./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-crafted/NestedRecursion_1b.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 678e0110 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/NestedRecursion_1b.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 cb528549fa76ae8087cf7043645dfa20323a0116 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-19 22:17:58,214 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 22:17:58,217 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 22:17:58,236 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 22:17:58,236 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 22:17:58,239 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 22:17:58,241 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 22:17:58,251 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 22:17:58,256 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 22:17:58,261 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 22:17:58,262 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 22:17:58,265 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 22:17:58,265 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 22:17:58,268 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 22:17:58,269 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 22:17:58,271 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 22:17:58,272 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 22:17:58,274 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 22:17:58,276 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 22:17:58,280 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 22:17:58,285 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 22:17:58,288 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 22:17:58,290 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 22:17:58,292 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 22:17:58,296 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 22:17:58,297 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 22:17:58,297 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 22:17:58,299 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 22:17:58,299 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 22:17:58,300 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 22:17:58,301 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 22:17:58,301 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 22:17:58,302 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 22:17:58,303 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 22:17:58,305 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 22:17:58,305 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 22:17:58,306 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 22:17:58,306 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 22:17:58,307 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 22:17:58,308 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 22:17:58,309 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 22:17:58,310 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2019-11-19 22:17:58,337 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 22:17:58,338 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 22:17:58,339 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 22:17:58,340 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 22:17:58,340 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 22:17:58,340 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 22:17:58,341 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-19 22:17:58,341 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-19 22:17:58,341 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 22:17:58,341 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-19 22:17:58,342 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-19 22:17:58,342 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-19 22:17:58,342 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2019-11-19 22:17:58,343 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 22:17:58,343 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 22:17:58,343 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-19 22:17:58,343 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 22:17:58,344 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 22:17:58,344 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-19 22:17:58,346 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-19 22:17:58,346 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 22:17:58,347 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 22:17:58,348 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-19 22:17:58,348 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-19 22:17:58,348 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-19 22:17:58,351 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-19 22:17:58,351 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-19 22:17:58,351 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 -> cb528549fa76ae8087cf7043645dfa20323a0116 [2019-11-19 22:17:58,662 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 22:17:58,681 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 22:17:58,687 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 22:17:58,689 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 22:17:58,689 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 22:17:58,690 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted/NestedRecursion_1b.c [2019-11-19 22:17:58,770 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25e4a2011/cee0921b2ae446009ceeb67f720091ae/FLAG971809429 [2019-11-19 22:17:59,277 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 22:17:59,278 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/NestedRecursion_1b.c [2019-11-19 22:17:59,285 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25e4a2011/cee0921b2ae446009ceeb67f720091ae/FLAG971809429 [2019-11-19 22:17:59,688 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25e4a2011/cee0921b2ae446009ceeb67f720091ae [2019-11-19 22:17:59,692 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 22:17:59,693 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 22:17:59,694 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 22:17:59,694 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 22:17:59,698 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 22:17:59,698 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:17:59" (1/1) ... [2019-11-19 22:17:59,701 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@216825c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:17:59, skipping insertion in model container [2019-11-19 22:17:59,702 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:17:59" (1/1) ... [2019-11-19 22:17:59,708 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 22:17:59,727 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 22:17:59,918 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 22:17:59,922 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 22:17:59,936 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 22:17:59,951 INFO L192 MainTranslator]: Completed translation [2019-11-19 22:17:59,951 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:17:59 WrapperNode [2019-11-19 22:17:59,951 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 22:17:59,952 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 22:17:59,952 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 22:17:59,952 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 22:17:59,961 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:17:59" (1/1) ... [2019-11-19 22:18:00,024 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:17:59" (1/1) ... [2019-11-19 22:18:00,038 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 22:18:00,039 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 22:18:00,039 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 22:18:00,039 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 22:18:00,047 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:17:59" (1/1) ... [2019-11-19 22:18:00,047 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:17:59" (1/1) ... [2019-11-19 22:18:00,048 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:17:59" (1/1) ... [2019-11-19 22:18:00,048 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:17:59" (1/1) ... [2019-11-19 22:18:00,050 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:17:59" (1/1) ... [2019-11-19 22:18:00,052 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:17:59" (1/1) ... [2019-11-19 22:18:00,053 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:17:59" (1/1) ... [2019-11-19 22:18:00,055 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 22:18:00,055 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 22:18:00,055 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 22:18:00,056 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 22:18:00,056 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:17:59" (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 22:18:00,117 INFO L130 BoogieDeclarations]: Found specification of procedure rec1 [2019-11-19 22:18:00,117 INFO L138 BoogieDeclarations]: Found implementation of procedure rec1 [2019-11-19 22:18:00,118 INFO L130 BoogieDeclarations]: Found specification of procedure rec2 [2019-11-19 22:18:00,118 INFO L138 BoogieDeclarations]: Found implementation of procedure rec2 [2019-11-19 22:18:00,118 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 22:18:00,118 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 22:18:00,344 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 22:18:00,345 INFO L285 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-19 22:18:00,346 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:18:00 BoogieIcfgContainer [2019-11-19 22:18:00,346 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 22:18:00,347 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-19 22:18:00,347 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-19 22:18:00,350 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-19 22:18:00,350 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 10:17:59" (1/3) ... [2019-11-19 22:18:00,351 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c1245d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:18:00, skipping insertion in model container [2019-11-19 22:18:00,351 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:17:59" (2/3) ... [2019-11-19 22:18:00,351 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c1245d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:18:00, skipping insertion in model container [2019-11-19 22:18:00,352 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:18:00" (3/3) ... [2019-11-19 22:18:00,353 INFO L109 eAbstractionObserver]: Analyzing ICFG NestedRecursion_1b.c [2019-11-19 22:18:00,362 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-19 22:18:00,369 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 10 error locations. [2019-11-19 22:18:00,382 INFO L249 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2019-11-19 22:18:00,412 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-19 22:18:00,412 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-19 22:18:00,412 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-19 22:18:00,412 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 22:18:00,412 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 22:18:00,413 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-19 22:18:00,413 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 22:18:00,413 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-19 22:18:00,432 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2019-11-19 22:18:00,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-11-19 22:18:00,436 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:18:00,437 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-11-19 22:18:00,438 INFO L410 AbstractCegarLoop]: === Iteration 1 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-19 22:18:00,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:18:00,443 INFO L82 PathProgramCache]: Analyzing trace with hash 70122184, now seen corresponding path program 1 times [2019-11-19 22:18:00,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:18:00,451 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421668787] [2019-11-19 22:18:00,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:18:00,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:00,636 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 22:18:00,637 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421668787] [2019-11-19 22:18:00,639 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:18:00,640 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:18:00,644 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838428619] [2019-11-19 22:18:00,651 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 22:18:00,655 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:18:00,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 22:18:00,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-19 22:18:00,682 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 5 states. [2019-11-19 22:18:00,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:18:00,827 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2019-11-19 22:18:00,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-19 22:18:00,829 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-11-19 22:18:00,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:18:00,838 INFO L225 Difference]: With dead ends: 62 [2019-11-19 22:18:00,838 INFO L226 Difference]: Without dead ends: 55 [2019-11-19 22:18:00,841 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-19 22:18:00,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-11-19 22:18:00,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 50. [2019-11-19 22:18:00,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-11-19 22:18:00,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 59 transitions. [2019-11-19 22:18:00,894 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 59 transitions. Word has length 5 [2019-11-19 22:18:00,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:18:00,894 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 59 transitions. [2019-11-19 22:18:00,895 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 22:18:00,895 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 59 transitions. [2019-11-19 22:18:00,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-11-19 22:18:00,895 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:18:00,896 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-11-19 22:18:00,896 INFO L410 AbstractCegarLoop]: === Iteration 2 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-19 22:18:00,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:18:00,897 INFO L82 PathProgramCache]: Analyzing trace with hash -2121179530, now seen corresponding path program 1 times [2019-11-19 22:18:00,897 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:18:00,898 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922178551] [2019-11-19 22:18:00,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:18:00,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:00,923 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 22:18:00,924 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922178551] [2019-11-19 22:18:00,924 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:18:00,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 22:18:00,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631145745] [2019-11-19 22:18:00,927 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:18:00,927 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:18:00,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:18:00,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:18:00,928 INFO L87 Difference]: Start difference. First operand 50 states and 59 transitions. Second operand 3 states. [2019-11-19 22:18:00,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:18:00,947 INFO L93 Difference]: Finished difference Result 52 states and 62 transitions. [2019-11-19 22:18:00,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:18:00,948 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-11-19 22:18:00,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:18:00,950 INFO L225 Difference]: With dead ends: 52 [2019-11-19 22:18:00,950 INFO L226 Difference]: Without dead ends: 51 [2019-11-19 22:18:00,951 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:18:00,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-11-19 22:18:00,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2019-11-19 22:18:00,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-11-19 22:18:00,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2019-11-19 22:18:00,964 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 6 [2019-11-19 22:18:00,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:18:00,965 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 57 transitions. [2019-11-19 22:18:00,965 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:18:00,965 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2019-11-19 22:18:00,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-19 22:18:00,966 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:18:00,966 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:18:00,967 INFO L410 AbstractCegarLoop]: === Iteration 3 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-19 22:18:00,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:18:00,968 INFO L82 PathProgramCache]: Analyzing trace with hash -2074588191, now seen corresponding path program 1 times [2019-11-19 22:18:00,968 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:18:00,968 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232740444] [2019-11-19 22:18:00,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:18:00,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:01,053 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 22:18:01,053 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232740444] [2019-11-19 22:18:01,054 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:18:01,054 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 22:18:01,054 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254134190] [2019-11-19 22:18:01,054 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-19 22:18:01,055 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:18:01,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-19 22:18:01,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-19 22:18:01,055 INFO L87 Difference]: Start difference. First operand 49 states and 57 transitions. Second operand 7 states. [2019-11-19 22:18:01,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:18:01,232 INFO L93 Difference]: Finished difference Result 77 states and 92 transitions. [2019-11-19 22:18:01,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-19 22:18:01,234 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2019-11-19 22:18:01,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:18:01,235 INFO L225 Difference]: With dead ends: 77 [2019-11-19 22:18:01,236 INFO L226 Difference]: Without dead ends: 76 [2019-11-19 22:18:01,236 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-19 22:18:01,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-11-19 22:18:01,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 65. [2019-11-19 22:18:01,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-11-19 22:18:01,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 81 transitions. [2019-11-19 22:18:01,260 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 81 transitions. Word has length 10 [2019-11-19 22:18:01,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:18:01,261 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 81 transitions. [2019-11-19 22:18:01,261 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-19 22:18:01,262 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 81 transitions. [2019-11-19 22:18:01,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-19 22:18:01,263 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:18:01,264 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:18:01,264 INFO L410 AbstractCegarLoop]: === Iteration 4 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-19 22:18:01,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:18:01,265 INFO L82 PathProgramCache]: Analyzing trace with hash 112275557, now seen corresponding path program 1 times [2019-11-19 22:18:01,265 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:18:01,265 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157889864] [2019-11-19 22:18:01,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:18:01,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:01,306 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 22:18:01,307 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157889864] [2019-11-19 22:18:01,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:18:01,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 22:18:01,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203304397] [2019-11-19 22:18:01,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:18:01,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:18:01,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:18:01,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:18:01,309 INFO L87 Difference]: Start difference. First operand 65 states and 81 transitions. Second operand 3 states. [2019-11-19 22:18:01,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:18:01,326 INFO L93 Difference]: Finished difference Result 69 states and 91 transitions. [2019-11-19 22:18:01,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:18:01,327 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-11-19 22:18:01,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:18:01,329 INFO L225 Difference]: With dead ends: 69 [2019-11-19 22:18:01,329 INFO L226 Difference]: Without dead ends: 68 [2019-11-19 22:18:01,330 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:18:01,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-19 22:18:01,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 64. [2019-11-19 22:18:01,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-11-19 22:18:01,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 79 transitions. [2019-11-19 22:18:01,344 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 79 transitions. Word has length 11 [2019-11-19 22:18:01,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:18:01,344 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 79 transitions. [2019-11-19 22:18:01,344 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:18:01,345 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 79 transitions. [2019-11-19 22:18:01,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-19 22:18:01,346 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:18:01,346 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:18:01,347 INFO L410 AbstractCegarLoop]: === Iteration 5 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-19 22:18:01,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:18:01,347 INFO L82 PathProgramCache]: Analyzing trace with hash -2048531074, now seen corresponding path program 1 times [2019-11-19 22:18:01,348 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:18:01,348 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501196887] [2019-11-19 22:18:01,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:18:01,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:01,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:01,440 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:18:01,440 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501196887] [2019-11-19 22:18:01,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:18:01,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 22:18:01,441 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769904551] [2019-11-19 22:18:01,441 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-19 22:18:01,442 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:18:01,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-19 22:18:01,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-19 22:18:01,442 INFO L87 Difference]: Start difference. First operand 64 states and 79 transitions. Second operand 6 states. [2019-11-19 22:18:01,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:18:01,507 INFO L93 Difference]: Finished difference Result 125 states and 160 transitions. [2019-11-19 22:18:01,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-19 22:18:01,507 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-11-19 22:18:01,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:18:01,509 INFO L225 Difference]: With dead ends: 125 [2019-11-19 22:18:01,509 INFO L226 Difference]: Without dead ends: 86 [2019-11-19 22:18:01,512 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-19 22:18:01,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-11-19 22:18:01,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 76. [2019-11-19 22:18:01,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-11-19 22:18:01,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 98 transitions. [2019-11-19 22:18:01,528 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 98 transitions. Word has length 16 [2019-11-19 22:18:01,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:18:01,529 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 98 transitions. [2019-11-19 22:18:01,529 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-19 22:18:01,529 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 98 transitions. [2019-11-19 22:18:01,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-19 22:18:01,530 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:18:01,531 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:18:01,531 INFO L410 AbstractCegarLoop]: === Iteration 6 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-19 22:18:01,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:18:01,532 INFO L82 PathProgramCache]: Analyzing trace with hash -57180086, now seen corresponding path program 1 times [2019-11-19 22:18:01,532 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:18:01,533 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936921992] [2019-11-19 22:18:01,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:18:01,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:01,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:01,570 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-19 22:18:01,570 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936921992] [2019-11-19 22:18:01,571 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:18:01,571 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 22:18:01,571 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734016212] [2019-11-19 22:18:01,572 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:18:01,572 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:18:01,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:18:01,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:18:01,573 INFO L87 Difference]: Start difference. First operand 76 states and 98 transitions. Second operand 3 states. [2019-11-19 22:18:01,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:18:01,597 INFO L93 Difference]: Finished difference Result 76 states and 98 transitions. [2019-11-19 22:18:01,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:18:01,598 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-19 22:18:01,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:18:01,601 INFO L225 Difference]: With dead ends: 76 [2019-11-19 22:18:01,602 INFO L226 Difference]: Without dead ends: 75 [2019-11-19 22:18:01,603 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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 22:18:01,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-11-19 22:18:01,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-11-19 22:18:01,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-11-19 22:18:01,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 96 transitions. [2019-11-19 22:18:01,643 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 96 transitions. Word has length 18 [2019-11-19 22:18:01,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:18:01,644 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 96 transitions. [2019-11-19 22:18:01,644 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:18:01,645 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 96 transitions. [2019-11-19 22:18:01,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-19 22:18:01,649 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:18:01,649 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:18:01,649 INFO L410 AbstractCegarLoop]: === Iteration 7 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-19 22:18:01,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:18:01,650 INFO L82 PathProgramCache]: Analyzing trace with hash -599425808, now seen corresponding path program 1 times [2019-11-19 22:18:01,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:18:01,651 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885535611] [2019-11-19 22:18:01,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:18:01,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:01,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:01,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:01,706 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-19 22:18:01,708 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885535611] [2019-11-19 22:18:01,709 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:18:01,710 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 22:18:01,710 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207392271] [2019-11-19 22:18:01,711 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:18:01,711 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:18:01,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:18:01,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:18:01,713 INFO L87 Difference]: Start difference. First operand 75 states and 96 transitions. Second operand 3 states. [2019-11-19 22:18:01,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:18:01,735 INFO L93 Difference]: Finished difference Result 75 states and 96 transitions. [2019-11-19 22:18:01,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:18:01,737 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-19 22:18:01,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:18:01,740 INFO L225 Difference]: With dead ends: 75 [2019-11-19 22:18:01,740 INFO L226 Difference]: Without dead ends: 74 [2019-11-19 22:18:01,741 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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 22:18:01,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-11-19 22:18:01,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-11-19 22:18:01,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-11-19 22:18:01,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 94 transitions. [2019-11-19 22:18:01,770 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 94 transitions. Word has length 19 [2019-11-19 22:18:01,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:18:01,773 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 94 transitions. [2019-11-19 22:18:01,773 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:18:01,774 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 94 transitions. [2019-11-19 22:18:01,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-19 22:18:01,775 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:18:01,775 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:18:01,775 INFO L410 AbstractCegarLoop]: === Iteration 8 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-19 22:18:01,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:18:01,776 INFO L82 PathProgramCache]: Analyzing trace with hash -1772582622, now seen corresponding path program 1 times [2019-11-19 22:18:01,776 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:18:01,776 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972362610] [2019-11-19 22:18:01,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:18:01,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:01,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:01,824 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-19 22:18:01,825 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972362610] [2019-11-19 22:18:01,825 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:18:01,825 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:18:01,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694060138] [2019-11-19 22:18:01,826 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 22:18:01,827 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:18:01,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 22:18:01,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 22:18:01,827 INFO L87 Difference]: Start difference. First operand 74 states and 94 transitions. Second operand 4 states. [2019-11-19 22:18:01,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:18:01,861 INFO L93 Difference]: Finished difference Result 95 states and 126 transitions. [2019-11-19 22:18:01,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 22:18:01,862 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-11-19 22:18:01,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:18:01,864 INFO L225 Difference]: With dead ends: 95 [2019-11-19 22:18:01,864 INFO L226 Difference]: Without dead ends: 94 [2019-11-19 22:18:01,865 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 22:18:01,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-11-19 22:18:01,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 80. [2019-11-19 22:18:01,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-11-19 22:18:01,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 100 transitions. [2019-11-19 22:18:01,896 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 100 transitions. Word has length 19 [2019-11-19 22:18:01,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:18:01,897 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 100 transitions. [2019-11-19 22:18:01,897 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 22:18:01,898 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 100 transitions. [2019-11-19 22:18:01,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-19 22:18:01,899 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:18:01,901 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:18:01,901 INFO L410 AbstractCegarLoop]: === Iteration 9 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-19 22:18:01,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:18:01,903 INFO L82 PathProgramCache]: Analyzing trace with hash -1402330794, now seen corresponding path program 1 times [2019-11-19 22:18:01,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:18:01,904 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458502585] [2019-11-19 22:18:01,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:18:01,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:01,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:01,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:01,967 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-19 22:18:01,968 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458502585] [2019-11-19 22:18:01,969 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:18:01,969 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:18:01,969 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165948870] [2019-11-19 22:18:01,970 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 22:18:01,971 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:18:01,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 22:18:01,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 22:18:01,971 INFO L87 Difference]: Start difference. First operand 80 states and 100 transitions. Second operand 4 states. [2019-11-19 22:18:01,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:18:01,998 INFO L93 Difference]: Finished difference Result 89 states and 110 transitions. [2019-11-19 22:18:02,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 22:18:02,000 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-11-19 22:18:02,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:18:02,002 INFO L225 Difference]: With dead ends: 89 [2019-11-19 22:18:02,002 INFO L226 Difference]: Without dead ends: 83 [2019-11-19 22:18:02,005 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 22:18:02,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-11-19 22:18:02,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-11-19 22:18:02,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-11-19 22:18:02,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 101 transitions. [2019-11-19 22:18:02,025 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 101 transitions. Word has length 20 [2019-11-19 22:18:02,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:18:02,026 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 101 transitions. [2019-11-19 22:18:02,026 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 22:18:02,026 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 101 transitions. [2019-11-19 22:18:02,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-19 22:18:02,030 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:18:02,030 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:18:02,030 INFO L410 AbstractCegarLoop]: === Iteration 10 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-19 22:18:02,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:18:02,031 INFO L82 PathProgramCache]: Analyzing trace with hash 921726737, now seen corresponding path program 1 times [2019-11-19 22:18:02,032 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:18:02,032 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570260567] [2019-11-19 22:18:02,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:18:02,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:02,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:02,103 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-19 22:18:02,103 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570260567] [2019-11-19 22:18:02,103 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:18:02,104 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 22:18:02,104 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245548867] [2019-11-19 22:18:02,104 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-19 22:18:02,104 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:18:02,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-19 22:18:02,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-19 22:18:02,110 INFO L87 Difference]: Start difference. First operand 83 states and 101 transitions. Second operand 6 states. [2019-11-19 22:18:02,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:18:02,201 INFO L93 Difference]: Finished difference Result 167 states and 222 transitions. [2019-11-19 22:18:02,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-19 22:18:02,204 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2019-11-19 22:18:02,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:18:02,206 INFO L225 Difference]: With dead ends: 167 [2019-11-19 22:18:02,206 INFO L226 Difference]: Without dead ends: 101 [2019-11-19 22:18:02,214 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-19 22:18:02,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-11-19 22:18:02,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 89. [2019-11-19 22:18:02,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-11-19 22:18:02,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 108 transitions. [2019-11-19 22:18:02,235 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 108 transitions. Word has length 23 [2019-11-19 22:18:02,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:18:02,236 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 108 transitions. [2019-11-19 22:18:02,236 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-19 22:18:02,236 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 108 transitions. [2019-11-19 22:18:02,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-19 22:18:02,238 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:18:02,238 INFO L410 BasicCegarLoop]: trace histogram [5, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:18:02,238 INFO L410 AbstractCegarLoop]: === Iteration 11 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-19 22:18:02,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:18:02,239 INFO L82 PathProgramCache]: Analyzing trace with hash 970950199, now seen corresponding path program 1 times [2019-11-19 22:18:02,239 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:18:02,240 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518079955] [2019-11-19 22:18:02,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:18:02,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:02,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:02,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:02,330 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-19 22:18:02,330 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518079955] [2019-11-19 22:18:02,331 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:18:02,331 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 22:18:02,331 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672433927] [2019-11-19 22:18:02,332 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-19 22:18:02,332 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:18:02,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-19 22:18:02,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-19 22:18:02,333 INFO L87 Difference]: Start difference. First operand 89 states and 108 transitions. Second operand 6 states. [2019-11-19 22:18:02,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:18:02,411 INFO L93 Difference]: Finished difference Result 176 states and 226 transitions. [2019-11-19 22:18:02,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-19 22:18:02,412 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-11-19 22:18:02,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:18:02,414 INFO L225 Difference]: With dead ends: 176 [2019-11-19 22:18:02,414 INFO L226 Difference]: Without dead ends: 105 [2019-11-19 22:18:02,416 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-19 22:18:02,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-11-19 22:18:02,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 97. [2019-11-19 22:18:02,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-11-19 22:18:02,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 117 transitions. [2019-11-19 22:18:02,428 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 117 transitions. Word has length 34 [2019-11-19 22:18:02,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:18:02,429 INFO L462 AbstractCegarLoop]: Abstraction has 97 states and 117 transitions. [2019-11-19 22:18:02,429 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-19 22:18:02,429 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 117 transitions. [2019-11-19 22:18:02,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-19 22:18:02,430 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:18:02,431 INFO L410 BasicCegarLoop]: trace histogram [5, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:18:02,431 INFO L410 AbstractCegarLoop]: === Iteration 12 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-19 22:18:02,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:18:02,432 INFO L82 PathProgramCache]: Analyzing trace with hash -1027694963, now seen corresponding path program 1 times [2019-11-19 22:18:02,432 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:18:02,432 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710607928] [2019-11-19 22:18:02,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:18:02,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:02,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:02,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:02,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:02,504 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-19 22:18:02,504 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710607928] [2019-11-19 22:18:02,505 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:18:02,505 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:18:02,505 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666494324] [2019-11-19 22:18:02,506 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 22:18:02,507 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:18:02,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 22:18:02,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 22:18:02,508 INFO L87 Difference]: Start difference. First operand 97 states and 117 transitions. Second operand 4 states. [2019-11-19 22:18:02,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:18:02,541 INFO L93 Difference]: Finished difference Result 104 states and 127 transitions. [2019-11-19 22:18:02,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 22:18:02,542 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2019-11-19 22:18:02,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:18:02,548 INFO L225 Difference]: With dead ends: 104 [2019-11-19 22:18:02,549 INFO L226 Difference]: Without dead ends: 103 [2019-11-19 22:18:02,549 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 22:18:02,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-11-19 22:18:02,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2019-11-19 22:18:02,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-11-19 22:18:02,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 121 transitions. [2019-11-19 22:18:02,566 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 121 transitions. Word has length 37 [2019-11-19 22:18:02,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:18:02,568 INFO L462 AbstractCegarLoop]: Abstraction has 101 states and 121 transitions. [2019-11-19 22:18:02,568 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 22:18:02,569 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 121 transitions. [2019-11-19 22:18:02,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-19 22:18:02,573 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:18:02,573 INFO L410 BasicCegarLoop]: trace histogram [5, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:18:02,574 INFO L410 AbstractCegarLoop]: === Iteration 13 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-19 22:18:02,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:18:02,575 INFO L82 PathProgramCache]: Analyzing trace with hash -1793772729, now seen corresponding path program 1 times [2019-11-19 22:18:02,575 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:18:02,575 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873733689] [2019-11-19 22:18:02,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:18:02,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:02,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:02,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:02,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:02,645 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-11-19 22:18:02,645 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873733689] [2019-11-19 22:18:02,646 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:18:02,646 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 22:18:02,646 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507288530] [2019-11-19 22:18:02,647 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:18:02,647 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:18:02,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:18:02,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:18:02,648 INFO L87 Difference]: Start difference. First operand 101 states and 121 transitions. Second operand 3 states. [2019-11-19 22:18:02,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:18:02,659 INFO L93 Difference]: Finished difference Result 101 states and 121 transitions. [2019-11-19 22:18:02,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:18:02,660 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2019-11-19 22:18:02,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:18:02,662 INFO L225 Difference]: With dead ends: 101 [2019-11-19 22:18:02,662 INFO L226 Difference]: Without dead ends: 100 [2019-11-19 22:18:02,663 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 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 22:18:02,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-11-19 22:18:02,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-11-19 22:18:02,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-11-19 22:18:02,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 119 transitions. [2019-11-19 22:18:02,676 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 119 transitions. Word has length 38 [2019-11-19 22:18:02,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:18:02,677 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 119 transitions. [2019-11-19 22:18:02,677 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:18:02,679 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 119 transitions. [2019-11-19 22:18:02,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-19 22:18:02,680 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:18:02,680 INFO L410 BasicCegarLoop]: trace histogram [5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:18:02,680 INFO L410 AbstractCegarLoop]: === Iteration 14 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-19 22:18:02,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:18:02,684 INFO L82 PathProgramCache]: Analyzing trace with hash -747989016, now seen corresponding path program 1 times [2019-11-19 22:18:02,684 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:18:02,685 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969965363] [2019-11-19 22:18:02,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:18:02,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:02,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:02,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:02,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:02,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:02,767 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-19 22:18:02,767 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969965363] [2019-11-19 22:18:02,768 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:18:02,768 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 22:18:02,768 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006131167] [2019-11-19 22:18:02,769 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-19 22:18:02,770 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:18:02,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-19 22:18:02,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-19 22:18:02,771 INFO L87 Difference]: Start difference. First operand 100 states and 119 transitions. Second operand 6 states. [2019-11-19 22:18:02,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:18:02,833 INFO L93 Difference]: Finished difference Result 110 states and 131 transitions. [2019-11-19 22:18:02,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-19 22:18:02,834 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2019-11-19 22:18:02,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:18:02,836 INFO L225 Difference]: With dead ends: 110 [2019-11-19 22:18:02,836 INFO L226 Difference]: Without dead ends: 109 [2019-11-19 22:18:02,837 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-19 22:18:02,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-11-19 22:18:02,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 99. [2019-11-19 22:18:02,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-11-19 22:18:02,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 117 transitions. [2019-11-19 22:18:02,849 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 117 transitions. Word has length 43 [2019-11-19 22:18:02,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:18:02,850 INFO L462 AbstractCegarLoop]: Abstraction has 99 states and 117 transitions. [2019-11-19 22:18:02,850 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-19 22:18:02,850 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 117 transitions. [2019-11-19 22:18:02,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-19 22:18:02,852 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:18:02,852 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:18:02,852 INFO L410 AbstractCegarLoop]: === Iteration 15 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-19 22:18:02,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:18:02,853 INFO L82 PathProgramCache]: Analyzing trace with hash -1488967228, now seen corresponding path program 1 times [2019-11-19 22:18:02,853 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:18:02,854 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596868156] [2019-11-19 22:18:02,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:18:02,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:02,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:02,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:02,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:02,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:02,975 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-19 22:18:02,976 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596868156] [2019-11-19 22:18:02,976 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1716600360] [2019-11-19 22:18:02,977 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 22:18:03,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:03,022 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-19 22:18:03,029 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:18:03,172 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-19 22:18:03,173 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-19 22:18:03,173 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 12 [2019-11-19 22:18:03,173 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821741232] [2019-11-19 22:18:03,174 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-19 22:18:03,174 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:18:03,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-19 22:18:03,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-11-19 22:18:03,175 INFO L87 Difference]: Start difference. First operand 99 states and 117 transitions. Second operand 7 states. [2019-11-19 22:18:03,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:18:03,284 INFO L93 Difference]: Finished difference Result 100 states and 117 transitions. [2019-11-19 22:18:03,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-19 22:18:03,285 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2019-11-19 22:18:03,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:18:03,286 INFO L225 Difference]: With dead ends: 100 [2019-11-19 22:18:03,286 INFO L226 Difference]: Without dead ends: 99 [2019-11-19 22:18:03,287 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2019-11-19 22:18:03,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-11-19 22:18:03,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2019-11-19 22:18:03,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-11-19 22:18:03,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 116 transitions. [2019-11-19 22:18:03,296 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 116 transitions. Word has length 40 [2019-11-19 22:18:03,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:18:03,296 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 116 transitions. [2019-11-19 22:18:03,297 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-19 22:18:03,297 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 116 transitions. [2019-11-19 22:18:03,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-19 22:18:03,298 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:18:03,298 INFO L410 BasicCegarLoop]: trace histogram [7, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:18:03,503 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:18:03,504 INFO L410 AbstractCegarLoop]: === Iteration 16 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-19 22:18:03,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:18:03,504 INFO L82 PathProgramCache]: Analyzing trace with hash 822906818, now seen corresponding path program 1 times [2019-11-19 22:18:03,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:18:03,505 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987275005] [2019-11-19 22:18:03,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:18:03,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:03,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:03,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:03,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:03,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:03,638 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 27 proven. 2 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-11-19 22:18:03,639 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987275005] [2019-11-19 22:18:03,639 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [768592910] [2019-11-19 22:18:03,639 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 22:18:03,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:03,693 INFO L255 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-19 22:18:03,698 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:18:03,776 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-11-19 22:18:03,776 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-19 22:18:03,776 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 12 [2019-11-19 22:18:03,777 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553864131] [2019-11-19 22:18:03,777 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-19 22:18:03,777 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:18:03,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-19 22:18:03,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-11-19 22:18:03,778 INFO L87 Difference]: Start difference. First operand 98 states and 116 transitions. Second operand 7 states. [2019-11-19 22:18:03,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:18:03,978 INFO L93 Difference]: Finished difference Result 126 states and 151 transitions. [2019-11-19 22:18:03,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-19 22:18:03,979 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-11-19 22:18:03,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:18:03,980 INFO L225 Difference]: With dead ends: 126 [2019-11-19 22:18:03,980 INFO L226 Difference]: Without dead ends: 125 [2019-11-19 22:18:03,981 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2019-11-19 22:18:03,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-11-19 22:18:03,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2019-11-19 22:18:03,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-11-19 22:18:03,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 150 transitions. [2019-11-19 22:18:03,999 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 150 transitions. Word has length 52 [2019-11-19 22:18:04,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:18:04,001 INFO L462 AbstractCegarLoop]: Abstraction has 124 states and 150 transitions. [2019-11-19 22:18:04,001 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-19 22:18:04,001 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 150 transitions. [2019-11-19 22:18:04,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-19 22:18:04,002 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:18:04,002 INFO L410 BasicCegarLoop]: trace histogram [5, 4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:18:04,205 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:18:04,206 INFO L410 AbstractCegarLoop]: === Iteration 17 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-19 22:18:04,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:18:04,207 INFO L82 PathProgramCache]: Analyzing trace with hash 695736933, now seen corresponding path program 1 times [2019-11-19 22:18:04,207 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:18:04,207 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3327434] [2019-11-19 22:18:04,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:18:04,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:04,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:04,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:04,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:04,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:04,326 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 22 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-19 22:18:04,327 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3327434] [2019-11-19 22:18:04,327 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1575061192] [2019-11-19 22:18:04,327 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 22:18:04,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:04,367 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-19 22:18:04,370 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:18:04,420 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-19 22:18:04,421 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-19 22:18:04,421 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 12 [2019-11-19 22:18:04,422 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490321841] [2019-11-19 22:18:04,422 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 22:18:04,422 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:18:04,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 22:18:04,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-11-19 22:18:04,423 INFO L87 Difference]: Start difference. First operand 124 states and 150 transitions. Second operand 5 states. [2019-11-19 22:18:04,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:18:04,499 INFO L93 Difference]: Finished difference Result 152 states and 185 transitions. [2019-11-19 22:18:04,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-19 22:18:04,500 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-11-19 22:18:04,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:18:04,502 INFO L225 Difference]: With dead ends: 152 [2019-11-19 22:18:04,503 INFO L226 Difference]: Without dead ends: 151 [2019-11-19 22:18:04,504 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-11-19 22:18:04,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-11-19 22:18:04,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 150. [2019-11-19 22:18:04,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-11-19 22:18:04,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 184 transitions. [2019-11-19 22:18:04,522 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 184 transitions. Word has length 45 [2019-11-19 22:18:04,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:18:04,522 INFO L462 AbstractCegarLoop]: Abstraction has 150 states and 184 transitions. [2019-11-19 22:18:04,523 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 22:18:04,523 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 184 transitions. [2019-11-19 22:18:04,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-19 22:18:04,524 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:18:04,524 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:18:04,727 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:18:04,728 INFO L410 AbstractCegarLoop]: === Iteration 18 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-19 22:18:04,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:18:04,729 INFO L82 PathProgramCache]: Analyzing trace with hash -1252678887, now seen corresponding path program 1 times [2019-11-19 22:18:04,729 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:18:04,729 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807091300] [2019-11-19 22:18:04,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:18:04,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:04,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:04,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:04,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:04,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:04,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:04,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:04,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:04,799 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-11-19 22:18:04,800 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807091300] [2019-11-19 22:18:04,800 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1313879636] [2019-11-19 22:18:04,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 22:18:04,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:04,843 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-19 22:18:04,848 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:18:04,864 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-11-19 22:18:04,865 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:18:04,865 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-11-19 22:18:04,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582885199] [2019-11-19 22:18:04,866 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-19 22:18:04,866 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:18:04,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-19 22:18:04,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-19 22:18:04,867 INFO L87 Difference]: Start difference. First operand 150 states and 184 transitions. Second operand 6 states. [2019-11-19 22:18:04,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:18:04,896 INFO L93 Difference]: Finished difference Result 159 states and 194 transitions. [2019-11-19 22:18:04,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-19 22:18:04,897 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2019-11-19 22:18:04,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:18:04,899 INFO L225 Difference]: With dead ends: 159 [2019-11-19 22:18:04,899 INFO L226 Difference]: Without dead ends: 155 [2019-11-19 22:18:04,899 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-19 22:18:04,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-11-19 22:18:04,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2019-11-19 22:18:04,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-11-19 22:18:04,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 189 transitions. [2019-11-19 22:18:04,915 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 189 transitions. Word has length 60 [2019-11-19 22:18:04,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:18:04,916 INFO L462 AbstractCegarLoop]: Abstraction has 155 states and 189 transitions. [2019-11-19 22:18:04,916 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-19 22:18:04,916 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 189 transitions. [2019-11-19 22:18:04,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-11-19 22:18:04,918 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:18:04,918 INFO L410 BasicCegarLoop]: trace histogram [10, 8, 6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:18:05,122 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:18:05,123 INFO L410 AbstractCegarLoop]: === Iteration 19 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-19 22:18:05,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:18:05,123 INFO L82 PathProgramCache]: Analyzing trace with hash 1438531096, now seen corresponding path program 2 times [2019-11-19 22:18:05,123 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:18:05,124 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825553452] [2019-11-19 22:18:05,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:18:05,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:05,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:05,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:05,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:05,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:05,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:05,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:05,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:05,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:05,349 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 60 proven. 32 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2019-11-19 22:18:05,350 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825553452] [2019-11-19 22:18:05,350 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1461149646] [2019-11-19 22:18:05,350 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 22:18:05,394 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-19 22:18:05,395 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 22:18:05,396 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-19 22:18:05,399 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:18:05,432 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 64 proven. 28 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2019-11-19 22:18:05,432 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:18:05,433 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 13 [2019-11-19 22:18:05,433 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117950563] [2019-11-19 22:18:05,434 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-19 22:18:05,434 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:18:05,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-19 22:18:05,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-11-19 22:18:05,435 INFO L87 Difference]: Start difference. First operand 155 states and 189 transitions. Second operand 13 states. [2019-11-19 22:18:05,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:18:05,659 INFO L93 Difference]: Finished difference Result 234 states and 284 transitions. [2019-11-19 22:18:05,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-19 22:18:05,660 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 77 [2019-11-19 22:18:05,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:18:05,662 INFO L225 Difference]: With dead ends: 234 [2019-11-19 22:18:05,662 INFO L226 Difference]: Without dead ends: 97 [2019-11-19 22:18:05,663 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2019-11-19 22:18:05,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-11-19 22:18:05,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 85. [2019-11-19 22:18:05,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-11-19 22:18:05,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 94 transitions. [2019-11-19 22:18:05,670 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 94 transitions. Word has length 77 [2019-11-19 22:18:05,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:18:05,671 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 94 transitions. [2019-11-19 22:18:05,671 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-19 22:18:05,671 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 94 transitions. [2019-11-19 22:18:05,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-11-19 22:18:05,673 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:18:05,673 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 9, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1] [2019-11-19 22:18:05,877 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:18:05,880 INFO L410 AbstractCegarLoop]: === Iteration 20 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-19 22:18:05,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:18:05,881 INFO L82 PathProgramCache]: Analyzing trace with hash -151262980, now seen corresponding path program 2 times [2019-11-19 22:18:05,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:18:05,881 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799044941] [2019-11-19 22:18:05,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:18:05,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:05,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:05,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:05,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:05,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:06,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:06,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:06,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:06,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:06,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:06,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:06,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:06,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:06,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:06,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:06,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:06,345 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 73 proven. 96 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2019-11-19 22:18:06,345 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799044941] [2019-11-19 22:18:06,346 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1992982642] [2019-11-19 22:18:06,346 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 22:18:06,411 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-19 22:18:06,412 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 22:18:06,413 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-19 22:18:06,431 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:18:06,546 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 48 proven. 78 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2019-11-19 22:18:06,547 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:18:06,547 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 10] total 23 [2019-11-19 22:18:06,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877039310] [2019-11-19 22:18:06,549 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-19 22:18:06,550 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:18:06,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-19 22:18:06,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=455, Unknown=0, NotChecked=0, Total=506 [2019-11-19 22:18:06,551 INFO L87 Difference]: Start difference. First operand 85 states and 94 transitions. Second operand 23 states. [2019-11-19 22:18:06,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:18:06,994 INFO L93 Difference]: Finished difference Result 95 states and 105 transitions. [2019-11-19 22:18:06,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-19 22:18:06,994 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 124 [2019-11-19 22:18:06,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:18:06,995 INFO L225 Difference]: With dead ends: 95 [2019-11-19 22:18:06,995 INFO L226 Difference]: Without dead ends: 0 [2019-11-19 22:18:06,996 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=102, Invalid=768, Unknown=0, NotChecked=0, Total=870 [2019-11-19 22:18:06,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-19 22:18:06,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-19 22:18:06,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-19 22:18:06,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-19 22:18:06,997 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 124 [2019-11-19 22:18:06,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:18:06,998 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-19 22:18:06,998 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-19 22:18:06,998 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-19 22:18:06,998 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-19 22:18:07,199 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:18:07,203 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-19 22:18:07,574 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 18 [2019-11-19 22:18:07,733 INFO L444 ceAbstractionStarter]: For program point rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-11-19 22:18:07,734 INFO L444 ceAbstractionStarter]: For program point rec1FINAL(lines 11 15) no Hoare annotation was computed. [2019-11-19 22:18:07,734 INFO L444 ceAbstractionStarter]: For program point rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-11-19 22:18:07,734 INFO L444 ceAbstractionStarter]: For program point rec1EXIT(lines 11 15) no Hoare annotation was computed. [2019-11-19 22:18:07,734 INFO L444 ceAbstractionStarter]: For program point L14(line 14) no Hoare annotation was computed. [2019-11-19 22:18:07,734 INFO L447 ceAbstractionStarter]: At program point rec1ENTRY(lines 11 15) the Hoare annotation is: true [2019-11-19 22:18:07,734 INFO L444 ceAbstractionStarter]: For program point L14-1(line 14) no Hoare annotation was computed. [2019-11-19 22:18:07,734 INFO L444 ceAbstractionStarter]: For program point L12(lines 12 13) no Hoare annotation was computed. [2019-11-19 22:18:07,735 INFO L440 ceAbstractionStarter]: At program point L14-2(line 14) the Hoare annotation is: (and (or (= |rec1_#in~i| rec1_~i) (not (<= |rec1_#in~i| 2147483647))) (not (<= |rec1_#in~i| 0))) [2019-11-19 22:18:07,735 INFO L444 ceAbstractionStarter]: For program point L14-3(line 14) no Hoare annotation was computed. [2019-11-19 22:18:07,735 INFO L444 ceAbstractionStarter]: For program point L14-4(line 14) no Hoare annotation was computed. [2019-11-19 22:18:07,736 INFO L444 ceAbstractionStarter]: For program point rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-11-19 22:18:07,736 INFO L444 ceAbstractionStarter]: For program point L14-5(line 14) no Hoare annotation was computed. [2019-11-19 22:18:07,736 INFO L440 ceAbstractionStarter]: At program point L14-6(line 14) the Hoare annotation is: (and (or (not (<= |rec1_#in~i| 2147483647)) (and (<= |rec1_#t~ret0| 1) (= |rec1_#in~i| rec1_~i))) (not (<= |rec1_#in~i| 0))) [2019-11-19 22:18:07,736 INFO L444 ceAbstractionStarter]: For program point rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-11-19 22:18:07,736 INFO L444 ceAbstractionStarter]: For program point rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-11-19 22:18:07,736 INFO L444 ceAbstractionStarter]: For program point L14-7(line 14) no Hoare annotation was computed. [2019-11-19 22:18:07,736 INFO L444 ceAbstractionStarter]: For program point rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-11-19 22:18:07,737 INFO L440 ceAbstractionStarter]: At program point L14-8(line 14) the Hoare annotation is: (and (or (not (<= |rec1_#in~i| 2147483647)) (and (<= |rec1_#t~ret1| 0) (= |rec1_#in~i| rec1_~i) (<= |rec1_#t~ret0| 1))) (or (<= 1 rec1_~i) (not (<= |rec1_#in~i| 2147483646)))) [2019-11-19 22:18:07,737 INFO L444 ceAbstractionStarter]: For program point L14-9(line 14) no Hoare annotation was computed. [2019-11-19 22:18:07,737 INFO L444 ceAbstractionStarter]: For program point L14-10(line 14) no Hoare annotation was computed. [2019-11-19 22:18:07,737 INFO L444 ceAbstractionStarter]: For program point L14-11(line 14) no Hoare annotation was computed. [2019-11-19 22:18:07,737 INFO L444 ceAbstractionStarter]: For program point rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-11-19 22:18:07,737 INFO L444 ceAbstractionStarter]: For program point rec2FINAL(lines 17 21) no Hoare annotation was computed. [2019-11-19 22:18:07,737 INFO L444 ceAbstractionStarter]: For program point rec2EXIT(lines 17 21) no Hoare annotation was computed. [2019-11-19 22:18:07,737 INFO L444 ceAbstractionStarter]: For program point L20(line 20) no Hoare annotation was computed. [2019-11-19 22:18:07,738 INFO L444 ceAbstractionStarter]: For program point L20-1(line 20) no Hoare annotation was computed. [2019-11-19 22:18:07,739 INFO L444 ceAbstractionStarter]: For program point L18(lines 18 19) no Hoare annotation was computed. [2019-11-19 22:18:07,739 INFO L440 ceAbstractionStarter]: At program point L20-2(line 20) the Hoare annotation is: (and (or (= rec2_~j |rec2_#in~j|) (not (<= |rec2_#in~j| 2147483647))) (not (<= |rec2_#in~j| 0))) [2019-11-19 22:18:07,739 INFO L444 ceAbstractionStarter]: For program point L20-3(line 20) no Hoare annotation was computed. [2019-11-19 22:18:07,740 INFO L440 ceAbstractionStarter]: At program point L20-4(line 20) the Hoare annotation is: (let ((.cse0 (not (<= |rec2_#in~j| 2147483647)))) (and (or (= rec2_~j |rec2_#in~j|) .cse0) (or (and (<= |rec2_#t~ret3| 1) (<= (+ |rec2_#t~ret3| 1) |rec2_#in~j|)) .cse0) (not (<= |rec2_#in~j| 0)))) [2019-11-19 22:18:07,740 INFO L444 ceAbstractionStarter]: For program point L20-5(line 20) no Hoare annotation was computed. [2019-11-19 22:18:07,740 INFO L444 ceAbstractionStarter]: For program point L20-6(line 20) no Hoare annotation was computed. [2019-11-19 22:18:07,740 INFO L444 ceAbstractionStarter]: For program point L20-7(line 20) no Hoare annotation was computed. [2019-11-19 22:18:07,740 INFO L447 ceAbstractionStarter]: At program point rec2ENTRY(lines 17 21) the Hoare annotation is: true [2019-11-19 22:18:07,741 INFO L444 ceAbstractionStarter]: For program point rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-11-19 22:18:07,741 INFO L444 ceAbstractionStarter]: For program point rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-11-19 22:18:07,741 INFO L444 ceAbstractionStarter]: For program point rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-11-19 22:18:07,741 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-19 22:18:07,741 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-19 22:18:07,742 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-19 22:18:07,742 INFO L440 ceAbstractionStarter]: At program point L25(line 25) the Hoare annotation is: (<= ULTIMATE.start_main_~x~0 2147483647) [2019-11-19 22:18:07,742 INFO L444 ceAbstractionStarter]: For program point L25-1(line 25) no Hoare annotation was computed. [2019-11-19 22:18:07,742 INFO L444 ceAbstractionStarter]: For program point L23(lines 23 26) no Hoare annotation was computed. [2019-11-19 22:18:07,746 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 10:18:07 BoogieIcfgContainer [2019-11-19 22:18:07,746 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-19 22:18:07,747 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-19 22:18:07,747 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-19 22:18:07,748 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-19 22:18:07,748 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:18:00" (3/4) ... [2019-11-19 22:18:07,753 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-19 22:18:07,761 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure rec1 [2019-11-19 22:18:07,762 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure rec2 [2019-11-19 22:18:07,768 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-11-19 22:18:07,769 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-19 22:18:07,826 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-19 22:18:07,827 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-19 22:18:07,829 INFO L168 Benchmark]: Toolchain (without parser) took 8135.52 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 281.5 MB). Free memory was 955.0 MB in the beginning and 1.2 GB in the end (delta: -241.0 MB). Peak memory consumption was 40.5 MB. Max. memory is 11.5 GB. [2019-11-19 22:18:07,829 INFO L168 Benchmark]: CDTParser took 0.51 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 22:18:07,830 INFO L168 Benchmark]: CACSL2BoogieTranslator took 257.96 ms. Allocated memory is still 1.0 GB. Free memory was 955.0 MB in the beginning and 942.9 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. [2019-11-19 22:18:07,830 INFO L168 Benchmark]: Boogie Procedure Inliner took 86.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 942.9 MB in the beginning and 1.1 GB in the end (delta: -196.9 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2019-11-19 22:18:07,831 INFO L168 Benchmark]: Boogie Preprocessor took 16.06 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 22:18:07,831 INFO L168 Benchmark]: RCFGBuilder took 290.58 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: 25.9 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. [2019-11-19 22:18:07,832 INFO L168 Benchmark]: TraceAbstraction took 7399.97 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 138.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -91.4 MB). Peak memory consumption was 364.8 MB. Max. memory is 11.5 GB. [2019-11-19 22:18:07,832 INFO L168 Benchmark]: Witness Printer took 79.75 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 11.5 GB. [2019-11-19 22:18:07,835 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.51 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 257.96 ms. Allocated memory is still 1.0 GB. Free memory was 955.0 MB in the beginning and 942.9 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 86.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 942.9 MB in the beginning and 1.1 GB in the end (delta: -196.9 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.06 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 290.58 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: 25.9 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7399.97 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 138.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -91.4 MB). Peak memory consumption was 364.8 MB. Max. memory is 11.5 GB. * Witness Printer took 79.75 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - AllSpecificationsHoldResult: All specifications hold 10 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 44 locations, 10 error locations. Result: SAFE, OverallTime: 7.3s, OverallIterations: 20, TraceHistogramMax: 12, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.5s, HoareTripleCheckerStatistics: 761 SDtfs, 331 SDslu, 2113 SDs, 0 SdLazy, 1002 SolverSat, 117 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 658 GetRequests, 522 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=155occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 20 MinimizatonAttempts, 93 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 222 PreInvPairs, 238 NumberOfFragments, 99 HoareAnnotationTreeSize, 222 FomulaSimplifications, 669 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 8 FomulaSimplificationsInter, 455 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 1095 NumberOfCodeBlocks, 1095 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 1069 ConstructedInterpolants, 0 QuantifiedInterpolants, 115121 SizeOfPredicates, 8 NumberOfNonLiveVariables, 820 ConjunctsInSsa, 37 ConjunctsInUnsatCore, 26 InterpolantComputations, 17 PerfectInterpolantSequences, 1315/1565 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...