./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 f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_638d51d2-c7d7-46a6-9da6-e0d0e057e8f0/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_638d51d2-c7d7-46a6-9da6-e0d0e057e8f0/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_638d51d2-c7d7-46a6-9da6-e0d0e057e8f0/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_638d51d2-c7d7-46a6-9da6-e0d0e057e8f0/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_638d51d2-c7d7-46a6-9da6-e0d0e057e8f0/bin/uautomizer/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_638d51d2-c7d7-46a6-9da6-e0d0e057e8f0/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.25-f470102 [2019-12-07 11:06:58,052 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 11:06:58,053 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 11:06:58,061 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 11:06:58,061 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 11:06:58,062 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 11:06:58,063 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 11:06:58,064 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 11:06:58,065 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 11:06:58,066 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 11:06:58,067 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 11:06:58,067 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 11:06:58,068 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 11:06:58,068 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 11:06:58,069 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 11:06:58,070 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 11:06:58,070 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 11:06:58,071 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 11:06:58,073 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 11:06:58,074 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 11:06:58,075 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 11:06:58,076 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 11:06:58,076 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 11:06:58,077 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 11:06:58,079 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 11:06:58,079 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 11:06:58,079 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 11:06:58,079 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 11:06:58,080 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 11:06:58,080 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 11:06:58,080 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 11:06:58,081 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 11:06:58,081 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 11:06:58,082 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 11:06:58,082 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 11:06:58,082 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 11:06:58,083 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 11:06:58,083 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 11:06:58,083 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 11:06:58,083 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 11:06:58,084 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 11:06:58,084 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_638d51d2-c7d7-46a6-9da6-e0d0e057e8f0/bin/uautomizer/config/svcomp-Overflow-32bit-Automizer_Default.epf [2019-12-07 11:06:58,095 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 11:06:58,095 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 11:06:58,096 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 11:06:58,096 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 11:06:58,096 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 11:06:58,097 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 11:06:58,097 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 11:06:58,097 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 11:06:58,097 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 11:06:58,097 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 11:06:58,098 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 11:06:58,098 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 11:06:58,098 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 11:06:58,098 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 11:06:58,099 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2019-12-07 11:06:58,099 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 11:06:58,099 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 11:06:58,099 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 11:06:58,099 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 11:06:58,100 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 11:06:58,100 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 11:06:58,100 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 11:06:58,100 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 11:06:58,100 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 11:06:58,101 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 11:06:58,101 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 11:06:58,101 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 11:06:58,101 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 11:06:58,101 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 11:06:58,102 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 11:06:58,102 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 11:06:58,102 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_638d51d2-c7d7-46a6-9da6-e0d0e057e8f0/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-12-07 11:06:58,209 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 11:06:58,217 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 11:06:58,219 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 11:06:58,220 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 11:06:58,220 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 11:06:58,220 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_638d51d2-c7d7-46a6-9da6-e0d0e057e8f0/bin/uautomizer/../../sv-benchmarks/c/bitvector/s3_srvr_1a.BV.c.cil.c [2019-12-07 11:06:58,259 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_638d51d2-c7d7-46a6-9da6-e0d0e057e8f0/bin/uautomizer/data/81a5aa0fc/b15d8b9194e24876bd813a2daed6e742/FLAGf05a162b3 [2019-12-07 11:06:58,672 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 11:06:58,673 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_638d51d2-c7d7-46a6-9da6-e0d0e057e8f0/sv-benchmarks/c/bitvector/s3_srvr_1a.BV.c.cil.c [2019-12-07 11:06:58,681 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_638d51d2-c7d7-46a6-9da6-e0d0e057e8f0/bin/uautomizer/data/81a5aa0fc/b15d8b9194e24876bd813a2daed6e742/FLAGf05a162b3 [2019-12-07 11:06:58,690 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_638d51d2-c7d7-46a6-9da6-e0d0e057e8f0/bin/uautomizer/data/81a5aa0fc/b15d8b9194e24876bd813a2daed6e742 [2019-12-07 11:06:58,692 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 11:06:58,693 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 11:06:58,693 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 11:06:58,693 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 11:06:58,696 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 11:06:58,696 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:06:58" (1/1) ... [2019-12-07 11:06:58,698 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@408e5454 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:06:58, skipping insertion in model container [2019-12-07 11:06:58,698 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:06:58" (1/1) ... [2019-12-07 11:06:58,703 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 11:06:58,728 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 11:06:58,896 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:06:58,898 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 11:06:58,934 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:06:58,943 INFO L208 MainTranslator]: Completed translation [2019-12-07 11:06:58,943 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:06:58 WrapperNode [2019-12-07 11:06:58,943 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 11:06:58,944 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 11:06:58,944 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 11:06:58,944 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 11:06:58,949 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:06:58" (1/1) ... [2019-12-07 11:06:58,956 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:06:58" (1/1) ... [2019-12-07 11:06:58,979 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 11:06:58,979 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 11:06:58,979 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 11:06:58,979 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 11:06:58,986 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:06:58" (1/1) ... [2019-12-07 11:06:58,986 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:06:58" (1/1) ... [2019-12-07 11:06:58,988 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:06:58" (1/1) ... [2019-12-07 11:06:58,988 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:06:58" (1/1) ... [2019-12-07 11:06:58,994 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:06:58" (1/1) ... [2019-12-07 11:06:59,000 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:06:58" (1/1) ... [2019-12-07 11:06:59,002 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:06:58" (1/1) ... [2019-12-07 11:06:59,004 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 11:06:59,004 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 11:06:59,004 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 11:06:59,005 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 11:06:59,005 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:06:58" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_638d51d2-c7d7-46a6-9da6-e0d0e057e8f0/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-12-07 11:06:59,045 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 11:06:59,045 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 11:06:59,119 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 11:06:59,416 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-12-07 11:06:59,416 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-12-07 11:06:59,417 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 11:06:59,418 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 11:06:59,419 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:06:59 BoogieIcfgContainer [2019-12-07 11:06:59,419 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 11:06:59,420 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 11:06:59,420 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 11:06:59,422 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 11:06:59,422 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 11:06:58" (1/3) ... [2019-12-07 11:06:59,423 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28c5ed05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:06:59, skipping insertion in model container [2019-12-07 11:06:59,423 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:06:58" (2/3) ... [2019-12-07 11:06:59,423 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28c5ed05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:06:59, skipping insertion in model container [2019-12-07 11:06:59,424 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:06:59" (3/3) ... [2019-12-07 11:06:59,425 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_1a.BV.c.cil.c [2019-12-07 11:06:59,432 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 11:06:59,436 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-12-07 11:06:59,443 INFO L249 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-12-07 11:06:59,460 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 11:06:59,460 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 11:06:59,461 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 11:06:59,461 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 11:06:59,461 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 11:06:59,461 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 11:06:59,461 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 11:06:59,461 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 11:06:59,474 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states. [2019-12-07 11:06:59,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 11:06:59,478 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:06:59,478 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:06:59,479 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 11:06:59,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:06:59,483 INFO L82 PathProgramCache]: Analyzing trace with hash -1272360941, now seen corresponding path program 1 times [2019-12-07 11:06:59,488 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:06:59,489 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500248492] [2019-12-07 11:06:59,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:06:59,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:06:59,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:06:59,609 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500248492] [2019-12-07 11:06:59,610 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:06:59,610 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:06:59,611 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804817385] [2019-12-07 11:06:59,614 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:06:59,614 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:06:59,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:06:59,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:06:59,624 INFO L87 Difference]: Start difference. First operand 146 states. Second operand 3 states. [2019-12-07 11:06:59,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:06:59,741 INFO L93 Difference]: Finished difference Result 311 states and 519 transitions. [2019-12-07 11:06:59,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:06:59,742 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-07 11:06:59,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:06:59,750 INFO L225 Difference]: With dead ends: 311 [2019-12-07 11:06:59,750 INFO L226 Difference]: Without dead ends: 149 [2019-12-07 11:06:59,753 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:06:59,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-12-07 11:06:59,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2019-12-07 11:06:59,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-12-07 11:06:59,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 224 transitions. [2019-12-07 11:06:59,786 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 224 transitions. Word has length 17 [2019-12-07 11:06:59,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:06:59,786 INFO L462 AbstractCegarLoop]: Abstraction has 149 states and 224 transitions. [2019-12-07 11:06:59,786 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:06:59,786 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 224 transitions. [2019-12-07 11:06:59,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 11:06:59,787 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:06:59,787 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:06:59,787 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 11:06:59,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:06:59,787 INFO L82 PathProgramCache]: Analyzing trace with hash -1039871977, now seen corresponding path program 1 times [2019-12-07 11:06:59,787 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:06:59,788 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617796126] [2019-12-07 11:06:59,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:06:59,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:06:59,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:06:59,816 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617796126] [2019-12-07 11:06:59,816 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:06:59,816 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:06:59,817 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417606428] [2019-12-07 11:06:59,818 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:06:59,818 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:06:59,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:06:59,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:06:59,818 INFO L87 Difference]: Start difference. First operand 149 states and 224 transitions. Second operand 3 states. [2019-12-07 11:06:59,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:06:59,898 INFO L93 Difference]: Finished difference Result 301 states and 450 transitions. [2019-12-07 11:06:59,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:06:59,899 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 11:06:59,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:06:59,900 INFO L225 Difference]: With dead ends: 301 [2019-12-07 11:06:59,900 INFO L226 Difference]: Without dead ends: 159 [2019-12-07 11:06:59,901 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:06:59,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-12-07 11:06:59,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 150. [2019-12-07 11:06:59,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-12-07 11:06:59,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 225 transitions. [2019-12-07 11:06:59,911 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 225 transitions. Word has length 18 [2019-12-07 11:06:59,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:06:59,911 INFO L462 AbstractCegarLoop]: Abstraction has 150 states and 225 transitions. [2019-12-07 11:06:59,911 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:06:59,911 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 225 transitions. [2019-12-07 11:06:59,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 11:06:59,912 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:06:59,912 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:06:59,912 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 11:06:59,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:06:59,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1005531851, now seen corresponding path program 1 times [2019-12-07 11:06:59,913 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:06:59,913 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693846779] [2019-12-07 11:06:59,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:06:59,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:06:59,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:06:59,937 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693846779] [2019-12-07 11:06:59,937 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:06:59,937 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:06:59,937 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115413680] [2019-12-07 11:06:59,937 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:06:59,937 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:06:59,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:06:59,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:06:59,938 INFO L87 Difference]: Start difference. First operand 150 states and 225 transitions. Second operand 3 states. [2019-12-07 11:07:00,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:07:00,012 INFO L93 Difference]: Finished difference Result 303 states and 452 transitions. [2019-12-07 11:07:00,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:07:00,012 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-07 11:07:00,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:07:00,014 INFO L225 Difference]: With dead ends: 303 [2019-12-07 11:07:00,014 INFO L226 Difference]: Without dead ends: 160 [2019-12-07 11:07:00,015 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:07:00,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-12-07 11:07:00,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 151. [2019-12-07 11:07:00,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-12-07 11:07:00,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 226 transitions. [2019-12-07 11:07:00,027 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 226 transitions. Word has length 19 [2019-12-07 11:07:00,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:07:00,027 INFO L462 AbstractCegarLoop]: Abstraction has 151 states and 226 transitions. [2019-12-07 11:07:00,027 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:07:00,028 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 226 transitions. [2019-12-07 11:07:00,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 11:07:00,028 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:07:00,029 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:07:00,029 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 11:07:00,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:07:00,029 INFO L82 PathProgramCache]: Analyzing trace with hash -994026446, now seen corresponding path program 1 times [2019-12-07 11:07:00,030 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:07:00,030 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477637454] [2019-12-07 11:07:00,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:07:00,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:07:00,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:07:00,060 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477637454] [2019-12-07 11:07:00,061 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:07:00,061 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:07:00,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609747567] [2019-12-07 11:07:00,061 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:07:00,062 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:07:00,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:07:00,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:07:00,062 INFO L87 Difference]: Start difference. First operand 151 states and 226 transitions. Second operand 3 states. [2019-12-07 11:07:00,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:07:00,156 INFO L93 Difference]: Finished difference Result 305 states and 454 transitions. [2019-12-07 11:07:00,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:07:00,156 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-07 11:07:00,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:07:00,158 INFO L225 Difference]: With dead ends: 305 [2019-12-07 11:07:00,158 INFO L226 Difference]: Without dead ends: 161 [2019-12-07 11:07:00,159 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:07:00,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-12-07 11:07:00,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 152. [2019-12-07 11:07:00,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-12-07 11:07:00,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 227 transitions. [2019-12-07 11:07:00,170 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 227 transitions. Word has length 20 [2019-12-07 11:07:00,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:07:00,170 INFO L462 AbstractCegarLoop]: Abstraction has 152 states and 227 transitions. [2019-12-07 11:07:00,170 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:07:00,170 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 227 transitions. [2019-12-07 11:07:00,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 11:07:00,171 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:07:00,171 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:07:00,171 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 11:07:00,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:07:00,172 INFO L82 PathProgramCache]: Analyzing trace with hash 461608262, now seen corresponding path program 1 times [2019-12-07 11:07:00,172 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:07:00,172 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555084116] [2019-12-07 11:07:00,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:07:00,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:07:00,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:07:00,200 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555084116] [2019-12-07 11:07:00,200 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:07:00,200 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:07:00,200 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537201666] [2019-12-07 11:07:00,201 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:07:00,201 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:07:00,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:07:00,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:07:00,201 INFO L87 Difference]: Start difference. First operand 152 states and 227 transitions. Second operand 3 states. [2019-12-07 11:07:00,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:07:00,288 INFO L93 Difference]: Finished difference Result 307 states and 456 transitions. [2019-12-07 11:07:00,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:07:00,288 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-12-07 11:07:00,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:07:00,289 INFO L225 Difference]: With dead ends: 307 [2019-12-07 11:07:00,289 INFO L226 Difference]: Without dead ends: 162 [2019-12-07 11:07:00,290 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:07:00,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-12-07 11:07:00,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 153. [2019-12-07 11:07:00,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-12-07 11:07:00,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 228 transitions. [2019-12-07 11:07:00,296 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 228 transitions. Word has length 21 [2019-12-07 11:07:00,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:07:00,297 INFO L462 AbstractCegarLoop]: Abstraction has 153 states and 228 transitions. [2019-12-07 11:07:00,297 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:07:00,297 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 228 transitions. [2019-12-07 11:07:00,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-07 11:07:00,298 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:07:00,298 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:07:00,299 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 11:07:00,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:07:00,299 INFO L82 PathProgramCache]: Analyzing trace with hash 205704618, now seen corresponding path program 1 times [2019-12-07 11:07:00,299 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:07:00,299 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673935406] [2019-12-07 11:07:00,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:07:00,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:07:00,327 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:07:00,328 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673935406] [2019-12-07 11:07:00,328 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:07:00,328 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:07:00,328 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996204847] [2019-12-07 11:07:00,329 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:07:00,329 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:07:00,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:07:00,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:07:00,329 INFO L87 Difference]: Start difference. First operand 153 states and 228 transitions. Second operand 3 states. [2019-12-07 11:07:00,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:07:00,439 INFO L93 Difference]: Finished difference Result 330 states and 498 transitions. [2019-12-07 11:07:00,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:07:00,440 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2019-12-07 11:07:00,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:07:00,441 INFO L225 Difference]: With dead ends: 330 [2019-12-07 11:07:00,442 INFO L226 Difference]: Without dead ends: 184 [2019-12-07 11:07:00,442 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:07:00,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-12-07 11:07:00,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2019-12-07 11:07:00,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-12-07 11:07:00,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 280 transitions. [2019-12-07 11:07:00,452 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 280 transitions. Word has length 46 [2019-12-07 11:07:00,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:07:00,452 INFO L462 AbstractCegarLoop]: Abstraction has 184 states and 280 transitions. [2019-12-07 11:07:00,452 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:07:00,453 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 280 transitions. [2019-12-07 11:07:00,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-07 11:07:00,455 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:07:00,455 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:07:00,455 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 11:07:00,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:07:00,456 INFO L82 PathProgramCache]: Analyzing trace with hash 2094953876, now seen corresponding path program 1 times [2019-12-07 11:07:00,456 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:07:00,456 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461153548] [2019-12-07 11:07:00,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:07:00,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:07:00,484 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 11:07:00,484 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461153548] [2019-12-07 11:07:00,484 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:07:00,485 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:07:00,485 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071444561] [2019-12-07 11:07:00,485 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:07:00,485 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:07:00,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:07:00,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:07:00,486 INFO L87 Difference]: Start difference. First operand 184 states and 280 transitions. Second operand 3 states. [2019-12-07 11:07:00,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:07:00,558 INFO L93 Difference]: Finished difference Result 379 states and 574 transitions. [2019-12-07 11:07:00,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:07:00,558 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-07 11:07:00,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:07:00,559 INFO L225 Difference]: With dead ends: 379 [2019-12-07 11:07:00,559 INFO L226 Difference]: Without dead ends: 202 [2019-12-07 11:07:00,560 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:07:00,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-12-07 11:07:00,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 200. [2019-12-07 11:07:00,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-12-07 11:07:00,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 301 transitions. [2019-12-07 11:07:00,566 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 301 transitions. Word has length 58 [2019-12-07 11:07:00,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:07:00,566 INFO L462 AbstractCegarLoop]: Abstraction has 200 states and 301 transitions. [2019-12-07 11:07:00,566 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:07:00,566 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 301 transitions. [2019-12-07 11:07:00,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-07 11:07:00,568 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:07:00,568 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:07:00,568 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 11:07:00,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:07:00,568 INFO L82 PathProgramCache]: Analyzing trace with hash 2134557448, now seen corresponding path program 1 times [2019-12-07 11:07:00,568 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:07:00,568 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193669582] [2019-12-07 11:07:00,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:07:00,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:07:00,587 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 11:07:00,587 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193669582] [2019-12-07 11:07:00,587 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:07:00,587 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:07:00,587 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678025717] [2019-12-07 11:07:00,588 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:07:00,588 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:07:00,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:07:00,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:07:00,588 INFO L87 Difference]: Start difference. First operand 200 states and 301 transitions. Second operand 3 states. [2019-12-07 11:07:00,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:07:00,653 INFO L93 Difference]: Finished difference Result 396 states and 595 transitions. [2019-12-07 11:07:00,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:07:00,653 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-07 11:07:00,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:07:00,655 INFO L225 Difference]: With dead ends: 396 [2019-12-07 11:07:00,655 INFO L226 Difference]: Without dead ends: 203 [2019-12-07 11:07:00,655 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:07:00,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-12-07 11:07:00,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 201. [2019-12-07 11:07:00,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-12-07 11:07:00,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 301 transitions. [2019-12-07 11:07:00,661 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 301 transitions. Word has length 59 [2019-12-07 11:07:00,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:07:00,661 INFO L462 AbstractCegarLoop]: Abstraction has 201 states and 301 transitions. [2019-12-07 11:07:00,661 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:07:00,661 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 301 transitions. [2019-12-07 11:07:00,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 11:07:00,662 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:07:00,662 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:07:00,662 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 11:07:00,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:07:00,663 INFO L82 PathProgramCache]: Analyzing trace with hash -1607957135, now seen corresponding path program 1 times [2019-12-07 11:07:00,663 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:07:00,663 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092983650] [2019-12-07 11:07:00,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:07:00,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:07:00,686 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 11:07:00,686 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092983650] [2019-12-07 11:07:00,686 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:07:00,686 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:07:00,686 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604519256] [2019-12-07 11:07:00,687 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:07:00,687 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:07:00,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:07:00,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:07:00,687 INFO L87 Difference]: Start difference. First operand 201 states and 301 transitions. Second operand 3 states. [2019-12-07 11:07:00,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:07:00,769 INFO L93 Difference]: Finished difference Result 439 states and 666 transitions. [2019-12-07 11:07:00,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:07:00,769 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-12-07 11:07:00,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:07:00,771 INFO L225 Difference]: With dead ends: 439 [2019-12-07 11:07:00,771 INFO L226 Difference]: Without dead ends: 245 [2019-12-07 11:07:00,771 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:07:00,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2019-12-07 11:07:00,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 243. [2019-12-07 11:07:00,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2019-12-07 11:07:00,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 372 transitions. [2019-12-07 11:07:00,778 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 372 transitions. Word has length 72 [2019-12-07 11:07:00,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:07:00,778 INFO L462 AbstractCegarLoop]: Abstraction has 243 states and 372 transitions. [2019-12-07 11:07:00,778 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:07:00,778 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 372 transitions. [2019-12-07 11:07:00,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-07 11:07:00,779 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:07:00,779 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:07:00,779 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 11:07:00,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:07:00,779 INFO L82 PathProgramCache]: Analyzing trace with hash 1882884773, now seen corresponding path program 1 times [2019-12-07 11:07:00,780 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:07:00,780 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469032068] [2019-12-07 11:07:00,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:07:00,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:07:00,801 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 11:07:00,801 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469032068] [2019-12-07 11:07:00,801 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:07:00,802 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:07:00,802 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705141468] [2019-12-07 11:07:00,802 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:07:00,802 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:07:00,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:07:00,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:07:00,802 INFO L87 Difference]: Start difference. First operand 243 states and 372 transitions. Second operand 3 states. [2019-12-07 11:07:00,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:07:00,880 INFO L93 Difference]: Finished difference Result 513 states and 788 transitions. [2019-12-07 11:07:00,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:07:00,881 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-12-07 11:07:00,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:07:00,882 INFO L225 Difference]: With dead ends: 513 [2019-12-07 11:07:00,883 INFO L226 Difference]: Without dead ends: 277 [2019-12-07 11:07:00,883 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:07:00,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2019-12-07 11:07:00,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 270. [2019-12-07 11:07:00,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2019-12-07 11:07:00,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 412 transitions. [2019-12-07 11:07:00,894 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 412 transitions. Word has length 73 [2019-12-07 11:07:00,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:07:00,894 INFO L462 AbstractCegarLoop]: Abstraction has 270 states and 412 transitions. [2019-12-07 11:07:00,894 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:07:00,894 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 412 transitions. [2019-12-07 11:07:00,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-07 11:07:00,895 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:07:00,896 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:07:00,896 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 11:07:00,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:07:00,896 INFO L82 PathProgramCache]: Analyzing trace with hash -369256571, now seen corresponding path program 1 times [2019-12-07 11:07:00,896 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:07:00,896 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866696393] [2019-12-07 11:07:00,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:07:00,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:07:00,924 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 11:07:00,925 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866696393] [2019-12-07 11:07:00,925 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:07:00,925 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:07:00,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931431006] [2019-12-07 11:07:00,925 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:07:00,926 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:07:00,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:07:00,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:07:00,926 INFO L87 Difference]: Start difference. First operand 270 states and 412 transitions. Second operand 3 states. [2019-12-07 11:07:01,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:07:01,017 INFO L93 Difference]: Finished difference Result 536 states and 817 transitions. [2019-12-07 11:07:01,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:07:01,018 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-12-07 11:07:01,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:07:01,020 INFO L225 Difference]: With dead ends: 536 [2019-12-07 11:07:01,020 INFO L226 Difference]: Without dead ends: 273 [2019-12-07 11:07:01,020 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:07:01,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2019-12-07 11:07:01,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 271. [2019-12-07 11:07:01,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-12-07 11:07:01,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 412 transitions. [2019-12-07 11:07:01,030 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 412 transitions. Word has length 73 [2019-12-07 11:07:01,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:07:01,030 INFO L462 AbstractCegarLoop]: Abstraction has 271 states and 412 transitions. [2019-12-07 11:07:01,030 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:07:01,030 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 412 transitions. [2019-12-07 11:07:01,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-07 11:07:01,031 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:07:01,031 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:07:01,031 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 11:07:01,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:07:01,032 INFO L82 PathProgramCache]: Analyzing trace with hash -189803919, now seen corresponding path program 1 times [2019-12-07 11:07:01,032 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:07:01,032 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259255579] [2019-12-07 11:07:01,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:07:01,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:07:01,060 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 11:07:01,060 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259255579] [2019-12-07 11:07:01,060 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:07:01,060 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:07:01,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615526600] [2019-12-07 11:07:01,061 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:07:01,061 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:07:01,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:07:01,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:07:01,061 INFO L87 Difference]: Start difference. First operand 271 states and 412 transitions. Second operand 3 states. [2019-12-07 11:07:01,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:07:01,152 INFO L93 Difference]: Finished difference Result 542 states and 825 transitions. [2019-12-07 11:07:01,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:07:01,152 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-12-07 11:07:01,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:07:01,153 INFO L225 Difference]: With dead ends: 542 [2019-12-07 11:07:01,154 INFO L226 Difference]: Without dead ends: 278 [2019-12-07 11:07:01,154 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:07:01,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-12-07 11:07:01,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 271. [2019-12-07 11:07:01,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-12-07 11:07:01,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 409 transitions. [2019-12-07 11:07:01,161 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 409 transitions. Word has length 74 [2019-12-07 11:07:01,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:07:01,161 INFO L462 AbstractCegarLoop]: Abstraction has 271 states and 409 transitions. [2019-12-07 11:07:01,161 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:07:01,161 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 409 transitions. [2019-12-07 11:07:01,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-12-07 11:07:01,161 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:07:01,162 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:07:01,162 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 11:07:01,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:07:01,162 INFO L82 PathProgramCache]: Analyzing trace with hash 873313086, now seen corresponding path program 1 times [2019-12-07 11:07:01,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:07:01,162 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232007253] [2019-12-07 11:07:01,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:07:01,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:07:01,193 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 11:07:01,193 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232007253] [2019-12-07 11:07:01,193 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:07:01,193 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:07:01,193 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316799832] [2019-12-07 11:07:01,194 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:07:01,194 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:07:01,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:07:01,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:07:01,194 INFO L87 Difference]: Start difference. First operand 271 states and 409 transitions. Second operand 3 states. [2019-12-07 11:07:01,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:07:01,303 INFO L93 Difference]: Finished difference Result 582 states and 881 transitions. [2019-12-07 11:07:01,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:07:01,303 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2019-12-07 11:07:01,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:07:01,305 INFO L225 Difference]: With dead ends: 582 [2019-12-07 11:07:01,305 INFO L226 Difference]: Without dead ends: 318 [2019-12-07 11:07:01,306 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:07:01,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-12-07 11:07:01,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 314. [2019-12-07 11:07:01,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2019-12-07 11:07:01,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 478 transitions. [2019-12-07 11:07:01,314 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 478 transitions. Word has length 89 [2019-12-07 11:07:01,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:07:01,314 INFO L462 AbstractCegarLoop]: Abstraction has 314 states and 478 transitions. [2019-12-07 11:07:01,314 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:07:01,314 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 478 transitions. [2019-12-07 11:07:01,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-12-07 11:07:01,315 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:07:01,315 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:07:01,315 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 11:07:01,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:07:01,315 INFO L82 PathProgramCache]: Analyzing trace with hash 1282770437, now seen corresponding path program 1 times [2019-12-07 11:07:01,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:07:01,315 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434252964] [2019-12-07 11:07:01,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:07:01,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:07:01,339 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 11:07:01,339 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434252964] [2019-12-07 11:07:01,340 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:07:01,340 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:07:01,340 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736986126] [2019-12-07 11:07:01,340 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:07:01,340 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:07:01,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:07:01,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:07:01,340 INFO L87 Difference]: Start difference. First operand 314 states and 478 transitions. Second operand 3 states. [2019-12-07 11:07:01,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:07:01,452 INFO L93 Difference]: Finished difference Result 637 states and 972 transitions. [2019-12-07 11:07:01,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:07:01,453 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2019-12-07 11:07:01,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:07:01,455 INFO L225 Difference]: With dead ends: 637 [2019-12-07 11:07:01,455 INFO L226 Difference]: Without dead ends: 328 [2019-12-07 11:07:01,456 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:07:01,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2019-12-07 11:07:01,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 324. [2019-12-07 11:07:01,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2019-12-07 11:07:01,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 497 transitions. [2019-12-07 11:07:01,466 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 497 transitions. Word has length 90 [2019-12-07 11:07:01,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:07:01,467 INFO L462 AbstractCegarLoop]: Abstraction has 324 states and 497 transitions. [2019-12-07 11:07:01,467 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:07:01,467 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 497 transitions. [2019-12-07 11:07:01,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-07 11:07:01,468 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:07:01,468 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:07:01,468 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 11:07:01,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:07:01,469 INFO L82 PathProgramCache]: Analyzing trace with hash 630357241, now seen corresponding path program 1 times [2019-12-07 11:07:01,469 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:07:01,469 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032806007] [2019-12-07 11:07:01,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:07:01,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:07:01,498 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-12-07 11:07:01,498 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032806007] [2019-12-07 11:07:01,498 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:07:01,498 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:07:01,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145413391] [2019-12-07 11:07:01,499 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:07:01,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:07:01,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:07:01,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:07:01,499 INFO L87 Difference]: Start difference. First operand 324 states and 497 transitions. Second operand 3 states. [2019-12-07 11:07:01,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:07:01,587 INFO L93 Difference]: Finished difference Result 678 states and 1042 transitions. [2019-12-07 11:07:01,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:07:01,587 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-12-07 11:07:01,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:07:01,589 INFO L225 Difference]: With dead ends: 678 [2019-12-07 11:07:01,589 INFO L226 Difference]: Without dead ends: 361 [2019-12-07 11:07:01,590 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:07:01,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2019-12-07 11:07:01,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 349. [2019-12-07 11:07:01,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2019-12-07 11:07:01,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 531 transitions. [2019-12-07 11:07:01,598 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 531 transitions. Word has length 99 [2019-12-07 11:07:01,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:07:01,599 INFO L462 AbstractCegarLoop]: Abstraction has 349 states and 531 transitions. [2019-12-07 11:07:01,599 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:07:01,599 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 531 transitions. [2019-12-07 11:07:01,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-07 11:07:01,599 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:07:01,600 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:07:01,600 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 11:07:01,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:07:01,600 INFO L82 PathProgramCache]: Analyzing trace with hash 757835045, now seen corresponding path program 1 times [2019-12-07 11:07:01,600 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:07:01,600 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686731436] [2019-12-07 11:07:01,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:07:01,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:07:01,626 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-12-07 11:07:01,626 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686731436] [2019-12-07 11:07:01,626 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:07:01,626 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:07:01,627 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423701824] [2019-12-07 11:07:01,627 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:07:01,627 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:07:01,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:07:01,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:07:01,627 INFO L87 Difference]: Start difference. First operand 349 states and 531 transitions. Second operand 3 states. [2019-12-07 11:07:01,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:07:01,715 INFO L93 Difference]: Finished difference Result 703 states and 1071 transitions. [2019-12-07 11:07:01,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:07:01,716 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-12-07 11:07:01,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:07:01,718 INFO L225 Difference]: With dead ends: 703 [2019-12-07 11:07:01,718 INFO L226 Difference]: Without dead ends: 361 [2019-12-07 11:07:01,719 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:07:01,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2019-12-07 11:07:01,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 349. [2019-12-07 11:07:01,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2019-12-07 11:07:01,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 526 transitions. [2019-12-07 11:07:01,730 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 526 transitions. Word has length 100 [2019-12-07 11:07:01,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:07:01,731 INFO L462 AbstractCegarLoop]: Abstraction has 349 states and 526 transitions. [2019-12-07 11:07:01,731 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:07:01,731 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 526 transitions. [2019-12-07 11:07:01,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-12-07 11:07:01,732 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:07:01,732 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:07:01,732 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 11:07:01,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:07:01,732 INFO L82 PathProgramCache]: Analyzing trace with hash -927735321, now seen corresponding path program 1 times [2019-12-07 11:07:01,732 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:07:01,732 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622722663] [2019-12-07 11:07:01,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:07:01,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:07:01,756 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-12-07 11:07:01,756 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622722663] [2019-12-07 11:07:01,756 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:07:01,757 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:07:01,757 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964216005] [2019-12-07 11:07:01,757 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:07:01,757 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:07:01,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:07:01,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:07:01,758 INFO L87 Difference]: Start difference. First operand 349 states and 526 transitions. Second operand 3 states. [2019-12-07 11:07:01,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:07:01,849 INFO L93 Difference]: Finished difference Result 718 states and 1081 transitions. [2019-12-07 11:07:01,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:07:01,850 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 119 [2019-12-07 11:07:01,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:07:01,852 INFO L225 Difference]: With dead ends: 718 [2019-12-07 11:07:01,852 INFO L226 Difference]: Without dead ends: 376 [2019-12-07 11:07:01,853 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:07:01,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2019-12-07 11:07:01,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 373. [2019-12-07 11:07:01,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2019-12-07 11:07:01,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 556 transitions. [2019-12-07 11:07:01,866 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 556 transitions. Word has length 119 [2019-12-07 11:07:01,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:07:01,866 INFO L462 AbstractCegarLoop]: Abstraction has 373 states and 556 transitions. [2019-12-07 11:07:01,866 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:07:01,866 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 556 transitions. [2019-12-07 11:07:01,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-12-07 11:07:01,867 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:07:01,867 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:07:01,868 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 11:07:01,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:07:01,868 INFO L82 PathProgramCache]: Analyzing trace with hash 1207090035, now seen corresponding path program 1 times [2019-12-07 11:07:01,868 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:07:01,868 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246870761] [2019-12-07 11:07:01,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:07:01,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:07:01,895 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-12-07 11:07:01,895 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246870761] [2019-12-07 11:07:01,896 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:07:01,896 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:07:01,896 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602086787] [2019-12-07 11:07:01,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:07:01,896 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:07:01,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:07:01,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:07:01,897 INFO L87 Difference]: Start difference. First operand 373 states and 556 transitions. Second operand 3 states. [2019-12-07 11:07:01,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:07:01,991 INFO L93 Difference]: Finished difference Result 742 states and 1105 transitions. [2019-12-07 11:07:01,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:07:01,992 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2019-12-07 11:07:01,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:07:01,994 INFO L225 Difference]: With dead ends: 742 [2019-12-07 11:07:01,994 INFO L226 Difference]: Without dead ends: 376 [2019-12-07 11:07:01,995 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:07:01,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2019-12-07 11:07:02,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 373. [2019-12-07 11:07:02,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2019-12-07 11:07:02,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 550 transitions. [2019-12-07 11:07:02,007 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 550 transitions. Word has length 120 [2019-12-07 11:07:02,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:07:02,007 INFO L462 AbstractCegarLoop]: Abstraction has 373 states and 550 transitions. [2019-12-07 11:07:02,007 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:07:02,007 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 550 transitions. [2019-12-07 11:07:02,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-12-07 11:07:02,008 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:07:02,008 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:07:02,008 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 11:07:02,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:07:02,009 INFO L82 PathProgramCache]: Analyzing trace with hash -568364771, now seen corresponding path program 1 times [2019-12-07 11:07:02,009 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:07:02,009 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350464890] [2019-12-07 11:07:02,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:07:02,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:07:02,044 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-12-07 11:07:02,044 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350464890] [2019-12-07 11:07:02,044 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:07:02,044 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:07:02,044 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966566724] [2019-12-07 11:07:02,045 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:07:02,045 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:07:02,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:07:02,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:07:02,045 INFO L87 Difference]: Start difference. First operand 373 states and 550 transitions. Second operand 3 states. [2019-12-07 11:07:02,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:07:02,152 INFO L93 Difference]: Finished difference Result 784 states and 1155 transitions. [2019-12-07 11:07:02,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:07:02,153 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 129 [2019-12-07 11:07:02,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:07:02,155 INFO L225 Difference]: With dead ends: 784 [2019-12-07 11:07:02,155 INFO L226 Difference]: Without dead ends: 418 [2019-12-07 11:07:02,156 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:07:02,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2019-12-07 11:07:02,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 414. [2019-12-07 11:07:02,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414 states. [2019-12-07 11:07:02,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 609 transitions. [2019-12-07 11:07:02,170 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 609 transitions. Word has length 129 [2019-12-07 11:07:02,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:07:02,171 INFO L462 AbstractCegarLoop]: Abstraction has 414 states and 609 transitions. [2019-12-07 11:07:02,171 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:07:02,171 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 609 transitions. [2019-12-07 11:07:02,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-12-07 11:07:02,172 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:07:02,173 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:07:02,173 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 11:07:02,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:07:02,173 INFO L82 PathProgramCache]: Analyzing trace with hash 12959108, now seen corresponding path program 1 times [2019-12-07 11:07:02,173 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:07:02,173 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084294608] [2019-12-07 11:07:02,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:07:02,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:07:02,202 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-12-07 11:07:02,202 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084294608] [2019-12-07 11:07:02,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:07:02,202 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:07:02,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441812301] [2019-12-07 11:07:02,202 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:07:02,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:07:02,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:07:02,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:07:02,203 INFO L87 Difference]: Start difference. First operand 414 states and 609 transitions. Second operand 3 states. [2019-12-07 11:07:02,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:07:02,311 INFO L93 Difference]: Finished difference Result 825 states and 1212 transitions. [2019-12-07 11:07:02,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:07:02,312 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 130 [2019-12-07 11:07:02,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:07:02,314 INFO L225 Difference]: With dead ends: 825 [2019-12-07 11:07:02,314 INFO L226 Difference]: Without dead ends: 416 [2019-12-07 11:07:02,314 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:07:02,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2019-12-07 11:07:02,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 412. [2019-12-07 11:07:02,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2019-12-07 11:07:02,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 604 transitions. [2019-12-07 11:07:02,323 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 604 transitions. Word has length 130 [2019-12-07 11:07:02,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:07:02,323 INFO L462 AbstractCegarLoop]: Abstraction has 412 states and 604 transitions. [2019-12-07 11:07:02,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:07:02,323 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 604 transitions. [2019-12-07 11:07:02,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-12-07 11:07:02,324 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:07:02,324 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:07:02,324 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 11:07:02,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:07:02,324 INFO L82 PathProgramCache]: Analyzing trace with hash -637521445, now seen corresponding path program 1 times [2019-12-07 11:07:02,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:07:02,325 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321352381] [2019-12-07 11:07:02,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:07:02,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:07:02,350 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-12-07 11:07:02,351 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321352381] [2019-12-07 11:07:02,351 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:07:02,351 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:07:02,351 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995835563] [2019-12-07 11:07:02,351 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:07:02,351 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:07:02,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:07:02,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:07:02,352 INFO L87 Difference]: Start difference. First operand 412 states and 604 transitions. Second operand 3 states. [2019-12-07 11:07:02,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:07:02,447 INFO L93 Difference]: Finished difference Result 842 states and 1234 transitions. [2019-12-07 11:07:02,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:07:02,447 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 140 [2019-12-07 11:07:02,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:07:02,449 INFO L225 Difference]: With dead ends: 842 [2019-12-07 11:07:02,449 INFO L226 Difference]: Without dead ends: 437 [2019-12-07 11:07:02,450 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:07:02,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2019-12-07 11:07:02,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 433. [2019-12-07 11:07:02,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2019-12-07 11:07:02,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 627 transitions. [2019-12-07 11:07:02,459 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 627 transitions. Word has length 140 [2019-12-07 11:07:02,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:07:02,459 INFO L462 AbstractCegarLoop]: Abstraction has 433 states and 627 transitions. [2019-12-07 11:07:02,459 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:07:02,459 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 627 transitions. [2019-12-07 11:07:02,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-12-07 11:07:02,460 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:07:02,460 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:07:02,460 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 11:07:02,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:07:02,461 INFO L82 PathProgramCache]: Analyzing trace with hash 871119983, now seen corresponding path program 1 times [2019-12-07 11:07:02,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:07:02,461 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320551107] [2019-12-07 11:07:02,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:07:02,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:07:02,486 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-12-07 11:07:02,486 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320551107] [2019-12-07 11:07:02,486 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:07:02,486 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:07:02,486 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357013479] [2019-12-07 11:07:02,486 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:07:02,486 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:07:02,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:07:02,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:07:02,487 INFO L87 Difference]: Start difference. First operand 433 states and 627 transitions. Second operand 3 states. [2019-12-07 11:07:02,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:07:02,568 INFO L93 Difference]: Finished difference Result 863 states and 1249 transitions. [2019-12-07 11:07:02,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:07:02,568 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 141 [2019-12-07 11:07:02,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:07:02,570 INFO L225 Difference]: With dead ends: 863 [2019-12-07 11:07:02,570 INFO L226 Difference]: Without dead ends: 437 [2019-12-07 11:07:02,571 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:07:02,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2019-12-07 11:07:02,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 433. [2019-12-07 11:07:02,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2019-12-07 11:07:02,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 619 transitions. [2019-12-07 11:07:02,580 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 619 transitions. Word has length 141 [2019-12-07 11:07:02,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:07:02,580 INFO L462 AbstractCegarLoop]: Abstraction has 433 states and 619 transitions. [2019-12-07 11:07:02,580 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:07:02,580 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 619 transitions. [2019-12-07 11:07:02,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-12-07 11:07:02,581 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:07:02,582 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:07:02,582 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 11:07:02,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:07:02,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1128117336, now seen corresponding path program 1 times [2019-12-07 11:07:02,582 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:07:02,582 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330775456] [2019-12-07 11:07:02,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:07:02,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:07:02,610 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2019-12-07 11:07:02,611 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330775456] [2019-12-07 11:07:02,611 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:07:02,611 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:07:02,611 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623696431] [2019-12-07 11:07:02,611 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:07:02,611 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:07:02,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:07:02,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:07:02,612 INFO L87 Difference]: Start difference. First operand 433 states and 619 transitions. Second operand 3 states. [2019-12-07 11:07:02,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:07:02,636 INFO L93 Difference]: Finished difference Result 1279 states and 1823 transitions. [2019-12-07 11:07:02,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:07:02,637 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 156 [2019-12-07 11:07:02,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:07:02,640 INFO L225 Difference]: With dead ends: 1279 [2019-12-07 11:07:02,640 INFO L226 Difference]: Without dead ends: 853 [2019-12-07 11:07:02,641 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:07:02,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 853 states. [2019-12-07 11:07:02,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 853 to 434. [2019-12-07 11:07:02,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2019-12-07 11:07:02,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 620 transitions. [2019-12-07 11:07:02,653 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 620 transitions. Word has length 156 [2019-12-07 11:07:02,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:07:02,653 INFO L462 AbstractCegarLoop]: Abstraction has 434 states and 620 transitions. [2019-12-07 11:07:02,653 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:07:02,653 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 620 transitions. [2019-12-07 11:07:02,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-12-07 11:07:02,654 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:07:02,655 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:07:02,655 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 11:07:02,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:07:02,655 INFO L82 PathProgramCache]: Analyzing trace with hash 386659640, now seen corresponding path program 1 times [2019-12-07 11:07:02,655 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:07:02,655 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752724228] [2019-12-07 11:07:02,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:07:02,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:07:02,700 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 110 proven. 5 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2019-12-07 11:07:02,700 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752724228] [2019-12-07 11:07:02,700 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1035200600] [2019-12-07 11:07:02,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_638d51d2-c7d7-46a6-9da6-e0d0e057e8f0/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-12-07 11:07:02,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:07:02,760 INFO L264 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 11:07:02,769 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:07:02,801 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 110 proven. 5 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2019-12-07 11:07:02,801 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 11:07:02,801 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-12-07 11:07:02,801 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991183732] [2019-12-07 11:07:02,802 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:07:02,802 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:07:02,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:07:02,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:07:02,802 INFO L87 Difference]: Start difference. First operand 434 states and 620 transitions. Second operand 4 states. [2019-12-07 11:07:03,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:07:03,077 INFO L93 Difference]: Finished difference Result 1355 states and 1932 transitions. [2019-12-07 11:07:03,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:07:03,077 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-12-07 11:07:03,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:07:03,081 INFO L225 Difference]: With dead ends: 1355 [2019-12-07 11:07:03,081 INFO L226 Difference]: Without dead ends: 903 [2019-12-07 11:07:03,082 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:07:03,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2019-12-07 11:07:03,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 532. [2019-12-07 11:07:03,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 532 states. [2019-12-07 11:07:03,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 761 transitions. [2019-12-07 11:07:03,097 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 761 transitions. Word has length 156 [2019-12-07 11:07:03,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:07:03,097 INFO L462 AbstractCegarLoop]: Abstraction has 532 states and 761 transitions. [2019-12-07 11:07:03,097 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:07:03,097 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 761 transitions. [2019-12-07 11:07:03,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-12-07 11:07:03,099 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:07:03,099 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:07:03,299 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:07:03,299 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 11:07:03,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:07:03,300 INFO L82 PathProgramCache]: Analyzing trace with hash 1891443376, now seen corresponding path program 1 times [2019-12-07 11:07:03,300 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:07:03,300 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20442228] [2019-12-07 11:07:03,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:07:03,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:07:03,339 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 120 proven. 7 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2019-12-07 11:07:03,339 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20442228] [2019-12-07 11:07:03,339 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1637462691] [2019-12-07 11:07:03,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_638d51d2-c7d7-46a6-9da6-e0d0e057e8f0/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-12-07 11:07:03,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:07:03,391 INFO L264 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 11:07:03,396 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:07:03,419 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 120 proven. 7 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2019-12-07 11:07:03,419 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 11:07:03,419 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-12-07 11:07:03,420 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415857461] [2019-12-07 11:07:03,420 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:07:03,420 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:07:03,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:07:03,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:07:03,421 INFO L87 Difference]: Start difference. First operand 532 states and 761 transitions. Second operand 4 states. [2019-12-07 11:07:03,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:07:03,630 INFO L93 Difference]: Finished difference Result 1476 states and 2098 transitions. [2019-12-07 11:07:03,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:07:03,630 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2019-12-07 11:07:03,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:07:03,635 INFO L225 Difference]: With dead ends: 1476 [2019-12-07 11:07:03,635 INFO L226 Difference]: Without dead ends: 951 [2019-12-07 11:07:03,636 INFO L630 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-12-07 11:07:03,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2019-12-07 11:07:03,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 587. [2019-12-07 11:07:03,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2019-12-07 11:07:03,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 801 transitions. [2019-12-07 11:07:03,660 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 801 transitions. Word has length 158 [2019-12-07 11:07:03,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:07:03,661 INFO L462 AbstractCegarLoop]: Abstraction has 587 states and 801 transitions. [2019-12-07 11:07:03,661 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:07:03,661 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 801 transitions. [2019-12-07 11:07:03,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-12-07 11:07:03,662 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:07:03,663 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:07:03,863 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:07:03,863 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 11:07:03,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:07:03,863 INFO L82 PathProgramCache]: Analyzing trace with hash -136801648, now seen corresponding path program 1 times [2019-12-07 11:07:03,864 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:07:03,864 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547864237] [2019-12-07 11:07:03,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:07:03,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:07:03,926 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 97 proven. 5 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-12-07 11:07:03,926 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547864237] [2019-12-07 11:07:03,926 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [285753411] [2019-12-07 11:07:03,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_638d51d2-c7d7-46a6-9da6-e0d0e057e8f0/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-12-07 11:07:03,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:07:03,983 INFO L264 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 11:07:03,987 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:07:04,024 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 97 proven. 5 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-12-07 11:07:04,024 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 11:07:04,024 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-12-07 11:07:04,025 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052425186] [2019-12-07 11:07:04,025 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:07:04,025 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:07:04,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:07:04,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:07:04,026 INFO L87 Difference]: Start difference. First operand 587 states and 801 transitions. Second operand 4 states. [2019-12-07 11:07:04,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:07:04,229 INFO L93 Difference]: Finished difference Result 1484 states and 2022 transitions. [2019-12-07 11:07:04,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:07:04,230 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 166 [2019-12-07 11:07:04,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:07:04,234 INFO L225 Difference]: With dead ends: 1484 [2019-12-07 11:07:04,235 INFO L226 Difference]: Without dead ends: 897 [2019-12-07 11:07:04,236 INFO L630 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-12-07 11:07:04,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2019-12-07 11:07:04,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 515. [2019-12-07 11:07:04,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 515 states. [2019-12-07 11:07:04,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 700 transitions. [2019-12-07 11:07:04,256 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 700 transitions. Word has length 166 [2019-12-07 11:07:04,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:07:04,256 INFO L462 AbstractCegarLoop]: Abstraction has 515 states and 700 transitions. [2019-12-07 11:07:04,256 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:07:04,256 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 700 transitions. [2019-12-07 11:07:04,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-12-07 11:07:04,258 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:07:04,258 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:07:04,458 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:07:04,459 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 11:07:04,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:07:04,459 INFO L82 PathProgramCache]: Analyzing trace with hash 1003230858, now seen corresponding path program 1 times [2019-12-07 11:07:04,459 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:07:04,459 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056404357] [2019-12-07 11:07:04,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:07:04,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:07:04,542 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-12-07 11:07:04,542 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056404357] [2019-12-07 11:07:04,542 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:07:04,543 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:07:04,543 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073464544] [2019-12-07 11:07:04,543 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:07:04,543 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:07:04,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:07:04,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:07:04,544 INFO L87 Difference]: Start difference. First operand 515 states and 700 transitions. Second operand 3 states. [2019-12-07 11:07:04,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:07:04,591 INFO L93 Difference]: Finished difference Result 1226 states and 1656 transitions. [2019-12-07 11:07:04,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:07:04,592 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 168 [2019-12-07 11:07:04,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:07:04,595 INFO L225 Difference]: With dead ends: 1226 [2019-12-07 11:07:04,595 INFO L226 Difference]: Without dead ends: 477 [2019-12-07 11:07:04,596 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:07:04,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2019-12-07 11:07:04,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 477. [2019-12-07 11:07:04,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 477 states. [2019-12-07 11:07:04,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 648 transitions. [2019-12-07 11:07:04,611 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 648 transitions. Word has length 168 [2019-12-07 11:07:04,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:07:04,611 INFO L462 AbstractCegarLoop]: Abstraction has 477 states and 648 transitions. [2019-12-07 11:07:04,611 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:07:04,611 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 648 transitions. [2019-12-07 11:07:04,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-12-07 11:07:04,612 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:07:04,613 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:07:04,613 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 11:07:04,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:07:04,613 INFO L82 PathProgramCache]: Analyzing trace with hash -1602987784, now seen corresponding path program 1 times [2019-12-07 11:07:04,613 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:07:04,613 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854673079] [2019-12-07 11:07:04,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:07:04,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:07:04,647 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2019-12-07 11:07:04,647 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854673079] [2019-12-07 11:07:04,647 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:07:04,647 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:07:04,647 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555527197] [2019-12-07 11:07:04,647 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:07:04,648 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:07:04,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:07:04,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:07:04,648 INFO L87 Difference]: Start difference. First operand 477 states and 648 transitions. Second operand 3 states. [2019-12-07 11:07:04,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:07:04,737 INFO L93 Difference]: Finished difference Result 964 states and 1304 transitions. [2019-12-07 11:07:04,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:07:04,738 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 200 [2019-12-07 11:07:04,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:07:04,740 INFO L225 Difference]: With dead ends: 964 [2019-12-07 11:07:04,740 INFO L226 Difference]: Without dead ends: 482 [2019-12-07 11:07:04,740 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:07:04,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2019-12-07 11:07:04,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 478. [2019-12-07 11:07:04,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 478 states. [2019-12-07 11:07:04,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 639 transitions. [2019-12-07 11:07:04,752 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 639 transitions. Word has length 200 [2019-12-07 11:07:04,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:07:04,752 INFO L462 AbstractCegarLoop]: Abstraction has 478 states and 639 transitions. [2019-12-07 11:07:04,752 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:07:04,753 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 639 transitions. [2019-12-07 11:07:04,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2019-12-07 11:07:04,754 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:07:04,754 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 9, 9, 8, 8, 7, 7, 6, 6, 6, 6, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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-12-07 11:07:04,754 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 11:07:04,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:07:04,755 INFO L82 PathProgramCache]: Analyzing trace with hash -1001955789, now seen corresponding path program 1 times [2019-12-07 11:07:04,755 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:07:04,755 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249106814] [2019-12-07 11:07:04,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:07:04,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:07:04,843 INFO L134 CoverageAnalysis]: Checked inductivity of 1164 backedges. 700 proven. 0 refuted. 0 times theorem prover too weak. 464 trivial. 0 not checked. [2019-12-07 11:07:04,844 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249106814] [2019-12-07 11:07:04,844 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:07:04,844 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:07:04,844 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302543803] [2019-12-07 11:07:04,844 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:07:04,844 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:07:04,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:07:04,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:07:04,845 INFO L87 Difference]: Start difference. First operand 478 states and 639 transitions. Second operand 3 states. [2019-12-07 11:07:04,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:07:04,939 INFO L93 Difference]: Finished difference Result 985 states and 1310 transitions. [2019-12-07 11:07:04,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:07:04,939 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 339 [2019-12-07 11:07:04,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:07:04,942 INFO L225 Difference]: With dead ends: 985 [2019-12-07 11:07:04,942 INFO L226 Difference]: Without dead ends: 514 [2019-12-07 11:07:04,943 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:07:04,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2019-12-07 11:07:04,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 512. [2019-12-07 11:07:04,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 512 states. [2019-12-07 11:07:04,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 678 transitions. [2019-12-07 11:07:04,961 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 678 transitions. Word has length 339 [2019-12-07 11:07:04,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:07:04,961 INFO L462 AbstractCegarLoop]: Abstraction has 512 states and 678 transitions. [2019-12-07 11:07:04,961 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:07:04,961 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 678 transitions. [2019-12-07 11:07:04,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2019-12-07 11:07:04,963 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:07:04,963 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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-12-07 11:07:04,963 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 11:07:04,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:07:04,963 INFO L82 PathProgramCache]: Analyzing trace with hash 1590673358, now seen corresponding path program 1 times [2019-12-07 11:07:04,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:07:04,964 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453369753] [2019-12-07 11:07:04,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:07:04,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:07:05,052 INFO L134 CoverageAnalysis]: Checked inductivity of 1424 backedges. 824 proven. 0 refuted. 0 times theorem prover too weak. 600 trivial. 0 not checked. [2019-12-07 11:07:05,052 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453369753] [2019-12-07 11:07:05,052 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:07:05,052 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:07:05,052 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932723719] [2019-12-07 11:07:05,053 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:07:05,053 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:07:05,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:07:05,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:07:05,053 INFO L87 Difference]: Start difference. First operand 512 states and 678 transitions. Second operand 3 states. [2019-12-07 11:07:05,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:07:05,147 INFO L93 Difference]: Finished difference Result 1055 states and 1392 transitions. [2019-12-07 11:07:05,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:07:05,147 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 370 [2019-12-07 11:07:05,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:07:05,149 INFO L225 Difference]: With dead ends: 1055 [2019-12-07 11:07:05,149 INFO L226 Difference]: Without dead ends: 550 [2019-12-07 11:07:05,150 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:07:05,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2019-12-07 11:07:05,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 548. [2019-12-07 11:07:05,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 548 states. [2019-12-07 11:07:05,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 719 transitions. [2019-12-07 11:07:05,163 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 719 transitions. Word has length 370 [2019-12-07 11:07:05,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:07:05,163 INFO L462 AbstractCegarLoop]: Abstraction has 548 states and 719 transitions. [2019-12-07 11:07:05,163 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:07:05,163 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 719 transitions. [2019-12-07 11:07:05,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2019-12-07 11:07:05,165 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:07:05,165 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 11, 11, 10, 10, 9, 9, 8, 8, 8, 8, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 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-12-07 11:07:05,165 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 11:07:05,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:07:05,166 INFO L82 PathProgramCache]: Analyzing trace with hash 458339096, now seen corresponding path program 1 times [2019-12-07 11:07:05,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:07:05,166 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833589398] [2019-12-07 11:07:05,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:07:05,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:07:05,339 INFO L134 CoverageAnalysis]: Checked inductivity of 1719 backedges. 970 proven. 0 refuted. 0 times theorem prover too weak. 749 trivial. 0 not checked. [2019-12-07 11:07:05,339 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833589398] [2019-12-07 11:07:05,339 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:07:05,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:07:05,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522070916] [2019-12-07 11:07:05,340 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:07:05,340 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:07:05,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:07:05,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:07:05,340 INFO L87 Difference]: Start difference. First operand 548 states and 719 transitions. Second operand 3 states. [2019-12-07 11:07:05,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:07:05,374 INFO L93 Difference]: Finished difference Result 1630 states and 2135 transitions. [2019-12-07 11:07:05,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:07:05,375 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 403 [2019-12-07 11:07:05,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:07:05,379 INFO L225 Difference]: With dead ends: 1630 [2019-12-07 11:07:05,379 INFO L226 Difference]: Without dead ends: 1089 [2019-12-07 11:07:05,380 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:07:05,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1089 states. [2019-12-07 11:07:05,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1089 to 1087. [2019-12-07 11:07:05,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1087 states. [2019-12-07 11:07:05,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1087 states to 1087 states and 1426 transitions. [2019-12-07 11:07:05,405 INFO L78 Accepts]: Start accepts. Automaton has 1087 states and 1426 transitions. Word has length 403 [2019-12-07 11:07:05,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:07:05,406 INFO L462 AbstractCegarLoop]: Abstraction has 1087 states and 1426 transitions. [2019-12-07 11:07:05,406 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:07:05,406 INFO L276 IsEmpty]: Start isEmpty. Operand 1087 states and 1426 transitions. [2019-12-07 11:07:05,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2019-12-07 11:07:05,408 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:07:05,408 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 11, 11, 10, 10, 9, 9, 8, 8, 8, 8, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 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-12-07 11:07:05,408 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 11:07:05,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:07:05,409 INFO L82 PathProgramCache]: Analyzing trace with hash 747158486, now seen corresponding path program 1 times [2019-12-07 11:07:05,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:07:05,409 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18384593] [2019-12-07 11:07:05,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:07:05,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:07:05,516 INFO L134 CoverageAnalysis]: Checked inductivity of 1719 backedges. 354 proven. 7 refuted. 0 times theorem prover too weak. 1358 trivial. 0 not checked. [2019-12-07 11:07:05,517 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18384593] [2019-12-07 11:07:05,517 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1595463603] [2019-12-07 11:07:05,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_638d51d2-c7d7-46a6-9da6-e0d0e057e8f0/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-12-07 11:07:05,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:07:05,592 INFO L264 TraceCheckSpWp]: Trace formula consists of 639 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 11:07:05,595 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:07:05,676 INFO L134 CoverageAnalysis]: Checked inductivity of 1719 backedges. 354 proven. 7 refuted. 0 times theorem prover too weak. 1358 trivial. 0 not checked. [2019-12-07 11:07:05,676 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 11:07:05,677 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-12-07 11:07:05,677 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184411912] [2019-12-07 11:07:05,677 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:07:05,677 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:07:05,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:07:05,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:07:05,678 INFO L87 Difference]: Start difference. First operand 1087 states and 1426 transitions. Second operand 4 states. [2019-12-07 11:07:05,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:07:05,824 INFO L93 Difference]: Finished difference Result 2539 states and 3361 transitions. [2019-12-07 11:07:05,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:07:05,824 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 403 [2019-12-07 11:07:05,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:07:05,825 INFO L225 Difference]: With dead ends: 2539 [2019-12-07 11:07:05,825 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 11:07:05,827 INFO L630 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-12-07 11:07:05,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 11:07:05,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 11:07:05,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 11:07:05,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 11:07:05,827 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 403 [2019-12-07 11:07:05,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:07:05,828 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 11:07:05,828 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:07:05,828 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 11:07:05,828 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 11:07:06,028 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:07:06,031 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 11:07:06,548 WARN L192 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 244 DAG size of output: 194 [2019-12-07 11:07:06,747 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 244 DAG size of output: 194 [2019-12-07 11:07:06,927 WARN L192 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 57 [2019-12-07 11:07:07,181 WARN L192 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 62 [2019-12-07 11:07:07,343 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 57 [2019-12-07 11:07:07,474 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 47 [2019-12-07 11:07:07,588 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 33 [2019-12-07 11:07:07,716 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 47 [2019-12-07 11:07:07,910 WARN L192 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 47 [2019-12-07 11:07:08,246 WARN L192 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 29 [2019-12-07 11:07:08,452 WARN L192 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 46 [2019-12-07 11:07:08,618 WARN L192 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 46 [2019-12-07 11:07:08,843 WARN L192 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 14 [2019-12-07 11:07:09,134 WARN L192 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 47 [2019-12-07 11:07:09,262 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 14 [2019-12-07 11:07:09,479 WARN L192 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 52 [2019-12-07 11:07:10,637 WARN L192 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 181 DAG size of output: 68 [2019-12-07 11:07:10,759 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 6 [2019-12-07 11:07:10,887 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 48 [2019-12-07 11:07:12,348 WARN L192 SmtUtils]: Spent 1.46 s on a formula simplification. DAG size of input: 181 DAG size of output: 68 [2019-12-07 11:07:12,598 WARN L192 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 29 [2019-12-07 11:07:12,602 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 260) no Hoare annotation was computed. [2019-12-07 11:07:12,602 INFO L246 CegarLoopResult]: For program point L630(lines 630 654) no Hoare annotation was computed. [2019-12-07 11:07:12,602 INFO L246 CegarLoopResult]: For program point L564(lines 564 568) no Hoare annotation was computed. [2019-12-07 11:07:12,602 INFO L246 CegarLoopResult]: For program point L498(lines 498 502) no Hoare annotation was computed. [2019-12-07 11:07:12,602 INFO L246 CegarLoopResult]: For program point L564-2(lines 564 568) no Hoare annotation was computed. [2019-12-07 11:07:12,602 INFO L246 CegarLoopResult]: For program point L498-2(lines 209 590) no Hoare annotation was computed. [2019-12-07 11:07:12,603 INFO L246 CegarLoopResult]: For program point L201(lines 201 595) no Hoare annotation was computed. [2019-12-07 11:07:12,603 INFO L246 CegarLoopResult]: For program point L168(lines 168 606) no Hoare annotation was computed. [2019-12-07 11:07:12,603 INFO L246 CegarLoopResult]: For program point L135(lines 135 617) no Hoare annotation was computed. [2019-12-07 11:07:12,603 INFO L246 CegarLoopResult]: For program point L102(lines 102 628) no Hoare annotation was computed. [2019-12-07 11:07:12,603 INFO L246 CegarLoopResult]: For program point L664(lines 664 668) no Hoare annotation was computed. [2019-12-07 11:07:12,603 INFO L246 CegarLoopResult]: For program point L631(lines 631 640) no Hoare annotation was computed. [2019-12-07 11:07:12,603 INFO L246 CegarLoopResult]: For program point L664-2(lines 664 668) no Hoare annotation was computed. [2019-12-07 11:07:12,603 INFO L246 CegarLoopResult]: For program point L631-2(lines 630 652) no Hoare annotation was computed. [2019-12-07 11:07:12,603 INFO L246 CegarLoopResult]: For program point L268(lines 268 272) no Hoare annotation was computed. [2019-12-07 11:07:12,604 INFO L242 CegarLoopResult]: At program point L202(lines 198 596) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 16384))) (.cse3 (<= 8576 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 24576))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and .cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) .cse1 .cse2 .cse3 .cse4 .cse5))) [2019-12-07 11:07:12,604 INFO L242 CegarLoopResult]: At program point L103(lines 102 628) the Hoare annotation is: false [2019-12-07 11:07:12,604 INFO L246 CegarLoopResult]: For program point L302(lines 302 306) no Hoare annotation was computed. [2019-12-07 11:07:12,604 INFO L246 CegarLoopResult]: For program point L302-2(lines 209 590) no Hoare annotation was computed. [2019-12-07 11:07:12,604 INFO L246 CegarLoopResult]: For program point L633(lines 633 637) no Hoare annotation was computed. [2019-12-07 11:07:12,604 INFO L246 CegarLoopResult]: For program point L204(lines 204 594) no Hoare annotation was computed. [2019-12-07 11:07:12,605 INFO L246 CegarLoopResult]: For program point L171(lines 171 605) no Hoare annotation was computed. [2019-12-07 11:07:12,605 INFO L246 CegarLoopResult]: For program point L138(lines 138 616) no Hoare annotation was computed. [2019-12-07 11:07:12,605 INFO L246 CegarLoopResult]: For program point L105(lines 105 627) no Hoare annotation was computed. [2019-12-07 11:07:12,605 INFO L246 CegarLoopResult]: For program point L337(lines 337 341) no Hoare annotation was computed. [2019-12-07 11:07:12,605 INFO L246 CegarLoopResult]: For program point L337-2(lines 209 590) no Hoare annotation was computed. [2019-12-07 11:07:12,605 INFO L242 CegarLoopResult]: At program point L205(lines 204 594) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) [2019-12-07 11:07:12,605 INFO L242 CegarLoopResult]: 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-12-07 11:07:12,606 INFO L242 CegarLoopResult]: At program point L139(lines 135 617) 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 8545))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8192))) (.cse11 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8195))) (.cse13 (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 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) .cse10 .cse11 .cse12 .cse13))) [2019-12-07 11:07:12,606 INFO L246 CegarLoopResult]: For program point L73(lines 73 81) no Hoare annotation was computed. [2019-12-07 11:07:12,606 INFO L246 CegarLoopResult]: For program point L437(lines 437 449) no Hoare annotation was computed. [2019-12-07 11:07:12,606 INFO L242 CegarLoopResult]: 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-12-07 11:07:12,606 INFO L246 CegarLoopResult]: For program point L437-2(lines 437 449) no Hoare annotation was computed. [2019-12-07 11:07:12,607 INFO L246 CegarLoopResult]: For program point L174(lines 174 604) no Hoare annotation was computed. [2019-12-07 11:07:12,607 INFO L246 CegarLoopResult]: For program point L141(lines 141 615) no Hoare annotation was computed. [2019-12-07 11:07:12,607 INFO L246 CegarLoopResult]: For program point L108(lines 108 626) no Hoare annotation was computed. [2019-12-07 11:07:12,607 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 260) no Hoare annotation was computed. [2019-12-07 11:07:12,607 INFO L242 CegarLoopResult]: At program point L208(lines 207 593) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) [2019-12-07 11:07:12,607 INFO L246 CegarLoopResult]: For program point L76(lines 76 80) no Hoare annotation was computed. [2019-12-07 11:07:12,607 INFO L246 CegarLoopResult]: For program point L76-2(lines 73 81) no Hoare annotation was computed. [2019-12-07 11:07:12,607 INFO L246 CegarLoopResult]: For program point L539(lines 539 544) no Hoare annotation was computed. [2019-12-07 11:07:12,608 INFO L246 CegarLoopResult]: For program point L440(lines 440 445) no Hoare annotation was computed. [2019-12-07 11:07:12,608 INFO L246 CegarLoopResult]: For program point L407(lines 407 411) no Hoare annotation was computed. [2019-12-07 11:07:12,608 INFO L246 CegarLoopResult]: For program point L242(lines 242 247) no Hoare annotation was computed. [2019-12-07 11:07:12,608 INFO L246 CegarLoopResult]: For program point L177(lines 177 603) no Hoare annotation was computed. [2019-12-07 11:07:12,608 INFO L246 CegarLoopResult]: For program point L144(lines 144 614) no Hoare annotation was computed. [2019-12-07 11:07:12,608 INFO L246 CegarLoopResult]: For program point L111(lines 111 625) no Hoare annotation was computed. [2019-12-07 11:07:12,608 INFO L246 CegarLoopResult]: For program point L574(lines 574 584) no Hoare annotation was computed. [2019-12-07 11:07:12,608 INFO L246 CegarLoopResult]: For program point L574-1(lines 574 584) no Hoare annotation was computed. [2019-12-07 11:07:12,608 INFO L246 CegarLoopResult]: For program point L508(lines 508 512) no Hoare annotation was computed. [2019-12-07 11:07:12,609 INFO L246 CegarLoopResult]: For program point L508-2(lines 508 512) no Hoare annotation was computed. [2019-12-07 11:07:12,609 INFO L242 CegarLoopResult]: At program point L178(lines 174 604) the Hoare annotation is: (let ((.cse0 (<= 8576 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (or (and .cse0 .cse1 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) .cse0 .cse1))) [2019-12-07 11:07:12,609 INFO L242 CegarLoopResult]: 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-12-07 11:07:12,609 INFO L246 CegarLoopResult]: For program point L476(lines 476 480) no Hoare annotation was computed. [2019-12-07 11:07:12,609 INFO L242 CegarLoopResult]: At program point L212(lines 105 627) the Hoare annotation is: false [2019-12-07 11:07:12,609 INFO L249 CegarLoopResult]: At program point L675(lines 65 677) the Hoare annotation is: true [2019-12-07 11:07:12,609 INFO L246 CegarLoopResult]: For program point L642(lines 642 648) no Hoare annotation was computed. [2019-12-07 11:07:12,610 INFO L246 CegarLoopResult]: For program point L345(lines 345 377) no Hoare annotation was computed. [2019-12-07 11:07:12,610 INFO L246 CegarLoopResult]: For program point L312(lines 312 316) no Hoare annotation was computed. [2019-12-07 11:07:12,610 INFO L246 CegarLoopResult]: For program point L312-2(lines 312 316) no Hoare annotation was computed. [2019-12-07 11:07:12,610 INFO L246 CegarLoopResult]: For program point L180(lines 180 602) no Hoare annotation was computed. [2019-12-07 11:07:12,610 INFO L246 CegarLoopResult]: For program point L147(lines 147 613) no Hoare annotation was computed. [2019-12-07 11:07:12,610 INFO L246 CegarLoopResult]: For program point L114(lines 114 624) no Hoare annotation was computed. [2019-12-07 11:07:12,610 INFO L249 CegarLoopResult]: At program point L676(lines 10 678) the Hoare annotation is: true [2019-12-07 11:07:12,610 INFO L246 CegarLoopResult]: For program point L577(lines 577 581) no Hoare annotation was computed. [2019-12-07 11:07:12,610 INFO L246 CegarLoopResult]: For program point L83(lines 83 91) no Hoare annotation was computed. [2019-12-07 11:07:12,611 INFO L246 CegarLoopResult]: For program point L83-1(lines 65 677) no Hoare annotation was computed. [2019-12-07 11:07:12,611 INFO L246 CegarLoopResult]: For program point L348(lines 348 376) no Hoare annotation was computed. [2019-12-07 11:07:12,611 INFO L246 CegarLoopResult]: For program point L348-1(lines 348 376) no Hoare annotation was computed. [2019-12-07 11:07:12,611 INFO L246 CegarLoopResult]: For program point L249(lines 249 262) no Hoare annotation was computed. [2019-12-07 11:07:12,611 INFO L246 CegarLoopResult]: For program point L183(lines 183 601) no Hoare annotation was computed. [2019-12-07 11:07:12,611 INFO L246 CegarLoopResult]: For program point L150(lines 150 612) no Hoare annotation was computed. [2019-12-07 11:07:12,611 INFO L246 CegarLoopResult]: For program point L117(lines 117 623) no Hoare annotation was computed. [2019-12-07 11:07:12,611 INFO L246 CegarLoopResult]: For program point L84(lines 84 88) no Hoare annotation was computed. [2019-12-07 11:07:12,611 INFO L246 CegarLoopResult]: For program point L349(lines 349 373) no Hoare annotation was computed. [2019-12-07 11:07:12,611 INFO L246 CegarLoopResult]: For program point L217(lines 217 221) no Hoare annotation was computed. [2019-12-07 11:07:12,612 INFO L242 CegarLoopResult]: At program point L184(lines 180 602) the Hoare annotation is: (let ((.cse0 (<= 8576 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (or (and .cse0 .cse1 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) .cse0 .cse1))) [2019-12-07 11:07:12,612 INFO L242 CegarLoopResult]: 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-12-07 11:07:12,612 INFO L246 CegarLoopResult]: For program point L217-2(lines 209 590) no Hoare annotation was computed. [2019-12-07 11:07:12,612 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 11:07:12,612 INFO L246 CegarLoopResult]: For program point L251(lines 251 256) no Hoare annotation was computed. [2019-12-07 11:07:12,612 INFO L246 CegarLoopResult]: For program point L549(lines 549 557) no Hoare annotation was computed. [2019-12-07 11:07:12,612 INFO L246 CegarLoopResult]: For program point L285(lines 285 289) no Hoare annotation was computed. [2019-12-07 11:07:12,613 INFO L246 CegarLoopResult]: For program point L285-2(lines 209 590) no Hoare annotation was computed. [2019-12-07 11:07:12,613 INFO L246 CegarLoopResult]: For program point L186(lines 186 600) no Hoare annotation was computed. [2019-12-07 11:07:12,613 INFO L246 CegarLoopResult]: For program point L153(lines 153 611) no Hoare annotation was computed. [2019-12-07 11:07:12,613 INFO L246 CegarLoopResult]: For program point L120(lines 120 622) no Hoare annotation was computed. [2019-12-07 11:07:12,613 INFO L246 CegarLoopResult]: For program point L385(lines 385 416) no Hoare annotation was computed. [2019-12-07 11:07:12,613 INFO L246 CegarLoopResult]: For program point L352(lines 352 372) no Hoare annotation was computed. [2019-12-07 11:07:12,613 INFO L242 CegarLoopResult]: At program point L121(lines 117 623) the Hoare annotation is: false [2019-12-07 11:07:12,613 INFO L246 CegarLoopResult]: For program point L386(lines 386 392) no Hoare annotation was computed. [2019-12-07 11:07:12,613 INFO L246 CegarLoopResult]: For program point L552(lines 552 556) no Hoare annotation was computed. [2019-12-07 11:07:12,614 INFO L246 CegarLoopResult]: For program point L519(lines 519 524) no Hoare annotation was computed. [2019-12-07 11:07:12,614 INFO L246 CegarLoopResult]: For program point L354(lines 354 358) no Hoare annotation was computed. [2019-12-07 11:07:12,614 INFO L246 CegarLoopResult]: For program point L321-1(lines 321 330) no Hoare annotation was computed. [2019-12-07 11:07:12,614 INFO L246 CegarLoopResult]: For program point L354-2(lines 352 370) no Hoare annotation was computed. [2019-12-07 11:07:12,614 INFO L246 CegarLoopResult]: For program point L189(lines 189 599) no Hoare annotation was computed. [2019-12-07 11:07:12,614 INFO L246 CegarLoopResult]: For program point L156(lines 156 610) no Hoare annotation was computed. [2019-12-07 11:07:12,614 INFO L246 CegarLoopResult]: For program point L123(lines 123 621) no Hoare annotation was computed. [2019-12-07 11:07:12,614 INFO L242 CegarLoopResult]: At program point L553(lines 65 677) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) [2019-12-07 11:07:12,614 INFO L246 CegarLoopResult]: For program point L487(lines 487 491) no Hoare annotation was computed. [2019-12-07 11:07:12,615 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 11:07:12,615 INFO L242 CegarLoopResult]: At program point L190(lines 186 600) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 16384))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse5 (<= 8576 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 24576))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)))) (or (and .cse0 .cse1 .cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-12-07 11:07:12,615 INFO L242 CegarLoopResult]: 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-12-07 11:07:12,615 INFO L242 CegarLoopResult]: 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 8545))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8192))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.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 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (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))))) [2019-12-07 11:07:12,615 INFO L246 CegarLoopResult]: For program point L455(lines 455 459) no Hoare annotation was computed. [2019-12-07 11:07:12,616 INFO L246 CegarLoopResult]: For program point L258(line 258) no Hoare annotation was computed. [2019-12-07 11:07:12,616 INFO L246 CegarLoopResult]: For program point L258-1(line 258) no Hoare annotation was computed. [2019-12-07 11:07:12,616 INFO L246 CegarLoopResult]: For program point L192(lines 192 598) no Hoare annotation was computed. [2019-12-07 11:07:12,616 INFO L246 CegarLoopResult]: For program point L159(lines 159 609) no Hoare annotation was computed. [2019-12-07 11:07:12,616 INFO L246 CegarLoopResult]: For program point L126(lines 126 620) no Hoare annotation was computed. [2019-12-07 11:07:12,616 INFO L249 CegarLoopResult]: At program point L688(lines 679 690) the Hoare annotation is: true [2019-12-07 11:07:12,616 INFO L246 CegarLoopResult]: For program point L325(lines 325 329) no Hoare annotation was computed. [2019-12-07 11:07:12,616 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 258) no Hoare annotation was computed. [2019-12-07 11:07:12,616 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-12-07 11:07:12,616 INFO L246 CegarLoopResult]: For program point L260(line 260) no Hoare annotation was computed. [2019-12-07 11:07:12,617 INFO L246 CegarLoopResult]: For program point L260-1(line 260) no Hoare annotation was computed. [2019-12-07 11:07:12,617 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 258) no Hoare annotation was computed. [2019-12-07 11:07:12,617 INFO L242 CegarLoopResult]: At program point L591(lines 99 659) the Hoare annotation is: (let ((.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse12 (<= 8576 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0)) (.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))) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.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))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.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 .cse2 .cse3 .cse4 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse6 .cse7 .cse0 .cse8 .cse11 .cse9 .cse10 .cse1) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse7 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse8 .cse11 .cse9 .cse10 .cse12 .cse13) (and .cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse3 .cse4 .cse7 .cse0 .cse8 .cse11 .cse9 .cse10 .cse12 .cse1) (and .cse2 .cse3 .cse4 .cse5 .cse7 .cse0 .cse8 .cse11 .cse9 .cse10 .cse1 .cse13))) [2019-12-07 11:07:12,617 INFO L246 CegarLoopResult]: For program point L558(lines 558 562) no Hoare annotation was computed. [2019-12-07 11:07:12,617 INFO L246 CegarLoopResult]: For program point L426(lines 426 430) no Hoare annotation was computed. [2019-12-07 11:07:12,618 INFO L242 CegarLoopResult]: 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-12-07 11:07:12,618 INFO L246 CegarLoopResult]: For program point L195(lines 195 597) no Hoare annotation was computed. [2019-12-07 11:07:12,618 INFO L246 CegarLoopResult]: For program point L162(lines 162 608) no Hoare annotation was computed. [2019-12-07 11:07:12,618 INFO L246 CegarLoopResult]: For program point L129(lines 129 619) no Hoare annotation was computed. [2019-12-07 11:07:12,618 INFO L246 CegarLoopResult]: For program point L526(lines 526 530) no Hoare annotation was computed. [2019-12-07 11:07:12,618 INFO L246 CegarLoopResult]: For program point L460(lines 460 471) no Hoare annotation was computed. [2019-12-07 11:07:12,618 INFO L246 CegarLoopResult]: For program point L526-2(lines 209 590) no Hoare annotation was computed. [2019-12-07 11:07:12,618 INFO L242 CegarLoopResult]: 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-12-07 11:07:12,619 INFO L246 CegarLoopResult]: For program point L229(lines 229 240) no Hoare annotation was computed. [2019-12-07 11:07:12,619 INFO L242 CegarLoopResult]: At program point L196(lines 192 598) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 16384))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse3 (<= 8576 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 24576))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)))) (or (and .cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-12-07 11:07:12,619 INFO L242 CegarLoopResult]: 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-12-07 11:07:12,619 INFO L246 CegarLoopResult]: For program point L229-2(lines 229 240) no Hoare annotation was computed. [2019-12-07 11:07:12,619 INFO L246 CegarLoopResult]: For program point L362(lines 362 366) no Hoare annotation was computed. [2019-12-07 11:07:12,619 INFO L249 CegarLoopResult]: At program point L660(lines 98 661) the Hoare annotation is: true [2019-12-07 11:07:12,619 INFO L246 CegarLoopResult]: For program point L396(lines 396 402) no Hoare annotation was computed. [2019-12-07 11:07:12,619 INFO L246 CegarLoopResult]: For program point L231(lines 231 236) no Hoare annotation was computed. [2019-12-07 11:07:12,619 INFO L246 CegarLoopResult]: For program point L198(lines 198 596) no Hoare annotation was computed. [2019-12-07 11:07:12,620 INFO L246 CegarLoopResult]: For program point L165(lines 165 607) no Hoare annotation was computed. [2019-12-07 11:07:12,620 INFO L246 CegarLoopResult]: For program point L132(lines 132 618) no Hoare annotation was computed. [2019-12-07 11:07:12,620 INFO L242 CegarLoopResult]: At program point L99-2(lines 99 659) the Hoare annotation is: (let ((.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse12 (<= 8576 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0)) (.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))) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.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))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.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 .cse2 .cse3 .cse4 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse6 .cse7 .cse0 .cse8 .cse11 .cse9 .cse10 .cse1) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse7 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse8 .cse11 .cse9 .cse10 .cse12 .cse13) (and .cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse3 .cse4 .cse7 .cse0 .cse8 .cse11 .cse9 .cse10 .cse12 .cse1) (and .cse2 .cse3 .cse4 .cse5 .cse7 .cse0 .cse8 .cse11 .cse9 .cse10 .cse1 .cse13))) [2019-12-07 11:07:12,620 INFO L242 CegarLoopResult]: At program point L166(lines 165 607) the Hoare annotation is: (let ((.cse9 (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 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 8545))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8192))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.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))) (.cse16 (<= 8576 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-12-07 11:07:12,620 INFO L242 CegarLoopResult]: 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 8545))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8192))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.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 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (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))))) [2019-12-07 11:07:12,621 INFO L246 CegarLoopResult]: For program point L100(line 100) no Hoare annotation was computed. [2019-12-07 11:07:12,621 INFO L246 CegarLoopResult]: For program point L629(lines 629 657) no Hoare annotation was computed. [2019-12-07 11:07:12,621 INFO L246 CegarLoopResult]: For program point L464(lines 464 468) no Hoare annotation was computed. [2019-12-07 11:07:12,650 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 11:07:12 BoogieIcfgContainer [2019-12-07 11:07:12,650 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 11:07:12,651 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 11:07:12,651 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 11:07:12,651 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 11:07:12,651 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:06:59" (3/4) ... [2019-12-07 11:07:12,653 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 11:07:12,666 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-12-07 11:07:12,666 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-12-07 11:07:12,734 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_638d51d2-c7d7-46a6-9da6-e0d0e057e8f0/bin/uautomizer/witness.graphml [2019-12-07 11:07:12,734 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 11:07:12,735 INFO L168 Benchmark]: Toolchain (without parser) took 14042.65 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 471.3 MB). Free memory was 946.0 MB in the beginning and 877.8 MB in the end (delta: 68.3 MB). Peak memory consumption was 539.6 MB. Max. memory is 11.5 GB. [2019-12-07 11:07:12,735 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:07:12,736 INFO L168 Benchmark]: CACSL2BoogieTranslator took 250.03 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.7 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -145.0 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. [2019-12-07 11:07:12,736 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.50 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:07:12,736 INFO L168 Benchmark]: Boogie Preprocessor took 24.93 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 11:07:12,736 INFO L168 Benchmark]: RCFGBuilder took 414.58 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 55.9 MB). Peak memory consumption was 55.9 MB. Max. memory is 11.5 GB. [2019-12-07 11:07:12,736 INFO L168 Benchmark]: TraceAbstraction took 13230.73 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 369.6 MB). Free memory was 1.0 GB in the beginning and 908.6 MB in the end (delta: 121.1 MB). Peak memory consumption was 518.4 MB. Max. memory is 11.5 GB. [2019-12-07 11:07:12,737 INFO L168 Benchmark]: Witness Printer took 83.67 ms. Allocated memory is still 1.5 GB. Free memory was 908.6 MB in the beginning and 877.8 MB in the end (delta: 30.8 MB). Peak memory consumption was 30.8 MB. Max. memory is 11.5 GB. [2019-12-07 11:07:12,738 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 250.03 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.7 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -145.0 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 35.50 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.93 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 414.58 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 55.9 MB). Peak memory consumption was 55.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 13230.73 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 369.6 MB). Free memory was 1.0 GB in the beginning and 908.6 MB in the end (delta: 121.1 MB). Peak memory consumption was 518.4 MB. Max. memory is 11.5 GB. * Witness Printer took 83.67 ms. Allocated memory is still 1.5 GB. Free memory was 908.6 MB in the beginning and 877.8 MB in the end (delta: 30.8 MB). Peak memory consumption was 30.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 260]: 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: 258]: 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 == 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)) || ((((((((((((((((!(s__state == 8513) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8192)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 207]: Loop Invariant Derived loop invariant: !(s__state == 12292) - InvariantResult [Line: 165]: 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__s3__tmp__next_state___0 <= 3) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8192)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480)) || (((((((((((((((((!(s__state == 8513) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8192)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480)) && 8576 <= s__s3__tmp__next_state___0)) || (((((((((((((((((!(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 == 8497)) && s__s3__tmp__next_state___0 <= 8640) && !(s__state == 8192)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480)) && 8576 <= s__s3__tmp__next_state___0) && !(0 == s__hit)) - InvariantResult [Line: 123]: Loop Invariant Derived loop invariant: ((((((((((((((((!(s__state == 8513) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8192)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480)) || ((((((((((((((((!(s__state == 8513) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8192)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 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 == 8673) && !(s__state == 8656)) && !(s__state == 8657)) && !(s__state == 8576)) && !(s__state == 16384)) && !(s__state == 8672)) && 8576 <= s__state) && !(s__state == 24576)) && !(s__state == 12292)) || ((((((((!(s__state == 8673) && !(s__state == 8656)) && !(s__state == 8657)) && !(s__state == 16384)) && !(s__state == 8672)) && 8576 <= s__state) && !(s__state == 24576)) && !(s__state == 12292)) && !(0 == s__hit)) - InvariantResult [Line: 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: ((((((!(s__state == 8656) && !(s__state == 8657)) && !(s__state == 16384)) && 8576 <= s__state) && !(s__state == 24576)) && !(s__state == 12292)) && !(0 == s__hit)) || ((((((!(s__state == 8656) && !(s__state == 8576)) && !(s__state == 8657)) && !(s__state == 16384)) && 8576 <= s__state) && !(s__state == 24576)) && !(s__state == 12292)) - 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: ((8576 <= s__state && s__state <= 8640) && !(0 == s__hit)) || ((!(s__state == 8576) && 8576 <= s__state) && s__state <= 8640) - 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: ((8576 <= s__state && s__state <= 8640) && !(0 == s__hit)) || ((!(s__state == 8576) && 8576 <= s__state) && s__state <= 8640) - 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 == 8513) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8192)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480)) - 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 == 8561) && !(s__state == 8529)) && !(s__state == 8481)) && s__s3__tmp__next_state___0 <= 3) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8513)) && !(s__state == 8192)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480)) && !(s__state == 8545))) || ((((((((((((!(s__state == 8513) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8497)) && s__s3__tmp__next_state___0 <= 8640) && !(s__state == 8192)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480)) && 8576 <= s__s3__tmp__next_state___0) && !(0 == s__hit))) || (((((((((((!(s__state == 8561) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8497)) && !(s__state == 8513)) && !(s__state == 8192)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480)) && 8576 <= s__s3__tmp__next_state___0) && !(s__state == 8545))) || (((((((((((!(s__state == 8561) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8513)) && !(s__state == 8192)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480)) && !(s__state == 8545)) && !(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 == 8561) && !(s__state == 8529)) && !(s__state == 8481)) && s__s3__tmp__next_state___0 <= 3) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8513)) && !(s__state == 8192)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480)) && !(s__state == 8545))) || ((((((((((((!(s__state == 8513) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8497)) && s__s3__tmp__next_state___0 <= 8640) && !(s__state == 8192)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480)) && 8576 <= s__s3__tmp__next_state___0) && !(0 == s__hit))) || (((((((((((!(s__state == 8561) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8497)) && !(s__state == 8513)) && !(s__state == 8192)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480)) && 8576 <= s__s3__tmp__next_state___0) && !(s__state == 8545))) || (((((((((((!(s__state == 8561) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8513)) && !(s__state == 8192)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480)) && !(s__state == 8545)) && !(0 == s__hit)) - InvariantResult [Line: 192]: Loop Invariant Derived loop invariant: ((((((!(s__state == 8673) && !(s__state == 8576)) && !(s__state == 16384)) && !(s__state == 8672)) && 8576 <= s__state) && !(s__state == 24576)) && !(s__state == 12292)) || ((((((!(s__state == 8673) && !(s__state == 16384)) && !(s__state == 8672)) && 8576 <= s__state) && !(s__state == 24576)) && !(s__state == 12292)) && !(0 == s__hit)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 146 locations, 4 error locations. Result: SAFE, OverallTime: 6.5s, OverallIterations: 32, TraceHistogramMax: 14, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 6.5s, HoareTripleCheckerStatistics: 5368 SDtfs, 4720 SDslu, 2130 SDs, 0 SdLazy, 3171 SolverSat, 1069 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 964 GetRequests, 924 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s 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.3s AutomataMinimizationTime, 32 MinimizatonAttempts, 1658 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 29 LocationsWithAnnotation, 29 PreInvPairs, 206 NumberOfFragments, 1796 HoareAnnotationTreeSize, 29 FomulaSimplifications, 249232 FormulaSimplificationTreeSizeReduction, 0.7s HoareSimplificationTime, 29 FomulaSimplificationsInter, 93537 FormulaSimplificationTreeSizeReductionInter, 5.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s 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...