./Ultimate.py --spec /storage/repos/svcomp/c/properties/no-overflow.prp --file /storage/repos/svcomp/c/termination-crafted-lit/BrockschmidtCookFuhs-CAV2013-Fig1_true-termination_true-no-overflow.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/termination-crafted-lit/BrockschmidtCookFuhs-CAV2013-Fig1_true-termination_true-no-overflow.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 7c08193784b646afd298f73ae6296b7af2e0cac1 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 20:47:20,035 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 20:47:20,037 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 20:47:20,050 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 20:47:20,051 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 20:47:20,052 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 20:47:20,054 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 20:47:20,056 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 20:47:20,059 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 20:47:20,059 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 20:47:20,062 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 20:47:20,063 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 20:47:20,065 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 20:47:20,066 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 20:47:20,070 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 20:47:20,071 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 20:47:20,072 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 20:47:20,083 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 20:47:20,085 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 20:47:20,088 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 20:47:20,090 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 20:47:20,092 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 20:47:20,096 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 20:47:20,097 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 20:47:20,097 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 20:47:20,099 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 20:47:20,100 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 20:47:20,100 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 20:47:20,104 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 20:47:20,106 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 20:47:20,106 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 20:47:20,107 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 20:47:20,107 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 20:47:20,108 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 20:47:20,109 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 20:47:20,109 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 20:47:20,109 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2019-01-01 20:47:20,133 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 20:47:20,133 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 20:47:20,135 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 20:47:20,135 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 20:47:20,136 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 20:47:20,136 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 20:47:20,136 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 20:47:20,136 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 20:47:20,136 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 20:47:20,136 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-01 20:47:20,139 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-01 20:47:20,139 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-01 20:47:20,140 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2019-01-01 20:47:20,140 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 20:47:20,140 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 20:47:20,140 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-01 20:47:20,140 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 20:47:20,140 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 20:47:20,141 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-01 20:47:20,141 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-01 20:47:20,141 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-01 20:47:20,141 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 20:47:20,141 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-01 20:47:20,142 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-01 20:47:20,143 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 20:47:20,143 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-01 20:47:20,143 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-01 20:47:20,143 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7c08193784b646afd298f73ae6296b7af2e0cac1 [2019-01-01 20:47:20,182 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 20:47:20,195 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 20:47:20,198 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 20:47:20,200 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 20:47:20,201 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 20:47:20,202 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-crafted-lit/BrockschmidtCookFuhs-CAV2013-Fig1_true-termination_true-no-overflow.c [2019-01-01 20:47:20,267 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f656a22e/951d6d7604984da9b80520a471175443/FLAG3e3afc6db [2019-01-01 20:47:20,720 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 20:47:20,720 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-crafted-lit/BrockschmidtCookFuhs-CAV2013-Fig1_true-termination_true-no-overflow.c [2019-01-01 20:47:20,727 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f656a22e/951d6d7604984da9b80520a471175443/FLAG3e3afc6db [2019-01-01 20:47:21,104 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f656a22e/951d6d7604984da9b80520a471175443 [2019-01-01 20:47:21,108 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 20:47:21,110 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 20:47:21,111 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 20:47:21,111 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 20:47:21,115 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 20:47:21,116 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 08:47:21" (1/1) ... [2019-01-01 20:47:21,119 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cd3e7f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:47:21, skipping insertion in model container [2019-01-01 20:47:21,119 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 08:47:21" (1/1) ... [2019-01-01 20:47:21,128 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 20:47:21,148 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 20:47:21,350 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 20:47:21,355 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 20:47:21,373 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 20:47:21,387 INFO L195 MainTranslator]: Completed translation [2019-01-01 20:47:21,388 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:47:21 WrapperNode [2019-01-01 20:47:21,388 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 20:47:21,389 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 20:47:21,389 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 20:47:21,389 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 20:47:21,399 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:47:21" (1/1) ... [2019-01-01 20:47:21,404 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:47:21" (1/1) ... [2019-01-01 20:47:21,425 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 20:47:21,425 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 20:47:21,425 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 20:47:21,426 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 20:47:21,436 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:47:21" (1/1) ... [2019-01-01 20:47:21,436 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:47:21" (1/1) ... [2019-01-01 20:47:21,437 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:47:21" (1/1) ... [2019-01-01 20:47:21,437 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:47:21" (1/1) ... [2019-01-01 20:47:21,439 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:47:21" (1/1) ... [2019-01-01 20:47:21,445 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:47:21" (1/1) ... [2019-01-01 20:47:21,447 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:47:21" (1/1) ... [2019-01-01 20:47:21,454 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 20:47:21,454 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 20:47:21,454 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 20:47:21,454 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 20:47:21,456 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:47:21" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-01 20:47:21,586 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 20:47:21,586 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 20:47:21,806 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 20:47:21,807 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2019-01-01 20:47:21,807 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 08:47:21 BoogieIcfgContainer [2019-01-01 20:47:21,808 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 20:47:21,809 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-01 20:47:21,809 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-01 20:47:21,812 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-01 20:47:21,812 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.01 08:47:21" (1/3) ... [2019-01-01 20:47:21,813 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a511ead and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 08:47:21, skipping insertion in model container [2019-01-01 20:47:21,813 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:47:21" (2/3) ... [2019-01-01 20:47:21,813 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a511ead and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 08:47:21, skipping insertion in model container [2019-01-01 20:47:21,814 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 08:47:21" (3/3) ... [2019-01-01 20:47:21,815 INFO L112 eAbstractionObserver]: Analyzing ICFG BrockschmidtCookFuhs-CAV2013-Fig1_true-termination_true-no-overflow.c [2019-01-01 20:47:21,828 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-01 20:47:21,839 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-01-01 20:47:21,866 INFO L257 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-01-01 20:47:21,904 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 20:47:21,904 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-01 20:47:21,905 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-01 20:47:21,905 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-01 20:47:21,905 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 20:47:21,905 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 20:47:21,905 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-01 20:47:21,905 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 20:47:21,906 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-01 20:47:21,923 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states. [2019-01-01 20:47:21,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-01 20:47:21,930 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:47:21,931 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-01 20:47:21,934 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:47:21,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:47:21,940 INFO L82 PathProgramCache]: Analyzing trace with hash 963476, now seen corresponding path program 1 times [2019-01-01 20:47:21,942 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:47:21,943 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:47:22,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:47:22,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:47:22,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:47:22,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:47:22,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:47:22,147 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:47:22,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 20:47:22,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 20:47:22,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 20:47:22,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 20:47:22,167 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 4 states. [2019-01-01 20:47:22,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:47:22,347 INFO L93 Difference]: Finished difference Result 40 states and 52 transitions. [2019-01-01 20:47:22,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 20:47:22,349 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-01-01 20:47:22,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:47:22,359 INFO L225 Difference]: With dead ends: 40 [2019-01-01 20:47:22,359 INFO L226 Difference]: Without dead ends: 18 [2019-01-01 20:47:22,362 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-01 20:47:22,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-01-01 20:47:22,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 14. [2019-01-01 20:47:22,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-01 20:47:22,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2019-01-01 20:47:22,394 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 4 [2019-01-01 20:47:22,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:47:22,395 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2019-01-01 20:47:22,395 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 20:47:22,396 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2019-01-01 20:47:22,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-01 20:47:22,396 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:47:22,396 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-01 20:47:22,397 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:47:22,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:47:22,397 INFO L82 PathProgramCache]: Analyzing trace with hash 29867816, now seen corresponding path program 1 times [2019-01-01 20:47:22,397 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:47:22,397 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:47:22,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:47:22,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:47:22,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:47:22,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:47:22,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:47:22,430 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:47:22,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-01 20:47:22,431 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 20:47:22,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 20:47:22,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 20:47:22,432 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand 3 states. [2019-01-01 20:47:22,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:47:22,474 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2019-01-01 20:47:22,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 20:47:22,475 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-01-01 20:47:22,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:47:22,476 INFO L225 Difference]: With dead ends: 14 [2019-01-01 20:47:22,476 INFO L226 Difference]: Without dead ends: 13 [2019-01-01 20:47:22,477 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 20:47:22,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-01-01 20:47:22,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-01-01 20:47:22,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-01 20:47:22,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2019-01-01 20:47:22,481 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 5 [2019-01-01 20:47:22,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:47:22,481 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2019-01-01 20:47:22,481 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 20:47:22,481 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2019-01-01 20:47:22,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-01 20:47:22,482 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:47:22,482 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-01 20:47:22,482 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:47:22,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:47:22,483 INFO L82 PathProgramCache]: Analyzing trace with hash 29869514, now seen corresponding path program 1 times [2019-01-01 20:47:22,483 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:47:22,483 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:47:22,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:47:22,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:47:22,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:47:22,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:47:22,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:47:22,513 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:47:22,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 20:47:22,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 20:47:22,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 20:47:22,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 20:47:22,515 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand 3 states. [2019-01-01 20:47:22,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:47:22,591 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2019-01-01 20:47:22,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 20:47:22,592 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-01-01 20:47:22,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:47:22,593 INFO L225 Difference]: With dead ends: 14 [2019-01-01 20:47:22,593 INFO L226 Difference]: Without dead ends: 13 [2019-01-01 20:47:22,593 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 20:47:22,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-01-01 20:47:22,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2019-01-01 20:47:22,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-01 20:47:22,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2019-01-01 20:47:22,598 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 5 [2019-01-01 20:47:22,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:47:22,598 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2019-01-01 20:47:22,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 20:47:22,598 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2019-01-01 20:47:22,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-01 20:47:22,599 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:47:22,599 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 20:47:22,599 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:47:22,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:47:22,600 INFO L82 PathProgramCache]: Analyzing trace with hash -1360166603, now seen corresponding path program 1 times [2019-01-01 20:47:22,600 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:47:22,600 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:47:22,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:47:22,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:47:22,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:47:22,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:47:22,669 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-01 20:47:22,670 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:47:22,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 20:47:22,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 20:47:22,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 20:47:22,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 20:47:22,671 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand 4 states. [2019-01-01 20:47:22,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:47:22,755 INFO L93 Difference]: Finished difference Result 12 states and 14 transitions. [2019-01-01 20:47:22,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 20:47:22,755 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-01-01 20:47:22,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:47:22,756 INFO L225 Difference]: With dead ends: 12 [2019-01-01 20:47:22,756 INFO L226 Difference]: Without dead ends: 11 [2019-01-01 20:47:22,756 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-01 20:47:22,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-01-01 20:47:22,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2019-01-01 20:47:22,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-01 20:47:22,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2019-01-01 20:47:22,760 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 12 transitions. Word has length 7 [2019-01-01 20:47:22,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:47:22,760 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 12 transitions. [2019-01-01 20:47:22,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 20:47:22,760 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 12 transitions. [2019-01-01 20:47:22,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-01 20:47:22,761 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:47:22,761 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-01-01 20:47:22,761 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:47:22,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:47:22,762 INFO L82 PathProgramCache]: Analyzing trace with hash -1360166548, now seen corresponding path program 1 times [2019-01-01 20:47:22,762 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:47:22,762 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:47:22,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:47:22,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:47:22,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:47:22,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:47:22,848 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:47:22,849 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:47:22,849 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 20:47:22,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:47:22,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:47:22,899 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:47:22,918 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:47:22,947 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:47:22,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2019-01-01 20:47:22,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 20:47:22,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 20:47:22,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-01 20:47:22,949 INFO L87 Difference]: Start difference. First operand 10 states and 12 transitions. Second operand 4 states. [2019-01-01 20:47:23,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:47:23,056 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2019-01-01 20:47:23,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 20:47:23,057 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-01-01 20:47:23,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:47:23,058 INFO L225 Difference]: With dead ends: 21 [2019-01-01 20:47:23,058 INFO L226 Difference]: Without dead ends: 20 [2019-01-01 20:47:23,059 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-01 20:47:23,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-01-01 20:47:23,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 13. [2019-01-01 20:47:23,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-01 20:47:23,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 16 transitions. [2019-01-01 20:47:23,065 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 16 transitions. Word has length 7 [2019-01-01 20:47:23,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:47:23,065 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 16 transitions. [2019-01-01 20:47:23,066 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 20:47:23,067 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 16 transitions. [2019-01-01 20:47:23,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-01 20:47:23,067 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:47:23,067 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1] [2019-01-01 20:47:23,068 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:47:23,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:47:23,068 INFO L82 PathProgramCache]: Analyzing trace with hash -2000108501, now seen corresponding path program 2 times [2019-01-01 20:47:23,068 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:47:23,069 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:47:23,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:47:23,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:47:23,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:47:23,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:47:23,159 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:47:23,160 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:47:23,160 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 20:47:23,175 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 20:47:23,184 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-01-01 20:47:23,184 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:47:23,186 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:47:23,291 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-01-01 20:47:23,311 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:47:23,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 7 [2019-01-01 20:47:23,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-01 20:47:23,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-01 20:47:23,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-01 20:47:23,313 INFO L87 Difference]: Start difference. First operand 13 states and 16 transitions. Second operand 8 states. [2019-01-01 20:47:23,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:47:23,774 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2019-01-01 20:47:23,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-01 20:47:23,775 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2019-01-01 20:47:23,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:47:23,776 INFO L225 Difference]: With dead ends: 30 [2019-01-01 20:47:23,776 INFO L226 Difference]: Without dead ends: 0 [2019-01-01 20:47:23,778 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2019-01-01 20:47:23,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-01 20:47:23,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-01 20:47:23,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-01 20:47:23,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-01 20:47:23,779 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 10 [2019-01-01 20:47:23,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:47:23,781 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 20:47:23,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-01 20:47:23,781 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-01 20:47:23,781 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-01 20:47:23,788 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-01 20:47:24,039 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-01-01 20:47:24,042 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-01 20:47:24,043 INFO L444 ceAbstractionStarter]: At program point L21-2(lines 21 23) the Hoare annotation is: (and (<= ULTIMATE.start_main_~n~0 2147483647) (<= 0 (+ ULTIMATE.start_main_~i~0 2147483648)) (<= 0 ULTIMATE.start_main_~j~0) (<= ULTIMATE.start_main_~i~0 2147483646)) [2019-01-01 20:47:24,043 INFO L448 ceAbstractionStarter]: For program point L21-3(lines 21 23) no Hoare annotation was computed. [2019-01-01 20:47:24,044 INFO L444 ceAbstractionStarter]: At program point L19-2(lines 19 25) the Hoare annotation is: (and (<= ULTIMATE.start_main_~n~0 2147483647) (<= 0 (+ ULTIMATE.start_main_~i~0 2147483648))) [2019-01-01 20:47:24,045 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 24) no Hoare annotation was computed. [2019-01-01 20:47:24,045 INFO L448 ceAbstractionStarter]: For program point L19-3(lines 19 25) no Hoare annotation was computed. [2019-01-01 20:47:24,046 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-01 20:47:24,047 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 22) no Hoare annotation was computed. [2019-01-01 20:47:24,047 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-01 20:47:24,047 INFO L451 ceAbstractionStarter]: At program point L26(lines 14 27) the Hoare annotation is: true [2019-01-01 20:47:24,047 INFO L448 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2019-01-01 20:47:24,047 INFO L448 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2019-01-01 20:47:24,047 INFO L448 ceAbstractionStarter]: For program point L22-1(line 22) no Hoare annotation was computed. [2019-01-01 20:47:24,048 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 24) no Hoare annotation was computed. [2019-01-01 20:47:24,048 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 22) no Hoare annotation was computed. [2019-01-01 20:47:24,069 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.01 08:47:24 BoogieIcfgContainer [2019-01-01 20:47:24,070 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-01 20:47:24,071 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 20:47:24,071 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 20:47:24,072 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 20:47:24,072 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 08:47:21" (3/4) ... [2019-01-01 20:47:24,077 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-01 20:47:24,096 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-01-01 20:47:24,097 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-01 20:47:24,151 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 20:47:24,151 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 20:47:24,152 INFO L168 Benchmark]: Toolchain (without parser) took 3043.25 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 951.3 MB in the beginning and 1.0 GB in the end (delta: -61.0 MB). Peak memory consumption was 75.3 MB. Max. memory is 11.5 GB. [2019-01-01 20:47:24,154 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 20:47:24,154 INFO L168 Benchmark]: CACSL2BoogieTranslator took 277.45 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-01 20:47:24,155 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.24 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 20:47:24,156 INFO L168 Benchmark]: Boogie Preprocessor took 28.48 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 20:47:24,156 INFO L168 Benchmark]: RCFGBuilder took 353.57 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -170.8 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-01-01 20:47:24,158 INFO L168 Benchmark]: TraceAbstraction took 2262.22 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 92.4 MB). Peak memory consumption was 92.4 MB. Max. memory is 11.5 GB. [2019-01-01 20:47:24,158 INFO L168 Benchmark]: Witness Printer took 79.74 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-01-01 20:47:24,163 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 277.45 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 36.24 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.48 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 353.57 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -170.8 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2262.22 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 92.4 MB). Peak memory consumption was 92.4 MB. Max. memory is 11.5 GB. * Witness Printer took 79.74 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 24]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 24]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: n <= 2147483647 && 0 <= i + 2147483648 - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: ((n <= 2147483647 && 0 <= i + 2147483648) && 0 <= j) && i <= 2147483646 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 15 locations, 4 error locations. SAFE Result, 2.1s OverallTime, 6 OverallIterations, 3 TraceHistogramMax, 0.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 35 SDtfs, 89 SDslu, 19 SDs, 0 SdLazy, 96 SolverSat, 28 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 41 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 13 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 15 NumberOfFragments, 25 HoareAnnotationTreeSize, 3 FomulaSimplifications, 417 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 55 NumberOfCodeBlocks, 49 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 47 ConstructedInterpolants, 0 QuantifiedInterpolants, 915 SizeOfPredicates, 2 NumberOfNonLiveVariables, 43 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 8 InterpolantComputations, 4 PerfectInterpolantSequences, 6/19 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...