./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-crafted-lit/genady.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version f6fb2bb1 Calling Ultimate with: /usr/bin/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 ../sv-benchmarks/c/termination-crafted-lit/genady.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 6938b5c805400363799492c040263d9022406929 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-f6fb2bb [2019-11-19 19:53:08,521 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 19:53:08,524 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 19:53:08,537 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 19:53:08,537 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 19:53:08,539 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 19:53:08,540 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 19:53:08,542 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 19:53:08,545 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 19:53:08,546 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 19:53:08,547 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 19:53:08,549 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 19:53:08,550 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 19:53:08,551 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 19:53:08,552 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 19:53:08,554 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 19:53:08,555 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 19:53:08,556 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 19:53:08,558 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 19:53:08,560 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 19:53:08,562 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 19:53:08,564 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 19:53:08,565 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 19:53:08,566 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 19:53:08,569 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 19:53:08,569 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 19:53:08,569 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 19:53:08,571 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 19:53:08,571 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 19:53:08,572 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 19:53:08,573 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 19:53:08,574 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 19:53:08,577 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 19:53:08,578 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 19:53:08,579 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 19:53:08,582 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 19:53:08,583 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 19:53:08,584 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 19:53:08,584 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 19:53:08,585 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 19:53:08,586 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 19:53:08,587 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2019-11-19 19:53:08,602 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 19:53:08,602 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 19:53:08,604 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 19:53:08,604 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 19:53:08,605 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 19:53:08,605 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 19:53:08,605 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-19 19:53:08,606 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-19 19:53:08,606 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 19:53:08,606 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-19 19:53:08,606 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-19 19:53:08,607 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-19 19:53:08,607 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2019-11-19 19:53:08,607 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 19:53:08,608 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 19:53:08,608 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-19 19:53:08,608 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 19:53:08,609 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 19:53:08,609 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-19 19:53:08,609 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-19 19:53:08,609 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 19:53:08,610 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 19:53:08,610 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-19 19:53:08,610 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-19 19:53:08,611 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-19 19:53:08,611 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-19 19:53:08,611 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-19 19:53:08,611 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> 6938b5c805400363799492c040263d9022406929 [2019-11-19 19:53:08,975 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 19:53:08,993 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 19:53:08,996 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 19:53:08,998 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 19:53:08,998 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 19:53:08,999 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted-lit/genady.c [2019-11-19 19:53:09,062 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56cde2b1d/c38b4fc23cb446d1961303d99f712756/FLAG782537006 [2019-11-19 19:53:09,507 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 19:53:09,508 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted-lit/genady.c [2019-11-19 19:53:09,515 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56cde2b1d/c38b4fc23cb446d1961303d99f712756/FLAG782537006 [2019-11-19 19:53:09,896 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56cde2b1d/c38b4fc23cb446d1961303d99f712756 [2019-11-19 19:53:09,899 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 19:53:09,901 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 19:53:09,902 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 19:53:09,902 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 19:53:09,906 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 19:53:09,907 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:53:09" (1/1) ... [2019-11-19 19:53:09,910 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69b5cc13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:53:09, skipping insertion in model container [2019-11-19 19:53:09,911 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:53:09" (1/1) ... [2019-11-19 19:53:09,918 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 19:53:09,934 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 19:53:10,103 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 19:53:10,109 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 19:53:10,123 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 19:53:10,133 INFO L192 MainTranslator]: Completed translation [2019-11-19 19:53:10,134 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:53:10 WrapperNode [2019-11-19 19:53:10,134 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 19:53:10,135 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 19:53:10,135 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 19:53:10,135 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 19:53:10,143 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:53:10" (1/1) ... [2019-11-19 19:53:10,147 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:53:10" (1/1) ... [2019-11-19 19:53:10,164 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 19:53:10,164 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 19:53:10,165 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 19:53:10,165 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 19:53:10,229 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:53:10" (1/1) ... [2019-11-19 19:53:10,229 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:53:10" (1/1) ... [2019-11-19 19:53:10,230 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:53:10" (1/1) ... [2019-11-19 19:53:10,230 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:53:10" (1/1) ... [2019-11-19 19:53:10,232 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:53:10" (1/1) ... [2019-11-19 19:53:10,236 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:53:10" (1/1) ... [2019-11-19 19:53:10,237 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:53:10" (1/1) ... [2019-11-19 19:53:10,238 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 19:53:10,239 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 19:53:10,239 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 19:53:10,239 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 19:53:10,240 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:53:10" (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-11-19 19:53:10,292 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 19:53:10,292 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 19:53:10,453 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 19:53:10,453 INFO L285 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-19 19:53:10,454 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:53:10 BoogieIcfgContainer [2019-11-19 19:53:10,454 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 19:53:10,456 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-19 19:53:10,456 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-19 19:53:10,459 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-19 19:53:10,460 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:53:09" (1/3) ... [2019-11-19 19:53:10,461 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73d2b32f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:53:10, skipping insertion in model container [2019-11-19 19:53:10,461 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:53:10" (2/3) ... [2019-11-19 19:53:10,462 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73d2b32f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:53:10, skipping insertion in model container [2019-11-19 19:53:10,462 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:53:10" (3/3) ... [2019-11-19 19:53:10,464 INFO L109 eAbstractionObserver]: Analyzing ICFG genady.c [2019-11-19 19:53:10,474 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-19 19:53:10,482 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-11-19 19:53:10,494 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-11-19 19:53:10,526 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-19 19:53:10,526 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-19 19:53:10,527 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-19 19:53:10,541 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 19:53:10,541 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 19:53:10,542 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-19 19:53:10,542 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 19:53:10,542 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-19 19:53:10,580 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2019-11-19 19:53:10,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-11-19 19:53:10,586 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 19:53:10,587 INFO L410 BasicCegarLoop]: trace histogram [1, 1] [2019-11-19 19:53:10,588 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-19 19:53:10,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:53:10,595 INFO L82 PathProgramCache]: Analyzing trace with hash 998, now seen corresponding path program 1 times [2019-11-19 19:53:10,606 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:53:10,606 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334928236] [2019-11-19 19:53:10,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:53:10,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:53:10,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 19:53:10,754 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334928236] [2019-11-19 19:53:10,755 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 19:53:10,755 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-19 19:53:10,757 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704751954] [2019-11-19 19:53:10,762 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 19:53:10,763 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 19:53:10,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 19:53:10,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 19:53:10,775 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 3 states. [2019-11-19 19:53:10,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 19:53:10,838 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-11-19 19:53:10,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 19:53:10,840 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-11-19 19:53:10,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 19:53:10,847 INFO L225 Difference]: With dead ends: 22 [2019-11-19 19:53:10,848 INFO L226 Difference]: Without dead ends: 13 [2019-11-19 19:53:10,850 INFO L630 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-11-19 19:53:10,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-11-19 19:53:10,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-11-19 19:53:10,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-11-19 19:53:10,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-11-19 19:53:10,881 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 2 [2019-11-19 19:53:10,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 19:53:10,881 INFO L462 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-11-19 19:53:10,881 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 19:53:10,881 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-11-19 19:53:10,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-11-19 19:53:10,882 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 19:53:10,882 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-11-19 19:53:10,883 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-19 19:53:10,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:53:10,883 INFO L82 PathProgramCache]: Analyzing trace with hash 30977, now seen corresponding path program 1 times [2019-11-19 19:53:10,883 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:53:10,884 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533736434] [2019-11-19 19:53:10,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:53:10,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:53:10,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 19:53:10,916 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533736434] [2019-11-19 19:53:10,916 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 19:53:10,916 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-19 19:53:10,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315645586] [2019-11-19 19:53:10,918 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 19:53:10,919 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 19:53:10,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 19:53:10,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 19:53:10,919 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 3 states. [2019-11-19 19:53:10,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 19:53:10,977 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-11-19 19:53:10,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 19:53:10,978 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-11-19 19:53:10,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 19:53:10,978 INFO L225 Difference]: With dead ends: 21 [2019-11-19 19:53:10,978 INFO L226 Difference]: Without dead ends: 20 [2019-11-19 19:53:10,979 INFO L630 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-11-19 19:53:10,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-11-19 19:53:10,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 15. [2019-11-19 19:53:10,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-19 19:53:10,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-11-19 19:53:10,985 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 3 [2019-11-19 19:53:10,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 19:53:10,986 INFO L462 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-11-19 19:53:10,986 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 19:53:10,986 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-11-19 19:53:10,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-11-19 19:53:10,986 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 19:53:10,987 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-11-19 19:53:10,987 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-19 19:53:10,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:53:10,987 INFO L82 PathProgramCache]: Analyzing trace with hash 29770307, now seen corresponding path program 1 times [2019-11-19 19:53:10,988 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:53:10,988 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653616759] [2019-11-19 19:53:10,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:53:10,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:53:11,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 19:53:11,016 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653616759] [2019-11-19 19:53:11,016 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 19:53:11,016 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-19 19:53:11,016 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869447439] [2019-11-19 19:53:11,017 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 19:53:11,017 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 19:53:11,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 19:53:11,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 19:53:11,018 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 3 states. [2019-11-19 19:53:11,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 19:53:11,050 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2019-11-19 19:53:11,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 19:53:11,051 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-11-19 19:53:11,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 19:53:11,052 INFO L225 Difference]: With dead ends: 19 [2019-11-19 19:53:11,052 INFO L226 Difference]: Without dead ends: 18 [2019-11-19 19:53:11,052 INFO L630 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-11-19 19:53:11,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-11-19 19:53:11,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2019-11-19 19:53:11,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-19 19:53:11,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-11-19 19:53:11,058 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 5 [2019-11-19 19:53:11,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 19:53:11,058 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-11-19 19:53:11,058 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 19:53:11,058 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-11-19 19:53:11,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-11-19 19:53:11,059 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 19:53:11,059 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-11-19 19:53:11,060 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-19 19:53:11,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:53:11,060 INFO L82 PathProgramCache]: Analyzing trace with hash 922879565, now seen corresponding path program 1 times [2019-11-19 19:53:11,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:53:11,061 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687206872] [2019-11-19 19:53:11,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:53:11,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:53:11,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 19:53:11,082 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687206872] [2019-11-19 19:53:11,082 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 19:53:11,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-19 19:53:11,083 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262565296] [2019-11-19 19:53:11,083 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 19:53:11,084 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 19:53:11,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 19:53:11,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 19:53:11,084 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 3 states. [2019-11-19 19:53:11,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 19:53:11,105 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-11-19 19:53:11,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 19:53:11,106 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-11-19 19:53:11,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 19:53:11,107 INFO L225 Difference]: With dead ends: 17 [2019-11-19 19:53:11,107 INFO L226 Difference]: Without dead ends: 16 [2019-11-19 19:53:11,107 INFO L630 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-11-19 19:53:11,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-11-19 19:53:11,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-11-19 19:53:11,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-11-19 19:53:11,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-11-19 19:53:11,112 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 6 [2019-11-19 19:53:11,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 19:53:11,113 INFO L462 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-11-19 19:53:11,113 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 19:53:11,113 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-11-19 19:53:11,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-19 19:53:11,114 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 19:53:11,114 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-19 19:53:11,114 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-19 19:53:11,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:53:11,115 INFO L82 PathProgramCache]: Analyzing trace with hash -1455504507, now seen corresponding path program 1 times [2019-11-19 19:53:11,115 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:53:11,116 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955708657] [2019-11-19 19:53:11,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:53:11,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:53:11,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 19:53:11,148 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955708657] [2019-11-19 19:53:11,148 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 19:53:11,148 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-19 19:53:11,148 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841255535] [2019-11-19 19:53:11,149 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 19:53:11,149 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 19:53:11,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 19:53:11,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 19:53:11,150 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 3 states. [2019-11-19 19:53:11,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 19:53:11,165 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-11-19 19:53:11,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 19:53:11,166 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-11-19 19:53:11,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 19:53:11,166 INFO L225 Difference]: With dead ends: 16 [2019-11-19 19:53:11,166 INFO L226 Difference]: Without dead ends: 15 [2019-11-19 19:53:11,167 INFO L630 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-11-19 19:53:11,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-11-19 19:53:11,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-11-19 19:53:11,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-19 19:53:11,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-11-19 19:53:11,172 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 7 [2019-11-19 19:53:11,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 19:53:11,172 INFO L462 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-11-19 19:53:11,172 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 19:53:11,172 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-11-19 19:53:11,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-19 19:53:11,173 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 19:53:11,173 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 19:53:11,174 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-19 19:53:11,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:53:11,174 INFO L82 PathProgramCache]: Analyzing trace with hash 2124000591, now seen corresponding path program 1 times [2019-11-19 19:53:11,175 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:53:11,175 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404520526] [2019-11-19 19:53:11,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:53:11,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:53:11,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 19:53:11,200 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404520526] [2019-11-19 19:53:11,201 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 19:53:11,201 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-19 19:53:11,201 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221000976] [2019-11-19 19:53:11,202 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 19:53:11,202 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 19:53:11,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 19:53:11,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 19:53:11,202 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 3 states. [2019-11-19 19:53:11,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 19:53:11,244 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-11-19 19:53:11,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 19:53:11,245 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-11-19 19:53:11,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 19:53:11,246 INFO L225 Difference]: With dead ends: 19 [2019-11-19 19:53:11,246 INFO L226 Difference]: Without dead ends: 18 [2019-11-19 19:53:11,247 INFO L630 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-11-19 19:53:11,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-11-19 19:53:11,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-11-19 19:53:11,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-11-19 19:53:11,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-11-19 19:53:11,256 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 8 [2019-11-19 19:53:11,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 19:53:11,256 INFO L462 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-11-19 19:53:11,258 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 19:53:11,258 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-11-19 19:53:11,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-19 19:53:11,259 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 19:53:11,259 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 19:53:11,260 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-19 19:53:11,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:53:11,262 INFO L82 PathProgramCache]: Analyzing trace with hash 1055103537, now seen corresponding path program 1 times [2019-11-19 19:53:11,268 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:53:11,270 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873042314] [2019-11-19 19:53:11,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:53:11,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:53:11,338 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 19:53:11,338 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873042314] [2019-11-19 19:53:11,339 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2058081366] [2019-11-19 19:53:11,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 19:53:11,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:53:11,372 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-19 19:53:11,377 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 19:53:11,451 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 19:53:11,452 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 19:53:11,452 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4] total 7 [2019-11-19 19:53:11,452 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218128012] [2019-11-19 19:53:11,453 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-19 19:53:11,453 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 19:53:11,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-19 19:53:11,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-11-19 19:53:11,454 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 9 states. [2019-11-19 19:53:11,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 19:53:11,631 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-11-19 19:53:11,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-19 19:53:11,631 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 10 [2019-11-19 19:53:11,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 19:53:11,632 INFO L225 Difference]: With dead ends: 25 [2019-11-19 19:53:11,632 INFO L226 Difference]: Without dead ends: 24 [2019-11-19 19:53:11,634 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-11-19 19:53:11,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-11-19 19:53:11,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 20. [2019-11-19 19:53:11,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-11-19 19:53:11,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-11-19 19:53:11,641 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 10 [2019-11-19 19:53:11,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 19:53:11,641 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-11-19 19:53:11,641 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-19 19:53:11,641 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-11-19 19:53:11,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-19 19:53:11,644 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 19:53:11,644 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-11-19 19:53:11,845 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 19:53:11,845 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-19 19:53:11,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:53:11,846 INFO L82 PathProgramCache]: Analyzing trace with hash 342218611, now seen corresponding path program 1 times [2019-11-19 19:53:11,846 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:53:11,847 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540115569] [2019-11-19 19:53:11,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:53:11,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:53:11,896 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 19:53:11,896 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540115569] [2019-11-19 19:53:11,896 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [190158828] [2019-11-19 19:53:11,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 19:53:11,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:53:11,929 INFO L255 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-19 19:53:11,930 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 19:53:11,938 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 19:53:11,938 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 19:53:11,939 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 2 [2019-11-19 19:53:11,939 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812115404] [2019-11-19 19:53:11,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 19:53:11,941 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 19:53:11,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 19:53:11,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 19:53:11,943 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 4 states. [2019-11-19 19:53:11,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 19:53:11,985 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-11-19 19:53:11,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 19:53:11,987 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-11-19 19:53:11,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 19:53:11,987 INFO L225 Difference]: With dead ends: 24 [2019-11-19 19:53:11,988 INFO L226 Difference]: Without dead ends: 23 [2019-11-19 19:53:11,988 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 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-11-19 19:53:11,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-11-19 19:53:11,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2019-11-19 19:53:11,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-11-19 19:53:11,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-11-19 19:53:11,998 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 12 [2019-11-19 19:53:11,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 19:53:11,999 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-11-19 19:53:11,999 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 19:53:11,999 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-11-19 19:53:12,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-19 19:53:12,000 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 19:53:12,001 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1] [2019-11-19 19:53:12,204 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 19:53:12,205 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-19 19:53:12,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:53:12,206 INFO L82 PathProgramCache]: Analyzing trace with hash -1217672673, now seen corresponding path program 1 times [2019-11-19 19:53:12,206 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:53:12,206 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463756624] [2019-11-19 19:53:12,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:53:12,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:53:12,267 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 19:53:12,270 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463756624] [2019-11-19 19:53:12,270 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [368970974] [2019-11-19 19:53:12,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 19:53:12,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:53:12,294 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-19 19:53:12,295 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 19:53:12,300 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 19:53:12,300 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 19:53:12,300 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 2 [2019-11-19 19:53:12,302 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443266741] [2019-11-19 19:53:12,302 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 19:53:12,303 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 19:53:12,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 19:53:12,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 19:53:12,304 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 4 states. [2019-11-19 19:53:12,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 19:53:12,344 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-11-19 19:53:12,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 19:53:12,345 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-11-19 19:53:12,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 19:53:12,346 INFO L225 Difference]: With dead ends: 26 [2019-11-19 19:53:12,346 INFO L226 Difference]: Without dead ends: 25 [2019-11-19 19:53:12,347 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 14 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-11-19 19:53:12,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-11-19 19:53:12,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-11-19 19:53:12,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-11-19 19:53:12,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-11-19 19:53:12,352 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 15 [2019-11-19 19:53:12,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 19:53:12,353 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-11-19 19:53:12,353 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 19:53:12,354 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-11-19 19:53:12,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-19 19:53:12,355 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 19:53:12,355 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1] [2019-11-19 19:53:12,558 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 19:53:12,562 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-19 19:53:12,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:53:12,562 INFO L82 PathProgramCache]: Analyzing trace with hash -1952333055, now seen corresponding path program 2 times [2019-11-19 19:53:12,563 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:53:12,563 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250158744] [2019-11-19 19:53:12,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:53:12,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:53:12,652 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 19:53:12,653 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250158744] [2019-11-19 19:53:12,653 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2128809041] [2019-11-19 19:53:12,653 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 19:53:12,683 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-19 19:53:12,684 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 19:53:12,684 INFO L255 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-19 19:53:12,685 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 19:53:12,790 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 19:53:12,792 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 19:53:12,792 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 11 [2019-11-19 19:53:12,792 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674590849] [2019-11-19 19:53:12,793 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-19 19:53:12,793 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 19:53:12,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-19 19:53:12,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-11-19 19:53:12,794 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 13 states. [2019-11-19 19:53:13,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 19:53:13,043 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-11-19 19:53:13,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-19 19:53:13,043 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 17 [2019-11-19 19:53:13,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 19:53:13,044 INFO L225 Difference]: With dead ends: 32 [2019-11-19 19:53:13,044 INFO L226 Difference]: Without dead ends: 31 [2019-11-19 19:53:13,046 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=283, Unknown=0, NotChecked=0, Total=420 [2019-11-19 19:53:13,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-11-19 19:53:13,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2019-11-19 19:53:13,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-19 19:53:13,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-11-19 19:53:13,058 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 17 [2019-11-19 19:53:13,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 19:53:13,058 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-11-19 19:53:13,059 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-19 19:53:13,059 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-11-19 19:53:13,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-19 19:53:13,059 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 19:53:13,060 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1] [2019-11-19 19:53:13,264 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 19:53:13,264 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-19 19:53:13,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:53:13,265 INFO L82 PathProgramCache]: Analyzing trace with hash 708643907, now seen corresponding path program 2 times [2019-11-19 19:53:13,265 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:53:13,265 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544741458] [2019-11-19 19:53:13,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:53:13,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:53:13,309 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-19 19:53:13,309 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544741458] [2019-11-19 19:53:13,309 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1878480309] [2019-11-19 19:53:13,310 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 19:53:13,330 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-19 19:53:13,330 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 19:53:13,331 INFO L255 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-19 19:53:13,333 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 19:53:13,382 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 19:53:13,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 19:53:13,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-11-19 19:53:13,383 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013944745] [2019-11-19 19:53:13,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-19 19:53:13,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 19:53:13,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-19 19:53:13,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-11-19 19:53:13,385 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 8 states. [2019-11-19 19:53:13,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 19:53:13,526 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2019-11-19 19:53:13,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-19 19:53:13,528 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2019-11-19 19:53:13,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 19:53:13,529 INFO L225 Difference]: With dead ends: 37 [2019-11-19 19:53:13,529 INFO L226 Difference]: Without dead ends: 36 [2019-11-19 19:53:13,529 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=131, Unknown=0, NotChecked=0, Total=210 [2019-11-19 19:53:13,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-11-19 19:53:13,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 26. [2019-11-19 19:53:13,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-19 19:53:13,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-11-19 19:53:13,535 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 19 [2019-11-19 19:53:13,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 19:53:13,535 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-11-19 19:53:13,535 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-19 19:53:13,535 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-11-19 19:53:13,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-19 19:53:13,536 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 19:53:13,536 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 1, 1] [2019-11-19 19:53:13,739 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 19:53:13,740 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-19 19:53:13,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:53:13,740 INFO L82 PathProgramCache]: Analyzing trace with hash 1446421327, now seen corresponding path program 2 times [2019-11-19 19:53:13,741 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:53:13,741 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808838327] [2019-11-19 19:53:13,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:53:13,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:53:13,813 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-19 19:53:13,814 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808838327] [2019-11-19 19:53:13,814 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [449519275] [2019-11-19 19:53:13,814 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 19:53:13,847 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-19 19:53:13,847 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 19:53:13,848 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-19 19:53:13,850 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 19:53:13,891 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 19:53:13,891 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 19:53:13,891 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4] total 7 [2019-11-19 19:53:13,892 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240826431] [2019-11-19 19:53:13,892 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-19 19:53:13,892 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 19:53:13,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-19 19:53:13,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-11-19 19:53:13,896 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 9 states. [2019-11-19 19:53:14,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 19:53:14,053 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-11-19 19:53:14,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-19 19:53:14,054 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2019-11-19 19:53:14,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 19:53:14,054 INFO L225 Difference]: With dead ends: 26 [2019-11-19 19:53:14,054 INFO L226 Difference]: Without dead ends: 25 [2019-11-19 19:53:14,055 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-11-19 19:53:14,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-11-19 19:53:14,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-11-19 19:53:14,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-11-19 19:53:14,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-11-19 19:53:14,059 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 22 [2019-11-19 19:53:14,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 19:53:14,059 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-11-19 19:53:14,059 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-19 19:53:14,060 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-11-19 19:53:14,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-19 19:53:14,060 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 19:53:14,060 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1] [2019-11-19 19:53:14,263 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 19:53:14,264 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-19 19:53:14,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:53:14,265 INFO L82 PathProgramCache]: Analyzing trace with hash -1558507471, now seen corresponding path program 3 times [2019-11-19 19:53:14,265 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:53:14,266 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775301686] [2019-11-19 19:53:14,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:53:14,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:53:14,350 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 19:53:14,351 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775301686] [2019-11-19 19:53:14,351 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1314501305] [2019-11-19 19:53:14,351 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 19:53:14,376 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-11-19 19:53:14,376 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 19:53:14,377 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-19 19:53:14,378 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 19:53:14,430 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-19 19:53:14,431 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-19 19:53:14,431 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 11 [2019-11-19 19:53:14,431 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648729472] [2019-11-19 19:53:14,432 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 19:53:14,432 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 19:53:14,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 19:53:14,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-11-19 19:53:14,433 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 5 states. [2019-11-19 19:53:14,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 19:53:14,458 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-11-19 19:53:14,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-19 19:53:14,460 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-11-19 19:53:14,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 19:53:14,461 INFO L225 Difference]: With dead ends: 25 [2019-11-19 19:53:14,461 INFO L226 Difference]: Without dead ends: 0 [2019-11-19 19:53:14,461 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-11-19 19:53:14,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-19 19:53:14,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-19 19:53:14,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-19 19:53:14,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-19 19:53:14,462 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2019-11-19 19:53:14,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 19:53:14,462 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-19 19:53:14,463 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 19:53:14,464 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-19 19:53:14,464 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-19 19:53:14,667 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 19:53:14,673 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-19 19:53:14,818 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 13 [2019-11-19 19:53:14,822 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 15) no Hoare annotation was computed. [2019-11-19 19:53:14,822 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-19 19:53:14,822 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 16) no Hoare annotation was computed. [2019-11-19 19:53:14,823 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 17) no Hoare annotation was computed. [2019-11-19 19:53:14,823 INFO L440 ceAbstractionStarter]: At program point L19(lines 11 20) the Hoare annotation is: (<= ULTIMATE.start_main_~i~0 (+ ULTIMATE.start_main_~j~0 9999)) [2019-11-19 19:53:14,823 INFO L444 ceAbstractionStarter]: For program point L17(line 17) no Hoare annotation was computed. [2019-11-19 19:53:14,823 INFO L444 ceAbstractionStarter]: For program point L17-1(line 17) no Hoare annotation was computed. [2019-11-19 19:53:14,823 INFO L444 ceAbstractionStarter]: For program point L15-1(line 15) no Hoare annotation was computed. [2019-11-19 19:53:14,823 INFO L444 ceAbstractionStarter]: For program point L15-2(lines 15 18) no Hoare annotation was computed. [2019-11-19 19:53:14,824 INFO L440 ceAbstractionStarter]: At program point L15-4(lines 15 18) the Hoare annotation is: (let ((.cse0 (+ ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0))) (and (<= ULTIMATE.start_main_~j~0 (+ ULTIMATE.start_main_~i~0 1)) (<= 10001 .cse0) (<= .cse0 10001) (<= ULTIMATE.start_main_~i~0 (+ ULTIMATE.start_main_~j~0 9999)))) [2019-11-19 19:53:14,824 INFO L444 ceAbstractionStarter]: For program point L15-5(lines 15 18) no Hoare annotation was computed. [2019-11-19 19:53:14,824 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 15) no Hoare annotation was computed. [2019-11-19 19:53:14,824 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 16) no Hoare annotation was computed. [2019-11-19 19:53:14,824 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-19 19:53:14,824 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 17) no Hoare annotation was computed. [2019-11-19 19:53:14,824 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-19 19:53:14,824 INFO L444 ceAbstractionStarter]: For program point L16(line 16) no Hoare annotation was computed. [2019-11-19 19:53:14,824 INFO L444 ceAbstractionStarter]: For program point L16-1(line 16) no Hoare annotation was computed. [2019-11-19 19:53:14,842 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 07:53:14 BoogieIcfgContainer [2019-11-19 19:53:14,843 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-19 19:53:14,843 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-19 19:53:14,843 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-19 19:53:14,843 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-19 19:53:14,844 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:53:10" (3/4) ... [2019-11-19 19:53:14,848 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-19 19:53:14,860 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-19 19:53:14,860 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-19 19:53:14,902 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-19 19:53:14,902 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-19 19:53:14,904 INFO L168 Benchmark]: Toolchain (without parser) took 5002.68 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 957.7 MB in the beginning and 822.7 MB in the end (delta: 135.0 MB). Peak memory consumption was 271.3 MB. Max. memory is 11.5 GB. [2019-11-19 19:53:14,904 INFO L168 Benchmark]: CDTParser took 1.48 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 19:53:14,905 INFO L168 Benchmark]: CACSL2BoogieTranslator took 232.48 ms. Allocated memory is still 1.0 GB. Free memory was 957.7 MB in the beginning and 946.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-19 19:53:14,905 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.27 ms. Allocated memory is still 1.0 GB. Free memory is still 946.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 19:53:14,906 INFO L168 Benchmark]: Boogie Preprocessor took 74.12 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -185.9 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. [2019-11-19 19:53:14,907 INFO L168 Benchmark]: RCFGBuilder took 215.85 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.6 MB). Peak memory consumption was 17.6 MB. Max. memory is 11.5 GB. [2019-11-19 19:53:14,907 INFO L168 Benchmark]: TraceAbstraction took 4386.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 822.7 MB in the end (delta: 292.7 MB). Peak memory consumption was 292.7 MB. Max. memory is 11.5 GB. [2019-11-19 19:53:14,908 INFO L168 Benchmark]: Witness Printer took 58.78 ms. Allocated memory is still 1.2 GB. Free memory is still 822.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 19:53:14,911 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.48 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 232.48 ms. Allocated memory is still 1.0 GB. Free memory was 957.7 MB in the beginning and 946.9 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 29.27 ms. Allocated memory is still 1.0 GB. Free memory is still 946.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 74.12 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -185.9 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 215.85 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.6 MB). Peak memory consumption was 17.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4386.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 822.7 MB in the end (delta: 292.7 MB). Peak memory consumption was 292.7 MB. Max. memory is 11.5 GB. * Witness Printer took 58.78 ms. Allocated memory is still 1.2 GB. Free memory is still 822.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 16]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 17]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 17]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 15]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 16]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 15]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - InvariantResult [Line: 15]: Loop Invariant Derived loop invariant: ((j <= i + 1 && 10001 <= i + j) && i + j <= 10001) && i <= j + 9999 - InvariantResult [Line: 11]: Loop Invariant Derived loop invariant: i <= j + 9999 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 18 locations, 6 error locations. Result: SAFE, OverallTime: 4.3s, OverallIterations: 13, TraceHistogramMax: 4, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, HoareTripleCheckerStatistics: 53 SDtfs, 145 SDslu, 21 SDs, 0 SdLazy, 393 SolverSat, 53 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 176 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 25 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 6 NumberOfFragments, 26 HoareAnnotationTreeSize, 2 FomulaSimplifications, 70 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 108 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 269 NumberOfCodeBlocks, 255 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 249 ConstructedInterpolants, 0 QuantifiedInterpolants, 15709 SizeOfPredicates, 1 NumberOfNonLiveVariables, 184 ConjunctsInSsa, 31 ConjunctsInUnsatCore, 20 InterpolantComputations, 7 PerfectInterpolantSequences, 64/174 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...