./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/bitvector/s3_srvr_1a.BV.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_9ea5bdf7-d11a-426d-b9e5-17c861eac7b2/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_9ea5bdf7-d11a-426d-b9e5-17c861eac7b2/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_9ea5bdf7-d11a-426d-b9e5-17c861eac7b2/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_9ea5bdf7-d11a-426d-b9e5-17c861eac7b2/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/bitvector/s3_srvr_1a.BV.c.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_9ea5bdf7-d11a-426d-b9e5-17c861eac7b2/bin/uautomizer/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_9ea5bdf7-d11a-426d-b9e5-17c861eac7b2/bin/uautomizer --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 49452e318e3c9c4b1e038ab7778998d33b04e5b2 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-16 00:19:32,314 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:19:32,316 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:19:32,329 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:19:32,330 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:19:32,331 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:19:32,333 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:19:32,342 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:19:32,346 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:19:32,350 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:19:32,351 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:19:32,353 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:19:32,353 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:19:32,355 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:19:32,356 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:19:32,357 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:19:32,357 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:19:32,358 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:19:32,360 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:19:32,363 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:19:32,366 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:19:32,368 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:19:32,371 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:19:32,372 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:19:32,374 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:19:32,374 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:19:32,375 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:19:32,376 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:19:32,376 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:19:32,377 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:19:32,377 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:19:32,378 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:19:32,378 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:19:32,379 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:19:32,380 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:19:32,381 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:19:32,381 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:19:32,381 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:19:32,382 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:19:32,382 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:19:32,383 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:19:32,384 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_9ea5bdf7-d11a-426d-b9e5-17c861eac7b2/bin/uautomizer/config/svcomp-Overflow-32bit-Automizer_Default.epf [2019-11-16 00:19:32,407 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:19:32,417 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:19:32,418 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:19:32,419 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:19:32,419 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:19:32,419 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:19:32,420 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:19:32,420 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-16 00:19:32,420 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:19:32,420 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:19:32,421 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:19:32,421 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-16 00:19:32,421 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-16 00:19:32,422 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-16 00:19:32,422 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2019-11-16 00:19:32,422 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:19:32,422 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:19:32,423 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:19:32,423 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-16 00:19:32,423 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:19:32,423 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:19:32,424 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-16 00:19:32,424 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-16 00:19:32,424 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:19:32,424 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:19:32,425 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-16 00:19:32,425 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-16 00:19:32,425 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:19:32,426 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-16 00:19:32,426 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-16 00:19:32,426 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 -> /tmp/vcloud-vcloud-master/worker/run_dir_9ea5bdf7-d11a-426d-b9e5-17c861eac7b2/bin/uautomizer 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 -> 49452e318e3c9c4b1e038ab7778998d33b04e5b2 [2019-11-16 00:19:32,463 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:19:32,476 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:19:32,479 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:19:32,481 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:19:32,482 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:19:32,483 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_9ea5bdf7-d11a-426d-b9e5-17c861eac7b2/bin/uautomizer/../../sv-benchmarks/c/bitvector/s3_srvr_1a.BV.c.cil.c [2019-11-16 00:19:32,535 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9ea5bdf7-d11a-426d-b9e5-17c861eac7b2/bin/uautomizer/data/0b24d88d7/bb2425c748794e0e94a09a9b37401514/FLAG7eb87b51c [2019-11-16 00:19:32,944 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:19:32,945 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_9ea5bdf7-d11a-426d-b9e5-17c861eac7b2/sv-benchmarks/c/bitvector/s3_srvr_1a.BV.c.cil.c [2019-11-16 00:19:32,956 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9ea5bdf7-d11a-426d-b9e5-17c861eac7b2/bin/uautomizer/data/0b24d88d7/bb2425c748794e0e94a09a9b37401514/FLAG7eb87b51c [2019-11-16 00:19:32,969 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_9ea5bdf7-d11a-426d-b9e5-17c861eac7b2/bin/uautomizer/data/0b24d88d7/bb2425c748794e0e94a09a9b37401514 [2019-11-16 00:19:32,971 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:19:32,972 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:19:32,973 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:19:32,973 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:19:32,976 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:19:32,977 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:19:32" (1/1) ... [2019-11-16 00:19:32,979 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d8bb5f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:19:32, skipping insertion in model container [2019-11-16 00:19:32,979 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:19:32" (1/1) ... [2019-11-16 00:19:32,985 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:19:33,028 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:19:33,285 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:19:33,288 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:19:33,347 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:19:33,360 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:19:33,360 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:19:33 WrapperNode [2019-11-16 00:19:33,360 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:19:33,361 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:19:33,361 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:19:33,361 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:19:33,368 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:19:33" (1/1) ... [2019-11-16 00:19:33,377 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:19:33" (1/1) ... [2019-11-16 00:19:33,418 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:19:33,419 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:19:33,419 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:19:33,419 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:19:33,428 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:19:33" (1/1) ... [2019-11-16 00:19:33,435 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:19:33" (1/1) ... [2019-11-16 00:19:33,440 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:19:33" (1/1) ... [2019-11-16 00:19:33,454 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:19:33" (1/1) ... [2019-11-16 00:19:33,462 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:19:33" (1/1) ... [2019-11-16 00:19:33,470 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:19:33" (1/1) ... [2019-11-16 00:19:33,481 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:19:33" (1/1) ... [2019-11-16 00:19:33,498 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:19:33,498 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:19:33,498 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:19:33,499 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:19:33,499 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:19:33" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9ea5bdf7-d11a-426d-b9e5-17c861eac7b2/bin/uautomizer/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-16 00:19:33,580 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:19:33,580 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:19:33,783 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-16 00:19:34,374 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-11-16 00:19:34,374 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-11-16 00:19:34,376 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:19:34,376 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-16 00:19:34,377 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:19:34 BoogieIcfgContainer [2019-11-16 00:19:34,377 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:19:34,378 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-16 00:19:34,378 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-16 00:19:34,380 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-16 00:19:34,380 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:19:32" (1/3) ... [2019-11-16 00:19:34,381 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@156a8c28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:19:34, skipping insertion in model container [2019-11-16 00:19:34,381 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:19:33" (2/3) ... [2019-11-16 00:19:34,382 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@156a8c28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:19:34, skipping insertion in model container [2019-11-16 00:19:34,382 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:19:34" (3/3) ... [2019-11-16 00:19:34,383 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_1a.BV.c.cil.c [2019-11-16 00:19:34,392 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-16 00:19:34,398 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-11-16 00:19:34,407 INFO L249 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-11-16 00:19:34,428 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-16 00:19:34,428 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-16 00:19:34,428 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-16 00:19:34,428 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:19:34,428 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:19:34,429 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-16 00:19:34,429 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:19:34,429 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-16 00:19:34,447 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states. [2019-11-16 00:19:34,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-16 00:19:34,453 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:19:34,454 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:19:34,455 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-16 00:19:34,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:19:34,461 INFO L82 PathProgramCache]: Analyzing trace with hash -1272360941, now seen corresponding path program 1 times [2019-11-16 00:19:34,468 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:19:34,468 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424503993] [2019-11-16 00:19:34,469 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:34,469 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:34,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:19:34,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:34,698 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-16 00:19:34,698 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424503993] [2019-11-16 00:19:34,699 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:19:34,699 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:19:34,699 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298637436] [2019-11-16 00:19:34,707 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:19:34,707 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:19:34,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:19:34,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:19:34,722 INFO L87 Difference]: Start difference. First operand 146 states. Second operand 3 states. [2019-11-16 00:19:34,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:19:34,954 INFO L93 Difference]: Finished difference Result 311 states and 519 transitions. [2019-11-16 00:19:34,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:19:34,957 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-16 00:19:34,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:19:34,975 INFO L225 Difference]: With dead ends: 311 [2019-11-16 00:19:34,976 INFO L226 Difference]: Without dead ends: 149 [2019-11-16 00:19:34,980 INFO L600 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-16 00:19:34,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-11-16 00:19:35,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2019-11-16 00:19:35,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-11-16 00:19:35,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 224 transitions. [2019-11-16 00:19:35,057 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 224 transitions. Word has length 17 [2019-11-16 00:19:35,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:19:35,058 INFO L462 AbstractCegarLoop]: Abstraction has 149 states and 224 transitions. [2019-11-16 00:19:35,058 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:19:35,058 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 224 transitions. [2019-11-16 00:19:35,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-16 00:19:35,059 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:19:35,059 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:19:35,060 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-16 00:19:35,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:19:35,061 INFO L82 PathProgramCache]: Analyzing trace with hash -1039871977, now seen corresponding path program 1 times [2019-11-16 00:19:35,061 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:19:35,061 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110333436] [2019-11-16 00:19:35,061 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:35,062 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:35,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:19:35,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:35,123 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-16 00:19:35,123 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110333436] [2019-11-16 00:19:35,123 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:19:35,124 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:19:35,124 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706598365] [2019-11-16 00:19:35,125 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:19:35,125 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:19:35,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:19:35,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:19:35,126 INFO L87 Difference]: Start difference. First operand 149 states and 224 transitions. Second operand 3 states. [2019-11-16 00:19:35,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:19:35,300 INFO L93 Difference]: Finished difference Result 301 states and 450 transitions. [2019-11-16 00:19:35,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:19:35,301 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-16 00:19:35,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:19:35,302 INFO L225 Difference]: With dead ends: 301 [2019-11-16 00:19:35,302 INFO L226 Difference]: Without dead ends: 159 [2019-11-16 00:19:35,304 INFO L600 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-16 00:19:35,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-11-16 00:19:35,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 150. [2019-11-16 00:19:35,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-11-16 00:19:35,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 225 transitions. [2019-11-16 00:19:35,320 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 225 transitions. Word has length 18 [2019-11-16 00:19:35,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:19:35,322 INFO L462 AbstractCegarLoop]: Abstraction has 150 states and 225 transitions. [2019-11-16 00:19:35,322 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:19:35,322 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 225 transitions. [2019-11-16 00:19:35,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-16 00:19:35,323 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:19:35,323 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:19:35,324 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-16 00:19:35,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:19:35,325 INFO L82 PathProgramCache]: Analyzing trace with hash 1005531851, now seen corresponding path program 1 times [2019-11-16 00:19:35,325 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:19:35,325 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633484400] [2019-11-16 00:19:35,326 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:35,326 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:35,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:19:35,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:35,391 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-16 00:19:35,391 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633484400] [2019-11-16 00:19:35,391 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:19:35,391 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:19:35,391 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120694636] [2019-11-16 00:19:35,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:19:35,392 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:19:35,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:19:35,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:19:35,393 INFO L87 Difference]: Start difference. First operand 150 states and 225 transitions. Second operand 3 states. [2019-11-16 00:19:35,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:19:35,534 INFO L93 Difference]: Finished difference Result 303 states and 452 transitions. [2019-11-16 00:19:35,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:19:35,534 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-16 00:19:35,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:19:35,536 INFO L225 Difference]: With dead ends: 303 [2019-11-16 00:19:35,536 INFO L226 Difference]: Without dead ends: 160 [2019-11-16 00:19:35,537 INFO L600 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-16 00:19:35,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-11-16 00:19:35,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 151. [2019-11-16 00:19:35,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-11-16 00:19:35,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 226 transitions. [2019-11-16 00:19:35,549 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 226 transitions. Word has length 19 [2019-11-16 00:19:35,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:19:35,550 INFO L462 AbstractCegarLoop]: Abstraction has 151 states and 226 transitions. [2019-11-16 00:19:35,550 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:19:35,550 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 226 transitions. [2019-11-16 00:19:35,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-16 00:19:35,551 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:19:35,551 INFO L380 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-16 00:19:35,552 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-16 00:19:35,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:19:35,552 INFO L82 PathProgramCache]: Analyzing trace with hash -994026446, now seen corresponding path program 1 times [2019-11-16 00:19:35,552 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:19:35,553 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571593005] [2019-11-16 00:19:35,556 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:35,556 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:35,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:19:35,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:35,587 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-16 00:19:35,588 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571593005] [2019-11-16 00:19:35,588 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:19:35,588 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:19:35,588 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368407342] [2019-11-16 00:19:35,589 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:19:35,589 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:19:35,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:19:35,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:19:35,590 INFO L87 Difference]: Start difference. First operand 151 states and 226 transitions. Second operand 3 states. [2019-11-16 00:19:35,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:19:35,729 INFO L93 Difference]: Finished difference Result 305 states and 454 transitions. [2019-11-16 00:19:35,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:19:35,729 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-16 00:19:35,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:19:35,731 INFO L225 Difference]: With dead ends: 305 [2019-11-16 00:19:35,731 INFO L226 Difference]: Without dead ends: 161 [2019-11-16 00:19:35,732 INFO L600 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-16 00:19:35,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-11-16 00:19:35,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 152. [2019-11-16 00:19:35,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-11-16 00:19:35,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 227 transitions. [2019-11-16 00:19:35,743 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 227 transitions. Word has length 20 [2019-11-16 00:19:35,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:19:35,743 INFO L462 AbstractCegarLoop]: Abstraction has 152 states and 227 transitions. [2019-11-16 00:19:35,744 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:19:35,744 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 227 transitions. [2019-11-16 00:19:35,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-16 00:19:35,745 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:19:35,745 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:19:35,745 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-16 00:19:35,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:19:35,746 INFO L82 PathProgramCache]: Analyzing trace with hash 461608262, now seen corresponding path program 1 times [2019-11-16 00:19:35,746 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:19:35,746 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705548921] [2019-11-16 00:19:35,746 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:35,746 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:35,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:19:35,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:35,775 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-16 00:19:35,775 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705548921] [2019-11-16 00:19:35,776 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:19:35,776 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:19:35,776 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555358599] [2019-11-16 00:19:35,776 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:19:35,777 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:19:35,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:19:35,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:19:35,777 INFO L87 Difference]: Start difference. First operand 152 states and 227 transitions. Second operand 3 states. [2019-11-16 00:19:35,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:19:35,920 INFO L93 Difference]: Finished difference Result 307 states and 456 transitions. [2019-11-16 00:19:35,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:19:35,921 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-16 00:19:35,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:19:35,922 INFO L225 Difference]: With dead ends: 307 [2019-11-16 00:19:35,922 INFO L226 Difference]: Without dead ends: 162 [2019-11-16 00:19:35,923 INFO L600 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-16 00:19:35,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-11-16 00:19:35,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 153. [2019-11-16 00:19:35,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-11-16 00:19:35,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 228 transitions. [2019-11-16 00:19:35,938 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 228 transitions. Word has length 21 [2019-11-16 00:19:35,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:19:35,938 INFO L462 AbstractCegarLoop]: Abstraction has 153 states and 228 transitions. [2019-11-16 00:19:35,938 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:19:35,939 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 228 transitions. [2019-11-16 00:19:35,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-16 00:19:35,947 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:19:35,947 INFO L380 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, 1, 1] [2019-11-16 00:19:35,947 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-16 00:19:35,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:19:35,948 INFO L82 PathProgramCache]: Analyzing trace with hash 205704618, now seen corresponding path program 1 times [2019-11-16 00:19:35,948 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:19:35,948 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696600336] [2019-11-16 00:19:35,948 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:35,948 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:35,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:19:35,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:36,025 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-16 00:19:36,026 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696600336] [2019-11-16 00:19:36,026 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:19:36,026 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:19:36,027 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449015882] [2019-11-16 00:19:36,027 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:19:36,027 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:19:36,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:19:36,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:19:36,028 INFO L87 Difference]: Start difference. First operand 153 states and 228 transitions. Second operand 3 states. [2019-11-16 00:19:36,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:19:36,199 INFO L93 Difference]: Finished difference Result 330 states and 498 transitions. [2019-11-16 00:19:36,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:19:36,200 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2019-11-16 00:19:36,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:19:36,202 INFO L225 Difference]: With dead ends: 330 [2019-11-16 00:19:36,202 INFO L226 Difference]: Without dead ends: 184 [2019-11-16 00:19:36,202 INFO L600 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-16 00:19:36,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-11-16 00:19:36,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2019-11-16 00:19:36,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-11-16 00:19:36,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 280 transitions. [2019-11-16 00:19:36,220 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 280 transitions. Word has length 46 [2019-11-16 00:19:36,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:19:36,220 INFO L462 AbstractCegarLoop]: Abstraction has 184 states and 280 transitions. [2019-11-16 00:19:36,220 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:19:36,220 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 280 transitions. [2019-11-16 00:19:36,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-16 00:19:36,222 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:19:36,222 INFO L380 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, 1, 1] [2019-11-16 00:19:36,222 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-16 00:19:36,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:19:36,223 INFO L82 PathProgramCache]: Analyzing trace with hash 2094953876, now seen corresponding path program 1 times [2019-11-16 00:19:36,223 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:19:36,223 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987259288] [2019-11-16 00:19:36,223 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:36,223 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:36,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:19:36,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:36,291 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-16 00:19:36,291 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987259288] [2019-11-16 00:19:36,291 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:19:36,291 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:19:36,292 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093483501] [2019-11-16 00:19:36,292 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:19:36,292 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:19:36,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:19:36,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:19:36,294 INFO L87 Difference]: Start difference. First operand 184 states and 280 transitions. Second operand 3 states. [2019-11-16 00:19:36,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:19:36,421 INFO L93 Difference]: Finished difference Result 379 states and 574 transitions. [2019-11-16 00:19:36,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:19:36,422 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-11-16 00:19:36,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:19:36,424 INFO L225 Difference]: With dead ends: 379 [2019-11-16 00:19:36,424 INFO L226 Difference]: Without dead ends: 202 [2019-11-16 00:19:36,425 INFO L600 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-16 00:19:36,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-11-16 00:19:36,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 200. [2019-11-16 00:19:36,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-11-16 00:19:36,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 301 transitions. [2019-11-16 00:19:36,435 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 301 transitions. Word has length 58 [2019-11-16 00:19:36,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:19:36,435 INFO L462 AbstractCegarLoop]: Abstraction has 200 states and 301 transitions. [2019-11-16 00:19:36,435 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:19:36,436 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 301 transitions. [2019-11-16 00:19:36,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-16 00:19:36,437 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:19:36,438 INFO L380 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, 1, 1] [2019-11-16 00:19:36,438 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-16 00:19:36,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:19:36,438 INFO L82 PathProgramCache]: Analyzing trace with hash 2134557448, now seen corresponding path program 1 times [2019-11-16 00:19:36,438 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:19:36,440 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038273158] [2019-11-16 00:19:36,440 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:36,440 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:36,440 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:19:36,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:36,471 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-16 00:19:36,471 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038273158] [2019-11-16 00:19:36,472 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:19:36,472 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:19:36,472 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411222917] [2019-11-16 00:19:36,473 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:19:36,473 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:19:36,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:19:36,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:19:36,474 INFO L87 Difference]: Start difference. First operand 200 states and 301 transitions. Second operand 3 states. [2019-11-16 00:19:36,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:19:36,630 INFO L93 Difference]: Finished difference Result 396 states and 595 transitions. [2019-11-16 00:19:36,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:19:36,630 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-11-16 00:19:36,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:19:36,632 INFO L225 Difference]: With dead ends: 396 [2019-11-16 00:19:36,632 INFO L226 Difference]: Without dead ends: 203 [2019-11-16 00:19:36,633 INFO L600 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-16 00:19:36,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-11-16 00:19:36,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 201. [2019-11-16 00:19:36,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-11-16 00:19:36,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 301 transitions. [2019-11-16 00:19:36,643 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 301 transitions. Word has length 59 [2019-11-16 00:19:36,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:19:36,643 INFO L462 AbstractCegarLoop]: Abstraction has 201 states and 301 transitions. [2019-11-16 00:19:36,643 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:19:36,643 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 301 transitions. [2019-11-16 00:19:36,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-16 00:19:36,644 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:19:36,645 INFO L380 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, 1, 1] [2019-11-16 00:19:36,645 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-16 00:19:36,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:19:36,645 INFO L82 PathProgramCache]: Analyzing trace with hash -1607957135, now seen corresponding path program 1 times [2019-11-16 00:19:36,646 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:19:36,646 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439282217] [2019-11-16 00:19:36,646 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:36,646 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:36,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:19:36,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:36,681 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-16 00:19:36,682 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439282217] [2019-11-16 00:19:36,682 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:19:36,682 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:19:36,682 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042957013] [2019-11-16 00:19:36,683 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:19:36,683 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:19:36,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:19:36,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:19:36,684 INFO L87 Difference]: Start difference. First operand 201 states and 301 transitions. Second operand 3 states. [2019-11-16 00:19:36,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:19:36,821 INFO L93 Difference]: Finished difference Result 439 states and 666 transitions. [2019-11-16 00:19:36,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:19:36,822 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-11-16 00:19:36,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:19:36,824 INFO L225 Difference]: With dead ends: 439 [2019-11-16 00:19:36,824 INFO L226 Difference]: Without dead ends: 245 [2019-11-16 00:19:36,824 INFO L600 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-16 00:19:36,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2019-11-16 00:19:36,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 243. [2019-11-16 00:19:36,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2019-11-16 00:19:36,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 372 transitions. [2019-11-16 00:19:36,836 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 372 transitions. Word has length 72 [2019-11-16 00:19:36,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:19:36,837 INFO L462 AbstractCegarLoop]: Abstraction has 243 states and 372 transitions. [2019-11-16 00:19:36,837 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:19:36,839 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 372 transitions. [2019-11-16 00:19:36,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-16 00:19:36,841 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:19:36,842 INFO L380 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, 1, 1] [2019-11-16 00:19:36,842 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-16 00:19:36,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:19:36,843 INFO L82 PathProgramCache]: Analyzing trace with hash 1882884773, now seen corresponding path program 1 times [2019-11-16 00:19:36,843 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:19:36,843 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638304038] [2019-11-16 00:19:36,843 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:36,843 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:36,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:19:36,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:36,902 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-16 00:19:36,904 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638304038] [2019-11-16 00:19:36,905 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:19:36,905 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:19:36,905 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673233665] [2019-11-16 00:19:36,906 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:19:36,906 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:19:36,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:19:36,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:19:36,907 INFO L87 Difference]: Start difference. First operand 243 states and 372 transitions. Second operand 3 states. [2019-11-16 00:19:37,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:19:37,047 INFO L93 Difference]: Finished difference Result 513 states and 788 transitions. [2019-11-16 00:19:37,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:19:37,047 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-11-16 00:19:37,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:19:37,049 INFO L225 Difference]: With dead ends: 513 [2019-11-16 00:19:37,049 INFO L226 Difference]: Without dead ends: 277 [2019-11-16 00:19:37,050 INFO L600 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-16 00:19:37,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2019-11-16 00:19:37,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 270. [2019-11-16 00:19:37,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2019-11-16 00:19:37,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 412 transitions. [2019-11-16 00:19:37,064 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 412 transitions. Word has length 73 [2019-11-16 00:19:37,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:19:37,065 INFO L462 AbstractCegarLoop]: Abstraction has 270 states and 412 transitions. [2019-11-16 00:19:37,066 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:19:37,066 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 412 transitions. [2019-11-16 00:19:37,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-16 00:19:37,067 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:19:37,067 INFO L380 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, 1, 1] [2019-11-16 00:19:37,067 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-16 00:19:37,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:19:37,068 INFO L82 PathProgramCache]: Analyzing trace with hash -369256571, now seen corresponding path program 1 times [2019-11-16 00:19:37,068 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:19:37,068 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201515241] [2019-11-16 00:19:37,068 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:37,068 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:37,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:19:37,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:37,105 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-16 00:19:37,105 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201515241] [2019-11-16 00:19:37,105 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:19:37,105 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:19:37,106 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646424702] [2019-11-16 00:19:37,106 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:19:37,106 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:19:37,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:19:37,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:19:37,107 INFO L87 Difference]: Start difference. First operand 270 states and 412 transitions. Second operand 3 states. [2019-11-16 00:19:37,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:19:37,254 INFO L93 Difference]: Finished difference Result 536 states and 817 transitions. [2019-11-16 00:19:37,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:19:37,254 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-11-16 00:19:37,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:19:37,256 INFO L225 Difference]: With dead ends: 536 [2019-11-16 00:19:37,256 INFO L226 Difference]: Without dead ends: 273 [2019-11-16 00:19:37,257 INFO L600 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-16 00:19:37,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2019-11-16 00:19:37,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 271. [2019-11-16 00:19:37,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-11-16 00:19:37,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 412 transitions. [2019-11-16 00:19:37,267 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 412 transitions. Word has length 73 [2019-11-16 00:19:37,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:19:37,268 INFO L462 AbstractCegarLoop]: Abstraction has 271 states and 412 transitions. [2019-11-16 00:19:37,268 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:19:37,268 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 412 transitions. [2019-11-16 00:19:37,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-16 00:19:37,269 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:19:37,269 INFO L380 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, 1, 1] [2019-11-16 00:19:37,269 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-16 00:19:37,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:19:37,270 INFO L82 PathProgramCache]: Analyzing trace with hash -189803919, now seen corresponding path program 1 times [2019-11-16 00:19:37,270 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:19:37,270 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353610365] [2019-11-16 00:19:37,270 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:37,270 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:37,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:19:37,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:37,305 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-16 00:19:37,305 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353610365] [2019-11-16 00:19:37,305 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:19:37,306 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:19:37,306 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714980219] [2019-11-16 00:19:37,306 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:19:37,306 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:19:37,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:19:37,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:19:37,307 INFO L87 Difference]: Start difference. First operand 271 states and 412 transitions. Second operand 3 states. [2019-11-16 00:19:37,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:19:37,443 INFO L93 Difference]: Finished difference Result 542 states and 825 transitions. [2019-11-16 00:19:37,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:19:37,443 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-11-16 00:19:37,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:19:37,445 INFO L225 Difference]: With dead ends: 542 [2019-11-16 00:19:37,445 INFO L226 Difference]: Without dead ends: 278 [2019-11-16 00:19:37,446 INFO L600 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-16 00:19:37,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-11-16 00:19:37,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 271. [2019-11-16 00:19:37,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-11-16 00:19:37,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 409 transitions. [2019-11-16 00:19:37,456 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 409 transitions. Word has length 74 [2019-11-16 00:19:37,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:19:37,457 INFO L462 AbstractCegarLoop]: Abstraction has 271 states and 409 transitions. [2019-11-16 00:19:37,457 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:19:37,457 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 409 transitions. [2019-11-16 00:19:37,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-16 00:19:37,458 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:19:37,458 INFO L380 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, 1, 1] [2019-11-16 00:19:37,459 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-16 00:19:37,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:19:37,459 INFO L82 PathProgramCache]: Analyzing trace with hash 873313086, now seen corresponding path program 1 times [2019-11-16 00:19:37,459 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:19:37,459 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558357878] [2019-11-16 00:19:37,460 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:37,460 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:37,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:19:37,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:37,498 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-16 00:19:37,498 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558357878] [2019-11-16 00:19:37,499 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:19:37,499 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:19:37,499 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482489220] [2019-11-16 00:19:37,499 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:19:37,500 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:19:37,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:19:37,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:19:37,500 INFO L87 Difference]: Start difference. First operand 271 states and 409 transitions. Second operand 3 states. [2019-11-16 00:19:37,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:19:37,670 INFO L93 Difference]: Finished difference Result 582 states and 881 transitions. [2019-11-16 00:19:37,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:19:37,670 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2019-11-16 00:19:37,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:19:37,673 INFO L225 Difference]: With dead ends: 582 [2019-11-16 00:19:37,673 INFO L226 Difference]: Without dead ends: 318 [2019-11-16 00:19:37,673 INFO L600 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-16 00:19:37,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-11-16 00:19:37,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 314. [2019-11-16 00:19:37,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2019-11-16 00:19:37,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 478 transitions. [2019-11-16 00:19:37,687 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 478 transitions. Word has length 89 [2019-11-16 00:19:37,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:19:37,687 INFO L462 AbstractCegarLoop]: Abstraction has 314 states and 478 transitions. [2019-11-16 00:19:37,688 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:19:37,688 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 478 transitions. [2019-11-16 00:19:37,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-11-16 00:19:37,689 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:19:37,689 INFO L380 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, 1, 1, 1] [2019-11-16 00:19:37,689 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-16 00:19:37,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:19:37,690 INFO L82 PathProgramCache]: Analyzing trace with hash 1282770437, now seen corresponding path program 1 times [2019-11-16 00:19:37,690 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:19:37,690 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272247] [2019-11-16 00:19:37,690 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:37,691 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:37,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:19:37,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:37,732 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-16 00:19:37,733 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272247] [2019-11-16 00:19:37,734 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:19:37,734 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:19:37,734 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605912313] [2019-11-16 00:19:37,734 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:19:37,735 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:19:37,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:19:37,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:19:37,735 INFO L87 Difference]: Start difference. First operand 314 states and 478 transitions. Second operand 3 states. [2019-11-16 00:19:37,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:19:37,889 INFO L93 Difference]: Finished difference Result 637 states and 972 transitions. [2019-11-16 00:19:37,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:19:37,889 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2019-11-16 00:19:37,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:19:37,892 INFO L225 Difference]: With dead ends: 637 [2019-11-16 00:19:37,892 INFO L226 Difference]: Without dead ends: 328 [2019-11-16 00:19:37,892 INFO L600 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-16 00:19:37,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2019-11-16 00:19:37,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 324. [2019-11-16 00:19:37,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2019-11-16 00:19:37,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 497 transitions. [2019-11-16 00:19:37,904 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 497 transitions. Word has length 90 [2019-11-16 00:19:37,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:19:37,906 INFO L462 AbstractCegarLoop]: Abstraction has 324 states and 497 transitions. [2019-11-16 00:19:37,906 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:19:37,906 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 497 transitions. [2019-11-16 00:19:37,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-16 00:19:37,907 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:19:37,907 INFO L380 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, 1, 1] [2019-11-16 00:19:37,908 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-16 00:19:37,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:19:37,908 INFO L82 PathProgramCache]: Analyzing trace with hash 630357241, now seen corresponding path program 1 times [2019-11-16 00:19:37,908 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:19:37,908 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133836044] [2019-11-16 00:19:37,909 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:37,909 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:37,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:19:37,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:37,960 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-16 00:19:37,960 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133836044] [2019-11-16 00:19:37,960 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:19:37,960 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:19:37,961 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646473467] [2019-11-16 00:19:37,961 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:19:37,961 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:19:37,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:19:37,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:19:37,962 INFO L87 Difference]: Start difference. First operand 324 states and 497 transitions. Second operand 3 states. [2019-11-16 00:19:38,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:19:38,092 INFO L93 Difference]: Finished difference Result 678 states and 1042 transitions. [2019-11-16 00:19:38,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:19:38,093 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-11-16 00:19:38,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:19:38,095 INFO L225 Difference]: With dead ends: 678 [2019-11-16 00:19:38,096 INFO L226 Difference]: Without dead ends: 361 [2019-11-16 00:19:38,096 INFO L600 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-16 00:19:38,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2019-11-16 00:19:38,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 349. [2019-11-16 00:19:38,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2019-11-16 00:19:38,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 531 transitions. [2019-11-16 00:19:38,112 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 531 transitions. Word has length 99 [2019-11-16 00:19:38,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:19:38,112 INFO L462 AbstractCegarLoop]: Abstraction has 349 states and 531 transitions. [2019-11-16 00:19:38,113 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:19:38,113 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 531 transitions. [2019-11-16 00:19:38,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-16 00:19:38,114 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:19:38,114 INFO L380 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, 1, 1] [2019-11-16 00:19:38,115 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-16 00:19:38,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:19:38,115 INFO L82 PathProgramCache]: Analyzing trace with hash 757835045, now seen corresponding path program 1 times [2019-11-16 00:19:38,115 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:19:38,116 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631375168] [2019-11-16 00:19:38,116 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:38,116 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:38,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:19:38,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:38,157 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-16 00:19:38,161 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631375168] [2019-11-16 00:19:38,162 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:19:38,162 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:19:38,163 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090779866] [2019-11-16 00:19:38,163 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:19:38,163 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:19:38,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:19:38,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:19:38,164 INFO L87 Difference]: Start difference. First operand 349 states and 531 transitions. Second operand 3 states. [2019-11-16 00:19:38,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:19:38,311 INFO L93 Difference]: Finished difference Result 703 states and 1071 transitions. [2019-11-16 00:19:38,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:19:38,312 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-11-16 00:19:38,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:19:38,314 INFO L225 Difference]: With dead ends: 703 [2019-11-16 00:19:38,314 INFO L226 Difference]: Without dead ends: 361 [2019-11-16 00:19:38,315 INFO L600 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-16 00:19:38,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2019-11-16 00:19:38,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 349. [2019-11-16 00:19:38,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2019-11-16 00:19:38,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 526 transitions. [2019-11-16 00:19:38,330 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 526 transitions. Word has length 100 [2019-11-16 00:19:38,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:19:38,331 INFO L462 AbstractCegarLoop]: Abstraction has 349 states and 526 transitions. [2019-11-16 00:19:38,331 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:19:38,331 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 526 transitions. [2019-11-16 00:19:38,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-11-16 00:19:38,333 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:19:38,333 INFO L380 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, 1, 1] [2019-11-16 00:19:38,333 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-16 00:19:38,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:19:38,334 INFO L82 PathProgramCache]: Analyzing trace with hash -927735321, now seen corresponding path program 1 times [2019-11-16 00:19:38,334 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:19:38,334 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493050347] [2019-11-16 00:19:38,334 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:38,335 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:38,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:19:38,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:38,399 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-16 00:19:38,399 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493050347] [2019-11-16 00:19:38,399 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:19:38,400 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:19:38,400 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581655810] [2019-11-16 00:19:38,400 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:19:38,400 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:19:38,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:19:38,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:19:38,401 INFO L87 Difference]: Start difference. First operand 349 states and 526 transitions. Second operand 3 states. [2019-11-16 00:19:38,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:19:38,532 INFO L93 Difference]: Finished difference Result 718 states and 1081 transitions. [2019-11-16 00:19:38,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:19:38,532 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 119 [2019-11-16 00:19:38,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:19:38,534 INFO L225 Difference]: With dead ends: 718 [2019-11-16 00:19:38,534 INFO L226 Difference]: Without dead ends: 376 [2019-11-16 00:19:38,535 INFO L600 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-16 00:19:38,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2019-11-16 00:19:38,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 373. [2019-11-16 00:19:38,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2019-11-16 00:19:38,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 556 transitions. [2019-11-16 00:19:38,549 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 556 transitions. Word has length 119 [2019-11-16 00:19:38,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:19:38,549 INFO L462 AbstractCegarLoop]: Abstraction has 373 states and 556 transitions. [2019-11-16 00:19:38,549 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:19:38,549 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 556 transitions. [2019-11-16 00:19:38,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-16 00:19:38,551 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:19:38,551 INFO L380 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, 1, 1] [2019-11-16 00:19:38,551 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-16 00:19:38,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:19:38,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1207090035, now seen corresponding path program 1 times [2019-11-16 00:19:38,552 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:19:38,552 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250921137] [2019-11-16 00:19:38,552 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:38,552 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:38,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:19:38,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:38,581 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-16 00:19:38,582 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250921137] [2019-11-16 00:19:38,582 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:19:38,582 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:19:38,582 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412038730] [2019-11-16 00:19:38,583 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:19:38,583 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:19:38,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:19:38,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:19:38,583 INFO L87 Difference]: Start difference. First operand 373 states and 556 transitions. Second operand 3 states. [2019-11-16 00:19:38,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:19:38,720 INFO L93 Difference]: Finished difference Result 742 states and 1105 transitions. [2019-11-16 00:19:38,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:19:38,720 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2019-11-16 00:19:38,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:19:38,723 INFO L225 Difference]: With dead ends: 742 [2019-11-16 00:19:38,723 INFO L226 Difference]: Without dead ends: 376 [2019-11-16 00:19:38,723 INFO L600 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-16 00:19:38,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2019-11-16 00:19:38,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 373. [2019-11-16 00:19:38,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2019-11-16 00:19:38,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 550 transitions. [2019-11-16 00:19:38,737 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 550 transitions. Word has length 120 [2019-11-16 00:19:38,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:19:38,737 INFO L462 AbstractCegarLoop]: Abstraction has 373 states and 550 transitions. [2019-11-16 00:19:38,737 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:19:38,738 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 550 transitions. [2019-11-16 00:19:38,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-11-16 00:19:38,739 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:19:38,739 INFO L380 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, 1, 1, 1] [2019-11-16 00:19:38,740 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-16 00:19:38,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:19:38,740 INFO L82 PathProgramCache]: Analyzing trace with hash -568364771, now seen corresponding path program 1 times [2019-11-16 00:19:38,740 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:19:38,740 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845735371] [2019-11-16 00:19:38,741 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:38,741 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:38,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:19:38,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:38,774 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-16 00:19:38,774 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845735371] [2019-11-16 00:19:38,775 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:19:38,775 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:19:38,775 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579380766] [2019-11-16 00:19:38,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:19:38,776 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:19:38,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:19:38,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:19:38,776 INFO L87 Difference]: Start difference. First operand 373 states and 550 transitions. Second operand 3 states. [2019-11-16 00:19:38,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:19:38,930 INFO L93 Difference]: Finished difference Result 784 states and 1155 transitions. [2019-11-16 00:19:38,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:19:38,931 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 129 [2019-11-16 00:19:38,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:19:38,933 INFO L225 Difference]: With dead ends: 784 [2019-11-16 00:19:38,933 INFO L226 Difference]: Without dead ends: 418 [2019-11-16 00:19:38,934 INFO L600 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-16 00:19:38,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2019-11-16 00:19:38,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 414. [2019-11-16 00:19:38,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414 states. [2019-11-16 00:19:38,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 609 transitions. [2019-11-16 00:19:38,949 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 609 transitions. Word has length 129 [2019-11-16 00:19:38,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:19:38,949 INFO L462 AbstractCegarLoop]: Abstraction has 414 states and 609 transitions. [2019-11-16 00:19:38,949 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:19:38,950 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 609 transitions. [2019-11-16 00:19:38,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-11-16 00:19:38,951 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:19:38,951 INFO L380 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, 1, 1, 1] [2019-11-16 00:19:38,952 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-16 00:19:38,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:19:38,952 INFO L82 PathProgramCache]: Analyzing trace with hash 12959108, now seen corresponding path program 1 times [2019-11-16 00:19:38,952 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:19:38,952 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777251288] [2019-11-16 00:19:38,953 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:38,953 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:38,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:19:38,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:38,987 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-16 00:19:38,988 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777251288] [2019-11-16 00:19:38,988 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:19:38,988 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:19:38,988 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448162899] [2019-11-16 00:19:38,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:19:38,989 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:19:38,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:19:38,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:19:38,990 INFO L87 Difference]: Start difference. First operand 414 states and 609 transitions. Second operand 3 states. [2019-11-16 00:19:39,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:19:39,148 INFO L93 Difference]: Finished difference Result 825 states and 1212 transitions. [2019-11-16 00:19:39,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:19:39,149 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 130 [2019-11-16 00:19:39,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:19:39,151 INFO L225 Difference]: With dead ends: 825 [2019-11-16 00:19:39,151 INFO L226 Difference]: Without dead ends: 416 [2019-11-16 00:19:39,152 INFO L600 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-16 00:19:39,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2019-11-16 00:19:39,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 412. [2019-11-16 00:19:39,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2019-11-16 00:19:39,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 604 transitions. [2019-11-16 00:19:39,167 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 604 transitions. Word has length 130 [2019-11-16 00:19:39,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:19:39,168 INFO L462 AbstractCegarLoop]: Abstraction has 412 states and 604 transitions. [2019-11-16 00:19:39,168 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:19:39,168 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 604 transitions. [2019-11-16 00:19:39,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-11-16 00:19:39,170 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:19:39,170 INFO L380 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, 1, 1] [2019-11-16 00:19:39,170 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-16 00:19:39,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:19:39,171 INFO L82 PathProgramCache]: Analyzing trace with hash -637521445, now seen corresponding path program 1 times [2019-11-16 00:19:39,171 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:19:39,171 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276817191] [2019-11-16 00:19:39,171 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:39,171 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:39,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:19:39,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:39,210 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-16 00:19:39,211 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276817191] [2019-11-16 00:19:39,211 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:19:39,211 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:19:39,211 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201337537] [2019-11-16 00:19:39,212 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:19:39,216 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:19:39,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:19:39,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:19:39,216 INFO L87 Difference]: Start difference. First operand 412 states and 604 transitions. Second operand 3 states. [2019-11-16 00:19:39,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:19:39,344 INFO L93 Difference]: Finished difference Result 842 states and 1234 transitions. [2019-11-16 00:19:39,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:19:39,345 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 140 [2019-11-16 00:19:39,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:19:39,347 INFO L225 Difference]: With dead ends: 842 [2019-11-16 00:19:39,347 INFO L226 Difference]: Without dead ends: 437 [2019-11-16 00:19:39,348 INFO L600 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-16 00:19:39,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2019-11-16 00:19:39,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 433. [2019-11-16 00:19:39,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2019-11-16 00:19:39,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 627 transitions. [2019-11-16 00:19:39,366 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 627 transitions. Word has length 140 [2019-11-16 00:19:39,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:19:39,366 INFO L462 AbstractCegarLoop]: Abstraction has 433 states and 627 transitions. [2019-11-16 00:19:39,366 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:19:39,366 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 627 transitions. [2019-11-16 00:19:39,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-11-16 00:19:39,368 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:19:39,368 INFO L380 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, 1, 1] [2019-11-16 00:19:39,369 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-16 00:19:39,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:19:39,369 INFO L82 PathProgramCache]: Analyzing trace with hash 871119983, now seen corresponding path program 1 times [2019-11-16 00:19:39,369 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:19:39,370 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992217338] [2019-11-16 00:19:39,370 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:39,370 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:39,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:19:39,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:39,418 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-16 00:19:39,418 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992217338] [2019-11-16 00:19:39,418 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:19:39,418 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:19:39,419 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031000434] [2019-11-16 00:19:39,419 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:19:39,419 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:19:39,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:19:39,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:19:39,420 INFO L87 Difference]: Start difference. First operand 433 states and 627 transitions. Second operand 3 states. [2019-11-16 00:19:39,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:19:39,556 INFO L93 Difference]: Finished difference Result 863 states and 1249 transitions. [2019-11-16 00:19:39,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:19:39,558 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 141 [2019-11-16 00:19:39,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:19:39,560 INFO L225 Difference]: With dead ends: 863 [2019-11-16 00:19:39,561 INFO L226 Difference]: Without dead ends: 437 [2019-11-16 00:19:39,561 INFO L600 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-16 00:19:39,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2019-11-16 00:19:39,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 433. [2019-11-16 00:19:39,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2019-11-16 00:19:39,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 619 transitions. [2019-11-16 00:19:39,581 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 619 transitions. Word has length 141 [2019-11-16 00:19:39,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:19:39,581 INFO L462 AbstractCegarLoop]: Abstraction has 433 states and 619 transitions. [2019-11-16 00:19:39,581 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:19:39,581 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 619 transitions. [2019-11-16 00:19:39,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-11-16 00:19:39,583 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:19:39,584 INFO L380 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, 1, 1] [2019-11-16 00:19:39,584 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-16 00:19:39,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:19:39,584 INFO L82 PathProgramCache]: Analyzing trace with hash 1128117336, now seen corresponding path program 1 times [2019-11-16 00:19:39,584 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:19:39,585 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025611821] [2019-11-16 00:19:39,585 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:39,585 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:39,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:19:39,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:39,626 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2019-11-16 00:19:39,626 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025611821] [2019-11-16 00:19:39,626 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:19:39,627 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:19:39,627 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373269996] [2019-11-16 00:19:39,628 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:19:39,628 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:19:39,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:19:39,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:19:39,629 INFO L87 Difference]: Start difference. First operand 433 states and 619 transitions. Second operand 3 states. [2019-11-16 00:19:39,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:19:39,670 INFO L93 Difference]: Finished difference Result 1279 states and 1823 transitions. [2019-11-16 00:19:39,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:19:39,671 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 156 [2019-11-16 00:19:39,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:19:39,676 INFO L225 Difference]: With dead ends: 1279 [2019-11-16 00:19:39,676 INFO L226 Difference]: Without dead ends: 853 [2019-11-16 00:19:39,677 INFO L600 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-16 00:19:39,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 853 states. [2019-11-16 00:19:39,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 853 to 434. [2019-11-16 00:19:39,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2019-11-16 00:19:39,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 620 transitions. [2019-11-16 00:19:39,703 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 620 transitions. Word has length 156 [2019-11-16 00:19:39,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:19:39,703 INFO L462 AbstractCegarLoop]: Abstraction has 434 states and 620 transitions. [2019-11-16 00:19:39,703 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:19:39,703 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 620 transitions. [2019-11-16 00:19:39,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-11-16 00:19:39,706 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:19:39,706 INFO L380 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, 1, 1] [2019-11-16 00:19:39,706 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-16 00:19:39,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:19:39,707 INFO L82 PathProgramCache]: Analyzing trace with hash 386659640, now seen corresponding path program 1 times [2019-11-16 00:19:39,707 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:19:39,707 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166313084] [2019-11-16 00:19:39,708 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:39,708 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:39,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:19:39,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:39,786 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-16 00:19:39,786 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166313084] [2019-11-16 00:19:39,786 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1930357764] [2019-11-16 00:19:39,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9ea5bdf7-d11a-426d-b9e5-17c861eac7b2/bin/uautomizer/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-16 00:19:39,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:39,899 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-16 00:19:39,913 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:19:39,960 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-16 00:19:39,960 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:19:39,961 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-16 00:19:39,961 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006974608] [2019-11-16 00:19:39,963 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:19:39,963 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:19:39,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:19:39,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:19:39,964 INFO L87 Difference]: Start difference. First operand 434 states and 620 transitions. Second operand 4 states. [2019-11-16 00:19:40,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:19:40,324 INFO L93 Difference]: Finished difference Result 1355 states and 1932 transitions. [2019-11-16 00:19:40,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:19:40,325 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-11-16 00:19:40,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:19:40,330 INFO L225 Difference]: With dead ends: 1355 [2019-11-16 00:19:40,330 INFO L226 Difference]: Without dead ends: 903 [2019-11-16 00:19:40,331 INFO L600 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-16 00:19:40,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2019-11-16 00:19:40,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 532. [2019-11-16 00:19:40,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 532 states. [2019-11-16 00:19:40,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 761 transitions. [2019-11-16 00:19:40,358 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 761 transitions. Word has length 156 [2019-11-16 00:19:40,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:19:40,359 INFO L462 AbstractCegarLoop]: Abstraction has 532 states and 761 transitions. [2019-11-16 00:19:40,359 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:19:40,359 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 761 transitions. [2019-11-16 00:19:40,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-11-16 00:19:40,361 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:19:40,362 INFO L380 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, 1, 1] [2019-11-16 00:19:40,566 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:19:40,566 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-16 00:19:40,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:19:40,567 INFO L82 PathProgramCache]: Analyzing trace with hash 1891443376, now seen corresponding path program 1 times [2019-11-16 00:19:40,567 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:19:40,567 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942731966] [2019-11-16 00:19:40,567 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:40,567 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:40,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:19:40,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:40,650 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-16 00:19:40,651 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942731966] [2019-11-16 00:19:40,651 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [38674488] [2019-11-16 00:19:40,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9ea5bdf7-d11a-426d-b9e5-17c861eac7b2/bin/uautomizer/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-16 00:19:40,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:40,742 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-16 00:19:40,754 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:19:40,787 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-16 00:19:40,788 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:19:40,788 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-16 00:19:40,788 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301037502] [2019-11-16 00:19:40,789 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:19:40,789 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:19:40,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:19:40,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:19:40,790 INFO L87 Difference]: Start difference. First operand 532 states and 761 transitions. Second operand 4 states. [2019-11-16 00:19:41,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:19:41,090 INFO L93 Difference]: Finished difference Result 1476 states and 2098 transitions. [2019-11-16 00:19:41,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:19:41,091 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2019-11-16 00:19:41,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:19:41,096 INFO L225 Difference]: With dead ends: 1476 [2019-11-16 00:19:41,096 INFO L226 Difference]: Without dead ends: 951 [2019-11-16 00:19:41,097 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 160 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-16 00:19:41,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2019-11-16 00:19:41,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 587. [2019-11-16 00:19:41,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2019-11-16 00:19:41,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 801 transitions. [2019-11-16 00:19:41,128 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 801 transitions. Word has length 158 [2019-11-16 00:19:41,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:19:41,128 INFO L462 AbstractCegarLoop]: Abstraction has 587 states and 801 transitions. [2019-11-16 00:19:41,128 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:19:41,128 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 801 transitions. [2019-11-16 00:19:41,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-11-16 00:19:41,131 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:19:41,131 INFO L380 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, 1, 1, 1] [2019-11-16 00:19:41,335 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:19:41,335 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-16 00:19:41,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:19:41,336 INFO L82 PathProgramCache]: Analyzing trace with hash -136801648, now seen corresponding path program 1 times [2019-11-16 00:19:41,336 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:19:41,336 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676079237] [2019-11-16 00:19:41,336 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:41,336 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:41,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:19:41,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:41,416 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-16 00:19:41,417 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676079237] [2019-11-16 00:19:41,417 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [438602420] [2019-11-16 00:19:41,417 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9ea5bdf7-d11a-426d-b9e5-17c861eac7b2/bin/uautomizer/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-16 00:19:41,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:41,497 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-16 00:19:41,504 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:19:41,540 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-16 00:19:41,541 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:19:41,541 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-16 00:19:41,541 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361974756] [2019-11-16 00:19:41,542 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:19:41,542 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:19:41,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:19:41,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:19:41,543 INFO L87 Difference]: Start difference. First operand 587 states and 801 transitions. Second operand 4 states. [2019-11-16 00:19:41,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:19:41,858 INFO L93 Difference]: Finished difference Result 1484 states and 2022 transitions. [2019-11-16 00:19:41,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:19:41,858 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 166 [2019-11-16 00:19:41,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:19:41,864 INFO L225 Difference]: With dead ends: 1484 [2019-11-16 00:19:41,864 INFO L226 Difference]: Without dead ends: 897 [2019-11-16 00:19:41,865 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 168 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-16 00:19:41,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2019-11-16 00:19:41,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 515. [2019-11-16 00:19:41,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 515 states. [2019-11-16 00:19:41,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 700 transitions. [2019-11-16 00:19:41,892 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 700 transitions. Word has length 166 [2019-11-16 00:19:41,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:19:41,892 INFO L462 AbstractCegarLoop]: Abstraction has 515 states and 700 transitions. [2019-11-16 00:19:41,892 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:19:41,892 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 700 transitions. [2019-11-16 00:19:41,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-11-16 00:19:41,894 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:19:41,895 INFO L380 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, 1, 1, 1] [2019-11-16 00:19:42,099 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:19:42,099 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-16 00:19:42,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:19:42,099 INFO L82 PathProgramCache]: Analyzing trace with hash 1003230858, now seen corresponding path program 1 times [2019-11-16 00:19:42,100 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:19:42,100 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613915082] [2019-11-16 00:19:42,100 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:42,100 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:42,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:19:42,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:42,184 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-16 00:19:42,185 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613915082] [2019-11-16 00:19:42,185 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:19:42,185 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:19:42,185 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193878631] [2019-11-16 00:19:42,186 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:19:42,186 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:19:42,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:19:42,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:19:42,186 INFO L87 Difference]: Start difference. First operand 515 states and 700 transitions. Second operand 3 states. [2019-11-16 00:19:42,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:19:42,225 INFO L93 Difference]: Finished difference Result 1226 states and 1656 transitions. [2019-11-16 00:19:42,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:19:42,226 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 168 [2019-11-16 00:19:42,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:19:42,229 INFO L225 Difference]: With dead ends: 1226 [2019-11-16 00:19:42,229 INFO L226 Difference]: Without dead ends: 477 [2019-11-16 00:19:42,230 INFO L600 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-16 00:19:42,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2019-11-16 00:19:42,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 477. [2019-11-16 00:19:42,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 477 states. [2019-11-16 00:19:42,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 648 transitions. [2019-11-16 00:19:42,253 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 648 transitions. Word has length 168 [2019-11-16 00:19:42,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:19:42,254 INFO L462 AbstractCegarLoop]: Abstraction has 477 states and 648 transitions. [2019-11-16 00:19:42,254 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:19:42,254 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 648 transitions. [2019-11-16 00:19:42,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-11-16 00:19:42,256 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:19:42,257 INFO L380 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, 1, 1, 1] [2019-11-16 00:19:42,257 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-16 00:19:42,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:19:42,257 INFO L82 PathProgramCache]: Analyzing trace with hash -1602987784, now seen corresponding path program 1 times [2019-11-16 00:19:42,258 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:19:42,258 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5609322] [2019-11-16 00:19:42,258 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:42,258 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:42,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:19:42,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:42,313 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-16 00:19:42,314 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5609322] [2019-11-16 00:19:42,314 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:19:42,314 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:19:42,314 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649754121] [2019-11-16 00:19:42,315 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:19:42,315 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:19:42,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:19:42,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:19:42,316 INFO L87 Difference]: Start difference. First operand 477 states and 648 transitions. Second operand 3 states. [2019-11-16 00:19:42,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:19:42,487 INFO L93 Difference]: Finished difference Result 964 states and 1304 transitions. [2019-11-16 00:19:42,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:19:42,487 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 200 [2019-11-16 00:19:42,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:19:42,490 INFO L225 Difference]: With dead ends: 964 [2019-11-16 00:19:42,490 INFO L226 Difference]: Without dead ends: 482 [2019-11-16 00:19:42,491 INFO L600 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-16 00:19:42,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2019-11-16 00:19:42,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 478. [2019-11-16 00:19:42,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 478 states. [2019-11-16 00:19:42,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 639 transitions. [2019-11-16 00:19:42,515 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 639 transitions. Word has length 200 [2019-11-16 00:19:42,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:19:42,515 INFO L462 AbstractCegarLoop]: Abstraction has 478 states and 639 transitions. [2019-11-16 00:19:42,516 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:19:42,516 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 639 transitions. [2019-11-16 00:19:42,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2019-11-16 00:19:42,521 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:19:42,522 INFO L380 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, 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] [2019-11-16 00:19:42,523 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-16 00:19:42,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:19:42,523 INFO L82 PathProgramCache]: Analyzing trace with hash -1001955789, now seen corresponding path program 1 times [2019-11-16 00:19:42,523 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:19:42,524 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145704788] [2019-11-16 00:19:42,524 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:42,524 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:42,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:19:42,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:42,655 INFO L134 CoverageAnalysis]: Checked inductivity of 1164 backedges. 700 proven. 0 refuted. 0 times theorem prover too weak. 464 trivial. 0 not checked. [2019-11-16 00:19:42,655 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145704788] [2019-11-16 00:19:42,655 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:19:42,655 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:19:42,656 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642405401] [2019-11-16 00:19:42,656 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:19:42,656 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:19:42,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:19:42,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:19:42,657 INFO L87 Difference]: Start difference. First operand 478 states and 639 transitions. Second operand 3 states. [2019-11-16 00:19:42,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:19:42,829 INFO L93 Difference]: Finished difference Result 985 states and 1310 transitions. [2019-11-16 00:19:42,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:19:42,830 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 339 [2019-11-16 00:19:42,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:19:42,833 INFO L225 Difference]: With dead ends: 985 [2019-11-16 00:19:42,833 INFO L226 Difference]: Without dead ends: 514 [2019-11-16 00:19:42,835 INFO L600 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-16 00:19:42,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2019-11-16 00:19:42,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 512. [2019-11-16 00:19:42,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 512 states. [2019-11-16 00:19:42,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 678 transitions. [2019-11-16 00:19:42,861 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 678 transitions. Word has length 339 [2019-11-16 00:19:42,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:19:42,861 INFO L462 AbstractCegarLoop]: Abstraction has 512 states and 678 transitions. [2019-11-16 00:19:42,861 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:19:42,862 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 678 transitions. [2019-11-16 00:19:42,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2019-11-16 00:19:42,867 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:19:42,868 INFO L380 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, 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] [2019-11-16 00:19:42,868 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-16 00:19:42,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:19:42,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1590673358, now seen corresponding path program 1 times [2019-11-16 00:19:42,869 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:19:42,869 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141354463] [2019-11-16 00:19:42,869 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:42,869 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:42,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:19:42,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:43,012 INFO L134 CoverageAnalysis]: Checked inductivity of 1424 backedges. 824 proven. 0 refuted. 0 times theorem prover too weak. 600 trivial. 0 not checked. [2019-11-16 00:19:43,013 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141354463] [2019-11-16 00:19:43,013 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:19:43,013 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:19:43,013 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720063062] [2019-11-16 00:19:43,014 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:19:43,014 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:19:43,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:19:43,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:19:43,015 INFO L87 Difference]: Start difference. First operand 512 states and 678 transitions. Second operand 3 states. [2019-11-16 00:19:43,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:19:43,178 INFO L93 Difference]: Finished difference Result 1055 states and 1392 transitions. [2019-11-16 00:19:43,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:19:43,178 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 370 [2019-11-16 00:19:43,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:19:43,182 INFO L225 Difference]: With dead ends: 1055 [2019-11-16 00:19:43,182 INFO L226 Difference]: Without dead ends: 550 [2019-11-16 00:19:43,183 INFO L600 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-16 00:19:43,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2019-11-16 00:19:43,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 548. [2019-11-16 00:19:43,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 548 states. [2019-11-16 00:19:43,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 719 transitions. [2019-11-16 00:19:43,214 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 719 transitions. Word has length 370 [2019-11-16 00:19:43,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:19:43,215 INFO L462 AbstractCegarLoop]: Abstraction has 548 states and 719 transitions. [2019-11-16 00:19:43,215 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:19:43,215 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 719 transitions. [2019-11-16 00:19:43,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2019-11-16 00:19:43,222 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:19:43,223 INFO L380 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, 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, 1, 1] [2019-11-16 00:19:43,223 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-16 00:19:43,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:19:43,224 INFO L82 PathProgramCache]: Analyzing trace with hash 458339096, now seen corresponding path program 1 times [2019-11-16 00:19:43,225 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:19:43,228 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112377035] [2019-11-16 00:19:43,229 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:43,229 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:43,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:19:43,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:43,495 INFO L134 CoverageAnalysis]: Checked inductivity of 1719 backedges. 970 proven. 0 refuted. 0 times theorem prover too weak. 749 trivial. 0 not checked. [2019-11-16 00:19:43,495 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112377035] [2019-11-16 00:19:43,496 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:19:43,496 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:19:43,496 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896828231] [2019-11-16 00:19:43,497 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:19:43,497 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:19:43,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:19:43,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:19:43,497 INFO L87 Difference]: Start difference. First operand 548 states and 719 transitions. Second operand 3 states. [2019-11-16 00:19:43,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:19:43,559 INFO L93 Difference]: Finished difference Result 1630 states and 2135 transitions. [2019-11-16 00:19:43,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:19:43,560 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 403 [2019-11-16 00:19:43,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:19:43,566 INFO L225 Difference]: With dead ends: 1630 [2019-11-16 00:19:43,566 INFO L226 Difference]: Without dead ends: 1089 [2019-11-16 00:19:43,567 INFO L600 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-16 00:19:43,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1089 states. [2019-11-16 00:19:43,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1089 to 1087. [2019-11-16 00:19:43,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1087 states. [2019-11-16 00:19:43,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1087 states to 1087 states and 1426 transitions. [2019-11-16 00:19:43,619 INFO L78 Accepts]: Start accepts. Automaton has 1087 states and 1426 transitions. Word has length 403 [2019-11-16 00:19:43,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:19:43,620 INFO L462 AbstractCegarLoop]: Abstraction has 1087 states and 1426 transitions. [2019-11-16 00:19:43,620 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:19:43,620 INFO L276 IsEmpty]: Start isEmpty. Operand 1087 states and 1426 transitions. [2019-11-16 00:19:43,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2019-11-16 00:19:43,627 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:19:43,627 INFO L380 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, 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, 1, 1] [2019-11-16 00:19:43,628 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-16 00:19:43,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:19:43,628 INFO L82 PathProgramCache]: Analyzing trace with hash 747158486, now seen corresponding path program 1 times [2019-11-16 00:19:43,628 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:19:43,629 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683804426] [2019-11-16 00:19:43,629 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:43,629 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:43,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:19:43,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:43,806 INFO L134 CoverageAnalysis]: Checked inductivity of 1719 backedges. 354 proven. 7 refuted. 0 times theorem prover too weak. 1358 trivial. 0 not checked. [2019-11-16 00:19:43,806 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683804426] [2019-11-16 00:19:43,806 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [969576550] [2019-11-16 00:19:43,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9ea5bdf7-d11a-426d-b9e5-17c861eac7b2/bin/uautomizer/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-16 00:19:43,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:43,942 INFO L256 TraceCheckSpWp]: Trace formula consists of 639 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-16 00:19:43,950 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:19:44,082 INFO L134 CoverageAnalysis]: Checked inductivity of 1719 backedges. 354 proven. 7 refuted. 0 times theorem prover too weak. 1358 trivial. 0 not checked. [2019-11-16 00:19:44,082 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:19:44,082 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-16 00:19:44,083 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470700037] [2019-11-16 00:19:44,084 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:19:44,084 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:19:44,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:19:44,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:19:44,085 INFO L87 Difference]: Start difference. First operand 1087 states and 1426 transitions. Second operand 4 states. [2019-11-16 00:19:44,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:19:44,367 INFO L93 Difference]: Finished difference Result 2539 states and 3361 transitions. [2019-11-16 00:19:44,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:19:44,367 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 403 [2019-11-16 00:19:44,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:19:44,368 INFO L225 Difference]: With dead ends: 2539 [2019-11-16 00:19:44,368 INFO L226 Difference]: Without dead ends: 0 [2019-11-16 00:19:44,371 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 405 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-16 00:19:44,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-16 00:19:44,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-16 00:19:44,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-16 00:19:44,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-16 00:19:44,371 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 403 [2019-11-16 00:19:44,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:19:44,372 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:19:44,372 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:19:44,372 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-16 00:19:44,372 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-16 00:19:44,577 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:19:44,581 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-16 00:19:45,556 WARN L191 SmtUtils]: Spent 395.00 ms on a formula simplification. DAG size of input: 244 DAG size of output: 194 [2019-11-16 00:19:46,006 WARN L191 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 244 DAG size of output: 194 [2019-11-16 00:19:46,364 WARN L191 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 57 [2019-11-16 00:19:46,844 WARN L191 SmtUtils]: Spent 478.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 62 [2019-11-16 00:19:47,201 WARN L191 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 57 [2019-11-16 00:19:47,428 WARN L191 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 47 [2019-11-16 00:19:47,672 WARN L191 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 33 [2019-11-16 00:19:47,918 WARN L191 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 47 [2019-11-16 00:19:48,154 WARN L191 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 47 [2019-11-16 00:19:48,427 WARN L191 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 29 [2019-11-16 00:19:48,605 WARN L191 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 46 [2019-11-16 00:19:48,809 WARN L191 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 46 [2019-11-16 00:19:48,942 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 14 [2019-11-16 00:19:49,098 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 47 [2019-11-16 00:19:49,285 WARN L191 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 14 [2019-11-16 00:19:49,543 WARN L191 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 52 [2019-11-16 00:19:50,673 WARN L191 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 181 DAG size of output: 68 [2019-11-16 00:19:50,819 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 6 [2019-11-16 00:19:50,965 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 48 [2019-11-16 00:19:52,040 WARN L191 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 181 DAG size of output: 68 [2019-11-16 00:19:52,183 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 29 [2019-11-16 00:19:52,184 INFO L443 ceAbstractionStarter]: For program point L630(lines 630 654) no Hoare annotation was computed. [2019-11-16 00:19:52,185 INFO L443 ceAbstractionStarter]: For program point L564(lines 564 568) no Hoare annotation was computed. [2019-11-16 00:19:52,185 INFO L443 ceAbstractionStarter]: For program point L498(lines 498 502) no Hoare annotation was computed. [2019-11-16 00:19:52,185 INFO L443 ceAbstractionStarter]: For program point L564-2(lines 564 568) no Hoare annotation was computed. [2019-11-16 00:19:52,185 INFO L443 ceAbstractionStarter]: For program point L498-2(lines 209 590) no Hoare annotation was computed. [2019-11-16 00:19:52,185 INFO L443 ceAbstractionStarter]: For program point L201(lines 201 595) no Hoare annotation was computed. [2019-11-16 00:19:52,185 INFO L443 ceAbstractionStarter]: For program point L168(lines 168 606) no Hoare annotation was computed. [2019-11-16 00:19:52,185 INFO L443 ceAbstractionStarter]: For program point L135(lines 135 617) no Hoare annotation was computed. [2019-11-16 00:19:52,185 INFO L443 ceAbstractionStarter]: For program point L102(lines 102 628) no Hoare annotation was computed. [2019-11-16 00:19:52,185 INFO L443 ceAbstractionStarter]: For program point L664(lines 664 668) no Hoare annotation was computed. [2019-11-16 00:19:52,185 INFO L443 ceAbstractionStarter]: For program point L631(lines 631 640) no Hoare annotation was computed. [2019-11-16 00:19:52,185 INFO L443 ceAbstractionStarter]: For program point L664-2(lines 664 668) no Hoare annotation was computed. [2019-11-16 00:19:52,186 INFO L443 ceAbstractionStarter]: For program point L631-2(lines 630 652) no Hoare annotation was computed. [2019-11-16 00:19:52,186 INFO L443 ceAbstractionStarter]: For program point L268(lines 268 272) no Hoare annotation was computed. [2019-11-16 00:19:52,186 INFO L439 ceAbstractionStarter]: At program point L202(lines 198 596) the Hoare annotation is: (let ((.cse0 (and (<= 8576 ULTIMATE.start_ssl3_accept_~s__state~0) (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 24576)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 16384)))))) (or (and .cse0 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) .cse0))) [2019-11-16 00:19:52,186 INFO L439 ceAbstractionStarter]: At program point L103(lines 102 628) the Hoare annotation is: false [2019-11-16 00:19:52,186 INFO L443 ceAbstractionStarter]: For program point L302(lines 302 306) no Hoare annotation was computed. [2019-11-16 00:19:52,186 INFO L443 ceAbstractionStarter]: For program point L302-2(lines 209 590) no Hoare annotation was computed. [2019-11-16 00:19:52,186 INFO L443 ceAbstractionStarter]: For program point L633(lines 633 637) no Hoare annotation was computed. [2019-11-16 00:19:52,186 INFO L443 ceAbstractionStarter]: For program point L204(lines 204 594) no Hoare annotation was computed. [2019-11-16 00:19:52,187 INFO L443 ceAbstractionStarter]: For program point L171(lines 171 605) no Hoare annotation was computed. [2019-11-16 00:19:52,187 INFO L443 ceAbstractionStarter]: For program point L138(lines 138 616) no Hoare annotation was computed. [2019-11-16 00:19:52,187 INFO L443 ceAbstractionStarter]: For program point L105(lines 105 627) no Hoare annotation was computed. [2019-11-16 00:19:52,187 INFO L443 ceAbstractionStarter]: For program point L337(lines 337 341) no Hoare annotation was computed. [2019-11-16 00:19:52,187 INFO L443 ceAbstractionStarter]: For program point L337-2(lines 209 590) no Hoare annotation was computed. [2019-11-16 00:19:52,187 INFO L439 ceAbstractionStarter]: At program point L205(lines 204 594) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) [2019-11-16 00:19:52,187 INFO L439 ceAbstractionStarter]: At program point L172(lines 168 606) the Hoare annotation is: (and (<= 8576 ULTIMATE.start_ssl3_accept_~s__state~0) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) [2019-11-16 00:19:52,187 INFO L439 ceAbstractionStarter]: At program point L139(lines 135 617) the Hoare annotation is: (let ((.cse0 (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 8192)) (<= 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))))) (or (and .cse0 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) .cse0))) [2019-11-16 00:19:52,187 INFO L443 ceAbstractionStarter]: For program point L73(lines 73 81) no Hoare annotation was computed. [2019-11-16 00:19:52,187 INFO L443 ceAbstractionStarter]: For program point L437(lines 437 449) no Hoare annotation was computed. [2019-11-16 00:19:52,188 INFO L439 ceAbstractionStarter]: At program point L404(lines 395 415) 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 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-16 00:19:52,188 INFO L443 ceAbstractionStarter]: For program point L437-2(lines 437 449) no Hoare annotation was computed. [2019-11-16 00:19:52,188 INFO L443 ceAbstractionStarter]: For program point L174(lines 174 604) no Hoare annotation was computed. [2019-11-16 00:19:52,188 INFO L443 ceAbstractionStarter]: For program point L141(lines 141 615) no Hoare annotation was computed. [2019-11-16 00:19:52,188 INFO L443 ceAbstractionStarter]: For program point L108(lines 108 626) no Hoare annotation was computed. [2019-11-16 00:19:52,188 INFO L439 ceAbstractionStarter]: At program point L208(lines 207 593) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) [2019-11-16 00:19:52,188 INFO L443 ceAbstractionStarter]: For program point L76(lines 76 80) no Hoare annotation was computed. [2019-11-16 00:19:52,188 INFO L443 ceAbstractionStarter]: For program point L76-2(lines 73 81) no Hoare annotation was computed. [2019-11-16 00:19:52,188 INFO L443 ceAbstractionStarter]: For program point L539(lines 539 544) no Hoare annotation was computed. [2019-11-16 00:19:52,188 INFO L443 ceAbstractionStarter]: For program point L440(lines 440 445) no Hoare annotation was computed. [2019-11-16 00:19:52,189 INFO L443 ceAbstractionStarter]: For program point L407(lines 407 411) no Hoare annotation was computed. [2019-11-16 00:19:52,189 INFO L443 ceAbstractionStarter]: For program point L242(lines 242 247) no Hoare annotation was computed. [2019-11-16 00:19:52,189 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 260) no Hoare annotation was computed. [2019-11-16 00:19:52,189 INFO L443 ceAbstractionStarter]: For program point L177(lines 177 603) no Hoare annotation was computed. [2019-11-16 00:19:52,189 INFO L443 ceAbstractionStarter]: For program point L144(lines 144 614) no Hoare annotation was computed. [2019-11-16 00:19:52,189 INFO L443 ceAbstractionStarter]: For program point L111(lines 111 625) no Hoare annotation was computed. [2019-11-16 00:19:52,189 INFO L443 ceAbstractionStarter]: For program point L574(lines 574 584) no Hoare annotation was computed. [2019-11-16 00:19:52,189 INFO L443 ceAbstractionStarter]: For program point L574-1(lines 574 584) no Hoare annotation was computed. [2019-11-16 00:19:52,189 INFO L443 ceAbstractionStarter]: For program point L508(lines 508 512) no Hoare annotation was computed. [2019-11-16 00:19:52,189 INFO L443 ceAbstractionStarter]: For program point L508-2(lines 508 512) no Hoare annotation was computed. [2019-11-16 00:19:52,189 INFO L439 ceAbstractionStarter]: At program point L178(lines 174 604) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse1 (<= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) .cse0 .cse1) (and .cse0 .cse1 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-16 00:19:52,189 INFO L439 ceAbstractionStarter]: At program point L145(lines 141 615) the Hoare annotation is: (and (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-16 00:19:52,189 INFO L443 ceAbstractionStarter]: For program point L476(lines 476 480) no Hoare annotation was computed. [2019-11-16 00:19:52,190 INFO L439 ceAbstractionStarter]: At program point L212(lines 105 627) the Hoare annotation is: false [2019-11-16 00:19:52,190 INFO L446 ceAbstractionStarter]: At program point L675(lines 65 677) the Hoare annotation is: true [2019-11-16 00:19:52,190 INFO L443 ceAbstractionStarter]: For program point L642(lines 642 648) no Hoare annotation was computed. [2019-11-16 00:19:52,190 INFO L443 ceAbstractionStarter]: For program point L345(lines 345 377) no Hoare annotation was computed. [2019-11-16 00:19:52,190 INFO L443 ceAbstractionStarter]: For program point L312(lines 312 316) no Hoare annotation was computed. [2019-11-16 00:19:52,190 INFO L443 ceAbstractionStarter]: For program point L312-2(lines 312 316) no Hoare annotation was computed. [2019-11-16 00:19:52,190 INFO L443 ceAbstractionStarter]: For program point L180(lines 180 602) no Hoare annotation was computed. [2019-11-16 00:19:52,190 INFO L443 ceAbstractionStarter]: For program point L147(lines 147 613) no Hoare annotation was computed. [2019-11-16 00:19:52,190 INFO L443 ceAbstractionStarter]: For program point L114(lines 114 624) no Hoare annotation was computed. [2019-11-16 00:19:52,190 INFO L446 ceAbstractionStarter]: At program point L676(lines 10 678) the Hoare annotation is: true [2019-11-16 00:19:52,190 INFO L443 ceAbstractionStarter]: For program point L577(lines 577 581) no Hoare annotation was computed. [2019-11-16 00:19:52,191 INFO L443 ceAbstractionStarter]: For program point L83(lines 83 91) no Hoare annotation was computed. [2019-11-16 00:19:52,191 INFO L443 ceAbstractionStarter]: For program point L83-1(lines 65 677) no Hoare annotation was computed. [2019-11-16 00:19:52,191 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 260) no Hoare annotation was computed. [2019-11-16 00:19:52,191 INFO L443 ceAbstractionStarter]: For program point L348(lines 348 376) no Hoare annotation was computed. [2019-11-16 00:19:52,191 INFO L443 ceAbstractionStarter]: For program point L348-1(lines 348 376) no Hoare annotation was computed. [2019-11-16 00:19:52,191 INFO L443 ceAbstractionStarter]: For program point L249(lines 249 262) no Hoare annotation was computed. [2019-11-16 00:19:52,191 INFO L443 ceAbstractionStarter]: For program point L183(lines 183 601) no Hoare annotation was computed. [2019-11-16 00:19:52,191 INFO L443 ceAbstractionStarter]: For program point L150(lines 150 612) no Hoare annotation was computed. [2019-11-16 00:19:52,191 INFO L443 ceAbstractionStarter]: For program point L117(lines 117 623) no Hoare annotation was computed. [2019-11-16 00:19:52,191 INFO L443 ceAbstractionStarter]: For program point L84(lines 84 88) no Hoare annotation was computed. [2019-11-16 00:19:52,192 INFO L443 ceAbstractionStarter]: For program point L349(lines 349 373) no Hoare annotation was computed. [2019-11-16 00:19:52,192 INFO L443 ceAbstractionStarter]: For program point L217(lines 217 221) no Hoare annotation was computed. [2019-11-16 00:19:52,192 INFO L439 ceAbstractionStarter]: At program point L184(lines 180 602) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse1 (<= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) .cse0 .cse1) (and .cse0 .cse1 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-16 00:19:52,192 INFO L439 ceAbstractionStarter]: At program point L151(lines 147 613) 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 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-16 00:19:52,192 INFO L443 ceAbstractionStarter]: For program point L217-2(lines 209 590) no Hoare annotation was computed. [2019-11-16 00:19:52,192 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-16 00:19:52,192 INFO L443 ceAbstractionStarter]: For program point L251(lines 251 256) no Hoare annotation was computed. [2019-11-16 00:19:52,192 INFO L443 ceAbstractionStarter]: For program point L549(lines 549 557) no Hoare annotation was computed. [2019-11-16 00:19:52,192 INFO L443 ceAbstractionStarter]: For program point L285(lines 285 289) no Hoare annotation was computed. [2019-11-16 00:19:52,192 INFO L443 ceAbstractionStarter]: For program point L285-2(lines 209 590) no Hoare annotation was computed. [2019-11-16 00:19:52,193 INFO L443 ceAbstractionStarter]: For program point L186(lines 186 600) no Hoare annotation was computed. [2019-11-16 00:19:52,193 INFO L443 ceAbstractionStarter]: For program point L153(lines 153 611) no Hoare annotation was computed. [2019-11-16 00:19:52,193 INFO L443 ceAbstractionStarter]: For program point L120(lines 120 622) no Hoare annotation was computed. [2019-11-16 00:19:52,193 INFO L443 ceAbstractionStarter]: For program point L385(lines 385 416) no Hoare annotation was computed. [2019-11-16 00:19:52,193 INFO L443 ceAbstractionStarter]: For program point L352(lines 352 372) no Hoare annotation was computed. [2019-11-16 00:19:52,193 INFO L439 ceAbstractionStarter]: At program point L121(lines 117 623) the Hoare annotation is: false [2019-11-16 00:19:52,193 INFO L443 ceAbstractionStarter]: For program point L386(lines 386 392) no Hoare annotation was computed. [2019-11-16 00:19:52,193 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 258) no Hoare annotation was computed. [2019-11-16 00:19:52,193 INFO L443 ceAbstractionStarter]: For program point L552(lines 552 556) no Hoare annotation was computed. [2019-11-16 00:19:52,194 INFO L443 ceAbstractionStarter]: For program point L519(lines 519 524) no Hoare annotation was computed. [2019-11-16 00:19:52,194 INFO L443 ceAbstractionStarter]: For program point L354(lines 354 358) no Hoare annotation was computed. [2019-11-16 00:19:52,194 INFO L443 ceAbstractionStarter]: For program point L321-1(lines 321 330) no Hoare annotation was computed. [2019-11-16 00:19:52,194 INFO L443 ceAbstractionStarter]: For program point L354-2(lines 352 370) no Hoare annotation was computed. [2019-11-16 00:19:52,194 INFO L443 ceAbstractionStarter]: For program point L189(lines 189 599) no Hoare annotation was computed. [2019-11-16 00:19:52,194 INFO L443 ceAbstractionStarter]: For program point L156(lines 156 610) no Hoare annotation was computed. [2019-11-16 00:19:52,194 INFO L443 ceAbstractionStarter]: For program point L123(lines 123 621) no Hoare annotation was computed. [2019-11-16 00:19:52,195 INFO L439 ceAbstractionStarter]: At program point L553(lines 65 677) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) [2019-11-16 00:19:52,195 INFO L443 ceAbstractionStarter]: For program point L487(lines 487 491) no Hoare annotation was computed. [2019-11-16 00:19:52,195 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-16 00:19:52,195 INFO L439 ceAbstractionStarter]: At program point L190(lines 186 600) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse2 (<= 8576 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 24576))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 16384)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-16 00:19:52,195 INFO L439 ceAbstractionStarter]: At program point L157(lines 153 611) 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 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-16 00:19:52,196 INFO L439 ceAbstractionStarter]: At program point L124(lines 123 621) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8192))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse13 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8195))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2019-11-16 00:19:52,196 INFO L443 ceAbstractionStarter]: For program point L455(lines 455 459) no Hoare annotation was computed. [2019-11-16 00:19:52,196 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 258) no Hoare annotation was computed. [2019-11-16 00:19:52,196 INFO L443 ceAbstractionStarter]: For program point L258(line 258) no Hoare annotation was computed. [2019-11-16 00:19:52,196 INFO L443 ceAbstractionStarter]: For program point L258-1(line 258) no Hoare annotation was computed. [2019-11-16 00:19:52,196 INFO L443 ceAbstractionStarter]: For program point L192(lines 192 598) no Hoare annotation was computed. [2019-11-16 00:19:52,196 INFO L443 ceAbstractionStarter]: For program point L159(lines 159 609) no Hoare annotation was computed. [2019-11-16 00:19:52,196 INFO L443 ceAbstractionStarter]: For program point L126(lines 126 620) no Hoare annotation was computed. [2019-11-16 00:19:52,197 INFO L446 ceAbstractionStarter]: At program point L688(lines 679 690) the Hoare annotation is: true [2019-11-16 00:19:52,197 INFO L443 ceAbstractionStarter]: For program point L325(lines 325 329) no Hoare annotation was computed. [2019-11-16 00:19:52,197 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-16 00:19:52,197 INFO L443 ceAbstractionStarter]: For program point L260(line 260) no Hoare annotation was computed. [2019-11-16 00:19:52,197 INFO L443 ceAbstractionStarter]: For program point L260-1(line 260) no Hoare annotation was computed. [2019-11-16 00:19:52,197 INFO L439 ceAbstractionStarter]: At program point L591(lines 99 659) the Hoare annotation is: (let ((.cse12 (<= 8576 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0)) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8192))) (.cse11 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8195))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse13 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)))) (or (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) .cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 24576)) .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse4 .cse5 .cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 16384)) .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse2 .cse3 .cse4 .cse8 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse7 .cse11 .cse9 .cse10 .cse12) (and .cse0 .cse2 .cse3 .cse4 .cse8 .cse1 .cse7 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse11 .cse9 .cse10 .cse12 .cse13) (and .cse0 .cse2 .cse3 .cse4 .cse6 .cse8 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse7 .cse11 .cse9 .cse10) (and (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse11 .cse9 .cse10) .cse13))) [2019-11-16 00:19:52,197 INFO L443 ceAbstractionStarter]: For program point L558(lines 558 562) no Hoare annotation was computed. [2019-11-16 00:19:52,197 INFO L443 ceAbstractionStarter]: For program point L426(lines 426 430) no Hoare annotation was computed. [2019-11-16 00:19:52,197 INFO L439 ceAbstractionStarter]: At program point L360(lines 342 378) 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 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-16 00:19:52,197 INFO L443 ceAbstractionStarter]: For program point L195(lines 195 597) no Hoare annotation was computed. [2019-11-16 00:19:52,197 INFO L443 ceAbstractionStarter]: For program point L162(lines 162 608) no Hoare annotation was computed. [2019-11-16 00:19:52,198 INFO L443 ceAbstractionStarter]: For program point L129(lines 129 619) no Hoare annotation was computed. [2019-11-16 00:19:52,198 INFO L443 ceAbstractionStarter]: For program point L526(lines 526 530) no Hoare annotation was computed. [2019-11-16 00:19:52,198 INFO L443 ceAbstractionStarter]: For program point L460(lines 460 471) no Hoare annotation was computed. [2019-11-16 00:19:52,198 INFO L443 ceAbstractionStarter]: For program point L526-2(lines 209 590) no Hoare annotation was computed. [2019-11-16 00:19:52,198 INFO L439 ceAbstractionStarter]: At program point L394(lines 385 416) 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 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-16 00:19:52,198 INFO L443 ceAbstractionStarter]: For program point L229(lines 229 240) no Hoare annotation was computed. [2019-11-16 00:19:52,198 INFO L439 ceAbstractionStarter]: At program point L196(lines 192 598) the Hoare annotation is: (let ((.cse0 (and (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 24576)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 16384))) (<= 8576 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and .cse0 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) .cse0))) [2019-11-16 00:19:52,198 INFO L439 ceAbstractionStarter]: At program point L163(lines 159 609) 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 8545)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529)) (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-16 00:19:52,198 INFO L443 ceAbstractionStarter]: For program point L229-2(lines 229 240) no Hoare annotation was computed. [2019-11-16 00:19:52,199 INFO L443 ceAbstractionStarter]: For program point L362(lines 362 366) no Hoare annotation was computed. [2019-11-16 00:19:52,199 INFO L446 ceAbstractionStarter]: At program point L660(lines 98 661) the Hoare annotation is: true [2019-11-16 00:19:52,199 INFO L443 ceAbstractionStarter]: For program point L396(lines 396 402) no Hoare annotation was computed. [2019-11-16 00:19:52,199 INFO L443 ceAbstractionStarter]: For program point L231(lines 231 236) no Hoare annotation was computed. [2019-11-16 00:19:52,199 INFO L443 ceAbstractionStarter]: For program point L198(lines 198 596) no Hoare annotation was computed. [2019-11-16 00:19:52,199 INFO L443 ceAbstractionStarter]: For program point L165(lines 165 607) no Hoare annotation was computed. [2019-11-16 00:19:52,199 INFO L443 ceAbstractionStarter]: For program point L132(lines 132 618) no Hoare annotation was computed. [2019-11-16 00:19:52,200 INFO L439 ceAbstractionStarter]: At program point L99-2(lines 99 659) the Hoare annotation is: (let ((.cse12 (<= 8576 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0)) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8192))) (.cse11 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8195))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse13 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)))) (or (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) .cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 24576)) .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse4 .cse5 .cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 16384)) .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse2 .cse3 .cse4 .cse8 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse7 .cse11 .cse9 .cse10 .cse12) (and .cse0 .cse2 .cse3 .cse4 .cse8 .cse1 .cse7 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse11 .cse9 .cse10 .cse12 .cse13) (and .cse0 .cse2 .cse3 .cse4 .cse6 .cse8 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse7 .cse11 .cse9 .cse10) (and (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse11 .cse9 .cse10) .cse13))) [2019-11-16 00:19:52,200 INFO L439 ceAbstractionStarter]: At program point L166(lines 165 607) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8192))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.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))) (.cse15 (<= 8576 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse12 .cse13 .cse14 .cse15 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse16 .cse8 .cse9 .cse10 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse16 .cse8 .cse9 .cse10 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse11 .cse12 .cse13 .cse14 .cse15))) [2019-11-16 00:19:52,200 INFO L439 ceAbstractionStarter]: At program point L133(lines 126 620) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8192))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse13 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8195))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2019-11-16 00:19:52,201 INFO L443 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-11-16 00:19:52,201 INFO L443 ceAbstractionStarter]: For program point L629(lines 629 657) no Hoare annotation was computed. [2019-11-16 00:19:52,201 INFO L443 ceAbstractionStarter]: For program point L464(lines 464 468) no Hoare annotation was computed. [2019-11-16 00:19:52,236 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:19:52 BoogieIcfgContainer [2019-11-16 00:19:52,236 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-16 00:19:52,237 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:19:52,237 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:19:52,237 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:19:52,237 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:19:34" (3/4) ... [2019-11-16 00:19:52,240 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-16 00:19:52,257 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-16 00:19:52,258 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-16 00:19:52,371 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_9ea5bdf7-d11a-426d-b9e5-17c861eac7b2/bin/uautomizer/witness.graphml [2019-11-16 00:19:52,371 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:19:52,372 INFO L168 Benchmark]: Toolchain (without parser) took 19399.95 ms. Allocated memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: 639.1 MB). Free memory was 946.2 MB in the beginning and 1.3 GB in the end (delta: -305.3 MB). Peak memory consumption was 333.8 MB. Max. memory is 11.5 GB. [2019-11-16 00:19:52,373 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:19:52,373 INFO L168 Benchmark]: CACSL2BoogieTranslator took 387.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 946.2 MB in the beginning and 1.1 GB in the end (delta: -187.9 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. [2019-11-16 00:19:52,373 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.53 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-16 00:19:52,374 INFO L168 Benchmark]: Boogie Preprocessor took 79.41 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-16 00:19:52,374 INFO L168 Benchmark]: RCFGBuilder took 878.65 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: 59.1 MB). Peak memory consumption was 59.1 MB. Max. memory is 11.5 GB. [2019-11-16 00:19:52,375 INFO L168 Benchmark]: TraceAbstraction took 17858.60 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 489.2 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -198.3 MB). Peak memory consumption was 662.2 MB. Max. memory is 11.5 GB. [2019-11-16 00:19:52,375 INFO L168 Benchmark]: Witness Printer took 134.58 ms. Allocated memory is still 1.7 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 21.8 MB). Peak memory consumption was 21.8 MB. Max. memory is 11.5 GB. [2019-11-16 00:19:52,377 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.23 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 387.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 946.2 MB in the beginning and 1.1 GB in the end (delta: -187.9 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 57.53 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. * Boogie Preprocessor took 79.41 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 878.65 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: 59.1 MB). Peak memory consumption was 59.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 17858.60 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 489.2 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -198.3 MB). Peak memory consumption was 662.2 MB. Max. memory is 11.5 GB. * Witness Printer took 134.58 ms. Allocated memory is still 1.7 GB. Free memory was 1.3 GB in the beginning and 1.3 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: 258]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 258]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 260]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 260]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - InvariantResult [Line: 10]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 126]: Loop Invariant Derived loop invariant: ((((((((((((((((!(s__state == 8513) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8192)) && !(s__state == 8496)) && !(s__state == 8545)) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480)) && !(0 == s__hit)) || ((((((((((((((((!(s__state == 8513) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8192)) && !(s__state == 8496)) && !(s__state == 8545)) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480)) - InvariantResult [Line: 207]: Loop Invariant Derived loop invariant: !(s__state == 12292) - InvariantResult [Line: 165]: Loop Invariant Derived loop invariant: ((((((((((((((((((!(s__state == 8513) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8192)) && !(s__state == 8496)) && !(s__state == 8545)) && !(s__state == 8497)) && s__s3__tmp__next_state___0 <= 8640) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480)) && 8576 <= s__s3__tmp__next_state___0) && !(0 == s__hit)) || ((((((((((((((((!(s__state == 8513) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8192)) && !(s__state == 8496)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 3) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480))) || (((((((((((((((((!(s__state == 8513) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8192)) && !(s__state == 8496)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480)) && 8576 <= s__s3__tmp__next_state___0) - InvariantResult [Line: 123]: Loop Invariant Derived loop invariant: ((((((((((((((((!(s__state == 8513) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8192)) && !(s__state == 8496)) && !(s__state == 8545)) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480)) && !(0 == s__hit)) || ((((((((((((((((!(s__state == 8513) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8192)) && !(s__state == 8496)) && !(s__state == 8545)) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480)) - InvariantResult [Line: 153]: Loop Invariant Derived loop invariant: (((((((((((((!(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: 186]: Loop Invariant Derived loop invariant: ((((((((!(s__state == 8657) && !(s__state == 8672)) && 8576 <= s__state) && !(s__state == 24576)) && !(s__state == 12292)) && !(s__state == 8673)) && !(s__state == 8656)) && !(s__state == 8576)) && !(s__state == 16384)) || ((((((((!(s__state == 8657) && !(s__state == 8672)) && 8576 <= s__state) && !(s__state == 24576)) && !(s__state == 12292)) && !(s__state == 8673)) && !(s__state == 8656)) && !(s__state == 16384)) && !(0 == s__hit)) - InvariantResult [Line: 385]: Loop Invariant Derived loop invariant: (((((((((((((!(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: 105]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 395]: Loop Invariant Derived loop invariant: (((((((((((((!(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: 198]: Loop Invariant Derived loop invariant: ((8576 <= s__state && (((!(s__state == 8657) && !(s__state == 24576)) && !(s__state == 12292)) && !(s__state == 8656)) && !(s__state == 16384)) && !(0 == s__hit)) || (!(s__state == 8576) && 8576 <= s__state && (((!(s__state == 8657) && !(s__state == 24576)) && !(s__state == 12292)) && !(s__state == 8656)) && !(s__state == 16384)) - InvariantResult [Line: 342]: Loop Invariant Derived loop invariant: (((((((((((((!(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: 147]: Loop Invariant Derived loop invariant: (((((((((((((!(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: ((!(s__state == 8576) && s__state <= 8640) && 8576 <= s__state) || ((s__state <= 8640 && 8576 <= s__state) && !(0 == s__hit)) - InvariantResult [Line: 65]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 141]: Loop Invariant Derived loop invariant: (((((((((((((!(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: 174]: Loop Invariant Derived loop invariant: ((!(s__state == 8576) && s__state <= 8640) && 8576 <= s__state) || ((s__state <= 8640 && 8576 <= s__state) && !(0 == s__hit)) - InvariantResult [Line: 65]: Loop Invariant Derived loop invariant: !(s__state == 12292) - InvariantResult [Line: 135]: 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 == 8192)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480)) && !(0 == s__hit)) || (!(s__state == 8576) && ((((((((((((!(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)) - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: ((((((((((((((((((!(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 == 8513) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8192)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480)) && 8576 <= s__s3__tmp__next_state___0)) || ((((((((((((!(s__state == 8513) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8192)) && !(s__state == 8545)) && !(s__state == 8497)) && s__s3__tmp__next_state___0 <= 8640) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480)) && 8576 <= s__s3__tmp__next_state___0) && !(0 == s__hit))) || (((((((((((!(s__state == 8513) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8192)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 3) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480))) || (((((((((((!(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)) - InvariantResult [Line: 168]: Loop Invariant Derived loop invariant: 8576 <= s__state && s__state <= 8640 - InvariantResult [Line: 204]: Loop Invariant Derived loop invariant: !(s__state == 12292) - InvariantResult [Line: 679]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 159]: Loop Invariant Derived loop invariant: (((((((((((((!(s__state == 8513) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8545)) && !(s__state == 8529)) && !(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: 117]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: ((((((((((((((((((!(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 == 8513) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8192)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480)) && 8576 <= s__s3__tmp__next_state___0)) || ((((((((((((!(s__state == 8513) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8192)) && !(s__state == 8545)) && !(s__state == 8497)) && s__s3__tmp__next_state___0 <= 8640) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480)) && 8576 <= s__s3__tmp__next_state___0) && !(0 == s__hit))) || (((((((((((!(s__state == 8513) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8192)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 3) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480))) || (((((((((((!(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)) - InvariantResult [Line: 192]: Loop Invariant Derived loop invariant: ((((((!(s__state == 8672) && !(s__state == 24576)) && !(s__state == 12292)) && !(s__state == 8673)) && !(s__state == 16384)) && 8576 <= s__state) && !(0 == s__hit)) || (!(s__state == 8576) && ((((!(s__state == 8672) && !(s__state == 24576)) && !(s__state == 12292)) && !(s__state == 8673)) && !(s__state == 16384)) && 8576 <= s__state) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 146 locations, 4 error locations. Result: SAFE, OverallTime: 17.7s, OverallIterations: 32, TraceHistogramMax: 14, AutomataDifference: 5.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 7.6s, HoareTripleCheckerStatistics: 5368 SDtfs, 4720 SDslu, 2130 SDs, 0 SdLazy, 3171 SolverSat, 1069 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 964 GetRequests, 924 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1087occurred in iteration=31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 32 MinimizatonAttempts, 1658 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 29 LocationsWithAnnotation, 29 PreInvPairs, 206 NumberOfFragments, 1821 HoareAnnotationTreeSize, 29 FomulaSimplifications, 240351 FormulaSimplificationTreeSizeReduction, 1.4s HoareSimplificationTime, 29 FomulaSimplificationsInter, 93512 FormulaSimplificationTreeSizeReductionInter, 6.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 5109 NumberOfCodeBlocks, 5109 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 5073 ConstructedInterpolants, 0 QuantifiedInterpolants, 1687384 SizeOfPredicates, 8 NumberOfNonLiveVariables, 1558 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 36 InterpolantComputations, 28 PerfectInterpolantSequences, 11171/11219 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...