./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/bitvector/s3_srvr_3a.BV.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 6b5699aa Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_a546479d-21dc-4402-a1a0-6a017ef060ec/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_a546479d-21dc-4402-a1a0-6a017ef060ec/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_a546479d-21dc-4402-a1a0-6a017ef060ec/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_a546479d-21dc-4402-a1a0-6a017ef060ec/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/bitvector/s3_srvr_3a.BV.c.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_a546479d-21dc-4402-a1a0-6a017ef060ec/bin/uautomizer/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_a546479d-21dc-4402-a1a0-6a017ef060ec/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 3c83e1c64d2af1ac92027e4b29fb95a984369de1 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-6b5699a [2019-11-25 08:48:58,802 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 08:48:58,804 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 08:48:58,819 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 08:48:58,819 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 08:48:58,820 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 08:48:58,822 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 08:48:58,831 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 08:48:58,836 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 08:48:58,840 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 08:48:58,842 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 08:48:58,843 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 08:48:58,843 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 08:48:58,845 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 08:48:58,847 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 08:48:58,848 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 08:48:58,849 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 08:48:58,849 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 08:48:58,852 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 08:48:58,856 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 08:48:58,859 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 08:48:58,863 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 08:48:58,864 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 08:48:58,865 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 08:48:58,867 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 08:48:58,868 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 08:48:58,868 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 08:48:58,869 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 08:48:58,870 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 08:48:58,871 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 08:48:58,871 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 08:48:58,872 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 08:48:58,873 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 08:48:58,874 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 08:48:58,875 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 08:48:58,875 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 08:48:58,875 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 08:48:58,876 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 08:48:58,876 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 08:48:58,877 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 08:48:58,878 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 08:48:58,879 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_a546479d-21dc-4402-a1a0-6a017ef060ec/bin/uautomizer/config/svcomp-Overflow-32bit-Automizer_Default.epf [2019-11-25 08:48:58,907 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 08:48:58,909 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 08:48:58,910 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 08:48:58,912 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 08:48:58,912 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 08:48:58,913 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 08:48:58,913 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-25 08:48:58,913 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-25 08:48:58,914 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 08:48:58,914 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-25 08:48:58,915 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 08:48:58,915 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-25 08:48:58,915 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 08:48:58,916 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-25 08:48:58,916 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2019-11-25 08:48:58,916 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-25 08:48:58,916 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-25 08:48:58,916 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 08:48:58,917 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-25 08:48:58,918 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 08:48:58,918 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 08:48:58,920 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 08:48:58,920 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 08:48:58,921 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 08:48:58,921 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 08:48:58,922 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 08:48:58,922 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-25 08:48:58,922 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-25 08:48:58,922 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-25 08:48:58,923 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-25 08:48:58,923 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_a546479d-21dc-4402-a1a0-6a017ef060ec/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 -> 3c83e1c64d2af1ac92027e4b29fb95a984369de1 [2019-11-25 08:48:59,065 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 08:48:59,076 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 08:48:59,080 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 08:48:59,081 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 08:48:59,082 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 08:48:59,082 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_a546479d-21dc-4402-a1a0-6a017ef060ec/bin/uautomizer/../../sv-benchmarks/c/bitvector/s3_srvr_3a.BV.c.cil.c [2019-11-25 08:48:59,133 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a546479d-21dc-4402-a1a0-6a017ef060ec/bin/uautomizer/data/93b0ca472/93c31be7b1ae4469a287eddb0c5260d1/FLAG23aa9bca9 [2019-11-25 08:48:59,582 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 08:48:59,582 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_a546479d-21dc-4402-a1a0-6a017ef060ec/sv-benchmarks/c/bitvector/s3_srvr_3a.BV.c.cil.c [2019-11-25 08:48:59,605 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a546479d-21dc-4402-a1a0-6a017ef060ec/bin/uautomizer/data/93b0ca472/93c31be7b1ae4469a287eddb0c5260d1/FLAG23aa9bca9 [2019-11-25 08:48:59,617 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_a546479d-21dc-4402-a1a0-6a017ef060ec/bin/uautomizer/data/93b0ca472/93c31be7b1ae4469a287eddb0c5260d1 [2019-11-25 08:48:59,620 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 08:48:59,622 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-25 08:48:59,623 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 08:48:59,623 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 08:48:59,627 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 08:48:59,627 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:48:59" (1/1) ... [2019-11-25 08:48:59,630 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@649c2bec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:48:59, skipping insertion in model container [2019-11-25 08:48:59,630 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:48:59" (1/1) ... [2019-11-25 08:48:59,637 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 08:48:59,675 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-25 08:48:59,954 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:48:59,958 INFO L201 MainTranslator]: Completed pre-run [2019-11-25 08:49:00,017 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:49:00,031 INFO L205 MainTranslator]: Completed translation [2019-11-25 08:49:00,031 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:00 WrapperNode [2019-11-25 08:49:00,032 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 08:49:00,032 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-25 08:49:00,032 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-25 08:49:00,033 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-25 08:49:00,042 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:00" (1/1) ... [2019-11-25 08:49:00,052 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:00" (1/1) ... [2019-11-25 08:49:00,093 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-25 08:49:00,094 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-25 08:49:00,094 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-25 08:49:00,094 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-25 08:49:00,104 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:00" (1/1) ... [2019-11-25 08:49:00,104 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:00" (1/1) ... [2019-11-25 08:49:00,109 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:00" (1/1) ... [2019-11-25 08:49:00,109 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:00" (1/1) ... [2019-11-25 08:49:00,119 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:00" (1/1) ... [2019-11-25 08:49:00,158 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:00" (1/1) ... [2019-11-25 08:49:00,160 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:00" (1/1) ... [2019-11-25 08:49:00,165 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-25 08:49:00,165 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-25 08:49:00,165 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-25 08:49:00,166 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-25 08:49:00,167 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:00" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a546479d-21dc-4402-a1a0-6a017ef060ec/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 08:49:00,265 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-25 08:49:00,266 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-25 08:49:00,498 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-25 08:49:01,217 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-11-25 08:49:01,218 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-11-25 08:49:01,219 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-25 08:49:01,220 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-25 08:49:01,221 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:49:01 BoogieIcfgContainer [2019-11-25 08:49:01,221 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-25 08:49:01,222 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-25 08:49:01,222 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-25 08:49:01,230 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-25 08:49:01,230 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 08:48:59" (1/3) ... [2019-11-25 08:49:01,231 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c940936 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:49:01, skipping insertion in model container [2019-11-25 08:49:01,231 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:00" (2/3) ... [2019-11-25 08:49:01,232 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c940936 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:49:01, skipping insertion in model container [2019-11-25 08:49:01,234 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:49:01" (3/3) ... [2019-11-25 08:49:01,236 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_3a.BV.c.cil.c [2019-11-25 08:49:01,256 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-25 08:49:01,264 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2019-11-25 08:49:01,276 INFO L249 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2019-11-25 08:49:01,311 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-25 08:49:01,311 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-25 08:49:01,311 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-25 08:49:01,311 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-25 08:49:01,311 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-25 08:49:01,311 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-25 08:49:01,312 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-25 08:49:01,312 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-25 08:49:01,332 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states. [2019-11-25 08:49:01,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-25 08:49:01,339 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:49:01,340 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:49:01,340 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-25 08:49:01,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:01,347 INFO L82 PathProgramCache]: Analyzing trace with hash -1287811732, now seen corresponding path program 1 times [2019-11-25 08:49:01,357 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:01,357 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708634181] [2019-11-25 08:49:01,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:01,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:01,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:49:01,542 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708634181] [2019-11-25 08:49:01,543 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:49:01,543 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:49:01,545 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663888054] [2019-11-25 08:49:01,550 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:49:01,551 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:01,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:49:01,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:49:01,569 INFO L87 Difference]: Start difference. First operand 152 states. Second operand 3 states. [2019-11-25 08:49:01,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:49:01,912 INFO L93 Difference]: Finished difference Result 323 states and 532 transitions. [2019-11-25 08:49:01,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:49:01,914 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-25 08:49:01,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:49:01,934 INFO L225 Difference]: With dead ends: 323 [2019-11-25 08:49:01,935 INFO L226 Difference]: Without dead ends: 155 [2019-11-25 08:49:01,941 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:49:01,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-11-25 08:49:02,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2019-11-25 08:49:02,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-11-25 08:49:02,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 230 transitions. [2019-11-25 08:49:02,034 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 230 transitions. Word has length 16 [2019-11-25 08:49:02,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:49:02,034 INFO L462 AbstractCegarLoop]: Abstraction has 155 states and 230 transitions. [2019-11-25 08:49:02,034 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:49:02,035 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 230 transitions. [2019-11-25 08:49:02,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-25 08:49:02,036 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:49:02,036 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:49:02,036 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-25 08:49:02,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:02,037 INFO L82 PathProgramCache]: Analyzing trace with hash 664085130, now seen corresponding path program 1 times [2019-11-25 08:49:02,037 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:02,037 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756160773] [2019-11-25 08:49:02,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:02,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:02,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:49:02,122 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756160773] [2019-11-25 08:49:02,122 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:49:02,122 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:49:02,123 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383752479] [2019-11-25 08:49:02,125 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:49:02,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:02,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:49:02,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:49:02,126 INFO L87 Difference]: Start difference. First operand 155 states and 230 transitions. Second operand 3 states. [2019-11-25 08:49:02,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:49:02,325 INFO L93 Difference]: Finished difference Result 313 states and 462 transitions. [2019-11-25 08:49:02,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:49:02,326 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-25 08:49:02,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:49:02,328 INFO L225 Difference]: With dead ends: 313 [2019-11-25 08:49:02,329 INFO L226 Difference]: Without dead ends: 165 [2019-11-25 08:49:02,331 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:49:02,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-11-25 08:49:02,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 156. [2019-11-25 08:49:02,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-11-25 08:49:02,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 231 transitions. [2019-11-25 08:49:02,356 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 231 transitions. Word has length 17 [2019-11-25 08:49:02,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:49:02,356 INFO L462 AbstractCegarLoop]: Abstraction has 156 states and 231 transitions. [2019-11-25 08:49:02,356 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:49:02,357 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 231 transitions. [2019-11-25 08:49:02,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-25 08:49:02,358 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:49:02,358 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:49:02,366 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-25 08:49:02,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:02,366 INFO L82 PathProgramCache]: Analyzing trace with hash 37329238, now seen corresponding path program 1 times [2019-11-25 08:49:02,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:02,367 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793378960] [2019-11-25 08:49:02,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:02,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:02,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:49:02,422 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793378960] [2019-11-25 08:49:02,422 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:49:02,422 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:49:02,423 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108540143] [2019-11-25 08:49:02,423 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:49:02,423 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:02,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:49:02,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:49:02,424 INFO L87 Difference]: Start difference. First operand 156 states and 231 transitions. Second operand 3 states. [2019-11-25 08:49:02,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:49:02,595 INFO L93 Difference]: Finished difference Result 315 states and 464 transitions. [2019-11-25 08:49:02,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:49:02,596 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-25 08:49:02,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:49:02,598 INFO L225 Difference]: With dead ends: 315 [2019-11-25 08:49:02,598 INFO L226 Difference]: Without dead ends: 166 [2019-11-25 08:49:02,599 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:49:02,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-11-25 08:49:02,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 157. [2019-11-25 08:49:02,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-11-25 08:49:02,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 232 transitions. [2019-11-25 08:49:02,633 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 232 transitions. Word has length 18 [2019-11-25 08:49:02,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:49:02,634 INFO L462 AbstractCegarLoop]: Abstraction has 157 states and 232 transitions. [2019-11-25 08:49:02,635 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:49:02,635 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 232 transitions. [2019-11-25 08:49:02,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-25 08:49:02,636 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:49:02,637 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:49:02,637 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-25 08:49:02,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:02,638 INFO L82 PathProgramCache]: Analyzing trace with hash 1635395343, now seen corresponding path program 1 times [2019-11-25 08:49:02,638 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:02,638 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992643257] [2019-11-25 08:49:02,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:02,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:02,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:49:02,701 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992643257] [2019-11-25 08:49:02,701 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:49:02,702 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:49:02,702 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869722848] [2019-11-25 08:49:02,702 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:49:02,702 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:02,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:49:02,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:49:02,703 INFO L87 Difference]: Start difference. First operand 157 states and 232 transitions. Second operand 3 states. [2019-11-25 08:49:02,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:49:02,873 INFO L93 Difference]: Finished difference Result 317 states and 466 transitions. [2019-11-25 08:49:02,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:49:02,874 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-25 08:49:02,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:49:02,876 INFO L225 Difference]: With dead ends: 317 [2019-11-25 08:49:02,876 INFO L226 Difference]: Without dead ends: 167 [2019-11-25 08:49:02,877 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:49:02,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-11-25 08:49:02,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 158. [2019-11-25 08:49:02,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-11-25 08:49:02,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 233 transitions. [2019-11-25 08:49:02,899 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 233 transitions. Word has length 19 [2019-11-25 08:49:02,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:49:02,899 INFO L462 AbstractCegarLoop]: Abstraction has 158 states and 233 transitions. [2019-11-25 08:49:02,900 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:49:02,900 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 233 transitions. [2019-11-25 08:49:02,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-25 08:49:02,901 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:49:02,902 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:49:02,902 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-25 08:49:02,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:02,902 INFO L82 PathProgramCache]: Analyzing trace with hash -811500677, now seen corresponding path program 1 times [2019-11-25 08:49:02,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:02,903 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248253136] [2019-11-25 08:49:02,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:02,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:02,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:49:02,951 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248253136] [2019-11-25 08:49:02,952 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:49:02,952 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:49:02,952 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372662092] [2019-11-25 08:49:02,952 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:49:02,953 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:02,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:49:02,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:49:02,953 INFO L87 Difference]: Start difference. First operand 158 states and 233 transitions. Second operand 3 states. [2019-11-25 08:49:03,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:49:03,108 INFO L93 Difference]: Finished difference Result 319 states and 468 transitions. [2019-11-25 08:49:03,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:49:03,109 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-25 08:49:03,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:49:03,110 INFO L225 Difference]: With dead ends: 319 [2019-11-25 08:49:03,111 INFO L226 Difference]: Without dead ends: 168 [2019-11-25 08:49:03,111 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:49:03,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-11-25 08:49:03,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 159. [2019-11-25 08:49:03,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-11-25 08:49:03,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 234 transitions. [2019-11-25 08:49:03,122 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 234 transitions. Word has length 20 [2019-11-25 08:49:03,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:49:03,122 INFO L462 AbstractCegarLoop]: Abstraction has 159 states and 234 transitions. [2019-11-25 08:49:03,123 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:49:03,123 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 234 transitions. [2019-11-25 08:49:03,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-25 08:49:03,124 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:49:03,125 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:49:03,125 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-25 08:49:03,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:03,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1579118521, now seen corresponding path program 1 times [2019-11-25 08:49:03,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:03,126 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702985263] [2019-11-25 08:49:03,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:03,141 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-25 08:49:03,141 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1716196801] [2019-11-25 08:49:03,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a546479d-21dc-4402-a1a0-6a017ef060ec/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:49:03,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:03,221 INFO L255 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-25 08:49:03,227 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:49:03,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:49:03,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702985263] [2019-11-25 08:49:03,255 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-25 08:49:03,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1716196801] [2019-11-25 08:49:03,255 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:49:03,256 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:49:03,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365404961] [2019-11-25 08:49:03,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:49:03,257 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:03,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:49:03,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:49:03,257 INFO L87 Difference]: Start difference. First operand 159 states and 234 transitions. Second operand 3 states. [2019-11-25 08:49:03,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:49:03,333 INFO L93 Difference]: Finished difference Result 455 states and 672 transitions. [2019-11-25 08:49:03,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:49:03,333 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-11-25 08:49:03,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:49:03,336 INFO L225 Difference]: With dead ends: 455 [2019-11-25 08:49:03,336 INFO L226 Difference]: Without dead ends: 303 [2019-11-25 08:49:03,337 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:49:03,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2019-11-25 08:49:03,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 299. [2019-11-25 08:49:03,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2019-11-25 08:49:03,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 446 transitions. [2019-11-25 08:49:03,364 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 446 transitions. Word has length 39 [2019-11-25 08:49:03,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:49:03,365 INFO L462 AbstractCegarLoop]: Abstraction has 299 states and 446 transitions. [2019-11-25 08:49:03,365 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:49:03,365 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 446 transitions. [2019-11-25 08:49:03,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-25 08:49:03,373 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:49:03,373 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:49:03,576 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:49:03,577 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-25 08:49:03,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:03,577 INFO L82 PathProgramCache]: Analyzing trace with hash 643824433, now seen corresponding path program 1 times [2019-11-25 08:49:03,577 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:03,578 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426374842] [2019-11-25 08:49:03,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:03,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:03,637 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:49:03,637 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426374842] [2019-11-25 08:49:03,637 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:49:03,637 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:49:03,637 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839027654] [2019-11-25 08:49:03,638 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:49:03,638 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:03,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:49:03,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:49:03,638 INFO L87 Difference]: Start difference. First operand 299 states and 446 transitions. Second operand 3 states. [2019-11-25 08:49:03,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:49:03,807 INFO L93 Difference]: Finished difference Result 653 states and 987 transitions. [2019-11-25 08:49:03,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:49:03,807 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-11-25 08:49:03,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:49:03,810 INFO L225 Difference]: With dead ends: 653 [2019-11-25 08:49:03,810 INFO L226 Difference]: Without dead ends: 361 [2019-11-25 08:49:03,811 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:49:03,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2019-11-25 08:49:03,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 361. [2019-11-25 08:49:03,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-11-25 08:49:03,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 550 transitions. [2019-11-25 08:49:03,832 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 550 transitions. Word has length 44 [2019-11-25 08:49:03,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:49:03,834 INFO L462 AbstractCegarLoop]: Abstraction has 361 states and 550 transitions. [2019-11-25 08:49:03,834 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:49:03,834 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 550 transitions. [2019-11-25 08:49:03,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-25 08:49:03,837 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:49:03,838 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:49:03,838 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-25 08:49:03,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:03,839 INFO L82 PathProgramCache]: Analyzing trace with hash 1369957728, now seen corresponding path program 1 times [2019-11-25 08:49:03,839 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:03,839 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701283814] [2019-11-25 08:49:03,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:03,865 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-25 08:49:03,865 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1771706799] [2019-11-25 08:49:03,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a546479d-21dc-4402-a1a0-6a017ef060ec/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:49:03,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:03,935 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-25 08:49:03,939 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:49:03,950 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:49:03,952 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701283814] [2019-11-25 08:49:03,952 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-25 08:49:03,956 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1771706799] [2019-11-25 08:49:03,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:49:03,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:49:03,958 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985740267] [2019-11-25 08:49:03,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:49:03,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:03,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:49:03,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:49:03,959 INFO L87 Difference]: Start difference. First operand 361 states and 550 transitions. Second operand 3 states. [2019-11-25 08:49:04,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:49:04,009 INFO L93 Difference]: Finished difference Result 719 states and 1092 transitions. [2019-11-25 08:49:04,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:49:04,010 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-11-25 08:49:04,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:49:04,013 INFO L225 Difference]: With dead ends: 719 [2019-11-25 08:49:04,014 INFO L226 Difference]: Without dead ends: 536 [2019-11-25 08:49:04,014 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:49:04,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2019-11-25 08:49:04,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 532. [2019-11-25 08:49:04,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 532 states. [2019-11-25 08:49:04,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 815 transitions. [2019-11-25 08:49:04,037 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 815 transitions. Word has length 55 [2019-11-25 08:49:04,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:49:04,037 INFO L462 AbstractCegarLoop]: Abstraction has 532 states and 815 transitions. [2019-11-25 08:49:04,037 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:49:04,037 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 815 transitions. [2019-11-25 08:49:04,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-25 08:49:04,039 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:49:04,039 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:49:04,241 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:49:04,242 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-25 08:49:04,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:04,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1405602907, now seen corresponding path program 1 times [2019-11-25 08:49:04,242 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:04,243 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345597930] [2019-11-25 08:49:04,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:04,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:04,292 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-25 08:49:04,292 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345597930] [2019-11-25 08:49:04,292 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:49:04,293 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:49:04,293 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568283376] [2019-11-25 08:49:04,293 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:49:04,293 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:04,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:49:04,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:49:04,294 INFO L87 Difference]: Start difference. First operand 532 states and 815 transitions. Second operand 3 states. [2019-11-25 08:49:04,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:49:04,455 INFO L93 Difference]: Finished difference Result 1111 states and 1694 transitions. [2019-11-25 08:49:04,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:49:04,456 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-11-25 08:49:04,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:49:04,459 INFO L225 Difference]: With dead ends: 1111 [2019-11-25 08:49:04,459 INFO L226 Difference]: Without dead ends: 586 [2019-11-25 08:49:04,460 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:49:04,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2019-11-25 08:49:04,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 580. [2019-11-25 08:49:04,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2019-11-25 08:49:04,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 878 transitions. [2019-11-25 08:49:04,490 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 878 transitions. Word has length 56 [2019-11-25 08:49:04,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:49:04,491 INFO L462 AbstractCegarLoop]: Abstraction has 580 states and 878 transitions. [2019-11-25 08:49:04,491 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:49:04,491 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 878 transitions. [2019-11-25 08:49:04,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-25 08:49:04,493 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:49:04,493 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:49:04,493 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-25 08:49:04,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:04,494 INFO L82 PathProgramCache]: Analyzing trace with hash -2147424561, now seen corresponding path program 1 times [2019-11-25 08:49:04,494 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:04,494 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213733841] [2019-11-25 08:49:04,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:04,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:04,538 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-25 08:49:04,539 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213733841] [2019-11-25 08:49:04,539 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:49:04,539 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:49:04,539 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014451112] [2019-11-25 08:49:04,540 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:49:04,540 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:04,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:49:04,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:49:04,540 INFO L87 Difference]: Start difference. First operand 580 states and 878 transitions. Second operand 3 states. [2019-11-25 08:49:04,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:49:04,704 INFO L93 Difference]: Finished difference Result 1162 states and 1757 transitions. [2019-11-25 08:49:04,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:49:04,705 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-11-25 08:49:04,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:49:04,708 INFO L225 Difference]: With dead ends: 1162 [2019-11-25 08:49:04,708 INFO L226 Difference]: Without dead ends: 589 [2019-11-25 08:49:04,709 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:49:04,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2019-11-25 08:49:04,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 583. [2019-11-25 08:49:04,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 583 states. [2019-11-25 08:49:04,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 878 transitions. [2019-11-25 08:49:04,732 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 878 transitions. Word has length 57 [2019-11-25 08:49:04,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:49:04,733 INFO L462 AbstractCegarLoop]: Abstraction has 583 states and 878 transitions. [2019-11-25 08:49:04,733 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:49:04,733 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 878 transitions. [2019-11-25 08:49:04,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-11-25 08:49:04,734 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:49:04,735 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:49:04,735 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-25 08:49:04,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:04,735 INFO L82 PathProgramCache]: Analyzing trace with hash -216125576, now seen corresponding path program 1 times [2019-11-25 08:49:04,736 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:04,736 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5883777] [2019-11-25 08:49:04,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:04,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:04,765 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-25 08:49:04,765 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5883777] [2019-11-25 08:49:04,765 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:49:04,765 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:49:04,766 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027459690] [2019-11-25 08:49:04,766 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:49:04,766 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:04,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:49:04,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:49:04,767 INFO L87 Difference]: Start difference. First operand 583 states and 878 transitions. Second operand 3 states. [2019-11-25 08:49:04,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:49:04,941 INFO L93 Difference]: Finished difference Result 1291 states and 1970 transitions. [2019-11-25 08:49:04,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:49:04,942 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-11-25 08:49:04,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:49:04,946 INFO L225 Difference]: With dead ends: 1291 [2019-11-25 08:49:04,946 INFO L226 Difference]: Without dead ends: 715 [2019-11-25 08:49:04,947 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:49:04,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2019-11-25 08:49:04,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 709. [2019-11-25 08:49:04,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 709 states. [2019-11-25 08:49:04,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 709 states and 1091 transitions. [2019-11-25 08:49:04,974 INFO L78 Accepts]: Start accepts. Automaton has 709 states and 1091 transitions. Word has length 70 [2019-11-25 08:49:04,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:49:04,974 INFO L462 AbstractCegarLoop]: Abstraction has 709 states and 1091 transitions. [2019-11-25 08:49:04,974 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:49:04,975 INFO L276 IsEmpty]: Start isEmpty. Operand 709 states and 1091 transitions. [2019-11-25 08:49:04,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-25 08:49:04,976 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:49:04,976 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:49:04,976 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-25 08:49:04,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:04,977 INFO L82 PathProgramCache]: Analyzing trace with hash 380295080, now seen corresponding path program 1 times [2019-11-25 08:49:04,977 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:04,977 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052755633] [2019-11-25 08:49:04,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:04,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:05,024 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-25 08:49:05,026 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052755633] [2019-11-25 08:49:05,026 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:49:05,027 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:49:05,027 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751810188] [2019-11-25 08:49:05,027 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:49:05,027 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:05,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:49:05,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:49:05,028 INFO L87 Difference]: Start difference. First operand 709 states and 1091 transitions. Second operand 3 states. [2019-11-25 08:49:05,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:49:05,226 INFO L93 Difference]: Finished difference Result 1513 states and 2336 transitions. [2019-11-25 08:49:05,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:49:05,226 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-11-25 08:49:05,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:49:05,232 INFO L225 Difference]: With dead ends: 1513 [2019-11-25 08:49:05,232 INFO L226 Difference]: Without dead ends: 811 [2019-11-25 08:49:05,240 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:49:05,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2019-11-25 08:49:05,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 790. [2019-11-25 08:49:05,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2019-11-25 08:49:05,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1211 transitions. [2019-11-25 08:49:05,270 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1211 transitions. Word has length 71 [2019-11-25 08:49:05,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:49:05,270 INFO L462 AbstractCegarLoop]: Abstraction has 790 states and 1211 transitions. [2019-11-25 08:49:05,270 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:49:05,270 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1211 transitions. [2019-11-25 08:49:05,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-25 08:49:05,272 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:49:05,272 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:49:05,272 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-25 08:49:05,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:05,273 INFO L82 PathProgramCache]: Analyzing trace with hash 1769518732, now seen corresponding path program 1 times [2019-11-25 08:49:05,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:05,274 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597523580] [2019-11-25 08:49:05,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:05,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:05,306 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-25 08:49:05,308 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597523580] [2019-11-25 08:49:05,309 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:49:05,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:49:05,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801376008] [2019-11-25 08:49:05,309 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:49:05,309 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:05,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:49:05,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:49:05,310 INFO L87 Difference]: Start difference. First operand 790 states and 1211 transitions. Second operand 3 states. [2019-11-25 08:49:05,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:49:05,483 INFO L93 Difference]: Finished difference Result 1582 states and 2423 transitions. [2019-11-25 08:49:05,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:49:05,484 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-11-25 08:49:05,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:49:05,489 INFO L225 Difference]: With dead ends: 1582 [2019-11-25 08:49:05,489 INFO L226 Difference]: Without dead ends: 799 [2019-11-25 08:49:05,490 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:49:05,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2019-11-25 08:49:05,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 793. [2019-11-25 08:49:05,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2019-11-25 08:49:05,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 1211 transitions. [2019-11-25 08:49:05,520 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 1211 transitions. Word has length 71 [2019-11-25 08:49:05,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:49:05,521 INFO L462 AbstractCegarLoop]: Abstraction has 793 states and 1211 transitions. [2019-11-25 08:49:05,521 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:49:05,522 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 1211 transitions. [2019-11-25 08:49:05,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-25 08:49:05,527 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:49:05,528 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:49:05,528 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-25 08:49:05,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:05,528 INFO L82 PathProgramCache]: Analyzing trace with hash -953703820, now seen corresponding path program 1 times [2019-11-25 08:49:05,529 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:05,529 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343108040] [2019-11-25 08:49:05,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:05,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:05,566 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-25 08:49:05,566 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343108040] [2019-11-25 08:49:05,567 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:49:05,567 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:49:05,567 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438385815] [2019-11-25 08:49:05,568 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:49:05,568 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:05,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:49:05,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:49:05,568 INFO L87 Difference]: Start difference. First operand 793 states and 1211 transitions. Second operand 3 states. [2019-11-25 08:49:05,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:49:05,733 INFO L93 Difference]: Finished difference Result 1600 states and 2447 transitions. [2019-11-25 08:49:05,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:49:05,733 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-11-25 08:49:05,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:49:05,738 INFO L225 Difference]: With dead ends: 1600 [2019-11-25 08:49:05,738 INFO L226 Difference]: Without dead ends: 814 [2019-11-25 08:49:05,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-11-25 08:49:05,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 814 states. [2019-11-25 08:49:05,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 814 to 793. [2019-11-25 08:49:05,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2019-11-25 08:49:05,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 1202 transitions. [2019-11-25 08:49:05,772 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 1202 transitions. Word has length 72 [2019-11-25 08:49:05,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:49:05,773 INFO L462 AbstractCegarLoop]: Abstraction has 793 states and 1202 transitions. [2019-11-25 08:49:05,773 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:49:05,773 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 1202 transitions. [2019-11-25 08:49:05,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-25 08:49:05,774 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:49:05,774 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:49:05,775 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-25 08:49:05,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:05,775 INFO L82 PathProgramCache]: Analyzing trace with hash -816065300, now seen corresponding path program 1 times [2019-11-25 08:49:05,775 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:05,775 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328512966] [2019-11-25 08:49:05,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:05,784 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-25 08:49:05,784 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [859149413] [2019-11-25 08:49:05,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a546479d-21dc-4402-a1a0-6a017ef060ec/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:49:05,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:05,851 INFO L255 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-25 08:49:05,860 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:49:05,874 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-25 08:49:05,874 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328512966] [2019-11-25 08:49:05,874 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-25 08:49:05,874 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [859149413] [2019-11-25 08:49:05,874 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:49:05,874 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:49:05,875 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347242807] [2019-11-25 08:49:05,875 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:49:05,875 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:05,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:49:05,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:49:05,875 INFO L87 Difference]: Start difference. First operand 793 states and 1202 transitions. Second operand 3 states. [2019-11-25 08:49:05,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:49:05,937 INFO L93 Difference]: Finished difference Result 1583 states and 2396 transitions. [2019-11-25 08:49:05,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:49:05,938 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2019-11-25 08:49:05,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:49:05,944 INFO L225 Difference]: With dead ends: 1583 [2019-11-25 08:49:05,944 INFO L226 Difference]: Without dead ends: 1055 [2019-11-25 08:49:05,946 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:49:05,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1055 states. [2019-11-25 08:49:05,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1055 to 1051. [2019-11-25 08:49:05,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1051 states. [2019-11-25 08:49:05,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1051 states to 1051 states and 1597 transitions. [2019-11-25 08:49:05,984 INFO L78 Accepts]: Start accepts. Automaton has 1051 states and 1597 transitions. Word has length 76 [2019-11-25 08:49:05,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:49:05,984 INFO L462 AbstractCegarLoop]: Abstraction has 1051 states and 1597 transitions. [2019-11-25 08:49:05,984 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:49:05,984 INFO L276 IsEmpty]: Start isEmpty. Operand 1051 states and 1597 transitions. [2019-11-25 08:49:05,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-25 08:49:05,986 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:49:05,986 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:49:06,189 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:49:06,189 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-25 08:49:06,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:06,189 INFO L82 PathProgramCache]: Analyzing trace with hash -174298828, now seen corresponding path program 1 times [2019-11-25 08:49:06,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:06,190 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471237139] [2019-11-25 08:49:06,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:06,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:06,243 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-25 08:49:06,244 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471237139] [2019-11-25 08:49:06,244 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:49:06,244 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:49:06,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461271814] [2019-11-25 08:49:06,246 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:49:06,247 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:06,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:49:06,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:49:06,247 INFO L87 Difference]: Start difference. First operand 1051 states and 1597 transitions. Second operand 3 states. [2019-11-25 08:49:06,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:49:06,448 INFO L93 Difference]: Finished difference Result 2279 states and 3475 transitions. [2019-11-25 08:49:06,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:49:06,449 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2019-11-25 08:49:06,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:49:06,456 INFO L225 Difference]: With dead ends: 2279 [2019-11-25 08:49:06,456 INFO L226 Difference]: Without dead ends: 1235 [2019-11-25 08:49:06,458 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:49:06,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1235 states. [2019-11-25 08:49:06,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1235 to 1223. [2019-11-25 08:49:06,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1223 states. [2019-11-25 08:49:06,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1223 states to 1223 states and 1873 transitions. [2019-11-25 08:49:06,506 INFO L78 Accepts]: Start accepts. Automaton has 1223 states and 1873 transitions. Word has length 86 [2019-11-25 08:49:06,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:49:06,507 INFO L462 AbstractCegarLoop]: Abstraction has 1223 states and 1873 transitions. [2019-11-25 08:49:06,507 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:49:06,507 INFO L276 IsEmpty]: Start isEmpty. Operand 1223 states and 1873 transitions. [2019-11-25 08:49:06,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-25 08:49:06,509 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:49:06,509 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:49:06,509 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-25 08:49:06,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:06,510 INFO L82 PathProgramCache]: Analyzing trace with hash -1676680243, now seen corresponding path program 1 times [2019-11-25 08:49:06,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:06,510 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430599453] [2019-11-25 08:49:06,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:06,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:06,558 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-25 08:49:06,560 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430599453] [2019-11-25 08:49:06,560 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:49:06,560 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:49:06,561 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007838519] [2019-11-25 08:49:06,561 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:49:06,561 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:06,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:49:06,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:49:06,562 INFO L87 Difference]: Start difference. First operand 1223 states and 1873 transitions. Second operand 3 states. [2019-11-25 08:49:06,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:49:06,789 INFO L93 Difference]: Finished difference Result 2499 states and 3839 transitions. [2019-11-25 08:49:06,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:49:06,790 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 87 [2019-11-25 08:49:06,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:49:06,798 INFO L225 Difference]: With dead ends: 2499 [2019-11-25 08:49:06,798 INFO L226 Difference]: Without dead ends: 1275 [2019-11-25 08:49:06,801 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:49:06,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1275 states. [2019-11-25 08:49:06,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1275 to 1263. [2019-11-25 08:49:06,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1263 states. [2019-11-25 08:49:06,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1263 states to 1263 states and 1949 transitions. [2019-11-25 08:49:06,850 INFO L78 Accepts]: Start accepts. Automaton has 1263 states and 1949 transitions. Word has length 87 [2019-11-25 08:49:06,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:49:06,850 INFO L462 AbstractCegarLoop]: Abstraction has 1263 states and 1949 transitions. [2019-11-25 08:49:06,850 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:49:06,850 INFO L276 IsEmpty]: Start isEmpty. Operand 1263 states and 1949 transitions. [2019-11-25 08:49:06,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-25 08:49:06,852 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:49:06,852 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:49:06,853 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-25 08:49:06,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:06,853 INFO L82 PathProgramCache]: Analyzing trace with hash 538835484, now seen corresponding path program 1 times [2019-11-25 08:49:06,853 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:06,853 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857721534] [2019-11-25 08:49:06,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:06,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:06,903 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-11-25 08:49:06,903 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857721534] [2019-11-25 08:49:06,903 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:49:06,903 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:49:06,904 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231706265] [2019-11-25 08:49:06,904 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:49:06,904 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:06,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:49:06,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:49:06,905 INFO L87 Difference]: Start difference. First operand 1263 states and 1949 transitions. Second operand 3 states. [2019-11-25 08:49:07,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:49:07,096 INFO L93 Difference]: Finished difference Result 2667 states and 4123 transitions. [2019-11-25 08:49:07,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:49:07,096 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-11-25 08:49:07,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:49:07,104 INFO L225 Difference]: With dead ends: 2667 [2019-11-25 08:49:07,104 INFO L226 Difference]: Without dead ends: 1411 [2019-11-25 08:49:07,106 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:49:07,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1411 states. [2019-11-25 08:49:07,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1411 to 1363. [2019-11-25 08:49:07,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1363 states. [2019-11-25 08:49:07,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1363 states to 1363 states and 2085 transitions. [2019-11-25 08:49:07,161 INFO L78 Accepts]: Start accepts. Automaton has 1363 states and 2085 transitions. Word has length 97 [2019-11-25 08:49:07,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:49:07,161 INFO L462 AbstractCegarLoop]: Abstraction has 1363 states and 2085 transitions. [2019-11-25 08:49:07,162 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:49:07,162 INFO L276 IsEmpty]: Start isEmpty. Operand 1363 states and 2085 transitions. [2019-11-25 08:49:07,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-25 08:49:07,164 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:49:07,164 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:49:07,164 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-25 08:49:07,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:07,165 INFO L82 PathProgramCache]: Analyzing trace with hash 704331080, now seen corresponding path program 1 times [2019-11-25 08:49:07,165 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:07,165 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925785414] [2019-11-25 08:49:07,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:07,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:07,197 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-11-25 08:49:07,198 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925785414] [2019-11-25 08:49:07,198 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:49:07,198 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:49:07,199 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887498196] [2019-11-25 08:49:07,200 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:49:07,200 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:07,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:49:07,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:49:07,200 INFO L87 Difference]: Start difference. First operand 1363 states and 2085 transitions. Second operand 3 states. [2019-11-25 08:49:07,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:49:07,396 INFO L93 Difference]: Finished difference Result 2767 states and 4239 transitions. [2019-11-25 08:49:07,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:49:07,396 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-11-25 08:49:07,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:49:07,404 INFO L225 Difference]: With dead ends: 2767 [2019-11-25 08:49:07,404 INFO L226 Difference]: Without dead ends: 1411 [2019-11-25 08:49:07,406 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:49:07,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1411 states. [2019-11-25 08:49:07,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1411 to 1363. [2019-11-25 08:49:07,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1363 states. [2019-11-25 08:49:07,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1363 states to 1363 states and 2065 transitions. [2019-11-25 08:49:07,460 INFO L78 Accepts]: Start accepts. Automaton has 1363 states and 2065 transitions. Word has length 98 [2019-11-25 08:49:07,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:49:07,460 INFO L462 AbstractCegarLoop]: Abstraction has 1363 states and 2065 transitions. [2019-11-25 08:49:07,460 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:49:07,461 INFO L276 IsEmpty]: Start isEmpty. Operand 1363 states and 2065 transitions. [2019-11-25 08:49:07,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-11-25 08:49:07,465 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:49:07,465 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:49:07,466 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-25 08:49:07,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:07,466 INFO L82 PathProgramCache]: Analyzing trace with hash -1454055914, now seen corresponding path program 1 times [2019-11-25 08:49:07,466 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:07,467 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988254180] [2019-11-25 08:49:07,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:07,480 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-25 08:49:07,481 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1296978399] [2019-11-25 08:49:07,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a546479d-21dc-4402-a1a0-6a017ef060ec/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:49:07,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:07,561 INFO L255 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-25 08:49:07,573 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:49:07,604 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-11-25 08:49:07,604 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988254180] [2019-11-25 08:49:07,604 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-25 08:49:07,604 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1296978399] [2019-11-25 08:49:07,605 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:49:07,605 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:49:07,605 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812219357] [2019-11-25 08:49:07,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:49:07,606 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:07,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:49:07,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:49:07,606 INFO L87 Difference]: Start difference. First operand 1363 states and 2065 transitions. Second operand 3 states. [2019-11-25 08:49:07,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:49:07,828 INFO L93 Difference]: Finished difference Result 2755 states and 4163 transitions. [2019-11-25 08:49:07,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:49:07,828 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2019-11-25 08:49:07,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:49:07,836 INFO L225 Difference]: With dead ends: 2755 [2019-11-25 08:49:07,836 INFO L226 Difference]: Without dead ends: 1399 [2019-11-25 08:49:07,838 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:49:07,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1399 states. [2019-11-25 08:49:07,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1399 to 1363. [2019-11-25 08:49:07,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1363 states. [2019-11-25 08:49:07,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1363 states to 1363 states and 1993 transitions. [2019-11-25 08:49:07,910 INFO L78 Accepts]: Start accepts. Automaton has 1363 states and 1993 transitions. Word has length 116 [2019-11-25 08:49:07,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:49:07,911 INFO L462 AbstractCegarLoop]: Abstraction has 1363 states and 1993 transitions. [2019-11-25 08:49:07,911 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:49:07,911 INFO L276 IsEmpty]: Start isEmpty. Operand 1363 states and 1993 transitions. [2019-11-25 08:49:07,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-11-25 08:49:07,914 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:49:07,914 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:49:08,117 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:49:08,117 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-25 08:49:08,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:08,117 INFO L82 PathProgramCache]: Analyzing trace with hash 2083865546, now seen corresponding path program 1 times [2019-11-25 08:49:08,117 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:08,118 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692014187] [2019-11-25 08:49:08,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:08,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:08,148 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-11-25 08:49:08,148 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692014187] [2019-11-25 08:49:08,149 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:49:08,149 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:49:08,149 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525628490] [2019-11-25 08:49:08,149 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:49:08,149 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:08,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:49:08,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:49:08,150 INFO L87 Difference]: Start difference. First operand 1363 states and 1993 transitions. Second operand 3 states. [2019-11-25 08:49:08,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:49:08,352 INFO L93 Difference]: Finished difference Result 2827 states and 4135 transitions. [2019-11-25 08:49:08,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:49:08,353 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 117 [2019-11-25 08:49:08,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:49:08,361 INFO L225 Difference]: With dead ends: 2827 [2019-11-25 08:49:08,361 INFO L226 Difference]: Without dead ends: 1471 [2019-11-25 08:49:08,363 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:49:08,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1471 states. [2019-11-25 08:49:08,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1471 to 1459. [2019-11-25 08:49:08,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1459 states. [2019-11-25 08:49:08,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1459 states to 1459 states and 2117 transitions. [2019-11-25 08:49:08,425 INFO L78 Accepts]: Start accepts. Automaton has 1459 states and 2117 transitions. Word has length 117 [2019-11-25 08:49:08,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:49:08,425 INFO L462 AbstractCegarLoop]: Abstraction has 1459 states and 2117 transitions. [2019-11-25 08:49:08,425 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:49:08,425 INFO L276 IsEmpty]: Start isEmpty. Operand 1459 states and 2117 transitions. [2019-11-25 08:49:08,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-11-25 08:49:08,428 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:49:08,428 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:49:08,428 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-25 08:49:08,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:08,429 INFO L82 PathProgramCache]: Analyzing trace with hash -63631274, now seen corresponding path program 1 times [2019-11-25 08:49:08,429 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:08,429 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579200771] [2019-11-25 08:49:08,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:08,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:08,458 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-11-25 08:49:08,459 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579200771] [2019-11-25 08:49:08,459 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:49:08,459 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:49:08,459 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088744170] [2019-11-25 08:49:08,460 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:49:08,460 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:08,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:49:08,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:49:08,461 INFO L87 Difference]: Start difference. First operand 1459 states and 2117 transitions. Second operand 3 states. [2019-11-25 08:49:08,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:49:08,667 INFO L93 Difference]: Finished difference Result 2923 states and 4239 transitions. [2019-11-25 08:49:08,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:49:08,667 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 118 [2019-11-25 08:49:08,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:49:08,675 INFO L225 Difference]: With dead ends: 2923 [2019-11-25 08:49:08,676 INFO L226 Difference]: Without dead ends: 1471 [2019-11-25 08:49:08,678 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:49:08,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1471 states. [2019-11-25 08:49:08,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1471 to 1459. [2019-11-25 08:49:08,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1459 states. [2019-11-25 08:49:08,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1459 states to 1459 states and 2097 transitions. [2019-11-25 08:49:08,736 INFO L78 Accepts]: Start accepts. Automaton has 1459 states and 2097 transitions. Word has length 118 [2019-11-25 08:49:08,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:49:08,736 INFO L462 AbstractCegarLoop]: Abstraction has 1459 states and 2097 transitions. [2019-11-25 08:49:08,736 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:49:08,736 INFO L276 IsEmpty]: Start isEmpty. Operand 1459 states and 2097 transitions. [2019-11-25 08:49:08,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-11-25 08:49:08,739 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:49:08,739 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:49:08,739 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-25 08:49:08,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:08,740 INFO L82 PathProgramCache]: Analyzing trace with hash 365233416, now seen corresponding path program 1 times [2019-11-25 08:49:08,740 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:08,740 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139270772] [2019-11-25 08:49:08,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:08,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:08,774 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-11-25 08:49:08,774 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139270772] [2019-11-25 08:49:08,774 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:49:08,775 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:49:08,775 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657719912] [2019-11-25 08:49:08,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:49:08,775 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:08,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:49:08,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:49:08,776 INFO L87 Difference]: Start difference. First operand 1459 states and 2097 transitions. Second operand 3 states. [2019-11-25 08:49:09,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:49:09,012 INFO L93 Difference]: Finished difference Result 3091 states and 4445 transitions. [2019-11-25 08:49:09,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:49:09,012 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 126 [2019-11-25 08:49:09,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:49:09,022 INFO L225 Difference]: With dead ends: 3091 [2019-11-25 08:49:09,022 INFO L226 Difference]: Without dead ends: 1639 [2019-11-25 08:49:09,024 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:49:09,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1639 states. [2019-11-25 08:49:09,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1639 to 1623. [2019-11-25 08:49:09,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1623 states. [2019-11-25 08:49:09,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1623 states to 1623 states and 2337 transitions. [2019-11-25 08:49:09,089 INFO L78 Accepts]: Start accepts. Automaton has 1623 states and 2337 transitions. Word has length 126 [2019-11-25 08:49:09,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:49:09,090 INFO L462 AbstractCegarLoop]: Abstraction has 1623 states and 2337 transitions. [2019-11-25 08:49:09,090 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:49:09,090 INFO L276 IsEmpty]: Start isEmpty. Operand 1623 states and 2337 transitions. [2019-11-25 08:49:09,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-11-25 08:49:09,093 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:49:09,093 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:49:09,093 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-25 08:49:09,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:09,094 INFO L82 PathProgramCache]: Analyzing trace with hash 1493527041, now seen corresponding path program 1 times [2019-11-25 08:49:09,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:09,094 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765019475] [2019-11-25 08:49:09,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:09,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:09,136 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-11-25 08:49:09,137 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765019475] [2019-11-25 08:49:09,137 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:49:09,137 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:49:09,138 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481700674] [2019-11-25 08:49:09,138 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:49:09,138 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:09,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:49:09,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:49:09,139 INFO L87 Difference]: Start difference. First operand 1623 states and 2337 transitions. Second operand 3 states. [2019-11-25 08:49:09,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:49:09,437 INFO L93 Difference]: Finished difference Result 3255 states and 4681 transitions. [2019-11-25 08:49:09,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:49:09,437 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 127 [2019-11-25 08:49:09,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:49:09,446 INFO L225 Difference]: With dead ends: 3255 [2019-11-25 08:49:09,446 INFO L226 Difference]: Without dead ends: 1631 [2019-11-25 08:49:09,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-11-25 08:49:09,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1631 states. [2019-11-25 08:49:09,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1631 to 1615. [2019-11-25 08:49:09,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1615 states. [2019-11-25 08:49:09,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1615 states to 1615 states and 2321 transitions. [2019-11-25 08:49:09,519 INFO L78 Accepts]: Start accepts. Automaton has 1615 states and 2321 transitions. Word has length 127 [2019-11-25 08:49:09,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:49:09,519 INFO L462 AbstractCegarLoop]: Abstraction has 1615 states and 2321 transitions. [2019-11-25 08:49:09,519 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:49:09,520 INFO L276 IsEmpty]: Start isEmpty. Operand 1615 states and 2321 transitions. [2019-11-25 08:49:09,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-11-25 08:49:09,522 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:49:09,523 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:49:09,523 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-25 08:49:09,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:09,523 INFO L82 PathProgramCache]: Analyzing trace with hash 704603328, now seen corresponding path program 1 times [2019-11-25 08:49:09,524 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:09,524 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222295857] [2019-11-25 08:49:09,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:09,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:09,565 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-25 08:49:09,565 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222295857] [2019-11-25 08:49:09,565 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:49:09,566 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:49:09,566 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901379917] [2019-11-25 08:49:09,566 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:49:09,566 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:09,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:49:09,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:49:09,567 INFO L87 Difference]: Start difference. First operand 1615 states and 2321 transitions. Second operand 3 states. [2019-11-25 08:49:09,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:49:09,776 INFO L93 Difference]: Finished difference Result 3323 states and 4778 transitions. [2019-11-25 08:49:09,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:49:09,776 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 138 [2019-11-25 08:49:09,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:49:09,786 INFO L225 Difference]: With dead ends: 3323 [2019-11-25 08:49:09,786 INFO L226 Difference]: Without dead ends: 1715 [2019-11-25 08:49:09,788 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:49:09,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1715 states. [2019-11-25 08:49:09,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1715 to 1699. [2019-11-25 08:49:09,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1699 states. [2019-11-25 08:49:09,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1699 states to 1699 states and 2417 transitions. [2019-11-25 08:49:09,860 INFO L78 Accepts]: Start accepts. Automaton has 1699 states and 2417 transitions. Word has length 138 [2019-11-25 08:49:09,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:49:09,861 INFO L462 AbstractCegarLoop]: Abstraction has 1699 states and 2417 transitions. [2019-11-25 08:49:09,861 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:49:09,861 INFO L276 IsEmpty]: Start isEmpty. Operand 1699 states and 2417 transitions. [2019-11-25 08:49:09,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-11-25 08:49:09,864 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:49:09,864 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:49:09,865 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-25 08:49:09,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:09,865 INFO L82 PathProgramCache]: Analyzing trace with hash 1658127444, now seen corresponding path program 1 times [2019-11-25 08:49:09,865 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:09,865 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885040945] [2019-11-25 08:49:09,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:09,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:09,900 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-25 08:49:09,901 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885040945] [2019-11-25 08:49:09,901 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:49:09,901 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:49:09,901 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686368322] [2019-11-25 08:49:09,902 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:49:09,902 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:09,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:49:09,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:49:09,903 INFO L87 Difference]: Start difference. First operand 1699 states and 2417 transitions. Second operand 3 states. [2019-11-25 08:49:10,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:49:10,092 INFO L93 Difference]: Finished difference Result 3407 states and 4846 transitions. [2019-11-25 08:49:10,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:49:10,092 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 139 [2019-11-25 08:49:10,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:49:10,101 INFO L225 Difference]: With dead ends: 3407 [2019-11-25 08:49:10,101 INFO L226 Difference]: Without dead ends: 1715 [2019-11-25 08:49:10,104 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:49:10,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1715 states. [2019-11-25 08:49:10,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1715 to 1699. [2019-11-25 08:49:10,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1699 states. [2019-11-25 08:49:10,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1699 states to 1699 states and 2389 transitions. [2019-11-25 08:49:10,167 INFO L78 Accepts]: Start accepts. Automaton has 1699 states and 2389 transitions. Word has length 139 [2019-11-25 08:49:10,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:49:10,167 INFO L462 AbstractCegarLoop]: Abstraction has 1699 states and 2389 transitions. [2019-11-25 08:49:10,167 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:49:10,167 INFO L276 IsEmpty]: Start isEmpty. Operand 1699 states and 2389 transitions. [2019-11-25 08:49:10,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-11-25 08:49:10,171 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:49:10,171 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:49:10,171 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-25 08:49:10,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:10,172 INFO L82 PathProgramCache]: Analyzing trace with hash 1163594683, now seen corresponding path program 1 times [2019-11-25 08:49:10,172 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:10,172 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007432272] [2019-11-25 08:49:10,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:10,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:10,213 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 205 trivial. 0 not checked. [2019-11-25 08:49:10,214 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007432272] [2019-11-25 08:49:10,214 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:49:10,214 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:49:10,214 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12132537] [2019-11-25 08:49:10,215 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:49:10,215 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:10,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:49:10,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:49:10,215 INFO L87 Difference]: Start difference. First operand 1699 states and 2389 transitions. Second operand 3 states. [2019-11-25 08:49:10,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:49:10,282 INFO L93 Difference]: Finished difference Result 3373 states and 4735 transitions. [2019-11-25 08:49:10,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:49:10,283 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 154 [2019-11-25 08:49:10,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:49:10,302 INFO L225 Difference]: With dead ends: 3373 [2019-11-25 08:49:10,306 INFO L226 Difference]: Without dead ends: 1681 [2019-11-25 08:49:10,309 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:49:10,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1681 states. [2019-11-25 08:49:10,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1681 to 1677. [2019-11-25 08:49:10,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1677 states. [2019-11-25 08:49:10,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1677 states to 1677 states and 2356 transitions. [2019-11-25 08:49:10,376 INFO L78 Accepts]: Start accepts. Automaton has 1677 states and 2356 transitions. Word has length 154 [2019-11-25 08:49:10,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:49:10,376 INFO L462 AbstractCegarLoop]: Abstraction has 1677 states and 2356 transitions. [2019-11-25 08:49:10,376 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:49:10,376 INFO L276 IsEmpty]: Start isEmpty. Operand 1677 states and 2356 transitions. [2019-11-25 08:49:10,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-11-25 08:49:10,379 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:49:10,380 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:49:10,380 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-25 08:49:10,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:10,381 INFO L82 PathProgramCache]: Analyzing trace with hash -1358544773, now seen corresponding path program 1 times [2019-11-25 08:49:10,381 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:10,381 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960955338] [2019-11-25 08:49:10,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:10,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:10,448 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 110 proven. 5 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2019-11-25 08:49:10,448 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960955338] [2019-11-25 08:49:10,448 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1336452794] [2019-11-25 08:49:10,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a546479d-21dc-4402-a1a0-6a017ef060ec/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:49:10,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:10,553 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-25 08:49:10,556 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:49:10,580 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 110 proven. 5 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2019-11-25 08:49:10,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:49:10,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-25 08:49:10,581 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557474367] [2019-11-25 08:49:10,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:49:10,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:10,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:49:10,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:49:10,582 INFO L87 Difference]: Start difference. First operand 1677 states and 2356 transitions. Second operand 4 states. [2019-11-25 08:49:11,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:49:11,072 INFO L93 Difference]: Finished difference Result 5291 states and 7422 transitions. [2019-11-25 08:49:11,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 08:49:11,072 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2019-11-25 08:49:11,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:49:11,079 INFO L225 Difference]: With dead ends: 5291 [2019-11-25 08:49:11,080 INFO L226 Difference]: Without dead ends: 3521 [2019-11-25 08:49:11,082 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:49:11,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3521 states. [2019-11-25 08:49:11,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3521 to 2065. [2019-11-25 08:49:11,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2065 states. [2019-11-25 08:49:11,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2065 states to 2065 states and 2916 transitions. [2019-11-25 08:49:11,161 INFO L78 Accepts]: Start accepts. Automaton has 2065 states and 2916 transitions. Word has length 154 [2019-11-25 08:49:11,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:49:11,162 INFO L462 AbstractCegarLoop]: Abstraction has 2065 states and 2916 transitions. [2019-11-25 08:49:11,162 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:49:11,162 INFO L276 IsEmpty]: Start isEmpty. Operand 2065 states and 2916 transitions. [2019-11-25 08:49:11,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-11-25 08:49:11,166 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:49:11,166 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:49:11,370 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:49:11,370 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-25 08:49:11,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:11,371 INFO L82 PathProgramCache]: Analyzing trace with hash 782353573, now seen corresponding path program 1 times [2019-11-25 08:49:11,371 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:11,371 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396777238] [2019-11-25 08:49:11,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:11,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:11,426 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 120 proven. 7 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2019-11-25 08:49:11,426 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396777238] [2019-11-25 08:49:11,426 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1324415583] [2019-11-25 08:49:11,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a546479d-21dc-4402-a1a0-6a017ef060ec/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:49:11,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:11,511 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-25 08:49:11,513 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:49:11,534 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 120 proven. 7 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2019-11-25 08:49:11,535 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:49:11,535 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-25 08:49:11,535 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468270661] [2019-11-25 08:49:11,536 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:49:11,536 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:11,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:49:11,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:49:11,536 INFO L87 Difference]: Start difference. First operand 2065 states and 2916 transitions. Second operand 4 states. [2019-11-25 08:49:11,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:49:11,945 INFO L93 Difference]: Finished difference Result 5632 states and 7889 transitions. [2019-11-25 08:49:11,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 08:49:11,946 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-11-25 08:49:11,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:49:11,953 INFO L225 Difference]: With dead ends: 5632 [2019-11-25 08:49:11,953 INFO L226 Difference]: Without dead ends: 3574 [2019-11-25 08:49:11,957 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:49:11,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3574 states. [2019-11-25 08:49:12,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3574 to 2575. [2019-11-25 08:49:12,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2575 states. [2019-11-25 08:49:12,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2575 states to 2575 states and 3493 transitions. [2019-11-25 08:49:12,056 INFO L78 Accepts]: Start accepts. Automaton has 2575 states and 3493 transitions. Word has length 156 [2019-11-25 08:49:12,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:49:12,056 INFO L462 AbstractCegarLoop]: Abstraction has 2575 states and 3493 transitions. [2019-11-25 08:49:12,056 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:49:12,057 INFO L276 IsEmpty]: Start isEmpty. Operand 2575 states and 3493 transitions. [2019-11-25 08:49:12,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-11-25 08:49:12,062 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:49:12,062 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:49:12,266 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:49:12,266 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-25 08:49:12,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:12,267 INFO L82 PathProgramCache]: Analyzing trace with hash -571340489, now seen corresponding path program 1 times [2019-11-25 08:49:12,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:12,267 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775404686] [2019-11-25 08:49:12,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:12,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:12,364 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 97 proven. 5 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-11-25 08:49:12,364 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775404686] [2019-11-25 08:49:12,364 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [561668035] [2019-11-25 08:49:12,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a546479d-21dc-4402-a1a0-6a017ef060ec/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:49:12,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:12,443 INFO L255 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-25 08:49:12,445 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:49:12,467 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 97 proven. 5 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-11-25 08:49:12,468 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:49:12,468 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-25 08:49:12,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118025725] [2019-11-25 08:49:12,469 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:49:12,469 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:12,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:49:12,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:49:12,469 INFO L87 Difference]: Start difference. First operand 2575 states and 3493 transitions. Second operand 4 states. [2019-11-25 08:49:12,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:49:12,879 INFO L93 Difference]: Finished difference Result 5967 states and 8033 transitions. [2019-11-25 08:49:12,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 08:49:12,880 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 163 [2019-11-25 08:49:12,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:49:12,886 INFO L225 Difference]: With dead ends: 5967 [2019-11-25 08:49:12,886 INFO L226 Difference]: Without dead ends: 3371 [2019-11-25 08:49:12,890 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:49:12,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3371 states. [2019-11-25 08:49:12,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3371 to 2281. [2019-11-25 08:49:12,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2281 states. [2019-11-25 08:49:12,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2281 states to 2281 states and 3072 transitions. [2019-11-25 08:49:12,970 INFO L78 Accepts]: Start accepts. Automaton has 2281 states and 3072 transitions. Word has length 163 [2019-11-25 08:49:12,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:49:12,970 INFO L462 AbstractCegarLoop]: Abstraction has 2281 states and 3072 transitions. [2019-11-25 08:49:12,970 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:49:12,970 INFO L276 IsEmpty]: Start isEmpty. Operand 2281 states and 3072 transitions. [2019-11-25 08:49:12,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-11-25 08:49:12,974 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:49:12,975 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:49:13,179 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:49:13,179 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-25 08:49:13,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:13,180 INFO L82 PathProgramCache]: Analyzing trace with hash -2030054557, now seen corresponding path program 1 times [2019-11-25 08:49:13,180 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:13,180 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908784747] [2019-11-25 08:49:13,180 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:13,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:13,256 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-11-25 08:49:13,256 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908784747] [2019-11-25 08:49:13,257 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:49:13,257 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:49:13,257 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762636446] [2019-11-25 08:49:13,257 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:49:13,258 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:13,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:49:13,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:49:13,258 INFO L87 Difference]: Start difference. First operand 2281 states and 3072 transitions. Second operand 3 states. [2019-11-25 08:49:13,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:49:13,346 INFO L93 Difference]: Finished difference Result 5499 states and 7335 transitions. [2019-11-25 08:49:13,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:49:13,347 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 165 [2019-11-25 08:49:13,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:49:13,353 INFO L225 Difference]: With dead ends: 5499 [2019-11-25 08:49:13,353 INFO L226 Difference]: Without dead ends: 3225 [2019-11-25 08:49:13,357 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:49:13,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3225 states. [2019-11-25 08:49:13,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3225 to 3221. [2019-11-25 08:49:13,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3221 states. [2019-11-25 08:49:13,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3221 states to 3221 states and 4261 transitions. [2019-11-25 08:49:13,468 INFO L78 Accepts]: Start accepts. Automaton has 3221 states and 4261 transitions. Word has length 165 [2019-11-25 08:49:13,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:49:13,468 INFO L462 AbstractCegarLoop]: Abstraction has 3221 states and 4261 transitions. [2019-11-25 08:49:13,469 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:49:13,469 INFO L276 IsEmpty]: Start isEmpty. Operand 3221 states and 4261 transitions. [2019-11-25 08:49:13,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-11-25 08:49:13,474 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:49:13,474 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:49:13,476 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-25 08:49:13,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:13,476 INFO L82 PathProgramCache]: Analyzing trace with hash -36905074, now seen corresponding path program 1 times [2019-11-25 08:49:13,476 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:13,477 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868810095] [2019-11-25 08:49:13,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:13,491 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-25 08:49:13,492 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1091234935] [2019-11-25 08:49:13,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a546479d-21dc-4402-a1a0-6a017ef060ec/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:49:13,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:13,578 INFO L255 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-25 08:49:13,581 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:49:13,628 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 172 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-11-25 08:49:13,628 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868810095] [2019-11-25 08:49:13,628 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-25 08:49:13,628 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1091234935] [2019-11-25 08:49:13,629 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:49:13,629 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:49:13,629 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854434638] [2019-11-25 08:49:13,630 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:49:13,630 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:13,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:49:13,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:49:13,631 INFO L87 Difference]: Start difference. First operand 3221 states and 4261 transitions. Second operand 4 states. [2019-11-25 08:49:13,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:49:13,913 INFO L93 Difference]: Finished difference Result 4906 states and 6379 transitions. [2019-11-25 08:49:13,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:49:13,913 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 186 [2019-11-25 08:49:13,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:49:13,920 INFO L225 Difference]: With dead ends: 4906 [2019-11-25 08:49:13,920 INFO L226 Difference]: Without dead ends: 4096 [2019-11-25 08:49:13,923 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:49:13,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4096 states. [2019-11-25 08:49:14,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4096 to 3918. [2019-11-25 08:49:14,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3918 states. [2019-11-25 08:49:14,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3918 states to 3918 states and 5142 transitions. [2019-11-25 08:49:14,045 INFO L78 Accepts]: Start accepts. Automaton has 3918 states and 5142 transitions. Word has length 186 [2019-11-25 08:49:14,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:49:14,045 INFO L462 AbstractCegarLoop]: Abstraction has 3918 states and 5142 transitions. [2019-11-25 08:49:14,046 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:49:14,046 INFO L276 IsEmpty]: Start isEmpty. Operand 3918 states and 5142 transitions. [2019-11-25 08:49:14,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-11-25 08:49:14,051 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:49:14,052 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:49:14,255 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:49:14,255 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-25 08:49:14,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:14,256 INFO L82 PathProgramCache]: Analyzing trace with hash -1106021424, now seen corresponding path program 1 times [2019-11-25 08:49:14,256 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:14,256 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539465689] [2019-11-25 08:49:14,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:14,272 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-25 08:49:14,272 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1705354140] [2019-11-25 08:49:14,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a546479d-21dc-4402-a1a0-6a017ef060ec/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:49:14,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:14,355 INFO L255 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-25 08:49:14,357 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:49:14,432 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 234 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-11-25 08:49:14,432 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539465689] [2019-11-25 08:49:14,432 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-25 08:49:14,433 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1705354140] [2019-11-25 08:49:14,433 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:49:14,433 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:49:14,433 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831158205] [2019-11-25 08:49:14,434 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 08:49:14,434 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:14,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 08:49:14,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:49:14,436 INFO L87 Difference]: Start difference. First operand 3918 states and 5142 transitions. Second operand 5 states. [2019-11-25 08:49:14,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:49:14,912 INFO L93 Difference]: Finished difference Result 5803 states and 7575 transitions. [2019-11-25 08:49:14,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 08:49:14,913 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 188 [2019-11-25 08:49:14,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:49:14,922 INFO L225 Difference]: With dead ends: 5803 [2019-11-25 08:49:14,923 INFO L226 Difference]: Without dead ends: 5802 [2019-11-25 08:49:14,926 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:49:14,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5802 states. [2019-11-25 08:49:15,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5802 to 5243. [2019-11-25 08:49:15,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5243 states. [2019-11-25 08:49:15,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5243 states to 5243 states and 6898 transitions. [2019-11-25 08:49:15,107 INFO L78 Accepts]: Start accepts. Automaton has 5243 states and 6898 transitions. Word has length 188 [2019-11-25 08:49:15,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:49:15,107 INFO L462 AbstractCegarLoop]: Abstraction has 5243 states and 6898 transitions. [2019-11-25 08:49:15,107 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 08:49:15,107 INFO L276 IsEmpty]: Start isEmpty. Operand 5243 states and 6898 transitions. [2019-11-25 08:49:15,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-11-25 08:49:15,113 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:49:15,115 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:49:15,318 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:49:15,321 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-25 08:49:15,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:15,322 INFO L82 PathProgramCache]: Analyzing trace with hash 73074738, now seen corresponding path program 1 times [2019-11-25 08:49:15,322 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:15,322 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982307270] [2019-11-25 08:49:15,323 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:15,338 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-25 08:49:15,338 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [39488139] [2019-11-25 08:49:15,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a546479d-21dc-4402-a1a0-6a017ef060ec/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:49:15,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:15,420 INFO L255 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-25 08:49:15,423 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:49:15,596 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 20 [2019-11-25 08:49:15,705 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 175 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-11-25 08:49:15,705 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982307270] [2019-11-25 08:49:15,706 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-25 08:49:15,706 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [39488139] [2019-11-25 08:49:15,706 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:49:15,706 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:49:15,706 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591081338] [2019-11-25 08:49:15,707 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:49:15,707 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:15,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:49:15,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:49:15,708 INFO L87 Difference]: Start difference. First operand 5243 states and 6898 transitions. Second operand 4 states. [2019-11-25 08:49:16,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:49:16,132 INFO L93 Difference]: Finished difference Result 9754 states and 12848 transitions. [2019-11-25 08:49:16,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:49:16,133 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 189 [2019-11-25 08:49:16,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:49:16,142 INFO L225 Difference]: With dead ends: 9754 [2019-11-25 08:49:16,142 INFO L226 Difference]: Without dead ends: 5296 [2019-11-25 08:49:16,148 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:49:16,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5296 states. [2019-11-25 08:49:16,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5296 to 5242. [2019-11-25 08:49:16,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5242 states. [2019-11-25 08:49:16,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5242 states to 5242 states and 6881 transitions. [2019-11-25 08:49:16,317 INFO L78 Accepts]: Start accepts. Automaton has 5242 states and 6881 transitions. Word has length 189 [2019-11-25 08:49:16,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:49:16,318 INFO L462 AbstractCegarLoop]: Abstraction has 5242 states and 6881 transitions. [2019-11-25 08:49:16,318 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:49:16,318 INFO L276 IsEmpty]: Start isEmpty. Operand 5242 states and 6881 transitions. [2019-11-25 08:49:16,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-11-25 08:49:16,324 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:49:16,324 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:49:16,528 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:49:16,528 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-25 08:49:16,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:16,528 INFO L82 PathProgramCache]: Analyzing trace with hash 1864895527, now seen corresponding path program 1 times [2019-11-25 08:49:16,528 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:16,528 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480888231] [2019-11-25 08:49:16,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:16,537 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-25 08:49:16,537 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1533068806] [2019-11-25 08:49:16,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a546479d-21dc-4402-a1a0-6a017ef060ec/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:49:16,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:16,624 INFO L255 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-25 08:49:16,626 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:49:16,657 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 238 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2019-11-25 08:49:16,657 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480888231] [2019-11-25 08:49:16,657 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-25 08:49:16,658 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1533068806] [2019-11-25 08:49:16,658 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:49:16,658 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:49:16,658 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929054133] [2019-11-25 08:49:16,659 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:49:16,659 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:16,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:49:16,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:49:16,659 INFO L87 Difference]: Start difference. First operand 5242 states and 6881 transitions. Second operand 3 states. [2019-11-25 08:49:16,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:49:16,919 INFO L93 Difference]: Finished difference Result 10421 states and 13665 transitions. [2019-11-25 08:49:16,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:49:16,920 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 196 [2019-11-25 08:49:16,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:49:16,926 INFO L225 Difference]: With dead ends: 10421 [2019-11-25 08:49:16,927 INFO L226 Difference]: Without dead ends: 3596 [2019-11-25 08:49:16,933 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:49:16,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3596 states. [2019-11-25 08:49:17,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3596 to 3587. [2019-11-25 08:49:17,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3587 states. [2019-11-25 08:49:17,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3587 states to 3587 states and 4675 transitions. [2019-11-25 08:49:17,038 INFO L78 Accepts]: Start accepts. Automaton has 3587 states and 4675 transitions. Word has length 196 [2019-11-25 08:49:17,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:49:17,038 INFO L462 AbstractCegarLoop]: Abstraction has 3587 states and 4675 transitions. [2019-11-25 08:49:17,039 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:49:17,039 INFO L276 IsEmpty]: Start isEmpty. Operand 3587 states and 4675 transitions. [2019-11-25 08:49:17,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-11-25 08:49:17,043 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:49:17,043 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:49:17,250 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:49:17,250 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-25 08:49:17,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:17,250 INFO L82 PathProgramCache]: Analyzing trace with hash 1327391442, now seen corresponding path program 1 times [2019-11-25 08:49:17,251 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:17,251 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832641351] [2019-11-25 08:49:17,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:17,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:17,307 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2019-11-25 08:49:17,308 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832641351] [2019-11-25 08:49:17,308 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:49:17,308 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:49:17,308 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398662722] [2019-11-25 08:49:17,309 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:49:17,309 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:17,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:49:17,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:49:17,310 INFO L87 Difference]: Start difference. First operand 3587 states and 4675 transitions. Second operand 3 states. [2019-11-25 08:49:17,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:49:17,573 INFO L93 Difference]: Finished difference Result 6826 states and 8875 transitions. [2019-11-25 08:49:17,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:49:17,574 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 197 [2019-11-25 08:49:17,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:49:17,579 INFO L225 Difference]: With dead ends: 6826 [2019-11-25 08:49:17,579 INFO L226 Difference]: Without dead ends: 3114 [2019-11-25 08:49:17,582 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:49:17,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3114 states. [2019-11-25 08:49:17,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3114 to 3072. [2019-11-25 08:49:17,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3072 states. [2019-11-25 08:49:17,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3072 states to 3072 states and 3966 transitions. [2019-11-25 08:49:17,673 INFO L78 Accepts]: Start accepts. Automaton has 3072 states and 3966 transitions. Word has length 197 [2019-11-25 08:49:17,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:49:17,673 INFO L462 AbstractCegarLoop]: Abstraction has 3072 states and 3966 transitions. [2019-11-25 08:49:17,673 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:49:17,673 INFO L276 IsEmpty]: Start isEmpty. Operand 3072 states and 3966 transitions. [2019-11-25 08:49:17,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2019-11-25 08:49:17,686 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:49:17,686 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 9, 9, 8, 8, 7, 7, 6, 6, 6, 6, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:49:17,686 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-25 08:49:17,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:17,687 INFO L82 PathProgramCache]: Analyzing trace with hash -1162887835, now seen corresponding path program 1 times [2019-11-25 08:49:17,687 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:17,687 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607770590] [2019-11-25 08:49:17,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:17,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:17,805 INFO L134 CoverageAnalysis]: Checked inductivity of 1163 backedges. 699 proven. 0 refuted. 0 times theorem prover too weak. 464 trivial. 0 not checked. [2019-11-25 08:49:17,805 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607770590] [2019-11-25 08:49:17,806 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:49:17,806 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:49:17,806 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132461212] [2019-11-25 08:49:17,807 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:49:17,807 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:17,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:49:17,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:49:17,808 INFO L87 Difference]: Start difference. First operand 3072 states and 3966 transitions. Second operand 3 states. [2019-11-25 08:49:18,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:49:18,028 INFO L93 Difference]: Finished difference Result 6482 states and 8334 transitions. [2019-11-25 08:49:18,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:49:18,029 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 335 [2019-11-25 08:49:18,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:49:18,035 INFO L225 Difference]: With dead ends: 6482 [2019-11-25 08:49:18,035 INFO L226 Difference]: Without dead ends: 3432 [2019-11-25 08:49:18,038 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:49:18,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3432 states. [2019-11-25 08:49:18,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3432 to 3412. [2019-11-25 08:49:18,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3412 states. [2019-11-25 08:49:18,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3412 states to 3412 states and 4356 transitions. [2019-11-25 08:49:18,132 INFO L78 Accepts]: Start accepts. Automaton has 3412 states and 4356 transitions. Word has length 335 [2019-11-25 08:49:18,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:49:18,133 INFO L462 AbstractCegarLoop]: Abstraction has 3412 states and 4356 transitions. [2019-11-25 08:49:18,133 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:49:18,133 INFO L276 IsEmpty]: Start isEmpty. Operand 3412 states and 4356 transitions. [2019-11-25 08:49:18,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2019-11-25 08:49:18,136 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:49:18,137 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:49:18,137 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-25 08:49:18,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:18,137 INFO L82 PathProgramCache]: Analyzing trace with hash -1926092110, now seen corresponding path program 1 times [2019-11-25 08:49:18,138 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:18,138 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916697137] [2019-11-25 08:49:18,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:18,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:18,268 INFO L134 CoverageAnalysis]: Checked inductivity of 1423 backedges. 823 proven. 0 refuted. 0 times theorem prover too weak. 600 trivial. 0 not checked. [2019-11-25 08:49:18,269 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916697137] [2019-11-25 08:49:18,269 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:49:18,269 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:49:18,270 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234008514] [2019-11-25 08:49:18,270 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:49:18,270 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:18,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:49:18,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:49:18,271 INFO L87 Difference]: Start difference. First operand 3412 states and 4356 transitions. Second operand 3 states. [2019-11-25 08:49:18,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:49:18,589 INFO L93 Difference]: Finished difference Result 7182 states and 9154 transitions. [2019-11-25 08:49:18,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:49:18,590 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 366 [2019-11-25 08:49:18,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:49:18,596 INFO L225 Difference]: With dead ends: 7182 [2019-11-25 08:49:18,596 INFO L226 Difference]: Without dead ends: 3792 [2019-11-25 08:49:18,599 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:49:18,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3792 states. [2019-11-25 08:49:18,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3792 to 3772. [2019-11-25 08:49:18,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3772 states. [2019-11-25 08:49:18,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3772 states to 3772 states and 4766 transitions. [2019-11-25 08:49:18,704 INFO L78 Accepts]: Start accepts. Automaton has 3772 states and 4766 transitions. Word has length 366 [2019-11-25 08:49:18,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:49:18,705 INFO L462 AbstractCegarLoop]: Abstraction has 3772 states and 4766 transitions. [2019-11-25 08:49:18,705 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:49:18,705 INFO L276 IsEmpty]: Start isEmpty. Operand 3772 states and 4766 transitions. [2019-11-25 08:49:18,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 400 [2019-11-25 08:49:18,709 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:49:18,709 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 11, 11, 10, 10, 9, 9, 8, 8, 8, 8, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:49:18,710 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-25 08:49:18,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:18,710 INFO L82 PathProgramCache]: Analyzing trace with hash -1476749664, now seen corresponding path program 1 times [2019-11-25 08:49:18,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:18,710 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554971847] [2019-11-25 08:49:18,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:18,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:18,888 INFO L134 CoverageAnalysis]: Checked inductivity of 1718 backedges. 353 proven. 7 refuted. 0 times theorem prover too weak. 1358 trivial. 0 not checked. [2019-11-25 08:49:18,888 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554971847] [2019-11-25 08:49:18,888 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [332336842] [2019-11-25 08:49:18,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a546479d-21dc-4402-a1a0-6a017ef060ec/bin/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:49:19,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:19,011 INFO L255 TraceCheckSpWp]: Trace formula consists of 624 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-25 08:49:19,015 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:49:19,108 INFO L134 CoverageAnalysis]: Checked inductivity of 1718 backedges. 353 proven. 7 refuted. 0 times theorem prover too weak. 1358 trivial. 0 not checked. [2019-11-25 08:49:19,108 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:49:19,109 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-25 08:49:19,110 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372259597] [2019-11-25 08:49:19,111 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:49:19,111 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:19,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:49:19,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:49:19,111 INFO L87 Difference]: Start difference. First operand 3772 states and 4766 transitions. Second operand 4 states. [2019-11-25 08:49:19,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:49:19,300 INFO L93 Difference]: Finished difference Result 4931 states and 6242 transitions. [2019-11-25 08:49:19,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:49:19,301 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 399 [2019-11-25 08:49:19,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:49:19,302 INFO L225 Difference]: With dead ends: 4931 [2019-11-25 08:49:19,302 INFO L226 Difference]: Without dead ends: 0 [2019-11-25 08:49:19,305 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 404 GetRequests, 401 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:49:19,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-25 08:49:19,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-25 08:49:19,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-25 08:49:19,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-25 08:49:19,306 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 399 [2019-11-25 08:49:19,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:49:19,307 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-25 08:49:19,307 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:49:19,307 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-25 08:49:19,307 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-25 08:49:19,511 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:49:19,515 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-25 08:49:19,895 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 87 [2019-11-25 08:49:20,066 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 127 [2019-11-25 08:49:20,184 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 135 [2019-11-25 08:49:21,288 WARN L192 SmtUtils]: Spent 866.00 ms on a formula simplification. DAG size of input: 407 DAG size of output: 228 [2019-11-25 08:49:22,161 WARN L192 SmtUtils]: Spent 824.00 ms on a formula simplification. DAG size of input: 408 DAG size of output: 229 [2019-11-25 08:49:22,410 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 128 [2019-11-25 08:49:22,843 WARN L192 SmtUtils]: Spent 430.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 60 [2019-11-25 08:49:23,188 WARN L192 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 29 [2019-11-25 08:49:23,555 WARN L192 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 57 [2019-11-25 08:49:23,746 WARN L192 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 49 [2019-11-25 08:49:23,934 WARN L192 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 49 [2019-11-25 08:49:24,122 WARN L192 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 49 [2019-11-25 08:49:24,565 WARN L192 SmtUtils]: Spent 440.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 44 [2019-11-25 08:49:24,999 WARN L192 SmtUtils]: Spent 432.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 17 [2019-11-25 08:49:25,127 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 49 [2019-11-25 08:49:25,286 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 17 [2019-11-25 08:49:25,410 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 49 [2019-11-25 08:49:25,634 WARN L192 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 49 [2019-11-25 08:49:25,791 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 17 [2019-11-25 08:49:27,597 WARN L192 SmtUtils]: Spent 1.80 s on a formula simplification. DAG size of input: 195 DAG size of output: 98 [2019-11-25 08:49:27,863 WARN L192 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 55 [2019-11-25 08:49:29,421 WARN L192 SmtUtils]: Spent 1.56 s on a formula simplification. DAG size of input: 196 DAG size of output: 98 [2019-11-25 08:49:29,540 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 9 [2019-11-25 08:49:29,736 WARN L192 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 50 [2019-11-25 08:49:30,217 WARN L192 SmtUtils]: Spent 472.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 39 [2019-11-25 08:49:30,219 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 264) no Hoare annotation was computed. [2019-11-25 08:49:30,220 INFO L444 ceAbstractionStarter]: For program point L399(lines 399 405) no Hoare annotation was computed. [2019-11-25 08:49:30,220 INFO L444 ceAbstractionStarter]: For program point L201(lines 201 591) no Hoare annotation was computed. [2019-11-25 08:49:30,220 INFO L444 ceAbstractionStarter]: For program point L168(lines 168 602) no Hoare annotation was computed. [2019-11-25 08:49:30,220 INFO L444 ceAbstractionStarter]: For program point L135(lines 135 613) no Hoare annotation was computed. [2019-11-25 08:49:30,220 INFO L444 ceAbstractionStarter]: For program point L102(lines 102 624) no Hoare annotation was computed. [2019-11-25 08:49:30,220 INFO L444 ceAbstractionStarter]: For program point L466(lines 466 470) no Hoare annotation was computed. [2019-11-25 08:49:30,220 INFO L440 ceAbstractionStarter]: At program point L202(lines 198 592) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 16384)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 24576)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292))) [2019-11-25 08:49:30,221 INFO L440 ceAbstractionStarter]: At program point L103(lines 102 624) the Hoare annotation is: false [2019-11-25 08:49:30,221 INFO L444 ceAbstractionStarter]: For program point L500(lines 500 504) no Hoare annotation was computed. [2019-11-25 08:49:30,221 INFO L444 ceAbstractionStarter]: For program point L500-2(lines 209 586) no Hoare annotation was computed. [2019-11-25 08:49:30,221 INFO L444 ceAbstractionStarter]: For program point L501(line 501) no Hoare annotation was computed. [2019-11-25 08:49:30,221 INFO L444 ceAbstractionStarter]: For program point L501-1(line 501) no Hoare annotation was computed. [2019-11-25 08:49:30,221 INFO L444 ceAbstractionStarter]: For program point L501-2(line 501) no Hoare annotation was computed. [2019-11-25 08:49:30,221 INFO L444 ceAbstractionStarter]: For program point L501-3(line 501) no Hoare annotation was computed. [2019-11-25 08:49:30,221 INFO L444 ceAbstractionStarter]: For program point L237(lines 237 242) no Hoare annotation was computed. [2019-11-25 08:49:30,221 INFO L444 ceAbstractionStarter]: For program point L204(lines 204 590) no Hoare annotation was computed. [2019-11-25 08:49:30,222 INFO L444 ceAbstractionStarter]: For program point L171(lines 171 601) no Hoare annotation was computed. [2019-11-25 08:49:30,222 INFO L444 ceAbstractionStarter]: For program point L138(lines 138 612) no Hoare annotation was computed. [2019-11-25 08:49:30,222 INFO L444 ceAbstractionStarter]: For program point L105(lines 105 623) no Hoare annotation was computed. [2019-11-25 08:49:30,222 INFO L440 ceAbstractionStarter]: At program point L205(lines 204 590) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) [2019-11-25 08:49:30,222 INFO L440 ceAbstractionStarter]: At program point L172(lines 168 602) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (<= 8576 ULTIMATE.start_ssl3_accept_~s__state~0) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) [2019-11-25 08:49:30,222 INFO L440 ceAbstractionStarter]: At program point L139(lines 135 613) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8192))) (.cse12 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8195))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-25 08:49:30,223 INFO L444 ceAbstractionStarter]: For program point L73(lines 73 81) no Hoare annotation was computed. [2019-11-25 08:49:30,223 INFO L444 ceAbstractionStarter]: For program point L272(lines 272 276) no Hoare annotation was computed. [2019-11-25 08:49:30,223 INFO L444 ceAbstractionStarter]: For program point L570(lines 570 580) no Hoare annotation was computed. [2019-11-25 08:49:30,223 INFO L444 ceAbstractionStarter]: For program point L570-1(lines 570 580) no Hoare annotation was computed. [2019-11-25 08:49:30,223 INFO L444 ceAbstractionStarter]: For program point L306(lines 306 310) no Hoare annotation was computed. [2019-11-25 08:49:30,223 INFO L444 ceAbstractionStarter]: For program point L306-2(lines 209 586) no Hoare annotation was computed. [2019-11-25 08:49:30,223 INFO L444 ceAbstractionStarter]: For program point L174(lines 174 600) no Hoare annotation was computed. [2019-11-25 08:49:30,223 INFO L444 ceAbstractionStarter]: For program point L141(lines 141 611) no Hoare annotation was computed. [2019-11-25 08:49:30,223 INFO L444 ceAbstractionStarter]: For program point L108(lines 108 622) no Hoare annotation was computed. [2019-11-25 08:49:30,223 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 264) no Hoare annotation was computed. [2019-11-25 08:49:30,224 INFO L444 ceAbstractionStarter]: For program point L439-1(lines 439 451) no Hoare annotation was computed. [2019-11-25 08:49:30,224 INFO L440 ceAbstractionStarter]: At program point L208(lines 207 589) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) [2019-11-25 08:49:30,224 INFO L444 ceAbstractionStarter]: For program point L76(lines 76 80) no Hoare annotation was computed. [2019-11-25 08:49:30,224 INFO L444 ceAbstractionStarter]: For program point L76-2(lines 73 81) no Hoare annotation was computed. [2019-11-25 08:49:30,224 INFO L447 ceAbstractionStarter]: At program point L671(lines 64 673) the Hoare annotation is: true [2019-11-25 08:49:30,224 INFO L444 ceAbstractionStarter]: For program point L638(lines 638 644) no Hoare annotation was computed. [2019-11-25 08:49:30,224 INFO L444 ceAbstractionStarter]: For program point L539(lines 539 544) no Hoare annotation was computed. [2019-11-25 08:49:30,229 INFO L440 ceAbstractionStarter]: At program point L407(lines 398 418) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8192)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8195)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) [2019-11-25 08:49:30,229 INFO L444 ceAbstractionStarter]: For program point L341(lines 341 345) no Hoare annotation was computed. [2019-11-25 08:49:30,230 INFO L444 ceAbstractionStarter]: For program point L341-2(lines 209 586) no Hoare annotation was computed. [2019-11-25 08:49:30,230 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 501) no Hoare annotation was computed. [2019-11-25 08:49:30,230 INFO L447 ceAbstractionStarter]: At program point L672(lines 9 674) the Hoare annotation is: true [2019-11-25 08:49:30,230 INFO L444 ceAbstractionStarter]: For program point L573(lines 573 577) no Hoare annotation was computed. [2019-11-25 08:49:30,230 INFO L444 ceAbstractionStarter]: For program point L177(lines 177 599) no Hoare annotation was computed. [2019-11-25 08:49:30,230 INFO L444 ceAbstractionStarter]: For program point L144(lines 144 610) no Hoare annotation was computed. [2019-11-25 08:49:30,231 INFO L444 ceAbstractionStarter]: For program point L111(lines 111 621) no Hoare annotation was computed. [2019-11-25 08:49:30,231 INFO L444 ceAbstractionStarter]: For program point L442(lines 442 447) no Hoare annotation was computed. [2019-11-25 08:49:30,231 INFO L440 ceAbstractionStarter]: At program point L178(lines 174 600) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse1 (<= 8576 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (or (and .cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) .cse1 .cse2) (and .cse0 .cse1 .cse2 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-25 08:49:30,231 INFO L440 ceAbstractionStarter]: At program point L145(lines 141 611) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8192)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8195)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) [2019-11-25 08:49:30,231 INFO L444 ceAbstractionStarter]: For program point L410(lines 410 414) no Hoare annotation was computed. [2019-11-25 08:49:30,232 INFO L440 ceAbstractionStarter]: At program point L212(lines 105 623) the Hoare annotation is: false [2019-11-25 08:49:30,232 INFO L444 ceAbstractionStarter]: For program point L510(lines 510 514) no Hoare annotation was computed. [2019-11-25 08:49:30,232 INFO L444 ceAbstractionStarter]: For program point L510-2(lines 510 514) no Hoare annotation was computed. [2019-11-25 08:49:30,232 INFO L444 ceAbstractionStarter]: For program point L180(lines 180 598) no Hoare annotation was computed. [2019-11-25 08:49:30,232 INFO L444 ceAbstractionStarter]: For program point L147(lines 147 609) no Hoare annotation was computed. [2019-11-25 08:49:30,232 INFO L444 ceAbstractionStarter]: For program point L114(lines 114 620) no Hoare annotation was computed. [2019-11-25 08:49:30,232 INFO L444 ceAbstractionStarter]: For program point L478(lines 478 482) no Hoare annotation was computed. [2019-11-25 08:49:30,232 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 501) no Hoare annotation was computed. [2019-11-25 08:49:30,232 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 501) no Hoare annotation was computed. [2019-11-25 08:49:30,232 INFO L444 ceAbstractionStarter]: For program point L83(lines 83 91) no Hoare annotation was computed. [2019-11-25 08:49:30,232 INFO L444 ceAbstractionStarter]: For program point L83-1(lines 64 673) no Hoare annotation was computed. [2019-11-25 08:49:30,232 INFO L444 ceAbstractionStarter]: For program point L183(lines 183 597) no Hoare annotation was computed. [2019-11-25 08:49:30,233 INFO L444 ceAbstractionStarter]: For program point L150(lines 150 608) no Hoare annotation was computed. [2019-11-25 08:49:30,233 INFO L444 ceAbstractionStarter]: For program point L117(lines 117 619) no Hoare annotation was computed. [2019-11-25 08:49:30,233 INFO L444 ceAbstractionStarter]: For program point L84(lines 84 88) no Hoare annotation was computed. [2019-11-25 08:49:30,233 INFO L444 ceAbstractionStarter]: For program point L349(lines 349 380) no Hoare annotation was computed. [2019-11-25 08:49:30,233 INFO L444 ceAbstractionStarter]: For program point L316(lines 316 320) no Hoare annotation was computed. [2019-11-25 08:49:30,233 INFO L444 ceAbstractionStarter]: For program point L316-2(lines 316 320) no Hoare annotation was computed. [2019-11-25 08:49:30,233 INFO L444 ceAbstractionStarter]: For program point L217(lines 217 221) no Hoare annotation was computed. [2019-11-25 08:49:30,233 INFO L440 ceAbstractionStarter]: At program point L184(lines 180 598) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse1 (<= 8576 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (or (and .cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) .cse1 .cse2) (and .cse0 .cse1 .cse2 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-25 08:49:30,234 INFO L440 ceAbstractionStarter]: At program point L151(lines 147 609) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8192)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8195)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) [2019-11-25 08:49:30,234 INFO L444 ceAbstractionStarter]: For program point L217-2(lines 209 586) no Hoare annotation was computed. [2019-11-25 08:49:30,234 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-25 08:49:30,234 INFO L444 ceAbstractionStarter]: For program point L549(lines 549 553) no Hoare annotation was computed. [2019-11-25 08:49:30,234 INFO L444 ceAbstractionStarter]: For program point L186(lines 186 596) no Hoare annotation was computed. [2019-11-25 08:49:30,234 INFO L444 ceAbstractionStarter]: For program point L153(lines 153 607) no Hoare annotation was computed. [2019-11-25 08:49:30,234 INFO L444 ceAbstractionStarter]: For program point L120(lines 120 618) no Hoare annotation was computed. [2019-11-25 08:49:30,235 INFO L440 ceAbstractionStarter]: At program point L550(lines 64 673) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) [2019-11-25 08:49:30,235 INFO L444 ceAbstractionStarter]: For program point L352(lines 352 379) no Hoare annotation was computed. [2019-11-25 08:49:30,235 INFO L444 ceAbstractionStarter]: For program point L352-1(lines 352 379) no Hoare annotation was computed. [2019-11-25 08:49:30,235 INFO L440 ceAbstractionStarter]: At program point L121(lines 117 619) the Hoare annotation is: false [2019-11-25 08:49:30,235 INFO L444 ceAbstractionStarter]: For program point L353(lines 353 376) no Hoare annotation was computed. [2019-11-25 08:49:30,235 INFO L444 ceAbstractionStarter]: For program point L254(lines 254 266) no Hoare annotation was computed. [2019-11-25 08:49:30,235 INFO L447 ceAbstractionStarter]: At program point L684(lines 675 686) the Hoare annotation is: true [2019-11-25 08:49:30,235 INFO L444 ceAbstractionStarter]: For program point L255(lines 255 260) no Hoare annotation was computed. [2019-11-25 08:49:30,235 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 595) no Hoare annotation was computed. [2019-11-25 08:49:30,235 INFO L444 ceAbstractionStarter]: For program point L156(lines 156 606) no Hoare annotation was computed. [2019-11-25 08:49:30,235 INFO L444 ceAbstractionStarter]: For program point L123(lines 123 617) no Hoare annotation was computed. [2019-11-25 08:49:30,235 INFO L444 ceAbstractionStarter]: For program point L520(lines 520 525) no Hoare annotation was computed. [2019-11-25 08:49:30,236 INFO L444 ceAbstractionStarter]: For program point L388(lines 388 419) no Hoare annotation was computed. [2019-11-25 08:49:30,236 INFO L444 ceAbstractionStarter]: For program point L289(lines 289 293) no Hoare annotation was computed. [2019-11-25 08:49:30,236 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-25 08:49:30,236 INFO L444 ceAbstractionStarter]: For program point L289-2(lines 209 586) no Hoare annotation was computed. [2019-11-25 08:49:30,236 INFO L440 ceAbstractionStarter]: At program point L190(lines 186 596) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 16384))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse6 (<= 8576 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 24576))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292))) (.cse9 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)))) (or (and .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) .cse4 .cse5 .cse6 .cse7 .cse8) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0) (= ULTIMATE.start_ssl3_accept_~s__state~0 8640) .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) [2019-11-25 08:49:30,237 INFO L440 ceAbstractionStarter]: At program point L157(lines 153 607) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8192)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8195)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) [2019-11-25 08:49:30,237 INFO L440 ceAbstractionStarter]: At program point L124(lines 123 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 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 .cse10 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse11 .cse12 .cse13 .cse14 .cse15) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2019-11-25 08:49:30,238 INFO L440 ceAbstractionStarter]: At program point L587(lines 99 655) the Hoare annotation is: (let ((.cse9 (= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0)) (.cse5 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse7 (<= 8576 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse24 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse6 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse8 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse4 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 24576))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse22 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse23 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse25 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 16384))) (.cse26 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8192))) (.cse27 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8195))) (.cse28 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse10 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)))) (or (and .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse1 .cse2 .cse3) (and .cse4 .cse5 (<= 8576 ULTIMATE.start_ssl3_accept_~s__state~0) .cse6 .cse7) (and .cse8 .cse1 .cse9 .cse2 .cse3 .cse10) (and .cse8 .cse9 (= ULTIMATE.start_ssl3_accept_~s__state~0 8640) .cse10) (and .cse4 .cse5 .cse1 .cse2 .cse7 .cse3) (and .cse8 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse1 .cse2 .cse3) (and .cse4 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse0 .cse24 .cse25 .cse26 .cse1 .cse27 .cse3 .cse28) (and .cse4 .cse13 .cse17 .cse19 .cse21 .cse23 .cse0 .cse24 .cse26 .cse1 .cse6 .cse3 .cse28) (and .cse22 .cse8 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0) .cse25 .cse14 .cse18) (and .cse4 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse0 .cse25 .cse26 .cse1 .cse27 .cse3 .cse28 .cse10))) [2019-11-25 08:49:30,238 INFO L444 ceAbstractionStarter]: For program point L554(lines 554 558) no Hoare annotation was computed. [2019-11-25 08:49:30,238 INFO L444 ceAbstractionStarter]: For program point L389(lines 389 395) no Hoare annotation was computed. [2019-11-25 08:49:30,238 INFO L444 ceAbstractionStarter]: For program point L356(lines 356 375) no Hoare annotation was computed. [2019-11-25 08:49:30,238 INFO L444 ceAbstractionStarter]: For program point L489(lines 489 493) no Hoare annotation was computed. [2019-11-25 08:49:30,239 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 501) no Hoare annotation was computed. [2019-11-25 08:49:30,239 INFO L444 ceAbstractionStarter]: For program point L357(lines 357 361) no Hoare annotation was computed. [2019-11-25 08:49:30,239 INFO L444 ceAbstractionStarter]: For program point L357-2(lines 356 373) no Hoare annotation was computed. [2019-11-25 08:49:30,239 INFO L444 ceAbstractionStarter]: For program point L192(lines 192 594) no Hoare annotation was computed. [2019-11-25 08:49:30,239 INFO L444 ceAbstractionStarter]: For program point L159(lines 159 605) no Hoare annotation was computed. [2019-11-25 08:49:30,239 INFO L444 ceAbstractionStarter]: For program point L126(lines 126 616) no Hoare annotation was computed. [2019-11-25 08:49:30,239 INFO L444 ceAbstractionStarter]: For program point L457(lines 457 461) no Hoare annotation was computed. [2019-11-25 08:49:30,239 INFO L444 ceAbstractionStarter]: For program point L325-1(lines 325 334) no Hoare annotation was computed. [2019-11-25 08:49:30,240 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 262) no Hoare annotation was computed. [2019-11-25 08:49:30,240 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-25 08:49:30,240 INFO L447 ceAbstractionStarter]: At program point L656(lines 98 657) the Hoare annotation is: true [2019-11-25 08:49:30,240 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 262) no Hoare annotation was computed. [2019-11-25 08:49:30,240 INFO L444 ceAbstractionStarter]: For program point L195(lines 195 593) no Hoare annotation was computed. [2019-11-25 08:49:30,240 INFO L444 ceAbstractionStarter]: For program point L162(lines 162 604) no Hoare annotation was computed. [2019-11-25 08:49:30,240 INFO L444 ceAbstractionStarter]: For program point L129(lines 129 615) no Hoare annotation was computed. [2019-11-25 08:49:30,240 INFO L444 ceAbstractionStarter]: For program point L625(lines 625 653) no Hoare annotation was computed. [2019-11-25 08:49:30,240 INFO L444 ceAbstractionStarter]: For program point L262(line 262) no Hoare annotation was computed. [2019-11-25 08:49:30,240 INFO L444 ceAbstractionStarter]: For program point L229(lines 229 246) no Hoare annotation was computed. [2019-11-25 08:49:30,240 INFO L444 ceAbstractionStarter]: For program point L262-1(line 262) no Hoare annotation was computed. [2019-11-25 08:49:30,241 INFO L440 ceAbstractionStarter]: At program point L196(lines 192 594) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 16384))) (.cse4 (<= 8576 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 24576))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292))) (.cse7 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)))) (or (and .cse0 .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse2 .cse4 .cse3 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse5 .cse6 .cse7))) [2019-11-25 08:49:30,241 INFO L440 ceAbstractionStarter]: At program point L163(lines 159 605) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8192)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8195)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) [2019-11-25 08:49:30,241 INFO L444 ceAbstractionStarter]: For program point L229-2(lines 209 586) no Hoare annotation was computed. [2019-11-25 08:49:30,241 INFO L444 ceAbstractionStarter]: For program point L626(lines 626 650) no Hoare annotation was computed. [2019-11-25 08:49:30,241 INFO L444 ceAbstractionStarter]: For program point L560(lines 560 564) no Hoare annotation was computed. [2019-11-25 08:49:30,241 INFO L444 ceAbstractionStarter]: For program point L527(lines 527 531) no Hoare annotation was computed. [2019-11-25 08:49:30,241 INFO L444 ceAbstractionStarter]: For program point L560-2(lines 560 564) no Hoare annotation was computed. [2019-11-25 08:49:30,242 INFO L444 ceAbstractionStarter]: For program point L527-2(lines 209 586) no Hoare annotation was computed. [2019-11-25 08:49:30,242 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 333) no Hoare annotation was computed. [2019-11-25 08:49:30,242 INFO L444 ceAbstractionStarter]: For program point L660(lines 660 664) no Hoare annotation was computed. [2019-11-25 08:49:30,242 INFO L444 ceAbstractionStarter]: For program point L627(lines 627 636) no Hoare annotation was computed. [2019-11-25 08:49:30,242 INFO L444 ceAbstractionStarter]: For program point L660-2(lines 660 664) no Hoare annotation was computed. [2019-11-25 08:49:30,242 INFO L444 ceAbstractionStarter]: For program point L627-2(lines 626 648) no Hoare annotation was computed. [2019-11-25 08:49:30,242 INFO L444 ceAbstractionStarter]: For program point L462(lines 462 473) no Hoare annotation was computed. [2019-11-25 08:49:30,242 INFO L444 ceAbstractionStarter]: For program point L429(lines 429 433) no Hoare annotation was computed. [2019-11-25 08:49:30,242 INFO L440 ceAbstractionStarter]: At program point L363(lines 346 381) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8192)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8195)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) [2019-11-25 08:49:30,243 INFO L444 ceAbstractionStarter]: For program point L264(line 264) no Hoare annotation was computed. [2019-11-25 08:49:30,243 INFO L444 ceAbstractionStarter]: For program point L231(lines 231 236) no Hoare annotation was computed. [2019-11-25 08:49:30,243 INFO L444 ceAbstractionStarter]: For program point L264-1(line 264) no Hoare annotation was computed. [2019-11-25 08:49:30,243 INFO L444 ceAbstractionStarter]: For program point L198(lines 198 592) no Hoare annotation was computed. [2019-11-25 08:49:30,243 INFO L444 ceAbstractionStarter]: For program point L165(lines 165 603) no Hoare annotation was computed. [2019-11-25 08:49:30,243 INFO L444 ceAbstractionStarter]: For program point L132(lines 132 614) no Hoare annotation was computed. [2019-11-25 08:49:30,244 INFO L440 ceAbstractionStarter]: At program point L99-2(lines 99 655) the Hoare annotation is: (let ((.cse9 (= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0)) (.cse5 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse7 (<= 8576 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse24 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse6 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse8 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse4 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 24576))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse22 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse23 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse25 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 16384))) (.cse26 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8192))) (.cse27 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8195))) (.cse28 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse10 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)))) (or (and .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse1 .cse2 .cse3) (and .cse4 .cse5 (<= 8576 ULTIMATE.start_ssl3_accept_~s__state~0) .cse6 .cse7) (and .cse8 .cse1 .cse9 .cse2 .cse3 .cse10) (and .cse8 .cse9 (= ULTIMATE.start_ssl3_accept_~s__state~0 8640) .cse10) (and .cse4 .cse5 .cse1 .cse2 .cse7 .cse3) (and .cse8 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse1 .cse2 .cse3) (and .cse4 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse0 .cse24 .cse25 .cse26 .cse1 .cse27 .cse3 .cse28) (and .cse4 .cse13 .cse17 .cse19 .cse21 .cse23 .cse0 .cse24 .cse26 .cse1 .cse6 .cse3 .cse28) (and .cse22 .cse8 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0) .cse25 .cse14 .cse18) (and .cse4 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse0 .cse25 .cse26 .cse1 .cse27 .cse3 .cse28 .cse10))) [2019-11-25 08:49:30,244 INFO L440 ceAbstractionStarter]: At program point L397(lines 388 419) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8192)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8195)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) [2019-11-25 08:49:30,244 INFO L440 ceAbstractionStarter]: At program point L166(lines 165 603) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8192))) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8195)))) (or (and .cse0 .cse1 (= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0) .cse2 .cse3 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse1 .cse2 (<= 8576 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0) .cse3) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse1 .cse2 .cse3))) [2019-11-25 08:49:30,245 INFO L440 ceAbstractionStarter]: At program point L133(lines 126 616) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8192))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse14 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8195))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-25 08:49:30,245 INFO L444 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-11-25 08:49:30,245 INFO L444 ceAbstractionStarter]: For program point L629(lines 629 633) no Hoare annotation was computed. [2019-11-25 08:49:30,245 INFO L444 ceAbstractionStarter]: For program point L365(lines 365 369) no Hoare annotation was computed. [2019-11-25 08:49:30,284 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 08:49:30 BoogieIcfgContainer [2019-11-25 08:49:30,284 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-25 08:49:30,284 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-25 08:49:30,284 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-25 08:49:30,285 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-25 08:49:30,285 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:49:01" (3/4) ... [2019-11-25 08:49:30,288 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-25 08:49:30,307 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-25 08:49:30,308 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-25 08:49:30,407 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_a546479d-21dc-4402-a1a0-6a017ef060ec/bin/uautomizer/witness.graphml [2019-11-25 08:49:30,407 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-25 08:49:30,408 INFO L168 Benchmark]: Toolchain (without parser) took 30786.96 ms. Allocated memory was 1.0 GB in the beginning and 1.9 GB in the end (delta: 835.7 MB). Free memory was 943.4 MB in the beginning and 846.9 MB in the end (delta: 96.5 MB). Peak memory consumption was 932.2 MB. Max. memory is 11.5 GB. [2019-11-25 08:49:30,409 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:49:30,409 INFO L168 Benchmark]: CACSL2BoogieTranslator took 409.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 943.4 MB in the beginning and 1.1 GB in the end (delta: -174.4 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. [2019-11-25 08:49:30,409 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.37 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:49:30,410 INFO L168 Benchmark]: Boogie Preprocessor took 71.09 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-25 08:49:30,410 INFO L168 Benchmark]: RCFGBuilder took 1056.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 54.6 MB). Peak memory consumption was 54.6 MB. Max. memory is 11.5 GB. [2019-11-25 08:49:30,411 INFO L168 Benchmark]: TraceAbstraction took 29061.68 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 707.3 MB). Free memory was 1.1 GB in the beginning and 873.2 MB in the end (delta: 183.3 MB). Peak memory consumption was 892.9 MB. Max. memory is 11.5 GB. [2019-11-25 08:49:30,411 INFO L168 Benchmark]: Witness Printer took 123.03 ms. Allocated memory is still 1.9 GB. Free memory was 873.2 MB in the beginning and 846.9 MB in the end (delta: 26.3 MB). Peak memory consumption was 26.3 MB. Max. memory is 11.5 GB. [2019-11-25 08:49:30,413 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.26 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 409.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 943.4 MB in the beginning and 1.1 GB in the end (delta: -174.4 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 61.37 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 71.09 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1056.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 54.6 MB). Peak memory consumption was 54.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 29061.68 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 707.3 MB). Free memory was 1.1 GB in the beginning and 873.2 MB in the end (delta: 183.3 MB). Peak memory consumption was 892.9 MB. Max. memory is 11.5 GB. * Witness Printer took 123.03 ms. Allocated memory is still 1.9 GB. Free memory was 873.2 MB in the beginning and 846.9 MB in the end (delta: 26.3 MB). Peak memory consumption was 26.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 501]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 264]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 501]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 501]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 501]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 262]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 264]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 262]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - InvariantResult [Line: 126]: Loop Invariant Derived loop invariant: (((((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8192)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480)) || (((((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8192)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 207]: Loop Invariant Derived loop invariant: !(s__state == 12292) - InvariantResult [Line: 165]: Loop Invariant Derived loop invariant: ((((((blastFlag <= 3 && !(s__state == 8192)) && 8640 == s__s3__tmp__next_state___0) && s__state <= 8448) && !(s__state == 8195)) && !(0 == s__hit)) || (((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8192)) && s__state <= 8448) && 8576 <= s__s3__tmp__next_state___0) && !(s__state == 8195))) || ((((blastFlag <= 3 && s__s3__tmp__next_state___0 <= 3) && !(s__state == 8192)) && s__state <= 8448) && !(s__state == 8195)) - InvariantResult [Line: 123]: Loop Invariant Derived loop invariant: ((((((((((((((((!(s__state == 8513) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && s__s3__tmp__next_state___0 <= 8640) && !(s__state == 8192)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480)) || ((((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8192)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480)) - InvariantResult [Line: 398]: Loop Invariant Derived loop invariant: ((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8192)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480) - InvariantResult [Line: 153]: Loop Invariant Derived loop invariant: ((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8192)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480) - InvariantResult [Line: 346]: Loop Invariant Derived loop invariant: ((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8192)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480) - InvariantResult [Line: 9]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 186]: Loop Invariant Derived loop invariant: ((((((((((blastFlag <= 2 && !(s__state == 8673)) && !(s__state == 8656)) && !(s__state == 8657)) && !(s__state == 8576)) && !(s__state == 16384)) && !(s__state == 8672)) && 8576 <= s__state) && !(s__state == 24576)) && !(s__state == 12292)) || (((blastFlag <= 3 && 8640 == s__s3__tmp__next_state___0) && s__state == 8640) && !(0 == s__hit))) || (((((((((blastFlag <= 2 && !(s__state == 8673)) && !(s__state == 8656)) && !(s__state == 8657)) && !(s__state == 16384)) && !(s__state == 8672)) && 8576 <= s__state) && !(s__state == 24576)) && !(s__state == 12292)) && !(0 == s__hit)) - InvariantResult [Line: 105]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: (((blastFlag <= 3 && 8672 <= s__state) && !(s__state == 16384)) && !(s__state == 24576)) && !(s__state == 12292) - InvariantResult [Line: 147]: Loop Invariant Derived loop invariant: ((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8192)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480) - InvariantResult [Line: 64]: Loop Invariant Derived loop invariant: !(s__state == 12292) - InvariantResult [Line: 180]: Loop Invariant Derived loop invariant: (((blastFlag <= 2 && !(s__state == 8576)) && 8576 <= s__state) && s__state <= 8640) || (((blastFlag <= 2 && 8576 <= s__state) && s__state <= 8640) && !(0 == s__hit)) - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 388]: Loop Invariant Derived loop invariant: ((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8192)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480) - InvariantResult [Line: 141]: Loop Invariant Derived loop invariant: ((((((((((((((blastFlag <= 2 && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8192)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480) - InvariantResult [Line: 675]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 174]: Loop Invariant Derived loop invariant: (((blastFlag <= 2 && !(s__state == 8576)) && 8576 <= s__state) && s__state <= 8640) || (((blastFlag <= 2 && 8576 <= s__state) && s__state <= 8640) && !(0 == s__hit)) - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: ((((((((((((!(s__state == 8448) && s__s3__tmp__next_state___0 <= 8640) && !(s__state == 8192)) && s__state <= 8448) && !(s__state == 8195)) || ((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && 8576 <= s__state) && s__state <= 8576) && 8576 <= s__s3__tmp__next_state___0)) || (((((blastFlag <= 3 && !(s__state == 8192)) && 8640 == s__s3__tmp__next_state___0) && s__state <= 8448) && !(s__state == 8195)) && !(0 == s__hit))) || (((blastFlag <= 3 && 8640 == s__s3__tmp__next_state___0) && s__state == 8640) && !(0 == s__hit))) || (((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8192)) && s__state <= 8448) && 8576 <= s__s3__tmp__next_state___0) && !(s__state == 8195))) || ((((blastFlag <= 3 && s__s3__tmp__next_state___0 <= 3) && !(s__state == 8192)) && s__state <= 8448) && !(s__state == 8195))) || (((((((((((((((((((((blastFlag <= 2 && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 24576)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8545)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(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 == 8496)) && !(s__state == 8195)) && !(s__state == 8480))) || ((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8192)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480))) || (((((!(s__state == 8673) && blastFlag <= 3) && 8672 <= s__state) && !(s__state == 16384)) && !(s__state == 24576)) && !(s__state == 12292))) || (((((((((((((((((((((blastFlag <= 2 && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 24576)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8545)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 16384)) && !(s__state == 8497)) && !(s__state == 8192)) && !(s__state == 8496)) && !(s__state == 8195)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 64]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 135]: Loop Invariant Derived loop invariant: (((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8192)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480)) || (((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8192)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: ((((((((((((!(s__state == 8448) && s__s3__tmp__next_state___0 <= 8640) && !(s__state == 8192)) && s__state <= 8448) && !(s__state == 8195)) || ((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && 8576 <= s__state) && s__state <= 8576) && 8576 <= s__s3__tmp__next_state___0)) || (((((blastFlag <= 3 && !(s__state == 8192)) && 8640 == s__s3__tmp__next_state___0) && s__state <= 8448) && !(s__state == 8195)) && !(0 == s__hit))) || (((blastFlag <= 3 && 8640 == s__s3__tmp__next_state___0) && s__state == 8640) && !(0 == s__hit))) || (((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8192)) && s__state <= 8448) && 8576 <= s__s3__tmp__next_state___0) && !(s__state == 8195))) || ((((blastFlag <= 3 && s__s3__tmp__next_state___0 <= 3) && !(s__state == 8192)) && s__state <= 8448) && !(s__state == 8195))) || (((((((((((((((((((((blastFlag <= 2 && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 24576)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8545)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(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 == 8496)) && !(s__state == 8195)) && !(s__state == 8480))) || ((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8192)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480))) || (((((!(s__state == 8673) && blastFlag <= 3) && 8672 <= s__state) && !(s__state == 16384)) && !(s__state == 24576)) && !(s__state == 12292))) || (((((((((((((((((((((blastFlag <= 2 && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 24576)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8545)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 16384)) && !(s__state == 8497)) && !(s__state == 8192)) && !(s__state == 8496)) && !(s__state == 8195)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 168]: Loop Invariant Derived loop invariant: (blastFlag <= 2 && 8576 <= s__state) && s__state <= 8640 - InvariantResult [Line: 204]: Loop Invariant Derived loop invariant: !(s__state == 12292) - InvariantResult [Line: 159]: Loop Invariant Derived loop invariant: ((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8545)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8192)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480) - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 192]: Loop Invariant Derived loop invariant: ((((((((blastFlag <= 2 && !(s__state == 8673)) && !(s__state == 8576)) && !(s__state == 16384)) && !(s__state == 8672)) && 8576 <= s__state) && !(s__state == 24576)) && !(s__state == 12292)) || (((((((blastFlag <= 2 && !(s__state == 8673)) && !(s__state == 16384)) && !(s__state == 8672)) && 8576 <= s__state) && !(s__state == 24576)) && !(s__state == 12292)) && !(0 == s__hit))) || ((((((((!(s__state == 8673) && blastFlag <= 3) && !(s__state == 16384)) && 8576 <= s__state) && !(s__state == 8672)) && s__s3__tmp__next_state___0 <= 8640) && !(s__state == 24576)) && !(s__state == 12292)) && !(0 == s__hit)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 152 locations, 8 error locations. Result: SAFE, OverallTime: 28.9s, OverallIterations: 39, TraceHistogramMax: 14, AutomataDifference: 9.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 10.7s, HoareTripleCheckerStatistics: 6988 SDtfs, 5871 SDslu, 3536 SDs, 0 SdLazy, 4214 SolverSat, 1138 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1986 GetRequests, 1935 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5243occurred in iteration=33, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.4s AutomataMinimizationTime, 39 MinimizatonAttempts, 4793 StatesRemovedByMinimization, 36 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 29 LocationsWithAnnotation, 29 PreInvPairs, 275 NumberOfFragments, 1926 HoareAnnotationTreeSize, 29 FomulaSimplifications, 230792 FormulaSimplificationTreeSizeReduction, 2.8s HoareSimplificationTime, 29 FomulaSimplificationsInter, 46542 FormulaSimplificationTreeSizeReductionInter, 7.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 5670 NumberOfCodeBlocks, 5670 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 5627 ConstructedInterpolants, 0 QuantifiedInterpolants, 1668610 SizeOfPredicates, 13 NumberOfNonLiveVariables, 3550 ConjunctsInSsa, 36 ConjunctsInUnsatCore, 43 InterpolantComputations, 35 PerfectInterpolantSequences, 10843/10891 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...