./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/bitvector/s3_srvr_3a_alt.BV.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version f470102c 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/bitvector/s3_srvr_3a_alt.BV.c.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-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 32bit --witnessprinter.graph.data.programhash 96aededabe895f84f71d6d614ed1af512bf7353b .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 20:27:09,406 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 20:27:09,409 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 20:27:09,429 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 20:27:09,429 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 20:27:09,431 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 20:27:09,433 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 20:27:09,443 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 20:27:09,449 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 20:27:09,452 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 20:27:09,453 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 20:27:09,455 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 20:27:09,455 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 20:27:09,459 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 20:27:09,461 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 20:27:09,462 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 20:27:09,464 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 20:27:09,465 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 20:27:09,468 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 20:27:09,472 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 20:27:09,477 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 20:27:09,481 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 20:27:09,482 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 20:27:09,484 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 20:27:09,486 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 20:27:09,486 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 20:27:09,486 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 20:27:09,488 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 20:27:09,489 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 20:27:09,489 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 20:27:09,490 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 20:27:09,490 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 20:27:09,491 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 20:27:09,492 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 20:27:09,494 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 20:27:09,494 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 20:27:09,495 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 20:27:09,495 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 20:27:09,495 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 20:27:09,496 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 20:27:09,498 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 20:27:09,499 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2019-11-28 20:27:09,535 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 20:27:09,536 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 20:27:09,537 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 20:27:09,537 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 20:27:09,537 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 20:27:09,537 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 20:27:09,542 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 20:27:09,542 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 20:27:09,542 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 20:27:09,542 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 20:27:09,543 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 20:27:09,543 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 20:27:09,543 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 20:27:09,543 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 20:27:09,543 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2019-11-28 20:27:09,544 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 20:27:09,544 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 20:27:09,544 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 20:27:09,544 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 20:27:09,545 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 20:27:09,546 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 20:27:09,546 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 20:27:09,546 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 20:27:09,546 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 20:27:09,547 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 20:27:09,547 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 20:27:09,547 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 20:27:09,547 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 20:27:09,548 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 20:27:09,548 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 20:27:09,548 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 20:27:09,548 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 96aededabe895f84f71d6d614ed1af512bf7353b [2019-11-28 20:27:09,867 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 20:27:09,889 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 20:27:09,893 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 20:27:09,894 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 20:27:09,895 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 20:27:09,896 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/s3_srvr_3a_alt.BV.c.cil.c [2019-11-28 20:27:09,971 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7883473be/150c57c665cf4d64a88b4f8696c2bf61/FLAGe56570ef9 [2019-11-28 20:27:10,514 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 20:27:10,514 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_srvr_3a_alt.BV.c.cil.c [2019-11-28 20:27:10,528 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7883473be/150c57c665cf4d64a88b4f8696c2bf61/FLAGe56570ef9 [2019-11-28 20:27:10,838 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7883473be/150c57c665cf4d64a88b4f8696c2bf61 [2019-11-28 20:27:10,842 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 20:27:10,844 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 20:27:10,846 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 20:27:10,846 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 20:27:10,850 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 20:27:10,851 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:27:10" (1/1) ... [2019-11-28 20:27:10,854 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b557634 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:27:10, skipping insertion in model container [2019-11-28 20:27:10,855 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:27:10" (1/1) ... [2019-11-28 20:27:10,864 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 20:27:10,925 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 20:27:11,269 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:27:11,274 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 20:27:11,355 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:27:11,370 INFO L208 MainTranslator]: Completed translation [2019-11-28 20:27:11,371 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:27:11 WrapperNode [2019-11-28 20:27:11,371 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 20:27:11,372 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 20:27:11,372 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 20:27:11,372 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 20:27:11,380 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:27:11" (1/1) ... [2019-11-28 20:27:11,398 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:27:11" (1/1) ... [2019-11-28 20:27:11,450 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 20:27:11,450 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 20:27:11,451 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 20:27:11,452 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 20:27:11,462 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:27:11" (1/1) ... [2019-11-28 20:27:11,462 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:27:11" (1/1) ... [2019-11-28 20:27:11,465 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:27:11" (1/1) ... [2019-11-28 20:27:11,466 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:27:11" (1/1) ... [2019-11-28 20:27:11,475 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:27:11" (1/1) ... [2019-11-28 20:27:11,484 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:27:11" (1/1) ... [2019-11-28 20:27:11,487 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:27:11" (1/1) ... [2019-11-28 20:27:11,491 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 20:27:11,492 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 20:27:11,492 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 20:27:11,492 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 20:27:11,493 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:27:11" (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-28 20:27:11,578 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 20:27:11,578 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 20:27:11,799 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-28 20:27:12,407 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-11-28 20:27:12,407 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-11-28 20:27:12,409 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 20:27:12,409 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-28 20:27:12,411 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:27:12 BoogieIcfgContainer [2019-11-28 20:27:12,411 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 20:27:12,412 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 20:27:12,412 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 20:27:12,416 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 20:27:12,416 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 08:27:10" (1/3) ... [2019-11-28 20:27:12,417 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62fc9c81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:27:12, skipping insertion in model container [2019-11-28 20:27:12,417 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:27:11" (2/3) ... [2019-11-28 20:27:12,418 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62fc9c81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:27:12, skipping insertion in model container [2019-11-28 20:27:12,418 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:27:12" (3/3) ... [2019-11-28 20:27:12,420 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_3a_alt.BV.c.cil.c [2019-11-28 20:27:12,430 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 20:27:12,436 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2019-11-28 20:27:12,448 INFO L249 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2019-11-28 20:27:12,482 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 20:27:12,482 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 20:27:12,483 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 20:27:12,483 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 20:27:12,483 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 20:27:12,483 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 20:27:12,483 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 20:27:12,483 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 20:27:12,502 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states. [2019-11-28 20:27:12,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 20:27:12,508 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:27:12,509 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:27:12,509 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:27:12,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:27:12,514 INFO L82 PathProgramCache]: Analyzing trace with hash -1287811732, now seen corresponding path program 1 times [2019-11-28 20:27:12,522 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:27:12,522 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724537528] [2019-11-28 20:27:12,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:27:12,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:27:12,703 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-28 20:27:12,704 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724537528] [2019-11-28 20:27:12,705 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:27:12,705 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 20:27:12,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657756349] [2019-11-28 20:27:12,712 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 20:27:12,713 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:27:12,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:27:12,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:27:12,731 INFO L87 Difference]: Start difference. First operand 152 states. Second operand 3 states. [2019-11-28 20:27:13,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:27:13,065 INFO L93 Difference]: Finished difference Result 323 states and 532 transitions. [2019-11-28 20:27:13,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:27:13,068 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-28 20:27:13,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:27:13,082 INFO L225 Difference]: With dead ends: 323 [2019-11-28 20:27:13,083 INFO L226 Difference]: Without dead ends: 155 [2019-11-28 20:27:13,087 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-28 20:27:13,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-11-28 20:27:13,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2019-11-28 20:27:13,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-11-28 20:27:13,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 230 transitions. [2019-11-28 20:27:13,152 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 230 transitions. Word has length 16 [2019-11-28 20:27:13,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:27:13,153 INFO L462 AbstractCegarLoop]: Abstraction has 155 states and 230 transitions. [2019-11-28 20:27:13,153 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 20:27:13,153 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 230 transitions. [2019-11-28 20:27:13,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 20:27:13,154 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:27:13,155 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:27:13,155 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:27:13,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:27:13,156 INFO L82 PathProgramCache]: Analyzing trace with hash 664085130, now seen corresponding path program 1 times [2019-11-28 20:27:13,156 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:27:13,156 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219195859] [2019-11-28 20:27:13,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:27:13,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:27:13,221 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-28 20:27:13,222 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219195859] [2019-11-28 20:27:13,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:27:13,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 20:27:13,223 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075262459] [2019-11-28 20:27:13,225 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 20:27:13,225 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:27:13,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:27:13,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:27:13,226 INFO L87 Difference]: Start difference. First operand 155 states and 230 transitions. Second operand 3 states. [2019-11-28 20:27:13,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:27:13,442 INFO L93 Difference]: Finished difference Result 313 states and 462 transitions. [2019-11-28 20:27:13,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:27:13,442 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-28 20:27:13,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:27:13,444 INFO L225 Difference]: With dead ends: 313 [2019-11-28 20:27:13,445 INFO L226 Difference]: Without dead ends: 165 [2019-11-28 20:27:13,447 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-28 20:27:13,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-11-28 20:27:13,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 156. [2019-11-28 20:27:13,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-11-28 20:27:13,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 231 transitions. [2019-11-28 20:27:13,466 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 231 transitions. Word has length 17 [2019-11-28 20:27:13,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:27:13,466 INFO L462 AbstractCegarLoop]: Abstraction has 156 states and 231 transitions. [2019-11-28 20:27:13,466 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 20:27:13,466 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 231 transitions. [2019-11-28 20:27:13,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-28 20:27:13,467 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:27:13,467 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:27:13,468 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:27:13,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:27:13,468 INFO L82 PathProgramCache]: Analyzing trace with hash 37329238, now seen corresponding path program 1 times [2019-11-28 20:27:13,469 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:27:13,469 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569700590] [2019-11-28 20:27:13,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:27:13,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:27:13,557 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-28 20:27:13,558 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569700590] [2019-11-28 20:27:13,558 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:27:13,558 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 20:27:13,558 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870126962] [2019-11-28 20:27:13,559 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 20:27:13,560 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:27:13,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:27:13,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:27:13,560 INFO L87 Difference]: Start difference. First operand 156 states and 231 transitions. Second operand 3 states. [2019-11-28 20:27:13,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:27:13,738 INFO L93 Difference]: Finished difference Result 315 states and 464 transitions. [2019-11-28 20:27:13,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:27:13,739 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-28 20:27:13,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:27:13,741 INFO L225 Difference]: With dead ends: 315 [2019-11-28 20:27:13,741 INFO L226 Difference]: Without dead ends: 166 [2019-11-28 20:27:13,743 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-28 20:27:13,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-11-28 20:27:13,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 157. [2019-11-28 20:27:13,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-11-28 20:27:13,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 232 transitions. [2019-11-28 20:27:13,758 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 232 transitions. Word has length 18 [2019-11-28 20:27:13,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:27:13,758 INFO L462 AbstractCegarLoop]: Abstraction has 157 states and 232 transitions. [2019-11-28 20:27:13,758 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 20:27:13,758 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 232 transitions. [2019-11-28 20:27:13,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-28 20:27:13,760 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:27:13,760 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:27:13,760 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:27:13,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:27:13,761 INFO L82 PathProgramCache]: Analyzing trace with hash 1635395343, now seen corresponding path program 1 times [2019-11-28 20:27:13,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:27:13,762 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233610800] [2019-11-28 20:27:13,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:27:13,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:27:13,832 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-28 20:27:13,832 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233610800] [2019-11-28 20:27:13,833 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:27:13,833 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 20:27:13,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280459178] [2019-11-28 20:27:13,834 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 20:27:13,834 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:27:13,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:27:13,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:27:13,836 INFO L87 Difference]: Start difference. First operand 157 states and 232 transitions. Second operand 3 states. [2019-11-28 20:27:14,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:27:14,017 INFO L93 Difference]: Finished difference Result 317 states and 466 transitions. [2019-11-28 20:27:14,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:27:14,018 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-28 20:27:14,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:27:14,020 INFO L225 Difference]: With dead ends: 317 [2019-11-28 20:27:14,020 INFO L226 Difference]: Without dead ends: 167 [2019-11-28 20:27:14,021 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-28 20:27:14,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-11-28 20:27:14,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 158. [2019-11-28 20:27:14,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-11-28 20:27:14,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 233 transitions. [2019-11-28 20:27:14,036 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 233 transitions. Word has length 19 [2019-11-28 20:27:14,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:27:14,036 INFO L462 AbstractCegarLoop]: Abstraction has 158 states and 233 transitions. [2019-11-28 20:27:14,036 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 20:27:14,037 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 233 transitions. [2019-11-28 20:27:14,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-28 20:27:14,038 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:27:14,038 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:27:14,039 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:27:14,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:27:14,039 INFO L82 PathProgramCache]: Analyzing trace with hash -811500677, now seen corresponding path program 1 times [2019-11-28 20:27:14,040 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:27:14,040 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753023621] [2019-11-28 20:27:14,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:27:14,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:27:14,090 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-28 20:27:14,091 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753023621] [2019-11-28 20:27:14,091 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:27:14,091 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 20:27:14,093 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211082670] [2019-11-28 20:27:14,093 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 20:27:14,094 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:27:14,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:27:14,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:27:14,094 INFO L87 Difference]: Start difference. First operand 158 states and 233 transitions. Second operand 3 states. [2019-11-28 20:27:14,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:27:14,271 INFO L93 Difference]: Finished difference Result 319 states and 468 transitions. [2019-11-28 20:27:14,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:27:14,272 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-28 20:27:14,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:27:14,274 INFO L225 Difference]: With dead ends: 319 [2019-11-28 20:27:14,274 INFO L226 Difference]: Without dead ends: 168 [2019-11-28 20:27:14,275 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-28 20:27:14,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-11-28 20:27:14,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 159. [2019-11-28 20:27:14,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-11-28 20:27:14,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 234 transitions. [2019-11-28 20:27:14,286 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 234 transitions. Word has length 20 [2019-11-28 20:27:14,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:27:14,287 INFO L462 AbstractCegarLoop]: Abstraction has 159 states and 234 transitions. [2019-11-28 20:27:14,287 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 20:27:14,287 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 234 transitions. [2019-11-28 20:27:14,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-28 20:27:14,289 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:27:14,290 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:27:14,290 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:27:14,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:27:14,291 INFO L82 PathProgramCache]: Analyzing trace with hash 1579118521, now seen corresponding path program 1 times [2019-11-28 20:27:14,291 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:27:14,291 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058733620] [2019-11-28 20:27:14,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:27:14,309 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-28 20:27:14,311 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1533804624] [2019-11-28 20:27:14,311 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-28 20:27:14,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:27:14,386 INFO L264 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:27:14,393 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:27:14,424 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-28 20:27:14,425 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058733620] [2019-11-28 20:27:14,425 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-28 20:27:14,426 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1533804624] [2019-11-28 20:27:14,426 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:27:14,426 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 20:27:14,427 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110188501] [2019-11-28 20:27:14,427 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 20:27:14,428 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:27:14,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:27:14,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:27:14,429 INFO L87 Difference]: Start difference. First operand 159 states and 234 transitions. Second operand 3 states. [2019-11-28 20:27:14,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:27:14,470 INFO L93 Difference]: Finished difference Result 455 states and 672 transitions. [2019-11-28 20:27:14,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:27:14,471 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-11-28 20:27:14,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:27:14,473 INFO L225 Difference]: With dead ends: 455 [2019-11-28 20:27:14,473 INFO L226 Difference]: Without dead ends: 303 [2019-11-28 20:27:14,474 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 37 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-28 20:27:14,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2019-11-28 20:27:14,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 299. [2019-11-28 20:27:14,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2019-11-28 20:27:14,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 446 transitions. [2019-11-28 20:27:14,490 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 446 transitions. Word has length 39 [2019-11-28 20:27:14,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:27:14,490 INFO L462 AbstractCegarLoop]: Abstraction has 299 states and 446 transitions. [2019-11-28 20:27:14,490 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 20:27:14,491 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 446 transitions. [2019-11-28 20:27:14,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-28 20:27:14,493 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:27:14,493 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:27:14,699 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:27:14,699 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:27:14,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:27:14,699 INFO L82 PathProgramCache]: Analyzing trace with hash 643824433, now seen corresponding path program 1 times [2019-11-28 20:27:14,700 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:27:14,700 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687107821] [2019-11-28 20:27:14,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:27:14,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:27:14,771 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-28 20:27:14,771 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687107821] [2019-11-28 20:27:14,772 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:27:14,772 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 20:27:14,773 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382828750] [2019-11-28 20:27:14,773 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 20:27:14,773 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:27:14,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:27:14,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:27:14,774 INFO L87 Difference]: Start difference. First operand 299 states and 446 transitions. Second operand 3 states. [2019-11-28 20:27:14,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:27:14,967 INFO L93 Difference]: Finished difference Result 653 states and 987 transitions. [2019-11-28 20:27:14,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:27:14,968 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-11-28 20:27:14,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:27:14,971 INFO L225 Difference]: With dead ends: 653 [2019-11-28 20:27:14,972 INFO L226 Difference]: Without dead ends: 361 [2019-11-28 20:27:14,973 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-28 20:27:14,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2019-11-28 20:27:14,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 361. [2019-11-28 20:27:14,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-11-28 20:27:14,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 550 transitions. [2019-11-28 20:27:14,997 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 550 transitions. Word has length 44 [2019-11-28 20:27:14,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:27:14,999 INFO L462 AbstractCegarLoop]: Abstraction has 361 states and 550 transitions. [2019-11-28 20:27:14,999 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 20:27:14,999 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 550 transitions. [2019-11-28 20:27:15,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-28 20:27:15,002 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:27:15,002 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:27:15,003 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:27:15,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:27:15,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1369957728, now seen corresponding path program 1 times [2019-11-28 20:27:15,003 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:27:15,004 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901437471] [2019-11-28 20:27:15,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:27:15,018 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-28 20:27:15,018 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1417714879] [2019-11-28 20:27:15,019 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-28 20:27:15,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:27:15,097 INFO L264 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:27:15,100 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:27:15,114 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:27:15,114 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901437471] [2019-11-28 20:27:15,114 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-28 20:27:15,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1417714879] [2019-11-28 20:27:15,115 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:27:15,115 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:27:15,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749236149] [2019-11-28 20:27:15,116 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 20:27:15,116 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:27:15,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:27:15,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:27:15,117 INFO L87 Difference]: Start difference. First operand 361 states and 550 transitions. Second operand 3 states. [2019-11-28 20:27:15,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:27:15,163 INFO L93 Difference]: Finished difference Result 719 states and 1092 transitions. [2019-11-28 20:27:15,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:27:15,166 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-11-28 20:27:15,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:27:15,171 INFO L225 Difference]: With dead ends: 719 [2019-11-28 20:27:15,172 INFO L226 Difference]: Without dead ends: 536 [2019-11-28 20:27:15,173 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 53 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-28 20:27:15,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2019-11-28 20:27:15,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 532. [2019-11-28 20:27:15,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 532 states. [2019-11-28 20:27:15,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 815 transitions. [2019-11-28 20:27:15,199 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 815 transitions. Word has length 55 [2019-11-28 20:27:15,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:27:15,199 INFO L462 AbstractCegarLoop]: Abstraction has 532 states and 815 transitions. [2019-11-28 20:27:15,200 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 20:27:15,200 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 815 transitions. [2019-11-28 20:27:15,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-28 20:27:15,202 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:27:15,203 INFO L410 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:27:15,409 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:27:15,409 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:27:15,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:27:15,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1405602907, now seen corresponding path program 1 times [2019-11-28 20:27:15,410 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:27:15,411 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8205050] [2019-11-28 20:27:15,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:27:15,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:27:15,457 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-28 20:27:15,458 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8205050] [2019-11-28 20:27:15,458 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:27:15,458 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 20:27:15,458 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563370964] [2019-11-28 20:27:15,459 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 20:27:15,461 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:27:15,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:27:15,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:27:15,462 INFO L87 Difference]: Start difference. First operand 532 states and 815 transitions. Second operand 3 states. [2019-11-28 20:27:15,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:27:15,612 INFO L93 Difference]: Finished difference Result 1111 states and 1694 transitions. [2019-11-28 20:27:15,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:27:15,612 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-11-28 20:27:15,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:27:15,618 INFO L225 Difference]: With dead ends: 1111 [2019-11-28 20:27:15,618 INFO L226 Difference]: Without dead ends: 586 [2019-11-28 20:27:15,619 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-28 20:27:15,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2019-11-28 20:27:15,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 580. [2019-11-28 20:27:15,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2019-11-28 20:27:15,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 878 transitions. [2019-11-28 20:27:15,663 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 878 transitions. Word has length 56 [2019-11-28 20:27:15,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:27:15,667 INFO L462 AbstractCegarLoop]: Abstraction has 580 states and 878 transitions. [2019-11-28 20:27:15,667 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 20:27:15,667 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 878 transitions. [2019-11-28 20:27:15,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-28 20:27:15,669 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:27:15,669 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:27:15,669 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:27:15,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:27:15,671 INFO L82 PathProgramCache]: Analyzing trace with hash -2147424561, now seen corresponding path program 1 times [2019-11-28 20:27:15,671 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:27:15,671 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026272434] [2019-11-28 20:27:15,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:27:15,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:27:15,725 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-28 20:27:15,725 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026272434] [2019-11-28 20:27:15,725 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:27:15,728 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 20:27:15,728 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668839343] [2019-11-28 20:27:15,728 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 20:27:15,729 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:27:15,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:27:15,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:27:15,729 INFO L87 Difference]: Start difference. First operand 580 states and 878 transitions. Second operand 3 states. [2019-11-28 20:27:15,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:27:15,902 INFO L93 Difference]: Finished difference Result 1162 states and 1757 transitions. [2019-11-28 20:27:15,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:27:15,903 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-11-28 20:27:15,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:27:15,907 INFO L225 Difference]: With dead ends: 1162 [2019-11-28 20:27:15,907 INFO L226 Difference]: Without dead ends: 589 [2019-11-28 20:27:15,908 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-28 20:27:15,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2019-11-28 20:27:15,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 583. [2019-11-28 20:27:15,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 583 states. [2019-11-28 20:27:15,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 878 transitions. [2019-11-28 20:27:15,931 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 878 transitions. Word has length 57 [2019-11-28 20:27:15,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:27:15,931 INFO L462 AbstractCegarLoop]: Abstraction has 583 states and 878 transitions. [2019-11-28 20:27:15,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 20:27:15,932 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 878 transitions. [2019-11-28 20:27:15,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-11-28 20:27:15,933 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:27:15,933 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1] [2019-11-28 20:27:15,934 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:27:15,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:27:15,934 INFO L82 PathProgramCache]: Analyzing trace with hash -216125576, now seen corresponding path program 1 times [2019-11-28 20:27:15,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:27:15,935 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314096599] [2019-11-28 20:27:15,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:27:15,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:27:15,978 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-28 20:27:15,978 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314096599] [2019-11-28 20:27:15,978 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:27:15,978 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 20:27:15,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729617535] [2019-11-28 20:27:15,979 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 20:27:15,979 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:27:15,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:27:15,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:27:15,980 INFO L87 Difference]: Start difference. First operand 583 states and 878 transitions. Second operand 3 states. [2019-11-28 20:27:16,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:27:16,176 INFO L93 Difference]: Finished difference Result 1291 states and 1970 transitions. [2019-11-28 20:27:16,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:27:16,176 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-11-28 20:27:16,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:27:16,181 INFO L225 Difference]: With dead ends: 1291 [2019-11-28 20:27:16,181 INFO L226 Difference]: Without dead ends: 715 [2019-11-28 20:27:16,182 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-28 20:27:16,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2019-11-28 20:27:16,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 709. [2019-11-28 20:27:16,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 709 states. [2019-11-28 20:27:16,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 709 states and 1091 transitions. [2019-11-28 20:27:16,217 INFO L78 Accepts]: Start accepts. Automaton has 709 states and 1091 transitions. Word has length 70 [2019-11-28 20:27:16,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:27:16,217 INFO L462 AbstractCegarLoop]: Abstraction has 709 states and 1091 transitions. [2019-11-28 20:27:16,217 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 20:27:16,217 INFO L276 IsEmpty]: Start isEmpty. Operand 709 states and 1091 transitions. [2019-11-28 20:27:16,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-28 20:27:16,219 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:27:16,219 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1] [2019-11-28 20:27:16,219 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:27:16,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:27:16,220 INFO L82 PathProgramCache]: Analyzing trace with hash 380295080, now seen corresponding path program 1 times [2019-11-28 20:27:16,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:27:16,220 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329507025] [2019-11-28 20:27:16,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:27:16,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:27:16,290 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-28 20:27:16,291 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329507025] [2019-11-28 20:27:16,291 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:27:16,291 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 20:27:16,291 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671882417] [2019-11-28 20:27:16,292 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 20:27:16,292 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:27:16,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:27:16,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:27:16,292 INFO L87 Difference]: Start difference. First operand 709 states and 1091 transitions. Second operand 3 states. [2019-11-28 20:27:16,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:27:16,501 INFO L93 Difference]: Finished difference Result 1513 states and 2336 transitions. [2019-11-28 20:27:16,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:27:16,502 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-11-28 20:27:16,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:27:16,507 INFO L225 Difference]: With dead ends: 1513 [2019-11-28 20:27:16,507 INFO L226 Difference]: Without dead ends: 811 [2019-11-28 20:27:16,512 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-28 20:27:16,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2019-11-28 20:27:16,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 790. [2019-11-28 20:27:16,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2019-11-28 20:27:16,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1211 transitions. [2019-11-28 20:27:16,546 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1211 transitions. Word has length 71 [2019-11-28 20:27:16,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:27:16,546 INFO L462 AbstractCegarLoop]: Abstraction has 790 states and 1211 transitions. [2019-11-28 20:27:16,546 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 20:27:16,546 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1211 transitions. [2019-11-28 20:27:16,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-28 20:27:16,548 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:27:16,548 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-28 20:27:16,548 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:27:16,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:27:16,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1769518732, now seen corresponding path program 1 times [2019-11-28 20:27:16,549 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:27:16,549 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931359106] [2019-11-28 20:27:16,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:27:16,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:27:16,587 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-28 20:27:16,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931359106] [2019-11-28 20:27:16,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:27:16,588 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 20:27:16,588 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029692354] [2019-11-28 20:27:16,589 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 20:27:16,589 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:27:16,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:27:16,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:27:16,590 INFO L87 Difference]: Start difference. First operand 790 states and 1211 transitions. Second operand 3 states. [2019-11-28 20:27:16,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:27:16,806 INFO L93 Difference]: Finished difference Result 1582 states and 2423 transitions. [2019-11-28 20:27:16,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:27:16,807 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-11-28 20:27:16,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:27:16,813 INFO L225 Difference]: With dead ends: 1582 [2019-11-28 20:27:16,813 INFO L226 Difference]: Without dead ends: 799 [2019-11-28 20:27:16,815 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-28 20:27:16,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2019-11-28 20:27:16,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 793. [2019-11-28 20:27:16,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2019-11-28 20:27:16,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 1211 transitions. [2019-11-28 20:27:16,864 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 1211 transitions. Word has length 71 [2019-11-28 20:27:16,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:27:16,866 INFO L462 AbstractCegarLoop]: Abstraction has 793 states and 1211 transitions. [2019-11-28 20:27:16,866 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 20:27:16,866 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 1211 transitions. [2019-11-28 20:27:16,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-28 20:27:16,869 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:27:16,869 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1] [2019-11-28 20:27:16,869 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:27:16,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:27:16,870 INFO L82 PathProgramCache]: Analyzing trace with hash -953703820, now seen corresponding path program 1 times [2019-11-28 20:27:16,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:27:16,871 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290607194] [2019-11-28 20:27:16,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:27:16,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:27:16,920 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-28 20:27:16,920 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290607194] [2019-11-28 20:27:16,921 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:27:16,921 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 20:27:16,921 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250486419] [2019-11-28 20:27:16,922 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 20:27:16,922 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:27:16,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:27:16,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:27:16,923 INFO L87 Difference]: Start difference. First operand 793 states and 1211 transitions. Second operand 3 states. [2019-11-28 20:27:17,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:27:17,134 INFO L93 Difference]: Finished difference Result 1600 states and 2447 transitions. [2019-11-28 20:27:17,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:27:17,134 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-11-28 20:27:17,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:27:17,139 INFO L225 Difference]: With dead ends: 1600 [2019-11-28 20:27:17,139 INFO L226 Difference]: Without dead ends: 814 [2019-11-28 20:27:17,142 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-28 20:27:17,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 814 states. [2019-11-28 20:27:17,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 814 to 793. [2019-11-28 20:27:17,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2019-11-28 20:27:17,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 1202 transitions. [2019-11-28 20:27:17,186 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 1202 transitions. Word has length 72 [2019-11-28 20:27:17,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:27:17,187 INFO L462 AbstractCegarLoop]: Abstraction has 793 states and 1202 transitions. [2019-11-28 20:27:17,187 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 20:27:17,187 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 1202 transitions. [2019-11-28 20:27:17,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-28 20:27:17,189 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:27:17,189 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:27:17,190 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:27:17,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:27:17,190 INFO L82 PathProgramCache]: Analyzing trace with hash -816065300, now seen corresponding path program 1 times [2019-11-28 20:27:17,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:27:17,191 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279350960] [2019-11-28 20:27:17,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:27:17,204 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-28 20:27:17,205 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2075226782] [2019-11-28 20:27:17,205 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-28 20:27:17,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:27:17,289 INFO L264 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:27:17,293 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:27:17,306 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-28 20:27:17,306 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279350960] [2019-11-28 20:27:17,306 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-28 20:27:17,307 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2075226782] [2019-11-28 20:27:17,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:27:17,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:27:17,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837416349] [2019-11-28 20:27:17,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 20:27:17,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:27:17,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:27:17,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:27:17,309 INFO L87 Difference]: Start difference. First operand 793 states and 1202 transitions. Second operand 3 states. [2019-11-28 20:27:17,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:27:17,369 INFO L93 Difference]: Finished difference Result 1583 states and 2396 transitions. [2019-11-28 20:27:17,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:27:17,369 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2019-11-28 20:27:17,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:27:17,375 INFO L225 Difference]: With dead ends: 1583 [2019-11-28 20:27:17,375 INFO L226 Difference]: Without dead ends: 1055 [2019-11-28 20:27:17,377 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 74 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-28 20:27:17,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1055 states. [2019-11-28 20:27:17,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1055 to 1051. [2019-11-28 20:27:17,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1051 states. [2019-11-28 20:27:17,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1051 states to 1051 states and 1597 transitions. [2019-11-28 20:27:17,424 INFO L78 Accepts]: Start accepts. Automaton has 1051 states and 1597 transitions. Word has length 76 [2019-11-28 20:27:17,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:27:17,424 INFO L462 AbstractCegarLoop]: Abstraction has 1051 states and 1597 transitions. [2019-11-28 20:27:17,425 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 20:27:17,425 INFO L276 IsEmpty]: Start isEmpty. Operand 1051 states and 1597 transitions. [2019-11-28 20:27:17,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-28 20:27:17,427 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:27:17,428 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:27:17,631 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:27:17,631 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:27:17,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:27:17,632 INFO L82 PathProgramCache]: Analyzing trace with hash -174298828, now seen corresponding path program 1 times [2019-11-28 20:27:17,632 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:27:17,633 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878237722] [2019-11-28 20:27:17,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:27:17,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:27:17,671 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-28 20:27:17,672 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878237722] [2019-11-28 20:27:17,673 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:27:17,673 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 20:27:17,675 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974095248] [2019-11-28 20:27:17,676 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 20:27:17,676 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:27:17,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:27:17,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:27:17,677 INFO L87 Difference]: Start difference. First operand 1051 states and 1597 transitions. Second operand 3 states. [2019-11-28 20:27:17,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:27:17,888 INFO L93 Difference]: Finished difference Result 2279 states and 3475 transitions. [2019-11-28 20:27:17,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:27:17,889 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2019-11-28 20:27:17,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:27:17,896 INFO L225 Difference]: With dead ends: 2279 [2019-11-28 20:27:17,897 INFO L226 Difference]: Without dead ends: 1235 [2019-11-28 20:27:17,899 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-28 20:27:17,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1235 states. [2019-11-28 20:27:17,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1235 to 1223. [2019-11-28 20:27:17,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1223 states. [2019-11-28 20:27:17,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1223 states to 1223 states and 1873 transitions. [2019-11-28 20:27:17,945 INFO L78 Accepts]: Start accepts. Automaton has 1223 states and 1873 transitions. Word has length 86 [2019-11-28 20:27:17,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:27:17,945 INFO L462 AbstractCegarLoop]: Abstraction has 1223 states and 1873 transitions. [2019-11-28 20:27:17,945 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 20:27:17,945 INFO L276 IsEmpty]: Start isEmpty. Operand 1223 states and 1873 transitions. [2019-11-28 20:27:17,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-28 20:27:17,948 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:27:17,948 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:27:17,948 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:27:17,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:27:17,949 INFO L82 PathProgramCache]: Analyzing trace with hash -1676680243, now seen corresponding path program 1 times [2019-11-28 20:27:17,949 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:27:17,950 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977772389] [2019-11-28 20:27:17,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:27:17,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:27:17,990 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-28 20:27:17,991 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977772389] [2019-11-28 20:27:17,991 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:27:17,992 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 20:27:17,992 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380049748] [2019-11-28 20:27:17,992 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 20:27:17,993 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:27:17,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:27:17,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:27:17,993 INFO L87 Difference]: Start difference. First operand 1223 states and 1873 transitions. Second operand 3 states. [2019-11-28 20:27:18,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:27:18,222 INFO L93 Difference]: Finished difference Result 2499 states and 3839 transitions. [2019-11-28 20:27:18,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:27:18,223 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 87 [2019-11-28 20:27:18,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:27:18,230 INFO L225 Difference]: With dead ends: 2499 [2019-11-28 20:27:18,230 INFO L226 Difference]: Without dead ends: 1275 [2019-11-28 20:27:18,233 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-28 20:27:18,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1275 states. [2019-11-28 20:27:18,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1275 to 1263. [2019-11-28 20:27:18,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1263 states. [2019-11-28 20:27:18,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1263 states to 1263 states and 1949 transitions. [2019-11-28 20:27:18,280 INFO L78 Accepts]: Start accepts. Automaton has 1263 states and 1949 transitions. Word has length 87 [2019-11-28 20:27:18,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:27:18,280 INFO L462 AbstractCegarLoop]: Abstraction has 1263 states and 1949 transitions. [2019-11-28 20:27:18,280 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 20:27:18,281 INFO L276 IsEmpty]: Start isEmpty. Operand 1263 states and 1949 transitions. [2019-11-28 20:27:18,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-28 20:27:18,283 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:27:18,284 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:27:18,284 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:27:18,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:27:18,285 INFO L82 PathProgramCache]: Analyzing trace with hash 538835484, now seen corresponding path program 1 times [2019-11-28 20:27:18,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:27:18,285 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440583994] [2019-11-28 20:27:18,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:27:18,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:27:18,318 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-11-28 20:27:18,318 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440583994] [2019-11-28 20:27:18,319 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:27:18,319 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 20:27:18,319 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310589624] [2019-11-28 20:27:18,320 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 20:27:18,320 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:27:18,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:27:18,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:27:18,321 INFO L87 Difference]: Start difference. First operand 1263 states and 1949 transitions. Second operand 3 states. [2019-11-28 20:27:18,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:27:18,506 INFO L93 Difference]: Finished difference Result 2667 states and 4123 transitions. [2019-11-28 20:27:18,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:27:18,507 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-11-28 20:27:18,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:27:18,515 INFO L225 Difference]: With dead ends: 2667 [2019-11-28 20:27:18,516 INFO L226 Difference]: Without dead ends: 1411 [2019-11-28 20:27:18,518 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-28 20:27:18,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1411 states. [2019-11-28 20:27:18,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1411 to 1363. [2019-11-28 20:27:18,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1363 states. [2019-11-28 20:27:18,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1363 states to 1363 states and 2085 transitions. [2019-11-28 20:27:18,564 INFO L78 Accepts]: Start accepts. Automaton has 1363 states and 2085 transitions. Word has length 97 [2019-11-28 20:27:18,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:27:18,565 INFO L462 AbstractCegarLoop]: Abstraction has 1363 states and 2085 transitions. [2019-11-28 20:27:18,565 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 20:27:18,565 INFO L276 IsEmpty]: Start isEmpty. Operand 1363 states and 2085 transitions. [2019-11-28 20:27:18,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-28 20:27:18,568 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:27:18,568 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:27:18,569 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:27:18,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:27:18,569 INFO L82 PathProgramCache]: Analyzing trace with hash 704331080, now seen corresponding path program 1 times [2019-11-28 20:27:18,570 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:27:18,570 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006592548] [2019-11-28 20:27:18,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:27:18,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:27:18,599 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-11-28 20:27:18,600 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006592548] [2019-11-28 20:27:18,600 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:27:18,600 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 20:27:18,601 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485662000] [2019-11-28 20:27:18,601 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 20:27:18,602 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:27:18,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:27:18,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:27:18,603 INFO L87 Difference]: Start difference. First operand 1363 states and 2085 transitions. Second operand 3 states. [2019-11-28 20:27:18,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:27:18,786 INFO L93 Difference]: Finished difference Result 2767 states and 4239 transitions. [2019-11-28 20:27:18,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:27:18,786 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-11-28 20:27:18,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:27:18,793 INFO L225 Difference]: With dead ends: 2767 [2019-11-28 20:27:18,794 INFO L226 Difference]: Without dead ends: 1411 [2019-11-28 20:27:18,796 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-28 20:27:18,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1411 states. [2019-11-28 20:27:18,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1411 to 1363. [2019-11-28 20:27:18,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1363 states. [2019-11-28 20:27:18,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1363 states to 1363 states and 2065 transitions. [2019-11-28 20:27:18,841 INFO L78 Accepts]: Start accepts. Automaton has 1363 states and 2065 transitions. Word has length 98 [2019-11-28 20:27:18,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:27:18,842 INFO L462 AbstractCegarLoop]: Abstraction has 1363 states and 2065 transitions. [2019-11-28 20:27:18,842 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 20:27:18,842 INFO L276 IsEmpty]: Start isEmpty. Operand 1363 states and 2065 transitions. [2019-11-28 20:27:18,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-11-28 20:27:18,845 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:27:18,845 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1] [2019-11-28 20:27:18,846 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:27:18,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:27:18,846 INFO L82 PathProgramCache]: Analyzing trace with hash -1454055914, now seen corresponding path program 1 times [2019-11-28 20:27:18,847 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:27:18,847 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194625849] [2019-11-28 20:27:18,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:27:18,858 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-28 20:27:18,858 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1689351387] [2019-11-28 20:27:18,858 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-28 20:27:18,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:27:18,919 INFO L264 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:27:18,923 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:27:18,961 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-11-28 20:27:18,961 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194625849] [2019-11-28 20:27:18,962 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-28 20:27:18,962 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1689351387] [2019-11-28 20:27:18,963 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:27:18,963 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:27:18,963 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123349332] [2019-11-28 20:27:18,964 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 20:27:18,968 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:27:18,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:27:18,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:27:18,969 INFO L87 Difference]: Start difference. First operand 1363 states and 2065 transitions. Second operand 3 states. [2019-11-28 20:27:19,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:27:19,227 INFO L93 Difference]: Finished difference Result 2755 states and 4163 transitions. [2019-11-28 20:27:19,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:27:19,228 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2019-11-28 20:27:19,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:27:19,235 INFO L225 Difference]: With dead ends: 2755 [2019-11-28 20:27:19,236 INFO L226 Difference]: Without dead ends: 1399 [2019-11-28 20:27:19,238 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 114 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-28 20:27:19,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1399 states. [2019-11-28 20:27:19,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1399 to 1363. [2019-11-28 20:27:19,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1363 states. [2019-11-28 20:27:19,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1363 states to 1363 states and 1993 transitions. [2019-11-28 20:27:19,297 INFO L78 Accepts]: Start accepts. Automaton has 1363 states and 1993 transitions. Word has length 116 [2019-11-28 20:27:19,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:27:19,298 INFO L462 AbstractCegarLoop]: Abstraction has 1363 states and 1993 transitions. [2019-11-28 20:27:19,298 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 20:27:19,298 INFO L276 IsEmpty]: Start isEmpty. Operand 1363 states and 1993 transitions. [2019-11-28 20:27:19,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-11-28 20:27:19,357 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:27:19,357 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:27:19,557 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:27:19,558 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:27:19,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:27:19,559 INFO L82 PathProgramCache]: Analyzing trace with hash 2083865546, now seen corresponding path program 1 times [2019-11-28 20:27:19,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:27:19,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879734949] [2019-11-28 20:27:19,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:27:19,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:27:19,628 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-11-28 20:27:19,629 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879734949] [2019-11-28 20:27:19,629 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:27:19,630 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 20:27:19,630 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998770198] [2019-11-28 20:27:19,631 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 20:27:19,631 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:27:19,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:27:19,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:27:19,632 INFO L87 Difference]: Start difference. First operand 1363 states and 1993 transitions. Second operand 3 states. [2019-11-28 20:27:19,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:27:19,873 INFO L93 Difference]: Finished difference Result 2827 states and 4135 transitions. [2019-11-28 20:27:19,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:27:19,874 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 117 [2019-11-28 20:27:19,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:27:19,884 INFO L225 Difference]: With dead ends: 2827 [2019-11-28 20:27:19,885 INFO L226 Difference]: Without dead ends: 1471 [2019-11-28 20:27:19,888 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-28 20:27:19,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1471 states. [2019-11-28 20:27:19,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1471 to 1459. [2019-11-28 20:27:19,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1459 states. [2019-11-28 20:27:19,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1459 states to 1459 states and 2117 transitions. [2019-11-28 20:27:19,969 INFO L78 Accepts]: Start accepts. Automaton has 1459 states and 2117 transitions. Word has length 117 [2019-11-28 20:27:19,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:27:19,970 INFO L462 AbstractCegarLoop]: Abstraction has 1459 states and 2117 transitions. [2019-11-28 20:27:19,970 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 20:27:19,971 INFO L276 IsEmpty]: Start isEmpty. Operand 1459 states and 2117 transitions. [2019-11-28 20:27:19,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-11-28 20:27:19,975 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:27:19,975 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:27:19,976 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:27:19,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:27:19,977 INFO L82 PathProgramCache]: Analyzing trace with hash -63631274, now seen corresponding path program 1 times [2019-11-28 20:27:19,977 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:27:19,978 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477030655] [2019-11-28 20:27:19,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:27:19,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:27:20,042 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-11-28 20:27:20,042 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477030655] [2019-11-28 20:27:20,043 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:27:20,043 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 20:27:20,044 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768130226] [2019-11-28 20:27:20,044 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 20:27:20,045 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:27:20,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:27:20,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:27:20,047 INFO L87 Difference]: Start difference. First operand 1459 states and 2117 transitions. Second operand 3 states. [2019-11-28 20:27:20,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:27:20,294 INFO L93 Difference]: Finished difference Result 2923 states and 4239 transitions. [2019-11-28 20:27:20,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:27:20,295 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 118 [2019-11-28 20:27:20,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:27:20,305 INFO L225 Difference]: With dead ends: 2923 [2019-11-28 20:27:20,305 INFO L226 Difference]: Without dead ends: 1471 [2019-11-28 20:27:20,308 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-28 20:27:20,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1471 states. [2019-11-28 20:27:20,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1471 to 1459. [2019-11-28 20:27:20,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1459 states. [2019-11-28 20:27:20,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1459 states to 1459 states and 2097 transitions. [2019-11-28 20:27:20,374 INFO L78 Accepts]: Start accepts. Automaton has 1459 states and 2097 transitions. Word has length 118 [2019-11-28 20:27:20,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:27:20,375 INFO L462 AbstractCegarLoop]: Abstraction has 1459 states and 2097 transitions. [2019-11-28 20:27:20,375 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 20:27:20,376 INFO L276 IsEmpty]: Start isEmpty. Operand 1459 states and 2097 transitions. [2019-11-28 20:27:20,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-11-28 20:27:20,380 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:27:20,380 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:27:20,381 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:27:20,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:27:20,383 INFO L82 PathProgramCache]: Analyzing trace with hash 365233416, now seen corresponding path program 1 times [2019-11-28 20:27:20,383 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:27:20,384 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061475021] [2019-11-28 20:27:20,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:27:20,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:27:20,448 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-11-28 20:27:20,449 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061475021] [2019-11-28 20:27:20,449 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:27:20,450 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 20:27:20,452 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302314174] [2019-11-28 20:27:20,453 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 20:27:20,453 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:27:20,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:27:20,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:27:20,454 INFO L87 Difference]: Start difference. First operand 1459 states and 2097 transitions. Second operand 3 states. [2019-11-28 20:27:20,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:27:20,743 INFO L93 Difference]: Finished difference Result 3091 states and 4445 transitions. [2019-11-28 20:27:20,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:27:20,744 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 126 [2019-11-28 20:27:20,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:27:20,754 INFO L225 Difference]: With dead ends: 3091 [2019-11-28 20:27:20,755 INFO L226 Difference]: Without dead ends: 1639 [2019-11-28 20:27:20,758 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-28 20:27:20,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1639 states. [2019-11-28 20:27:20,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1639 to 1623. [2019-11-28 20:27:20,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1623 states. [2019-11-28 20:27:20,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1623 states to 1623 states and 2337 transitions. [2019-11-28 20:27:20,841 INFO L78 Accepts]: Start accepts. Automaton has 1623 states and 2337 transitions. Word has length 126 [2019-11-28 20:27:20,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:27:20,842 INFO L462 AbstractCegarLoop]: Abstraction has 1623 states and 2337 transitions. [2019-11-28 20:27:20,842 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 20:27:20,842 INFO L276 IsEmpty]: Start isEmpty. Operand 1623 states and 2337 transitions. [2019-11-28 20:27:20,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-11-28 20:27:20,847 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:27:20,847 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:27:20,848 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:27:20,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:27:20,849 INFO L82 PathProgramCache]: Analyzing trace with hash 1493527041, now seen corresponding path program 1 times [2019-11-28 20:27:20,849 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:27:20,849 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33321516] [2019-11-28 20:27:20,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:27:20,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:27:20,936 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-11-28 20:27:20,936 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33321516] [2019-11-28 20:27:20,937 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:27:20,937 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 20:27:20,938 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113498775] [2019-11-28 20:27:20,938 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 20:27:20,939 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:27:20,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:27:20,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:27:20,940 INFO L87 Difference]: Start difference. First operand 1623 states and 2337 transitions. Second operand 3 states. [2019-11-28 20:27:21,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:27:21,222 INFO L93 Difference]: Finished difference Result 3255 states and 4681 transitions. [2019-11-28 20:27:21,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:27:21,222 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 127 [2019-11-28 20:27:21,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:27:21,231 INFO L225 Difference]: With dead ends: 3255 [2019-11-28 20:27:21,231 INFO L226 Difference]: Without dead ends: 1631 [2019-11-28 20:27:21,236 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-28 20:27:21,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1631 states. [2019-11-28 20:27:21,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1631 to 1615. [2019-11-28 20:27:21,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1615 states. [2019-11-28 20:27:21,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1615 states to 1615 states and 2321 transitions. [2019-11-28 20:27:21,298 INFO L78 Accepts]: Start accepts. Automaton has 1615 states and 2321 transitions. Word has length 127 [2019-11-28 20:27:21,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:27:21,299 INFO L462 AbstractCegarLoop]: Abstraction has 1615 states and 2321 transitions. [2019-11-28 20:27:21,299 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 20:27:21,299 INFO L276 IsEmpty]: Start isEmpty. Operand 1615 states and 2321 transitions. [2019-11-28 20:27:21,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-11-28 20:27:21,303 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:27:21,304 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:27:21,304 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:27:21,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:27:21,304 INFO L82 PathProgramCache]: Analyzing trace with hash 704603328, now seen corresponding path program 1 times [2019-11-28 20:27:21,305 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:27:21,305 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093776644] [2019-11-28 20:27:21,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:27:21,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:27:21,349 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-28 20:27:21,350 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093776644] [2019-11-28 20:27:21,350 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:27:21,351 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 20:27:21,351 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256560161] [2019-11-28 20:27:21,351 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 20:27:21,352 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:27:21,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:27:21,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:27:21,353 INFO L87 Difference]: Start difference. First operand 1615 states and 2321 transitions. Second operand 3 states. [2019-11-28 20:27:21,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:27:21,536 INFO L93 Difference]: Finished difference Result 3323 states and 4778 transitions. [2019-11-28 20:27:21,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:27:21,537 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 138 [2019-11-28 20:27:21,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:27:21,546 INFO L225 Difference]: With dead ends: 3323 [2019-11-28 20:27:21,546 INFO L226 Difference]: Without dead ends: 1715 [2019-11-28 20:27:21,549 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-28 20:27:21,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1715 states. [2019-11-28 20:27:21,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1715 to 1699. [2019-11-28 20:27:21,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1699 states. [2019-11-28 20:27:21,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1699 states to 1699 states and 2417 transitions. [2019-11-28 20:27:21,628 INFO L78 Accepts]: Start accepts. Automaton has 1699 states and 2417 transitions. Word has length 138 [2019-11-28 20:27:21,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:27:21,628 INFO L462 AbstractCegarLoop]: Abstraction has 1699 states and 2417 transitions. [2019-11-28 20:27:21,628 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 20:27:21,629 INFO L276 IsEmpty]: Start isEmpty. Operand 1699 states and 2417 transitions. [2019-11-28 20:27:21,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-11-28 20:27:21,632 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:27:21,632 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:27:21,633 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:27:21,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:27:21,633 INFO L82 PathProgramCache]: Analyzing trace with hash 1658127444, now seen corresponding path program 1 times [2019-11-28 20:27:21,633 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:27:21,634 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151333616] [2019-11-28 20:27:21,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:27:21,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:27:21,670 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-28 20:27:21,671 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151333616] [2019-11-28 20:27:21,671 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:27:21,671 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 20:27:21,671 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910500954] [2019-11-28 20:27:21,672 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 20:27:21,672 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:27:21,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:27:21,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:27:21,673 INFO L87 Difference]: Start difference. First operand 1699 states and 2417 transitions. Second operand 3 states. [2019-11-28 20:27:21,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:27:21,852 INFO L93 Difference]: Finished difference Result 3407 states and 4846 transitions. [2019-11-28 20:27:21,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:27:21,853 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 139 [2019-11-28 20:27:21,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:27:21,863 INFO L225 Difference]: With dead ends: 3407 [2019-11-28 20:27:21,864 INFO L226 Difference]: Without dead ends: 1715 [2019-11-28 20:27:21,866 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-28 20:27:21,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1715 states. [2019-11-28 20:27:21,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1715 to 1699. [2019-11-28 20:27:21,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1699 states. [2019-11-28 20:27:21,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1699 states to 1699 states and 2389 transitions. [2019-11-28 20:27:21,933 INFO L78 Accepts]: Start accepts. Automaton has 1699 states and 2389 transitions. Word has length 139 [2019-11-28 20:27:21,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:27:21,933 INFO L462 AbstractCegarLoop]: Abstraction has 1699 states and 2389 transitions. [2019-11-28 20:27:21,933 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 20:27:21,933 INFO L276 IsEmpty]: Start isEmpty. Operand 1699 states and 2389 transitions. [2019-11-28 20:27:21,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-11-28 20:27:21,937 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:27:21,937 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:27:21,938 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:27:21,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:27:21,938 INFO L82 PathProgramCache]: Analyzing trace with hash 1163594683, now seen corresponding path program 1 times [2019-11-28 20:27:21,938 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:27:21,939 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068982609] [2019-11-28 20:27:21,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:27:21,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:27:21,973 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 205 trivial. 0 not checked. [2019-11-28 20:27:21,974 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068982609] [2019-11-28 20:27:21,974 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:27:21,974 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 20:27:21,975 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902963922] [2019-11-28 20:27:21,975 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 20:27:21,975 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:27:21,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:27:21,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:27:21,976 INFO L87 Difference]: Start difference. First operand 1699 states and 2389 transitions. Second operand 3 states. [2019-11-28 20:27:22,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:27:22,031 INFO L93 Difference]: Finished difference Result 3373 states and 4735 transitions. [2019-11-28 20:27:22,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:27:22,032 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 154 [2019-11-28 20:27:22,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:27:22,052 INFO L225 Difference]: With dead ends: 3373 [2019-11-28 20:27:22,055 INFO L226 Difference]: Without dead ends: 1681 [2019-11-28 20:27:22,059 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-28 20:27:22,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1681 states. [2019-11-28 20:27:22,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1681 to 1677. [2019-11-28 20:27:22,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1677 states. [2019-11-28 20:27:22,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1677 states to 1677 states and 2356 transitions. [2019-11-28 20:27:22,124 INFO L78 Accepts]: Start accepts. Automaton has 1677 states and 2356 transitions. Word has length 154 [2019-11-28 20:27:22,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:27:22,125 INFO L462 AbstractCegarLoop]: Abstraction has 1677 states and 2356 transitions. [2019-11-28 20:27:22,125 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 20:27:22,125 INFO L276 IsEmpty]: Start isEmpty. Operand 1677 states and 2356 transitions. [2019-11-28 20:27:22,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-11-28 20:27:22,129 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:27:22,129 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:27:22,129 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:27:22,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:27:22,130 INFO L82 PathProgramCache]: Analyzing trace with hash -1358544773, now seen corresponding path program 1 times [2019-11-28 20:27:22,130 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:27:22,130 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404234089] [2019-11-28 20:27:22,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:27:22,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:27:22,208 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 110 proven. 5 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2019-11-28 20:27:22,211 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404234089] [2019-11-28 20:27:22,211 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1253072751] [2019-11-28 20:27:22,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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-28 20:27:22,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:27:22,311 INFO L264 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-28 20:27:22,320 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:27:22,355 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 110 proven. 5 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2019-11-28 20:27:22,356 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:27:22,356 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-28 20:27:22,356 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624905124] [2019-11-28 20:27:22,357 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 20:27:22,357 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:27:22,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:27:22,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:27:22,358 INFO L87 Difference]: Start difference. First operand 1677 states and 2356 transitions. Second operand 4 states. [2019-11-28 20:27:22,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:27:22,771 INFO L93 Difference]: Finished difference Result 5291 states and 7422 transitions. [2019-11-28 20:27:22,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 20:27:22,772 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2019-11-28 20:27:22,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:27:22,785 INFO L225 Difference]: With dead ends: 5291 [2019-11-28 20:27:22,786 INFO L226 Difference]: Without dead ends: 3521 [2019-11-28 20:27:22,789 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 20:27:22,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3521 states. [2019-11-28 20:27:22,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3521 to 2065. [2019-11-28 20:27:22,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2065 states. [2019-11-28 20:27:22,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2065 states to 2065 states and 2916 transitions. [2019-11-28 20:27:22,857 INFO L78 Accepts]: Start accepts. Automaton has 2065 states and 2916 transitions. Word has length 154 [2019-11-28 20:27:22,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:27:22,858 INFO L462 AbstractCegarLoop]: Abstraction has 2065 states and 2916 transitions. [2019-11-28 20:27:22,858 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 20:27:22,858 INFO L276 IsEmpty]: Start isEmpty. Operand 2065 states and 2916 transitions. [2019-11-28 20:27:22,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-11-28 20:27:22,862 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:27:22,862 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:27:23,065 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:27:23,066 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:27:23,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:27:23,066 INFO L82 PathProgramCache]: Analyzing trace with hash 782353573, now seen corresponding path program 1 times [2019-11-28 20:27:23,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:27:23,067 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332153799] [2019-11-28 20:27:23,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:27:23,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:27:23,131 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 120 proven. 7 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2019-11-28 20:27:23,131 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332153799] [2019-11-28 20:27:23,132 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [221160858] [2019-11-28 20:27:23,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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-28 20:27:23,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:27:23,212 INFO L264 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-28 20:27:23,214 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:27:23,247 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 120 proven. 7 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2019-11-28 20:27:23,248 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:27:23,248 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-28 20:27:23,249 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126975561] [2019-11-28 20:27:23,249 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 20:27:23,249 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:27:23,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:27:23,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:27:23,250 INFO L87 Difference]: Start difference. First operand 2065 states and 2916 transitions. Second operand 4 states. [2019-11-28 20:27:23,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:27:23,709 INFO L93 Difference]: Finished difference Result 5632 states and 7889 transitions. [2019-11-28 20:27:23,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 20:27:23,710 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-11-28 20:27:23,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:27:23,716 INFO L225 Difference]: With dead ends: 5632 [2019-11-28 20:27:23,717 INFO L226 Difference]: Without dead ends: 3574 [2019-11-28 20:27:23,722 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 20:27:23,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3574 states. [2019-11-28 20:27:23,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3574 to 2573. [2019-11-28 20:27:23,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2573 states. [2019-11-28 20:27:23,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2573 states to 2573 states and 3491 transitions. [2019-11-28 20:27:23,796 INFO L78 Accepts]: Start accepts. Automaton has 2573 states and 3491 transitions. Word has length 156 [2019-11-28 20:27:23,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:27:23,797 INFO L462 AbstractCegarLoop]: Abstraction has 2573 states and 3491 transitions. [2019-11-28 20:27:23,797 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 20:27:23,797 INFO L276 IsEmpty]: Start isEmpty. Operand 2573 states and 3491 transitions. [2019-11-28 20:27:23,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-11-28 20:27:23,802 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:27:23,802 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:27:24,007 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:27:24,007 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:27:24,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:27:24,007 INFO L82 PathProgramCache]: Analyzing trace with hash -571340489, now seen corresponding path program 1 times [2019-11-28 20:27:24,008 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:27:24,008 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625499066] [2019-11-28 20:27:24,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:27:24,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:27:24,059 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 97 proven. 5 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-11-28 20:27:24,060 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625499066] [2019-11-28 20:27:24,060 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2079874806] [2019-11-28 20:27:24,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:27:24,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:27:24,127 INFO L264 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-28 20:27:24,129 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:27:24,148 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 97 proven. 5 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-11-28 20:27:24,148 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:27:24,149 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-28 20:27:24,149 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585403530] [2019-11-28 20:27:24,150 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 20:27:24,150 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:27:24,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:27:24,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:27:24,150 INFO L87 Difference]: Start difference. First operand 2573 states and 3491 transitions. Second operand 4 states. [2019-11-28 20:27:24,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:27:24,542 INFO L93 Difference]: Finished difference Result 6269 states and 8443 transitions. [2019-11-28 20:27:24,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 20:27:24,542 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 163 [2019-11-28 20:27:24,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:27:24,549 INFO L225 Difference]: With dead ends: 6269 [2019-11-28 20:27:24,549 INFO L226 Difference]: Without dead ends: 3674 [2019-11-28 20:27:24,552 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 20:27:24,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3674 states. [2019-11-28 20:27:24,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3674 to 2279. [2019-11-28 20:27:24,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2279 states. [2019-11-28 20:27:24,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2279 states to 2279 states and 3070 transitions. [2019-11-28 20:27:24,618 INFO L78 Accepts]: Start accepts. Automaton has 2279 states and 3070 transitions. Word has length 163 [2019-11-28 20:27:24,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:27:24,618 INFO L462 AbstractCegarLoop]: Abstraction has 2279 states and 3070 transitions. [2019-11-28 20:27:24,618 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 20:27:24,619 INFO L276 IsEmpty]: Start isEmpty. Operand 2279 states and 3070 transitions. [2019-11-28 20:27:24,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-11-28 20:27:24,623 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:27:24,623 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:27:24,827 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:27:24,831 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:27:24,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:27:24,831 INFO L82 PathProgramCache]: Analyzing trace with hash -2030054557, now seen corresponding path program 1 times [2019-11-28 20:27:24,831 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:27:24,831 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220835027] [2019-11-28 20:27:24,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:27:24,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:27:24,904 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-11-28 20:27:24,905 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220835027] [2019-11-28 20:27:24,905 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:27:24,905 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:27:24,905 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642239743] [2019-11-28 20:27:24,906 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 20:27:24,906 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:27:24,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:27:24,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:27:24,907 INFO L87 Difference]: Start difference. First operand 2279 states and 3070 transitions. Second operand 3 states. [2019-11-28 20:27:24,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:27:24,994 INFO L93 Difference]: Finished difference Result 5493 states and 7329 transitions. [2019-11-28 20:27:24,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:27:24,995 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 165 [2019-11-28 20:27:24,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:27:25,001 INFO L225 Difference]: With dead ends: 5493 [2019-11-28 20:27:25,002 INFO L226 Difference]: Without dead ends: 3221 [2019-11-28 20:27:25,005 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-28 20:27:25,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3221 states. [2019-11-28 20:27:25,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3221 to 3217. [2019-11-28 20:27:25,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3217 states. [2019-11-28 20:27:25,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3217 states to 3217 states and 4257 transitions. [2019-11-28 20:27:25,098 INFO L78 Accepts]: Start accepts. Automaton has 3217 states and 4257 transitions. Word has length 165 [2019-11-28 20:27:25,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:27:25,099 INFO L462 AbstractCegarLoop]: Abstraction has 3217 states and 4257 transitions. [2019-11-28 20:27:25,099 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 20:27:25,099 INFO L276 IsEmpty]: Start isEmpty. Operand 3217 states and 4257 transitions. [2019-11-28 20:27:25,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-11-28 20:27:25,104 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:27:25,105 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:27:25,106 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:27:25,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:27:25,107 INFO L82 PathProgramCache]: Analyzing trace with hash -36905074, now seen corresponding path program 1 times [2019-11-28 20:27:25,107 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:27:25,107 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159321974] [2019-11-28 20:27:25,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:27:25,121 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-28 20:27:25,121 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1439401354] [2019-11-28 20:27:25,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:27:25,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:27:25,194 INFO L264 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 20:27:25,197 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:27:25,265 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 172 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-11-28 20:27:25,266 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159321974] [2019-11-28 20:27:25,266 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-28 20:27:25,267 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1439401354] [2019-11-28 20:27:25,267 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:27:25,267 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:27:25,268 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916327236] [2019-11-28 20:27:25,269 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 20:27:25,270 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:27:25,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:27:25,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:27:25,271 INFO L87 Difference]: Start difference. First operand 3217 states and 4257 transitions. Second operand 4 states. [2019-11-28 20:27:25,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:27:25,793 INFO L93 Difference]: Finished difference Result 5057 states and 6580 transitions. [2019-11-28 20:27:25,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 20:27:25,794 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 186 [2019-11-28 20:27:25,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:27:25,805 INFO L225 Difference]: With dead ends: 5057 [2019-11-28 20:27:25,806 INFO L226 Difference]: Without dead ends: 4092 [2019-11-28 20:27:25,809 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:27:25,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4092 states. [2019-11-28 20:27:25,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4092 to 3522. [2019-11-28 20:27:25,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3522 states. [2019-11-28 20:27:25,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3522 states to 3522 states and 4633 transitions. [2019-11-28 20:27:25,951 INFO L78 Accepts]: Start accepts. Automaton has 3522 states and 4633 transitions. Word has length 186 [2019-11-28 20:27:25,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:27:25,952 INFO L462 AbstractCegarLoop]: Abstraction has 3522 states and 4633 transitions. [2019-11-28 20:27:25,952 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 20:27:25,952 INFO L276 IsEmpty]: Start isEmpty. Operand 3522 states and 4633 transitions. [2019-11-28 20:27:25,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-11-28 20:27:25,959 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:27:25,959 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:27:26,163 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:27:26,166 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:27:26,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:27:26,167 INFO L82 PathProgramCache]: Analyzing trace with hash -1106021424, now seen corresponding path program 1 times [2019-11-28 20:27:26,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:27:26,167 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707172096] [2019-11-28 20:27:26,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:27:26,186 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-28 20:27:26,186 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [750611774] [2019-11-28 20:27:26,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:27:26,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:27:26,267 INFO L264 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 20:27:26,269 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:27:26,340 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 234 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-11-28 20:27:26,340 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707172096] [2019-11-28 20:27:26,340 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-28 20:27:26,341 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [750611774] [2019-11-28 20:27:26,341 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:27:26,341 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 20:27:26,341 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863040584] [2019-11-28 20:27:26,342 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 20:27:26,342 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:27:26,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 20:27:26,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-28 20:27:26,344 INFO L87 Difference]: Start difference. First operand 3522 states and 4633 transitions. Second operand 5 states. [2019-11-28 20:27:26,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:27:26,649 INFO L93 Difference]: Finished difference Result 5415 states and 7085 transitions. [2019-11-28 20:27:26,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 20:27:26,649 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 188 [2019-11-28 20:27:26,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:27:26,659 INFO L225 Difference]: With dead ends: 5415 [2019-11-28 20:27:26,660 INFO L226 Difference]: Without dead ends: 5414 [2019-11-28 20:27:26,662 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-28 20:27:26,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5414 states. [2019-11-28 20:27:26,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5414 to 4841. [2019-11-28 20:27:26,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4841 states. [2019-11-28 20:27:26,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4841 states to 4841 states and 6383 transitions. [2019-11-28 20:27:26,823 INFO L78 Accepts]: Start accepts. Automaton has 4841 states and 6383 transitions. Word has length 188 [2019-11-28 20:27:26,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:27:26,824 INFO L462 AbstractCegarLoop]: Abstraction has 4841 states and 6383 transitions. [2019-11-28 20:27:26,824 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 20:27:26,824 INFO L276 IsEmpty]: Start isEmpty. Operand 4841 states and 6383 transitions. [2019-11-28 20:27:26,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-11-28 20:27:26,829 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:27:26,829 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:27:27,033 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:27:27,033 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:27:27,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:27:27,034 INFO L82 PathProgramCache]: Analyzing trace with hash 73074738, now seen corresponding path program 1 times [2019-11-28 20:27:27,034 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:27:27,034 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838915220] [2019-11-28 20:27:27,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:27:27,058 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-28 20:27:27,058 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [424952622] [2019-11-28 20:27:27,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:27:27,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:27:27,138 INFO L264 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 20:27:27,140 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:27:27,277 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 175 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-11-28 20:27:27,277 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838915220] [2019-11-28 20:27:27,278 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-28 20:27:27,278 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [424952622] [2019-11-28 20:27:27,278 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:27:27,278 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 20:27:27,279 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685208498] [2019-11-28 20:27:27,279 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 20:27:27,279 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:27:27,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 20:27:27,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-28 20:27:27,280 INFO L87 Difference]: Start difference. First operand 4841 states and 6383 transitions. Second operand 5 states. [2019-11-28 20:27:27,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:27:27,729 INFO L93 Difference]: Finished difference Result 9086 states and 11995 transitions. [2019-11-28 20:27:27,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 20:27:27,730 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 189 [2019-11-28 20:27:27,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:27:27,740 INFO L225 Difference]: With dead ends: 9086 [2019-11-28 20:27:27,740 INFO L226 Difference]: Without dead ends: 4944 [2019-11-28 20:27:27,746 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-28 20:27:27,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4944 states. [2019-11-28 20:27:27,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4944 to 4935. [2019-11-28 20:27:27,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4935 states. [2019-11-28 20:27:27,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4935 states to 4935 states and 6457 transitions. [2019-11-28 20:27:27,952 INFO L78 Accepts]: Start accepts. Automaton has 4935 states and 6457 transitions. Word has length 189 [2019-11-28 20:27:27,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:27:27,953 INFO L462 AbstractCegarLoop]: Abstraction has 4935 states and 6457 transitions. [2019-11-28 20:27:27,953 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 20:27:27,953 INFO L276 IsEmpty]: Start isEmpty. Operand 4935 states and 6457 transitions. [2019-11-28 20:27:27,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-11-28 20:27:27,958 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:27:27,958 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1] [2019-11-28 20:27:28,167 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:27:28,167 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:27:28,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:27:28,168 INFO L82 PathProgramCache]: Analyzing trace with hash 1864895527, now seen corresponding path program 1 times [2019-11-28 20:27:28,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:27:28,168 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672540565] [2019-11-28 20:27:28,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:27:28,181 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-28 20:27:28,182 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [702755043] [2019-11-28 20:27:28,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:27:28,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:27:28,267 INFO L264 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:27:28,270 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:27:28,365 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 238 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2019-11-28 20:27:28,366 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672540565] [2019-11-28 20:27:28,366 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-28 20:27:28,366 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [702755043] [2019-11-28 20:27:28,367 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:27:28,367 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:27:28,367 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45616134] [2019-11-28 20:27:28,368 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 20:27:28,368 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:27:28,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:27:28,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:27:28,369 INFO L87 Difference]: Start difference. First operand 4935 states and 6457 transitions. Second operand 3 states. [2019-11-28 20:27:28,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:27:28,621 INFO L93 Difference]: Finished difference Result 9835 states and 12868 transitions. [2019-11-28 20:27:28,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:27:28,622 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 196 [2019-11-28 20:27:28,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:27:28,628 INFO L225 Difference]: With dead ends: 9835 [2019-11-28 20:27:28,628 INFO L226 Difference]: Without dead ends: 3433 [2019-11-28 20:27:28,635 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 194 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-28 20:27:28,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3433 states. [2019-11-28 20:27:28,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3433 to 3427. [2019-11-28 20:27:28,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3427 states. [2019-11-28 20:27:28,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3427 states to 3427 states and 4448 transitions. [2019-11-28 20:27:28,734 INFO L78 Accepts]: Start accepts. Automaton has 3427 states and 4448 transitions. Word has length 196 [2019-11-28 20:27:28,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:27:28,735 INFO L462 AbstractCegarLoop]: Abstraction has 3427 states and 4448 transitions. [2019-11-28 20:27:28,735 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 20:27:28,735 INFO L276 IsEmpty]: Start isEmpty. Operand 3427 states and 4448 transitions. [2019-11-28 20:27:28,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-11-28 20:27:28,738 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:27:28,738 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:27:28,941 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:27:28,943 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:27:28,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:27:28,943 INFO L82 PathProgramCache]: Analyzing trace with hash 1327391442, now seen corresponding path program 1 times [2019-11-28 20:27:28,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:27:28,943 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776111719] [2019-11-28 20:27:28,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:27:28,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:27:29,009 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2019-11-28 20:27:29,010 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776111719] [2019-11-28 20:27:29,010 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:27:29,010 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 20:27:29,011 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170621594] [2019-11-28 20:27:29,011 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 20:27:29,011 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:27:29,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:27:29,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:27:29,013 INFO L87 Difference]: Start difference. First operand 3427 states and 4448 transitions. Second operand 3 states. [2019-11-28 20:27:29,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:27:29,246 INFO L93 Difference]: Finished difference Result 6506 states and 8421 transitions. [2019-11-28 20:27:29,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:27:29,247 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 197 [2019-11-28 20:27:29,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:27:29,253 INFO L225 Difference]: With dead ends: 6506 [2019-11-28 20:27:29,253 INFO L226 Difference]: Without dead ends: 2978 [2019-11-28 20:27:29,258 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-28 20:27:29,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2978 states. [2019-11-28 20:27:29,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2978 to 2936. [2019-11-28 20:27:29,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2936 states. [2019-11-28 20:27:29,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2936 states to 2936 states and 3773 transitions. [2019-11-28 20:27:29,366 INFO L78 Accepts]: Start accepts. Automaton has 2936 states and 3773 transitions. Word has length 197 [2019-11-28 20:27:29,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:27:29,367 INFO L462 AbstractCegarLoop]: Abstraction has 2936 states and 3773 transitions. [2019-11-28 20:27:29,367 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 20:27:29,367 INFO L276 IsEmpty]: Start isEmpty. Operand 2936 states and 3773 transitions. [2019-11-28 20:27:29,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2019-11-28 20:27:29,370 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:27:29,370 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 9, 9, 8, 8, 7, 7, 6, 6, 6, 6, 4, 3, 3, 3, 3, 3, 3, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:27:29,370 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:27:29,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:27:29,371 INFO L82 PathProgramCache]: Analyzing trace with hash -1162887835, now seen corresponding path program 1 times [2019-11-28 20:27:29,371 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:27:29,371 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416456583] [2019-11-28 20:27:29,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:27:29,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:27:29,494 INFO L134 CoverageAnalysis]: Checked inductivity of 1163 backedges. 699 proven. 0 refuted. 0 times theorem prover too weak. 464 trivial. 0 not checked. [2019-11-28 20:27:29,495 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416456583] [2019-11-28 20:27:29,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:27:29,495 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:27:29,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036625675] [2019-11-28 20:27:29,497 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 20:27:29,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:27:29,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:27:29,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:27:29,498 INFO L87 Difference]: Start difference. First operand 2936 states and 3773 transitions. Second operand 3 states. [2019-11-28 20:27:29,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:27:29,697 INFO L93 Difference]: Finished difference Result 6138 states and 7862 transitions. [2019-11-28 20:27:29,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:27:29,698 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 335 [2019-11-28 20:27:29,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:27:29,706 INFO L225 Difference]: With dead ends: 6138 [2019-11-28 20:27:29,706 INFO L226 Difference]: Without dead ends: 3224 [2019-11-28 20:27:29,710 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-28 20:27:29,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3224 states. [2019-11-28 20:27:29,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3224 to 3208. [2019-11-28 20:27:29,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3208 states. [2019-11-28 20:27:29,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3208 states to 3208 states and 4085 transitions. [2019-11-28 20:27:29,797 INFO L78 Accepts]: Start accepts. Automaton has 3208 states and 4085 transitions. Word has length 335 [2019-11-28 20:27:29,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:27:29,798 INFO L462 AbstractCegarLoop]: Abstraction has 3208 states and 4085 transitions. [2019-11-28 20:27:29,798 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 20:27:29,798 INFO L276 IsEmpty]: Start isEmpty. Operand 3208 states and 4085 transitions. [2019-11-28 20:27:29,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2019-11-28 20:27:29,801 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:27:29,802 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 5, 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, 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, 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, 1, 1, 1] [2019-11-28 20:27:29,802 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:27:29,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:27:29,803 INFO L82 PathProgramCache]: Analyzing trace with hash -1926092110, now seen corresponding path program 1 times [2019-11-28 20:27:29,803 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:27:29,803 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609671014] [2019-11-28 20:27:29,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:27:29,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:27:29,969 INFO L134 CoverageAnalysis]: Checked inductivity of 1423 backedges. 823 proven. 0 refuted. 0 times theorem prover too weak. 600 trivial. 0 not checked. [2019-11-28 20:27:29,969 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609671014] [2019-11-28 20:27:29,969 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:27:29,970 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:27:29,970 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107964561] [2019-11-28 20:27:29,970 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 20:27:29,971 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:27:29,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:27:29,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:27:29,971 INFO L87 Difference]: Start difference. First operand 3208 states and 4085 transitions. Second operand 3 states. [2019-11-28 20:27:30,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:27:30,190 INFO L93 Difference]: Finished difference Result 6443 states and 8197 transitions. [2019-11-28 20:27:30,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:27:30,190 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 366 [2019-11-28 20:27:30,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:27:30,196 INFO L225 Difference]: With dead ends: 6443 [2019-11-28 20:27:30,196 INFO L226 Difference]: Without dead ends: 3257 [2019-11-28 20:27:30,200 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-28 20:27:30,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3257 states. [2019-11-28 20:27:30,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3257 to 3030. [2019-11-28 20:27:30,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3030 states. [2019-11-28 20:27:30,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3030 states to 3030 states and 3851 transitions. [2019-11-28 20:27:30,282 INFO L78 Accepts]: Start accepts. Automaton has 3030 states and 3851 transitions. Word has length 366 [2019-11-28 20:27:30,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:27:30,283 INFO L462 AbstractCegarLoop]: Abstraction has 3030 states and 3851 transitions. [2019-11-28 20:27:30,283 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 20:27:30,283 INFO L276 IsEmpty]: Start isEmpty. Operand 3030 states and 3851 transitions. [2019-11-28 20:27:30,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 400 [2019-11-28 20:27:30,287 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:27:30,287 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 11, 11, 10, 10, 9, 9, 8, 8, 8, 8, 6, 5, 5, 4, 4, 3, 3, 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, 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, 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-28 20:27:30,288 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:27:30,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:27:30,288 INFO L82 PathProgramCache]: Analyzing trace with hash -1476749664, now seen corresponding path program 1 times [2019-11-28 20:27:30,288 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:27:30,289 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782970423] [2019-11-28 20:27:30,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:27:30,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:27:30,473 INFO L134 CoverageAnalysis]: Checked inductivity of 1718 backedges. 353 proven. 7 refuted. 0 times theorem prover too weak. 1358 trivial. 0 not checked. [2019-11-28 20:27:30,474 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782970423] [2019-11-28 20:27:30,474 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1743772753] [2019-11-28 20:27:30,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:27:30,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:27:30,576 INFO L264 TraceCheckSpWp]: Trace formula consists of 628 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-28 20:27:30,580 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:27:30,669 INFO L134 CoverageAnalysis]: Checked inductivity of 1718 backedges. 353 proven. 7 refuted. 0 times theorem prover too weak. 1358 trivial. 0 not checked. [2019-11-28 20:27:30,670 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:27:30,670 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-28 20:27:30,670 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158409547] [2019-11-28 20:27:30,671 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 20:27:30,671 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:27:30,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:27:30,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:27:30,672 INFO L87 Difference]: Start difference. First operand 3030 states and 3851 transitions. Second operand 4 states. [2019-11-28 20:27:30,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:27:30,851 INFO L93 Difference]: Finished difference Result 4189 states and 5327 transitions. [2019-11-28 20:27:30,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 20:27:30,852 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 399 [2019-11-28 20:27:30,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:27:30,853 INFO L225 Difference]: With dead ends: 4189 [2019-11-28 20:27:30,853 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 20:27:30,857 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 404 GetRequests, 401 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 20:27:30,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 20:27:30,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 20:27:30,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 20:27:30,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 20:27:30,858 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 399 [2019-11-28 20:27:30,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:27:30,859 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 20:27:30,859 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 20:27:30,859 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 20:27:30,859 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 20:27:31,065 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:27:31,068 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-28 20:27:31,186 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 111 [2019-11-28 20:27:31,341 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 116 [2019-11-28 20:27:32,678 WARN L192 SmtUtils]: Spent 1.28 s on a formula simplification. DAG size of input: 435 DAG size of output: 270 [2019-11-28 20:27:33,754 WARN L192 SmtUtils]: Spent 632.00 ms on a formula simplification. DAG size of input: 436 DAG size of output: 271 [2019-11-28 20:27:34,323 WARN L192 SmtUtils]: Spent 429.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 60 [2019-11-28 20:27:34,660 WARN L192 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 29 [2019-11-28 20:27:35,049 WARN L192 SmtUtils]: Spent 387.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 49 [2019-11-28 20:27:35,232 WARN L192 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 49 [2019-11-28 20:27:37,968 WARN L192 SmtUtils]: Spent 2.73 s on a formula simplification. DAG size of input: 233 DAG size of output: 83 [2019-11-28 20:27:38,148 WARN L192 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 49 [2019-11-28 20:27:38,325 WARN L192 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 49 [2019-11-28 20:27:38,769 WARN L192 SmtUtils]: Spent 441.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 44 [2019-11-28 20:27:39,243 WARN L192 SmtUtils]: Spent 471.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 17 [2019-11-28 20:27:39,420 WARN L192 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 49 [2019-11-28 20:27:39,645 WARN L192 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 17 [2019-11-28 20:27:39,840 WARN L192 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 49 [2019-11-28 20:27:40,204 WARN L192 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 49 [2019-11-28 20:27:40,453 WARN L192 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 17 [2019-11-28 20:27:40,950 WARN L192 SmtUtils]: Spent 496.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 55 [2019-11-28 20:27:43,647 WARN L192 SmtUtils]: Spent 2.69 s on a formula simplification. DAG size of input: 234 DAG size of output: 83 [2019-11-28 20:27:43,825 WARN L192 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 9 [2019-11-28 20:27:44,105 WARN L192 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 50 [2019-11-28 20:27:44,607 WARN L192 SmtUtils]: Spent 498.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 38 [2019-11-28 20:27:44,612 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 264) no Hoare annotation was computed. [2019-11-28 20:27:44,612 INFO L246 CegarLoopResult]: For program point L630(lines 630 634) no Hoare annotation was computed. [2019-11-28 20:27:44,612 INFO L246 CegarLoopResult]: For program point L399(lines 399 405) no Hoare annotation was computed. [2019-11-28 20:27:44,613 INFO L246 CegarLoopResult]: For program point L201(lines 201 592) no Hoare annotation was computed. [2019-11-28 20:27:44,613 INFO L246 CegarLoopResult]: For program point L168(lines 168 603) no Hoare annotation was computed. [2019-11-28 20:27:44,613 INFO L246 CegarLoopResult]: For program point L135(lines 135 614) no Hoare annotation was computed. [2019-11-28 20:27:44,613 INFO L246 CegarLoopResult]: For program point L102(lines 102 625) no Hoare annotation was computed. [2019-11-28 20:27:44,614 INFO L246 CegarLoopResult]: For program point L466(lines 466 470) no Hoare annotation was computed. [2019-11-28 20:27:44,614 INFO L242 CegarLoopResult]: At program point L202(lines 198 593) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 16384)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 24576)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292))) [2019-11-28 20:27:44,614 INFO L242 CegarLoopResult]: At program point L103(lines 102 625) the Hoare annotation is: false [2019-11-28 20:27:44,614 INFO L246 CegarLoopResult]: For program point L501(lines 501 505) no Hoare annotation was computed. [2019-11-28 20:27:44,614 INFO L246 CegarLoopResult]: For program point L501-2(lines 209 587) no Hoare annotation was computed. [2019-11-28 20:27:44,615 INFO L246 CegarLoopResult]: For program point L237(lines 237 242) no Hoare annotation was computed. [2019-11-28 20:27:44,615 INFO L246 CegarLoopResult]: For program point L204(lines 204 591) no Hoare annotation was computed. [2019-11-28 20:27:44,615 INFO L246 CegarLoopResult]: For program point L171(lines 171 602) no Hoare annotation was computed. [2019-11-28 20:27:44,615 INFO L246 CegarLoopResult]: For program point L138(lines 138 613) no Hoare annotation was computed. [2019-11-28 20:27:44,615 INFO L246 CegarLoopResult]: For program point L105(lines 105 624) no Hoare annotation was computed. [2019-11-28 20:27:44,615 INFO L246 CegarLoopResult]: For program point L502(line 502) no Hoare annotation was computed. [2019-11-28 20:27:44,616 INFO L246 CegarLoopResult]: For program point L502-1(line 502) no Hoare annotation was computed. [2019-11-28 20:27:44,616 INFO L246 CegarLoopResult]: For program point L502-2(line 502) no Hoare annotation was computed. [2019-11-28 20:27:44,616 INFO L246 CegarLoopResult]: For program point L502-3(line 502) no Hoare annotation was computed. [2019-11-28 20:27:44,616 INFO L242 CegarLoopResult]: At program point L205(lines 204 591) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) [2019-11-28 20:27:44,616 INFO L242 CegarLoopResult]: At program point L172(lines 168 603) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (<= 8576 ULTIMATE.start_ssl3_accept_~s__state~0) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) [2019-11-28 20:27:44,617 INFO L242 CegarLoopResult]: At program point L139(lines 135 614) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8192))) (.cse12 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8195))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-28 20:27:44,617 INFO L246 CegarLoopResult]: For program point L73(lines 73 81) no Hoare annotation was computed. [2019-11-28 20:27:44,617 INFO L246 CegarLoopResult]: For program point L272(lines 272 276) no Hoare annotation was computed. [2019-11-28 20:27:44,618 INFO L246 CegarLoopResult]: For program point L306(lines 306 310) no Hoare annotation was computed. [2019-11-28 20:27:44,618 INFO L246 CegarLoopResult]: For program point L306-2(lines 209 587) no Hoare annotation was computed. [2019-11-28 20:27:44,618 INFO L246 CegarLoopResult]: For program point L174(lines 174 601) no Hoare annotation was computed. [2019-11-28 20:27:44,618 INFO L246 CegarLoopResult]: For program point L141(lines 141 612) no Hoare annotation was computed. [2019-11-28 20:27:44,618 INFO L246 CegarLoopResult]: For program point L108(lines 108 623) no Hoare annotation was computed. [2019-11-28 20:27:44,619 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 264) no Hoare annotation was computed. [2019-11-28 20:27:44,619 INFO L246 CegarLoopResult]: For program point L571(lines 571 581) no Hoare annotation was computed. [2019-11-28 20:27:44,619 INFO L246 CegarLoopResult]: For program point L571-1(lines 571 581) no Hoare annotation was computed. [2019-11-28 20:27:44,619 INFO L246 CegarLoopResult]: For program point L439-1(lines 439 451) no Hoare annotation was computed. [2019-11-28 20:27:44,619 INFO L242 CegarLoopResult]: At program point L208(lines 207 590) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) [2019-11-28 20:27:44,619 INFO L246 CegarLoopResult]: For program point L76(lines 76 80) no Hoare annotation was computed. [2019-11-28 20:27:44,620 INFO L246 CegarLoopResult]: For program point L76-2(lines 73 81) no Hoare annotation was computed. [2019-11-28 20:27:44,620 INFO L242 CegarLoopResult]: At program point L407(lines 398 418) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8192)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8195)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) [2019-11-28 20:27:44,620 INFO L246 CegarLoopResult]: For program point L341(lines 341 345) no Hoare annotation was computed. [2019-11-28 20:27:44,620 INFO L246 CegarLoopResult]: For program point L341-2(lines 209 587) no Hoare annotation was computed. [2019-11-28 20:27:44,621 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 502) no Hoare annotation was computed. [2019-11-28 20:27:44,621 INFO L249 CegarLoopResult]: At program point L672(lines 64 674) the Hoare annotation is: true [2019-11-28 20:27:44,621 INFO L246 CegarLoopResult]: For program point L639(lines 639 645) no Hoare annotation was computed. [2019-11-28 20:27:44,621 INFO L246 CegarLoopResult]: For program point L540(lines 540 545) no Hoare annotation was computed. [2019-11-28 20:27:44,621 INFO L246 CegarLoopResult]: For program point L177(lines 177 600) no Hoare annotation was computed. [2019-11-28 20:27:44,621 INFO L246 CegarLoopResult]: For program point L144(lines 144 611) no Hoare annotation was computed. [2019-11-28 20:27:44,622 INFO L246 CegarLoopResult]: For program point L111(lines 111 622) no Hoare annotation was computed. [2019-11-28 20:27:44,622 INFO L249 CegarLoopResult]: At program point L673(lines 9 675) the Hoare annotation is: true [2019-11-28 20:27:44,622 INFO L246 CegarLoopResult]: For program point L574(lines 574 578) no Hoare annotation was computed. [2019-11-28 20:27:44,622 INFO L246 CegarLoopResult]: For program point L442(lines 442 447) no Hoare annotation was computed. [2019-11-28 20:27:44,622 INFO L242 CegarLoopResult]: At program point L178(lines 174 601) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse1 (<= 8576 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (or (and .cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) .cse1 .cse2) (and .cse0 .cse1 .cse2 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-28 20:27:44,623 INFO L242 CegarLoopResult]: At program point L145(lines 141 612) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8192)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8195)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) [2019-11-28 20:27:44,623 INFO L246 CegarLoopResult]: For program point L410(lines 410 414) no Hoare annotation was computed. [2019-11-28 20:27:44,623 INFO L242 CegarLoopResult]: At program point L212(lines 105 624) the Hoare annotation is: false [2019-11-28 20:27:44,623 INFO L246 CegarLoopResult]: For program point L180(lines 180 599) no Hoare annotation was computed. [2019-11-28 20:27:44,623 INFO L246 CegarLoopResult]: For program point L147(lines 147 610) no Hoare annotation was computed. [2019-11-28 20:27:44,623 INFO L246 CegarLoopResult]: For program point L114(lines 114 621) no Hoare annotation was computed. [2019-11-28 20:27:44,623 INFO L246 CegarLoopResult]: For program point L511(lines 511 515) no Hoare annotation was computed. [2019-11-28 20:27:44,624 INFO L246 CegarLoopResult]: For program point L478(lines 478 482) no Hoare annotation was computed. [2019-11-28 20:27:44,624 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 502) no Hoare annotation was computed. [2019-11-28 20:27:44,624 INFO L246 CegarLoopResult]: For program point L511-2(lines 511 515) no Hoare annotation was computed. [2019-11-28 20:27:44,624 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 502) no Hoare annotation was computed. [2019-11-28 20:27:44,624 INFO L246 CegarLoopResult]: For program point L83(lines 83 91) no Hoare annotation was computed. [2019-11-28 20:27:44,624 INFO L246 CegarLoopResult]: For program point L83-1(lines 64 674) no Hoare annotation was computed. [2019-11-28 20:27:44,624 INFO L246 CegarLoopResult]: For program point L183(lines 183 598) no Hoare annotation was computed. [2019-11-28 20:27:44,624 INFO L246 CegarLoopResult]: For program point L150(lines 150 609) no Hoare annotation was computed. [2019-11-28 20:27:44,624 INFO L246 CegarLoopResult]: For program point L117(lines 117 620) no Hoare annotation was computed. [2019-11-28 20:27:44,625 INFO L246 CegarLoopResult]: For program point L84(lines 84 88) no Hoare annotation was computed. [2019-11-28 20:27:44,625 INFO L246 CegarLoopResult]: For program point L349(lines 349 380) no Hoare annotation was computed. [2019-11-28 20:27:44,625 INFO L246 CegarLoopResult]: For program point L316(lines 316 320) no Hoare annotation was computed. [2019-11-28 20:27:44,625 INFO L246 CegarLoopResult]: For program point L316-2(lines 316 320) no Hoare annotation was computed. [2019-11-28 20:27:44,625 INFO L246 CegarLoopResult]: For program point L217(lines 217 221) no Hoare annotation was computed. [2019-11-28 20:27:44,625 INFO L242 CegarLoopResult]: At program point L184(lines 180 599) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse1 (<= 8576 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (or (and .cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) .cse1 .cse2) (and .cse0 .cse1 .cse2 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-28 20:27:44,625 INFO L242 CegarLoopResult]: At program point L151(lines 147 610) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8192)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8195)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) [2019-11-28 20:27:44,625 INFO L246 CegarLoopResult]: For program point L217-2(lines 209 587) no Hoare annotation was computed. [2019-11-28 20:27:44,625 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-28 20:27:44,625 INFO L246 CegarLoopResult]: For program point L186(lines 186 597) no Hoare annotation was computed. [2019-11-28 20:27:44,626 INFO L246 CegarLoopResult]: For program point L153(lines 153 608) no Hoare annotation was computed. [2019-11-28 20:27:44,626 INFO L246 CegarLoopResult]: For program point L120(lines 120 619) no Hoare annotation was computed. [2019-11-28 20:27:44,626 INFO L246 CegarLoopResult]: For program point L550(lines 550 554) no Hoare annotation was computed. [2019-11-28 20:27:44,626 INFO L246 CegarLoopResult]: For program point L352(lines 352 379) no Hoare annotation was computed. [2019-11-28 20:27:44,626 INFO L246 CegarLoopResult]: For program point L352-1(lines 352 379) no Hoare annotation was computed. [2019-11-28 20:27:44,626 INFO L242 CegarLoopResult]: At program point L121(lines 117 620) the Hoare annotation is: false [2019-11-28 20:27:44,626 INFO L242 CegarLoopResult]: At program point L551(lines 64 674) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) [2019-11-28 20:27:44,626 INFO L246 CegarLoopResult]: For program point L353(lines 353 376) no Hoare annotation was computed. [2019-11-28 20:27:44,626 INFO L246 CegarLoopResult]: For program point L254(lines 254 266) no Hoare annotation was computed. [2019-11-28 20:27:44,627 INFO L246 CegarLoopResult]: For program point L255(lines 255 260) no Hoare annotation was computed. [2019-11-28 20:27:44,627 INFO L246 CegarLoopResult]: For program point L189(lines 189 596) no Hoare annotation was computed. [2019-11-28 20:27:44,627 INFO L246 CegarLoopResult]: For program point L156(lines 156 607) no Hoare annotation was computed. [2019-11-28 20:27:44,627 INFO L246 CegarLoopResult]: For program point L123(lines 123 618) no Hoare annotation was computed. [2019-11-28 20:27:44,627 INFO L249 CegarLoopResult]: At program point L685(lines 676 687) the Hoare annotation is: true [2019-11-28 20:27:44,627 INFO L246 CegarLoopResult]: For program point L388(lines 388 419) no Hoare annotation was computed. [2019-11-28 20:27:44,627 INFO L246 CegarLoopResult]: For program point L289(lines 289 293) no Hoare annotation was computed. [2019-11-28 20:27:44,627 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-28 20:27:44,627 INFO L246 CegarLoopResult]: For program point L289-2(lines 209 587) no Hoare annotation was computed. [2019-11-28 20:27:44,627 INFO L242 CegarLoopResult]: At program point L190(lines 186 597) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 16384))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse6 (<= 8576 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 24576))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292))) (.cse9 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)))) (or (and .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) .cse4 .cse5 .cse6 .cse7 .cse8) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0) (= ULTIMATE.start_ssl3_accept_~s__state~0 8640) .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) [2019-11-28 20:27:44,628 INFO L242 CegarLoopResult]: At program point L157(lines 153 608) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8192)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8195)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) [2019-11-28 20:27:44,628 INFO L242 CegarLoopResult]: At program point L124(lines 123 618) the Hoare annotation is: (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8192)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8195)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) [2019-11-28 20:27:44,628 INFO L246 CegarLoopResult]: For program point L521(lines 521 526) no Hoare annotation was computed. [2019-11-28 20:27:44,628 INFO L246 CegarLoopResult]: For program point L389(lines 389 395) no Hoare annotation was computed. [2019-11-28 20:27:44,628 INFO L246 CegarLoopResult]: For program point L356(lines 356 375) no Hoare annotation was computed. [2019-11-28 20:27:44,628 INFO L242 CegarLoopResult]: At program point L588(lines 99 656) the Hoare annotation is: (let ((.cse6 (= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse3 (<= 8576 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0)) (.cse7 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse9 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8192))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8195))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse4 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 16384))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 24576))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)))) (or (and .cse0 .cse1 (<= 8576 ULTIMATE.start_ssl3_accept_~s__state~0) .cse2 .cse3) (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse4 .cse6 (= ULTIMATE.start_ssl3_accept_~s__state~0 8640) .cse9) (and .cse0 .cse1 .cse5 .cse7 .cse3 .cse8) (and .cse4 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse5 .cse7 .cse8) (and .cse10 .cse5 .cse7 .cse8) (and .cse0 .cse11 .cse12 .cse13 .cse14 .cse15 .cse10 .cse16 .cse5 .cse2 .cse8 .cse17 .cse9) (and .cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) .cse11 .cse18 .cse12 .cse19 .cse13 .cse14 .cse20 .cse15 .cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) .cse21 .cse16 .cse5 .cse8 .cse17) (and .cse20 .cse4 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0) .cse21 .cse18 .cse19))) [2019-11-28 20:27:44,628 INFO L246 CegarLoopResult]: For program point L555(lines 555 559) no Hoare annotation was computed. [2019-11-28 20:27:44,628 INFO L246 CegarLoopResult]: For program point L489(lines 489 493) no Hoare annotation was computed. [2019-11-28 20:27:44,629 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 502) no Hoare annotation was computed. [2019-11-28 20:27:44,629 INFO L246 CegarLoopResult]: For program point L357(lines 357 361) no Hoare annotation was computed. [2019-11-28 20:27:44,629 INFO L246 CegarLoopResult]: For program point L357-2(lines 356 373) no Hoare annotation was computed. [2019-11-28 20:27:44,629 INFO L246 CegarLoopResult]: For program point L192(lines 192 595) no Hoare annotation was computed. [2019-11-28 20:27:44,629 INFO L246 CegarLoopResult]: For program point L159(lines 159 606) no Hoare annotation was computed. [2019-11-28 20:27:44,629 INFO L246 CegarLoopResult]: For program point L126(lines 126 617) no Hoare annotation was computed. [2019-11-28 20:27:44,629 INFO L246 CegarLoopResult]: For program point L457(lines 457 461) no Hoare annotation was computed. [2019-11-28 20:27:44,629 INFO L246 CegarLoopResult]: For program point L325-1(lines 325 334) no Hoare annotation was computed. [2019-11-28 20:27:44,630 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 262) no Hoare annotation was computed. [2019-11-28 20:27:44,630 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-28 20:27:44,630 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 262) no Hoare annotation was computed. [2019-11-28 20:27:44,630 INFO L249 CegarLoopResult]: At program point L657(lines 98 658) the Hoare annotation is: true [2019-11-28 20:27:44,630 INFO L246 CegarLoopResult]: For program point L195(lines 195 594) no Hoare annotation was computed. [2019-11-28 20:27:44,630 INFO L246 CegarLoopResult]: For program point L162(lines 162 605) no Hoare annotation was computed. [2019-11-28 20:27:44,631 INFO L246 CegarLoopResult]: For program point L129(lines 129 616) no Hoare annotation was computed. [2019-11-28 20:27:44,631 INFO L246 CegarLoopResult]: For program point L262(line 262) no Hoare annotation was computed. [2019-11-28 20:27:44,631 INFO L246 CegarLoopResult]: For program point L229(lines 229 246) no Hoare annotation was computed. [2019-11-28 20:27:44,631 INFO L246 CegarLoopResult]: For program point L262-1(line 262) no Hoare annotation was computed. [2019-11-28 20:27:44,631 INFO L242 CegarLoopResult]: At program point L196(lines 192 595) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse4 (<= 8576 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 16384))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 24576))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292))) (.cse7 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)))) (or (and .cse0 .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse2 .cse3 .cse5 (<= 8640 ULTIMATE.start_ssl3_accept_~s__state~0) .cse6 .cse7))) [2019-11-28 20:27:44,632 INFO L242 CegarLoopResult]: At program point L163(lines 159 606) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8192)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8195)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) [2019-11-28 20:27:44,632 INFO L246 CegarLoopResult]: For program point L229-2(lines 209 587) no Hoare annotation was computed. [2019-11-28 20:27:44,632 INFO L246 CegarLoopResult]: For program point L626(lines 626 654) no Hoare annotation was computed. [2019-11-28 20:27:44,632 INFO L246 CegarLoopResult]: For program point L329(lines 329 333) no Hoare annotation was computed. [2019-11-28 20:27:44,632 INFO L246 CegarLoopResult]: For program point L627(lines 627 651) no Hoare annotation was computed. [2019-11-28 20:27:44,632 INFO L246 CegarLoopResult]: For program point L561(lines 561 565) no Hoare annotation was computed. [2019-11-28 20:27:44,632 INFO L246 CegarLoopResult]: For program point L528(lines 528 532) no Hoare annotation was computed. [2019-11-28 20:27:44,632 INFO L246 CegarLoopResult]: For program point L561-2(lines 561 565) no Hoare annotation was computed. [2019-11-28 20:27:44,632 INFO L246 CegarLoopResult]: For program point L462(lines 462 473) no Hoare annotation was computed. [2019-11-28 20:27:44,633 INFO L246 CegarLoopResult]: For program point L528-2(lines 209 587) no Hoare annotation was computed. [2019-11-28 20:27:44,633 INFO L246 CegarLoopResult]: For program point L429(lines 429 433) no Hoare annotation was computed. [2019-11-28 20:27:44,633 INFO L242 CegarLoopResult]: At program point L363(lines 346 381) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8192)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8195)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) [2019-11-28 20:27:44,633 INFO L246 CegarLoopResult]: For program point L264(line 264) no Hoare annotation was computed. [2019-11-28 20:27:44,633 INFO L246 CegarLoopResult]: For program point L231(lines 231 236) no Hoare annotation was computed. [2019-11-28 20:27:44,633 INFO L246 CegarLoopResult]: For program point L264-1(line 264) no Hoare annotation was computed. [2019-11-28 20:27:44,634 INFO L246 CegarLoopResult]: For program point L198(lines 198 593) no Hoare annotation was computed. [2019-11-28 20:27:44,634 INFO L246 CegarLoopResult]: For program point L165(lines 165 604) no Hoare annotation was computed. [2019-11-28 20:27:44,634 INFO L246 CegarLoopResult]: For program point L132(lines 132 615) no Hoare annotation was computed. [2019-11-28 20:27:44,634 INFO L242 CegarLoopResult]: At program point L99-2(lines 99 656) the Hoare annotation is: (let ((.cse6 (= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse3 (<= 8576 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0)) (.cse7 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse9 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8192))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8195))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse4 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 16384))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 24576))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)))) (or (and .cse0 .cse1 (<= 8576 ULTIMATE.start_ssl3_accept_~s__state~0) .cse2 .cse3) (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse4 .cse6 (= ULTIMATE.start_ssl3_accept_~s__state~0 8640) .cse9) (and .cse0 .cse1 .cse5 .cse7 .cse3 .cse8) (and .cse4 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse5 .cse7 .cse8) (and .cse10 .cse5 .cse7 .cse8) (and .cse0 .cse11 .cse12 .cse13 .cse14 .cse15 .cse10 .cse16 .cse5 .cse2 .cse8 .cse17 .cse9) (and .cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) .cse11 .cse18 .cse12 .cse19 .cse13 .cse14 .cse20 .cse15 .cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) .cse21 .cse16 .cse5 .cse8 .cse17) (and .cse20 .cse4 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0) .cse21 .cse18 .cse19))) [2019-11-28 20:27:44,634 INFO L246 CegarLoopResult]: For program point L661(lines 661 665) no Hoare annotation was computed. [2019-11-28 20:27:44,634 INFO L246 CegarLoopResult]: For program point L628(lines 628 637) no Hoare annotation was computed. [2019-11-28 20:27:44,634 INFO L246 CegarLoopResult]: For program point L661-2(lines 661 665) no Hoare annotation was computed. [2019-11-28 20:27:44,634 INFO L246 CegarLoopResult]: For program point L628-2(lines 627 649) no Hoare annotation was computed. [2019-11-28 20:27:44,634 INFO L242 CegarLoopResult]: At program point L397(lines 388 419) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8192)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8195)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) [2019-11-28 20:27:44,635 INFO L242 CegarLoopResult]: At program point L166(lines 165 604) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8192))) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8195)))) (or (and .cse0 .cse1 (= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0) .cse2 .cse3 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse1 .cse2 (<= 8576 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0) .cse3) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse1 .cse2 .cse3))) [2019-11-28 20:27:44,635 INFO L242 CegarLoopResult]: At program point L133(lines 126 617) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8192))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse14 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8195))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-28 20:27:44,635 INFO L246 CegarLoopResult]: For program point L100(line 100) no Hoare annotation was computed. [2019-11-28 20:27:44,635 INFO L246 CegarLoopResult]: For program point L365(lines 365 369) no Hoare annotation was computed. [2019-11-28 20:27:44,672 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 08:27:44 BoogieIcfgContainer [2019-11-28 20:27:44,672 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 20:27:44,672 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 20:27:44,673 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 20:27:44,673 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 20:27:44,674 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:27:12" (3/4) ... [2019-11-28 20:27:44,677 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 20:27:44,700 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-28 20:27:44,701 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-28 20:27:44,863 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 20:27:44,863 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 20:27:44,864 INFO L168 Benchmark]: Toolchain (without parser) took 34021.06 ms. Allocated memory was 1.0 GB in the beginning and 2.0 GB in the end (delta: 945.8 MB). Free memory was 955.0 MB in the beginning and 1.2 GB in the end (delta: -207.4 MB). Peak memory consumption was 738.4 MB. Max. memory is 11.5 GB. [2019-11-28 20:27:44,865 INFO L168 Benchmark]: CDTParser took 0.19 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-28 20:27:44,865 INFO L168 Benchmark]: CACSL2BoogieTranslator took 525.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -183.4 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. [2019-11-28 20:27:44,866 INFO L168 Benchmark]: Boogie Procedure Inliner took 78.46 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: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-28 20:27:44,866 INFO L168 Benchmark]: Boogie Preprocessor took 41.17 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-28 20:27:44,866 INFO L168 Benchmark]: RCFGBuilder took 919.15 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: 58.7 MB). Peak memory consumption was 58.7 MB. Max. memory is 11.5 GB. [2019-11-28 20:27:44,867 INFO L168 Benchmark]: TraceAbstraction took 32259.87 ms. Allocated memory was 1.2 GB in the beginning and 2.0 GB in the end (delta: 797.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -111.2 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2019-11-28 20:27:44,867 INFO L168 Benchmark]: Witness Printer took 190.83 ms. Allocated memory is still 2.0 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 21.8 MB). Peak memory consumption was 21.8 MB. Max. memory is 11.5 GB. [2019-11-28 20:27:44,869 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.19 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 525.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -183.4 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 78.46 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: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 41.17 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 919.15 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: 58.7 MB). Peak memory consumption was 58.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 32259.87 ms. Allocated memory was 1.2 GB in the beginning and 2.0 GB in the end (delta: 797.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -111.2 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. * Witness Printer took 190.83 ms. Allocated memory is still 2.0 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 21.8 MB). Peak memory consumption was 21.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 502]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 264]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 502]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 502]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 502]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 262]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 264]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 262]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - InvariantResult [Line: 126]: Loop Invariant Derived loop invariant: (((((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8192)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480)) || (((((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8192)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 207]: Loop Invariant Derived loop invariant: !(s__state == 12292) - InvariantResult [Line: 676]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 165]: Loop Invariant Derived loop invariant: ((((((blastFlag <= 3 && !(s__state == 8192)) && 8640 == s__s3__tmp__next_state___0) && s__state <= 8448) && !(s__state == 8195)) && !(0 == s__hit)) || (((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8192)) && s__state <= 8448) && 8576 <= s__s3__tmp__next_state___0) && !(s__state == 8195))) || ((((blastFlag <= 3 && s__s3__tmp__next_state___0 <= 3) && !(s__state == 8192)) && s__state <= 8448) && !(s__state == 8195)) - InvariantResult [Line: 123]: Loop Invariant Derived loop invariant: ((((((((((((((!(s__state == 8513) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8192)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480) - InvariantResult [Line: 398]: Loop Invariant Derived loop invariant: ((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8192)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480) - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: (((((((((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && 8576 <= s__state) && s__state <= 8576) && 8576 <= s__s3__tmp__next_state___0) || (((((blastFlag <= 3 && !(s__state == 8192)) && 8640 == s__s3__tmp__next_state___0) && s__state <= 8448) && !(s__state == 8195)) && !(0 == s__hit))) || (((blastFlag <= 3 && 8640 == s__s3__tmp__next_state___0) && s__state == 8640) && !(0 == s__hit))) || (((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8192)) && s__state <= 8448) && 8576 <= s__s3__tmp__next_state___0) && !(s__state == 8195))) || ((((blastFlag <= 3 && s__s3__tmp__next_state___0 <= 3) && !(s__state == 8192)) && s__state <= 8448) && !(s__state == 8195))) || (((!(s__state == 8448) && !(s__state == 8192)) && s__state <= 8448) && !(s__state == 8195))) || ((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8192)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480)) && !(0 == s__hit))) || ((((((((((((((((blastFlag <= 2 && !(s__state == 8657)) && !(s__state == 8513)) && !(s__state == 24576)) && !(s__state == 8545)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 16384)) && !(s__state == 8497)) && !(s__state == 8192)) && !(s__state == 8195)) && !(s__state == 8480))) || (((((!(s__state == 8673) && blastFlag <= 3) && 8672 <= s__state) && !(s__state == 16384)) && !(s__state == 24576)) && !(s__state == 12292)) - InvariantResult [Line: 153]: Loop Invariant Derived loop invariant: ((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8192)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480) - InvariantResult [Line: 346]: Loop Invariant Derived loop invariant: ((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8192)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480) - InvariantResult [Line: 64]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 186]: Loop Invariant Derived loop invariant: ((((((((((blastFlag <= 2 && !(s__state == 8673)) && !(s__state == 8656)) && !(s__state == 8657)) && !(s__state == 8576)) && !(s__state == 16384)) && !(s__state == 8672)) && 8576 <= s__state) && !(s__state == 24576)) && !(s__state == 12292)) || (((blastFlag <= 3 && 8640 == s__s3__tmp__next_state___0) && s__state == 8640) && !(0 == s__hit))) || (((((((((blastFlag <= 2 && !(s__state == 8673)) && !(s__state == 8656)) && !(s__state == 8657)) && !(s__state == 16384)) && !(s__state == 8672)) && 8576 <= s__state) && !(s__state == 24576)) && !(s__state == 12292)) && !(0 == s__hit)) - InvariantResult [Line: 105]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: (((blastFlag <= 3 && 8672 <= s__state) && !(s__state == 16384)) && !(s__state == 24576)) && !(s__state == 12292) - InvariantResult [Line: 147]: Loop Invariant Derived loop invariant: ((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8192)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480) - InvariantResult [Line: 180]: Loop Invariant Derived loop invariant: (((blastFlag <= 2 && !(s__state == 8576)) && 8576 <= s__state) && s__state <= 8640) || (((blastFlag <= 2 && 8576 <= s__state) && s__state <= 8640) && !(0 == s__hit)) - InvariantResult [Line: 388]: Loop Invariant Derived loop invariant: ((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8192)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480) - InvariantResult [Line: 141]: Loop Invariant Derived loop invariant: ((((((((((((((blastFlag <= 2 && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8192)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480) - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 9]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 174]: Loop Invariant Derived loop invariant: (((blastFlag <= 2 && !(s__state == 8576)) && 8576 <= s__state) && s__state <= 8640) || (((blastFlag <= 2 && 8576 <= s__state) && s__state <= 8640) && !(0 == s__hit)) - InvariantResult [Line: 135]: Loop Invariant Derived loop invariant: (((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8192)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480)) || (((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8192)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: (((((((((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && 8576 <= s__state) && s__state <= 8576) && 8576 <= s__s3__tmp__next_state___0) || (((((blastFlag <= 3 && !(s__state == 8192)) && 8640 == s__s3__tmp__next_state___0) && s__state <= 8448) && !(s__state == 8195)) && !(0 == s__hit))) || (((blastFlag <= 3 && 8640 == s__s3__tmp__next_state___0) && s__state == 8640) && !(0 == s__hit))) || (((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8192)) && s__state <= 8448) && 8576 <= s__s3__tmp__next_state___0) && !(s__state == 8195))) || ((((blastFlag <= 3 && s__s3__tmp__next_state___0 <= 3) && !(s__state == 8192)) && s__state <= 8448) && !(s__state == 8195))) || (((!(s__state == 8448) && !(s__state == 8192)) && s__state <= 8448) && !(s__state == 8195))) || ((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8192)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480)) && !(0 == s__hit))) || ((((((((((((((((blastFlag <= 2 && !(s__state == 8657)) && !(s__state == 8513)) && !(s__state == 24576)) && !(s__state == 8545)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 16384)) && !(s__state == 8497)) && !(s__state == 8192)) && !(s__state == 8195)) && !(s__state == 8480))) || (((((!(s__state == 8673) && blastFlag <= 3) && 8672 <= s__state) && !(s__state == 16384)) && !(s__state == 24576)) && !(s__state == 12292)) - InvariantResult [Line: 168]: Loop Invariant Derived loop invariant: (blastFlag <= 2 && 8576 <= s__state) && s__state <= 8640 - InvariantResult [Line: 64]: Loop Invariant Derived loop invariant: !(s__state == 12292) - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 204]: Loop Invariant Derived loop invariant: !(s__state == 12292) - InvariantResult [Line: 159]: Loop Invariant Derived loop invariant: ((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8545)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8192)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480) - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 192]: Loop Invariant Derived loop invariant: ((((((((blastFlag <= 2 && !(s__state == 8673)) && !(s__state == 8576)) && !(s__state == 16384)) && !(s__state == 8672)) && 8576 <= s__state) && !(s__state == 24576)) && !(s__state == 12292)) || (((((((blastFlag <= 2 && !(s__state == 8673)) && !(s__state == 16384)) && !(s__state == 8672)) && 8576 <= s__state) && !(s__state == 24576)) && !(s__state == 12292)) && !(0 == s__hit))) || (((((((!(s__state == 8673) && blastFlag <= 3) && !(s__state == 16384)) && !(s__state == 8672)) && !(s__state == 24576)) && 8640 <= s__state) && !(s__state == 12292)) && !(0 == s__hit)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 152 locations, 8 error locations. Result: SAFE, OverallTime: 18.5s, OverallIterations: 39, TraceHistogramMax: 14, AutomataDifference: 9.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 13.5s, HoareTripleCheckerStatistics: 6928 SDtfs, 5885 SDslu, 3640 SDs, 0 SdLazy, 4372 SolverSat, 1144 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1986 GetRequests, 1934 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4935occurred in iteration=34, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.3s AutomataMinimizationTime, 39 MinimizatonAttempts, 5661 StatesRemovedByMinimization, 36 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 29 LocationsWithAnnotation, 29 PreInvPairs, 264 NumberOfFragments, 1630 HoareAnnotationTreeSize, 29 FomulaSimplifications, 343295 FormulaSimplificationTreeSizeReduction, 2.8s HoareSimplificationTime, 29 FomulaSimplificationsInter, 71676 FormulaSimplificationTreeSizeReductionInter, 10.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 5670 NumberOfCodeBlocks, 5670 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 5627 ConstructedInterpolants, 0 QuantifiedInterpolants, 1665978 SizeOfPredicates, 13 NumberOfNonLiveVariables, 3554 ConjunctsInSsa, 37 ConjunctsInUnsatCore, 43 InterpolantComputations, 35 PerfectInterpolantSequences, 10843/10891 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...