./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/bitvector/s3_srvr_2a.BV.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_e8523ade-d2fd-469b-8e4d-38d5e1a815bb/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_e8523ade-d2fd-469b-8e4d-38d5e1a815bb/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_e8523ade-d2fd-469b-8e4d-38d5e1a815bb/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_e8523ade-d2fd-469b-8e4d-38d5e1a815bb/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/bitvector/s3_srvr_2a.BV.c.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_e8523ade-d2fd-469b-8e4d-38d5e1a815bb/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_e8523ade-d2fd-469b-8e4d-38d5e1a815bb/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 87f4b9a5847fc100ee315fb7d7bd5061116ea6e9 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-19 22:39:58,060 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 22:39:58,061 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 22:39:58,076 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 22:39:58,076 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 22:39:58,077 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 22:39:58,079 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 22:39:58,087 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 22:39:58,091 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 22:39:58,096 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 22:39:58,097 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 22:39:58,099 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 22:39:58,099 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 22:39:58,101 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 22:39:58,101 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 22:39:58,102 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 22:39:58,103 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 22:39:58,104 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 22:39:58,106 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 22:39:58,108 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 22:39:58,109 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 22:39:58,110 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 22:39:58,111 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 22:39:58,112 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 22:39:58,114 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 22:39:58,114 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 22:39:58,115 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 22:39:58,115 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 22:39:58,116 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 22:39:58,118 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 22:39:58,118 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 22:39:58,120 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 22:39:58,121 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 22:39:58,121 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 22:39:58,123 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 22:39:58,123 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 22:39:58,124 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 22:39:58,124 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 22:39:58,125 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 22:39:58,125 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 22:39:58,129 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 22:39:58,130 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_e8523ade-d2fd-469b-8e4d-38d5e1a815bb/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-19 22:39:58,142 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 22:39:58,150 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 22:39:58,151 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 22:39:58,151 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 22:39:58,151 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 22:39:58,157 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 22:39:58,157 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-19 22:39:58,158 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-19 22:39:58,158 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-19 22:39:58,158 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 22:39:58,158 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-19 22:39:58,158 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-19 22:39:58,158 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-19 22:39:58,159 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-19 22:39:58,159 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 22:39:58,159 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 22:39:58,159 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-19 22:39:58,159 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 22:39:58,160 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 22:39:58,160 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-19 22:39:58,160 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-19 22:39:58,160 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 22:39:58,160 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 22:39:58,161 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-19 22:39:58,161 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-19 22:39:58,161 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-19 22:39:58,161 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-19 22:39:58,161 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-19 22:39:58,162 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_e8523ade-d2fd-469b-8e4d-38d5e1a815bb/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 ! call(__VERIFIER_error())) ) 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 -> 87f4b9a5847fc100ee315fb7d7bd5061116ea6e9 [2019-11-19 22:39:58,302 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 22:39:58,314 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 22:39:58,317 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 22:39:58,318 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 22:39:58,319 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 22:39:58,320 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_e8523ade-d2fd-469b-8e4d-38d5e1a815bb/bin/uautomizer/../../sv-benchmarks/c/bitvector/s3_srvr_2a.BV.c.cil.c [2019-11-19 22:39:58,369 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e8523ade-d2fd-469b-8e4d-38d5e1a815bb/bin/uautomizer/data/2736636e1/2821129308414f90ba3bd5532107504d/FLAG9c208e09d [2019-11-19 22:39:58,804 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 22:39:58,812 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_e8523ade-d2fd-469b-8e4d-38d5e1a815bb/sv-benchmarks/c/bitvector/s3_srvr_2a.BV.c.cil.c [2019-11-19 22:39:58,825 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e8523ade-d2fd-469b-8e4d-38d5e1a815bb/bin/uautomizer/data/2736636e1/2821129308414f90ba3bd5532107504d/FLAG9c208e09d [2019-11-19 22:39:58,842 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_e8523ade-d2fd-469b-8e4d-38d5e1a815bb/bin/uautomizer/data/2736636e1/2821129308414f90ba3bd5532107504d [2019-11-19 22:39:58,845 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 22:39:58,846 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 22:39:58,847 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 22:39:58,848 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 22:39:58,851 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 22:39:58,852 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:39:58" (1/1) ... [2019-11-19 22:39:58,854 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@332ee523 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:39:58, skipping insertion in model container [2019-11-19 22:39:58,854 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:39:58" (1/1) ... [2019-11-19 22:39:58,861 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 22:39:58,919 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 22:39:59,230 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 22:39:59,233 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 22:39:59,287 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 22:39:59,299 INFO L192 MainTranslator]: Completed translation [2019-11-19 22:39:59,300 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:39:59 WrapperNode [2019-11-19 22:39:59,300 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 22:39:59,301 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 22:39:59,301 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 22:39:59,301 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 22:39:59,309 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:39:59" (1/1) ... [2019-11-19 22:39:59,317 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:39:59" (1/1) ... [2019-11-19 22:39:59,350 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 22:39:59,350 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 22:39:59,351 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 22:39:59,351 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 22:39:59,359 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:39:59" (1/1) ... [2019-11-19 22:39:59,360 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:39:59" (1/1) ... [2019-11-19 22:39:59,364 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:39:59" (1/1) ... [2019-11-19 22:39:59,364 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:39:59" (1/1) ... [2019-11-19 22:39:59,371 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:39:59" (1/1) ... [2019-11-19 22:39:59,380 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:39:59" (1/1) ... [2019-11-19 22:39:59,383 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:39:59" (1/1) ... [2019-11-19 22:39:59,388 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 22:39:59,388 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 22:39:59,388 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 22:39:59,388 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 22:39:59,389 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:39:59" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e8523ade-d2fd-469b-8e4d-38d5e1a815bb/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-19 22:39:59,445 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 22:39:59,445 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 22:39:59,557 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-19 22:40:00,129 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-11-19 22:40:00,130 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-11-19 22:40:00,131 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 22:40:00,131 INFO L285 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-19 22:40:00,132 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:40:00 BoogieIcfgContainer [2019-11-19 22:40:00,132 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 22:40:00,133 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-19 22:40:00,133 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-19 22:40:00,135 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-19 22:40:00,136 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 10:39:58" (1/3) ... [2019-11-19 22:40:00,136 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@541a1789 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:40:00, skipping insertion in model container [2019-11-19 22:40:00,136 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:39:59" (2/3) ... [2019-11-19 22:40:00,136 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@541a1789 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:40:00, skipping insertion in model container [2019-11-19 22:40:00,137 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:40:00" (3/3) ... [2019-11-19 22:40:00,138 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_2a.BV.c.cil.c [2019-11-19 22:40:00,146 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-19 22:40:00,155 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-19 22:40:00,165 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-19 22:40:00,196 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-19 22:40:00,197 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-19 22:40:00,197 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-19 22:40:00,197 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 22:40:00,197 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 22:40:00,197 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-19 22:40:00,198 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 22:40:00,198 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-19 22:40:00,219 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states. [2019-11-19 22:40:00,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-19 22:40:00,232 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:40:00,233 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, 1, 1, 1, 1] [2019-11-19 22:40:00,233 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:40:00,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:40:00,238 INFO L82 PathProgramCache]: Analyzing trace with hash -91609757, now seen corresponding path program 1 times [2019-11-19 22:40:00,247 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:40:00,247 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072058751] [2019-11-19 22:40:00,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:40:00,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:40:00,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:40:00,464 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072058751] [2019-11-19 22:40:00,464 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:40:00,465 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 22:40:00,466 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674331853] [2019-11-19 22:40:00,471 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:40:00,472 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:40:00,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:40:00,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:40:00,484 INFO L87 Difference]: Start difference. First operand 137 states. Second operand 3 states. [2019-11-19 22:40:00,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:40:00,799 INFO L93 Difference]: Finished difference Result 316 states and 546 transitions. [2019-11-19 22:40:00,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:40:00,801 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-11-19 22:40:00,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:40:00,819 INFO L225 Difference]: With dead ends: 316 [2019-11-19 22:40:00,820 INFO L226 Difference]: Without dead ends: 160 [2019-11-19 22:40:00,824 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:40:00,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-11-19 22:40:00,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 155. [2019-11-19 22:40:00,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-11-19 22:40:00,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 247 transitions. [2019-11-19 22:40:00,905 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 247 transitions. Word has length 43 [2019-11-19 22:40:00,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:40:00,906 INFO L462 AbstractCegarLoop]: Abstraction has 155 states and 247 transitions. [2019-11-19 22:40:00,906 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:40:00,907 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 247 transitions. [2019-11-19 22:40:00,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-19 22:40:00,917 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:40:00,917 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, 1, 1, 1, 1, 1] [2019-11-19 22:40:00,917 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:40:00,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:40:00,919 INFO L82 PathProgramCache]: Analyzing trace with hash 1448029290, now seen corresponding path program 1 times [2019-11-19 22:40:00,919 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:40:00,920 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941703617] [2019-11-19 22:40:00,920 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:40:00,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:40:01,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:40:01,038 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941703617] [2019-11-19 22:40:01,038 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:40:01,038 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 22:40:01,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744985612] [2019-11-19 22:40:01,044 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:40:01,044 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:40:01,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:40:01,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:40:01,045 INFO L87 Difference]: Start difference. First operand 155 states and 247 transitions. Second operand 3 states. [2019-11-19 22:40:01,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:40:01,283 INFO L93 Difference]: Finished difference Result 351 states and 564 transitions. [2019-11-19 22:40:01,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:40:01,284 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-11-19 22:40:01,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:40:01,286 INFO L225 Difference]: With dead ends: 351 [2019-11-19 22:40:01,287 INFO L226 Difference]: Without dead ends: 201 [2019-11-19 22:40:01,288 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:40:01,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-11-19 22:40:01,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 196. [2019-11-19 22:40:01,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-11-19 22:40:01,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 319 transitions. [2019-11-19 22:40:01,317 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 319 transitions. Word has length 44 [2019-11-19 22:40:01,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:40:01,317 INFO L462 AbstractCegarLoop]: Abstraction has 196 states and 319 transitions. [2019-11-19 22:40:01,318 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:40:01,318 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 319 transitions. [2019-11-19 22:40:01,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-19 22:40:01,324 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:40:01,324 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, 1, 1, 1, 1] [2019-11-19 22:40:01,325 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:40:01,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:40:01,325 INFO L82 PathProgramCache]: Analyzing trace with hash 2008911458, now seen corresponding path program 1 times [2019-11-19 22:40:01,326 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:40:01,326 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347571015] [2019-11-19 22:40:01,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:40:01,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:40:01,430 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-19 22:40:01,431 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347571015] [2019-11-19 22:40:01,431 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:40:01,432 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:40:01,432 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466413105] [2019-11-19 22:40:01,432 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:40:01,433 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:40:01,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:40:01,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:40:01,433 INFO L87 Difference]: Start difference. First operand 196 states and 319 transitions. Second operand 3 states. [2019-11-19 22:40:01,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:40:01,474 INFO L93 Difference]: Finished difference Result 572 states and 934 transitions. [2019-11-19 22:40:01,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:40:01,478 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-11-19 22:40:01,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:40:01,481 INFO L225 Difference]: With dead ends: 572 [2019-11-19 22:40:01,481 INFO L226 Difference]: Without dead ends: 383 [2019-11-19 22:40:01,483 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-19 22:40:01,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2019-11-19 22:40:01,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 383. [2019-11-19 22:40:01,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2019-11-19 22:40:01,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 623 transitions. [2019-11-19 22:40:01,513 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 623 transitions. Word has length 59 [2019-11-19 22:40:01,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:40:01,523 INFO L462 AbstractCegarLoop]: Abstraction has 383 states and 623 transitions. [2019-11-19 22:40:01,523 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:40:01,523 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 623 transitions. [2019-11-19 22:40:01,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-19 22:40:01,524 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:40:01,524 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, 1, 1, 1, 1] [2019-11-19 22:40:01,525 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:40:01,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:40:01,525 INFO L82 PathProgramCache]: Analyzing trace with hash 44999767, now seen corresponding path program 1 times [2019-11-19 22:40:01,525 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:40:01,525 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295177772] [2019-11-19 22:40:01,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:40:01,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:40:01,577 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-19 22:40:01,577 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295177772] [2019-11-19 22:40:01,578 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:40:01,578 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 22:40:01,578 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879053057] [2019-11-19 22:40:01,579 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:40:01,579 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:40:01,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:40:01,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:40:01,579 INFO L87 Difference]: Start difference. First operand 383 states and 623 transitions. Second operand 3 states. [2019-11-19 22:40:01,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:40:01,752 INFO L93 Difference]: Finished difference Result 811 states and 1316 transitions. [2019-11-19 22:40:01,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:40:01,753 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2019-11-19 22:40:01,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:40:01,757 INFO L225 Difference]: With dead ends: 811 [2019-11-19 22:40:01,757 INFO L226 Difference]: Without dead ends: 435 [2019-11-19 22:40:01,758 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:40:01,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2019-11-19 22:40:01,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 425. [2019-11-19 22:40:01,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2019-11-19 22:40:01,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 685 transitions. [2019-11-19 22:40:01,800 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 685 transitions. Word has length 80 [2019-11-19 22:40:01,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:40:01,801 INFO L462 AbstractCegarLoop]: Abstraction has 425 states and 685 transitions. [2019-11-19 22:40:01,801 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:40:01,801 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 685 transitions. [2019-11-19 22:40:01,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-19 22:40:01,803 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:40:01,803 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:40:01,803 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:40:01,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:40:01,804 INFO L82 PathProgramCache]: Analyzing trace with hash 586802411, now seen corresponding path program 1 times [2019-11-19 22:40:01,804 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:40:01,804 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933156884] [2019-11-19 22:40:01,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:40:01,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:40:01,859 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-19 22:40:01,860 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933156884] [2019-11-19 22:40:01,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:40:01,860 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 22:40:01,860 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045735709] [2019-11-19 22:40:01,861 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:40:01,861 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:40:01,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:40:01,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:40:01,862 INFO L87 Difference]: Start difference. First operand 425 states and 685 transitions. Second operand 3 states. [2019-11-19 22:40:02,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:40:02,048 INFO L93 Difference]: Finished difference Result 853 states and 1374 transitions. [2019-11-19 22:40:02,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:40:02,049 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2019-11-19 22:40:02,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:40:02,052 INFO L225 Difference]: With dead ends: 853 [2019-11-19 22:40:02,052 INFO L226 Difference]: Without dead ends: 435 [2019-11-19 22:40:02,053 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:40:02,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2019-11-19 22:40:02,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 425. [2019-11-19 22:40:02,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2019-11-19 22:40:02,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 681 transitions. [2019-11-19 22:40:02,068 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 681 transitions. Word has length 81 [2019-11-19 22:40:02,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:40:02,069 INFO L462 AbstractCegarLoop]: Abstraction has 425 states and 681 transitions. [2019-11-19 22:40:02,069 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:40:02,069 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 681 transitions. [2019-11-19 22:40:02,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-19 22:40:02,071 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:40:02,071 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:40:02,071 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:40:02,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:40:02,072 INFO L82 PathProgramCache]: Analyzing trace with hash 1514553016, now seen corresponding path program 1 times [2019-11-19 22:40:02,072 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:40:02,072 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709578516] [2019-11-19 22:40:02,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:40:02,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:40:02,119 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-19 22:40:02,119 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709578516] [2019-11-19 22:40:02,119 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:40:02,120 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:40:02,120 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424351410] [2019-11-19 22:40:02,120 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:40:02,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:40:02,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:40:02,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:40:02,121 INFO L87 Difference]: Start difference. First operand 425 states and 681 transitions. Second operand 3 states. [2019-11-19 22:40:02,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:40:02,276 INFO L93 Difference]: Finished difference Result 971 states and 1575 transitions. [2019-11-19 22:40:02,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:40:02,276 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2019-11-19 22:40:02,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:40:02,279 INFO L225 Difference]: With dead ends: 971 [2019-11-19 22:40:02,279 INFO L226 Difference]: Without dead ends: 553 [2019-11-19 22:40:02,280 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-19 22:40:02,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2019-11-19 22:40:02,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 543. [2019-11-19 22:40:02,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 543 states. [2019-11-19 22:40:02,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 797 transitions. [2019-11-19 22:40:02,297 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 797 transitions. Word has length 96 [2019-11-19 22:40:02,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:40:02,297 INFO L462 AbstractCegarLoop]: Abstraction has 543 states and 797 transitions. [2019-11-19 22:40:02,297 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:40:02,297 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 797 transitions. [2019-11-19 22:40:02,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-19 22:40:02,299 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:40:02,299 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:40:02,299 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:40:02,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:40:02,300 INFO L82 PathProgramCache]: Analyzing trace with hash 1948282102, now seen corresponding path program 1 times [2019-11-19 22:40:02,300 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:40:02,300 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936315164] [2019-11-19 22:40:02,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:40:02,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:40:02,342 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-19 22:40:02,343 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936315164] [2019-11-19 22:40:02,343 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:40:02,343 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:40:02,343 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53934920] [2019-11-19 22:40:02,344 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:40:02,344 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:40:02,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:40:02,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:40:02,344 INFO L87 Difference]: Start difference. First operand 543 states and 797 transitions. Second operand 3 states. [2019-11-19 22:40:02,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:40:02,538 INFO L93 Difference]: Finished difference Result 1167 states and 1733 transitions. [2019-11-19 22:40:02,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:40:02,539 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2019-11-19 22:40:02,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:40:02,543 INFO L225 Difference]: With dead ends: 1167 [2019-11-19 22:40:02,543 INFO L226 Difference]: Without dead ends: 631 [2019-11-19 22:40:02,544 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-19 22:40:02,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2019-11-19 22:40:02,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 605. [2019-11-19 22:40:02,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2019-11-19 22:40:02,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 885 transitions. [2019-11-19 22:40:02,563 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 885 transitions. Word has length 96 [2019-11-19 22:40:02,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:40:02,564 INFO L462 AbstractCegarLoop]: Abstraction has 605 states and 885 transitions. [2019-11-19 22:40:02,564 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:40:02,564 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 885 transitions. [2019-11-19 22:40:02,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-19 22:40:02,566 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:40:02,567 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, 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-19 22:40:02,567 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:40:02,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:40:02,567 INFO L82 PathProgramCache]: Analyzing trace with hash 564782516, now seen corresponding path program 1 times [2019-11-19 22:40:02,568 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:40:02,568 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310097179] [2019-11-19 22:40:02,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:40:02,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:40:02,634 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-11-19 22:40:02,634 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310097179] [2019-11-19 22:40:02,635 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:40:02,635 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:40:02,635 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103690079] [2019-11-19 22:40:02,635 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:40:02,635 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:40:02,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:40:02,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:40:02,636 INFO L87 Difference]: Start difference. First operand 605 states and 885 transitions. Second operand 3 states. [2019-11-19 22:40:02,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:40:02,673 INFO L93 Difference]: Finished difference Result 905 states and 1324 transitions. [2019-11-19 22:40:02,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:40:02,674 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2019-11-19 22:40:02,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:40:02,679 INFO L225 Difference]: With dead ends: 905 [2019-11-19 22:40:02,679 INFO L226 Difference]: Without dead ends: 903 [2019-11-19 22:40:02,680 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-19 22:40:02,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2019-11-19 22:40:02,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 903. [2019-11-19 22:40:02,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 903 states. [2019-11-19 22:40:02,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 903 states to 903 states and 1322 transitions. [2019-11-19 22:40:02,707 INFO L78 Accepts]: Start accepts. Automaton has 903 states and 1322 transitions. Word has length 120 [2019-11-19 22:40:02,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:40:02,707 INFO L462 AbstractCegarLoop]: Abstraction has 903 states and 1322 transitions. [2019-11-19 22:40:02,707 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:40:02,708 INFO L276 IsEmpty]: Start isEmpty. Operand 903 states and 1322 transitions. [2019-11-19 22:40:02,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-11-19 22:40:02,711 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:40:02,711 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, 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-19 22:40:02,711 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:40:02,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:40:02,712 INFO L82 PathProgramCache]: Analyzing trace with hash 1174075643, now seen corresponding path program 1 times [2019-11-19 22:40:02,712 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:40:02,712 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681677426] [2019-11-19 22:40:02,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:40:02,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:40:02,770 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 205 proven. 0 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2019-11-19 22:40:02,771 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681677426] [2019-11-19 22:40:02,771 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:40:02,771 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:40:02,771 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662331772] [2019-11-19 22:40:02,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:40:02,772 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:40:02,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:40:02,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:40:02,773 INFO L87 Difference]: Start difference. First operand 903 states and 1322 transitions. Second operand 3 states. [2019-11-19 22:40:02,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:40:02,922 INFO L93 Difference]: Finished difference Result 1877 states and 2732 transitions. [2019-11-19 22:40:02,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:40:02,923 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 184 [2019-11-19 22:40:02,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:40:02,928 INFO L225 Difference]: With dead ends: 1877 [2019-11-19 22:40:02,929 INFO L226 Difference]: Without dead ends: 981 [2019-11-19 22:40:02,930 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-19 22:40:02,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 981 states. [2019-11-19 22:40:02,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 981 to 972. [2019-11-19 22:40:02,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 972 states. [2019-11-19 22:40:02,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 972 states and 1406 transitions. [2019-11-19 22:40:02,958 INFO L78 Accepts]: Start accepts. Automaton has 972 states and 1406 transitions. Word has length 184 [2019-11-19 22:40:02,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:40:02,958 INFO L462 AbstractCegarLoop]: Abstraction has 972 states and 1406 transitions. [2019-11-19 22:40:02,959 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:40:02,959 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states and 1406 transitions. [2019-11-19 22:40:02,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-11-19 22:40:02,962 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:40:02,962 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2019-11-19 22:40:02,963 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:40:02,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:40:02,963 INFO L82 PathProgramCache]: Analyzing trace with hash 1179429289, now seen corresponding path program 1 times [2019-11-19 22:40:02,963 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:40:02,963 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305344484] [2019-11-19 22:40:02,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:40:02,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:40:03,056 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 292 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2019-11-19 22:40:03,056 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305344484] [2019-11-19 22:40:03,056 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:40:03,056 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:40:03,057 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811191917] [2019-11-19 22:40:03,057 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:40:03,057 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:40:03,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:40:03,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:40:03,058 INFO L87 Difference]: Start difference. First operand 972 states and 1406 transitions. Second operand 3 states. [2019-11-19 22:40:03,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:40:03,204 INFO L93 Difference]: Finished difference Result 2048 states and 2960 transitions. [2019-11-19 22:40:03,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:40:03,205 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 204 [2019-11-19 22:40:03,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:40:03,211 INFO L225 Difference]: With dead ends: 2048 [2019-11-19 22:40:03,211 INFO L226 Difference]: Without dead ends: 1083 [2019-11-19 22:40:03,213 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-19 22:40:03,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1083 states. [2019-11-19 22:40:03,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1083 to 1047. [2019-11-19 22:40:03,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1047 states. [2019-11-19 22:40:03,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1047 states to 1047 states and 1496 transitions. [2019-11-19 22:40:03,242 INFO L78 Accepts]: Start accepts. Automaton has 1047 states and 1496 transitions. Word has length 204 [2019-11-19 22:40:03,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:40:03,243 INFO L462 AbstractCegarLoop]: Abstraction has 1047 states and 1496 transitions. [2019-11-19 22:40:03,243 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:40:03,243 INFO L276 IsEmpty]: Start isEmpty. Operand 1047 states and 1496 transitions. [2019-11-19 22:40:03,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-11-19 22:40:03,247 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:40:03,247 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 5, 5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:40:03,247 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:40:03,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:40:03,248 INFO L82 PathProgramCache]: Analyzing trace with hash -1179962115, now seen corresponding path program 1 times [2019-11-19 22:40:03,248 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:40:03,248 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142728032] [2019-11-19 22:40:03,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:40:03,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:40:03,314 INFO L134 CoverageAnalysis]: Checked inductivity of 578 backedges. 312 proven. 0 refuted. 0 times theorem prover too weak. 266 trivial. 0 not checked. [2019-11-19 22:40:03,315 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142728032] [2019-11-19 22:40:03,315 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:40:03,315 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:40:03,315 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902736847] [2019-11-19 22:40:03,316 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:40:03,316 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:40:03,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:40:03,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:40:03,317 INFO L87 Difference]: Start difference. First operand 1047 states and 1496 transitions. Second operand 3 states. [2019-11-19 22:40:03,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:40:03,361 INFO L93 Difference]: Finished difference Result 3109 states and 4430 transitions. [2019-11-19 22:40:03,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:40:03,361 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 230 [2019-11-19 22:40:03,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:40:03,373 INFO L225 Difference]: With dead ends: 3109 [2019-11-19 22:40:03,373 INFO L226 Difference]: Without dead ends: 2069 [2019-11-19 22:40:03,375 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-19 22:40:03,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2069 states. [2019-11-19 22:40:03,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2069 to 1050. [2019-11-19 22:40:03,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1050 states. [2019-11-19 22:40:03,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1050 states to 1050 states and 1499 transitions. [2019-11-19 22:40:03,415 INFO L78 Accepts]: Start accepts. Automaton has 1050 states and 1499 transitions. Word has length 230 [2019-11-19 22:40:03,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:40:03,416 INFO L462 AbstractCegarLoop]: Abstraction has 1050 states and 1499 transitions. [2019-11-19 22:40:03,416 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:40:03,416 INFO L276 IsEmpty]: Start isEmpty. Operand 1050 states and 1499 transitions. [2019-11-19 22:40:03,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-11-19 22:40:03,419 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:40:03,420 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 5, 5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:40:03,420 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:40:03,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:40:03,420 INFO L82 PathProgramCache]: Analyzing trace with hash -150020643, now seen corresponding path program 1 times [2019-11-19 22:40:03,421 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:40:03,421 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080086018] [2019-11-19 22:40:03,421 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:40:03,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:40:03,503 INFO L134 CoverageAnalysis]: Checked inductivity of 578 backedges. 385 proven. 0 refuted. 0 times theorem prover too weak. 193 trivial. 0 not checked. [2019-11-19 22:40:03,503 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080086018] [2019-11-19 22:40:03,504 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:40:03,504 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:40:03,504 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045928565] [2019-11-19 22:40:03,505 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:40:03,505 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:40:03,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:40:03,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:40:03,505 INFO L87 Difference]: Start difference. First operand 1050 states and 1499 transitions. Second operand 3 states. [2019-11-19 22:40:03,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:40:03,676 INFO L93 Difference]: Finished difference Result 2195 states and 3134 transitions. [2019-11-19 22:40:03,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:40:03,677 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 230 [2019-11-19 22:40:03,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:40:03,683 INFO L225 Difference]: With dead ends: 2195 [2019-11-19 22:40:03,683 INFO L226 Difference]: Without dead ends: 1152 [2019-11-19 22:40:03,685 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-19 22:40:03,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1152 states. [2019-11-19 22:40:03,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1152 to 1131. [2019-11-19 22:40:03,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1131 states. [2019-11-19 22:40:03,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1131 states to 1131 states and 1595 transitions. [2019-11-19 22:40:03,728 INFO L78 Accepts]: Start accepts. Automaton has 1131 states and 1595 transitions. Word has length 230 [2019-11-19 22:40:03,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:40:03,728 INFO L462 AbstractCegarLoop]: Abstraction has 1131 states and 1595 transitions. [2019-11-19 22:40:03,728 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:40:03,729 INFO L276 IsEmpty]: Start isEmpty. Operand 1131 states and 1595 transitions. [2019-11-19 22:40:03,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-11-19 22:40:03,733 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:40:03,733 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:40:03,734 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:40:03,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:40:03,734 INFO L82 PathProgramCache]: Analyzing trace with hash -336843366, now seen corresponding path program 1 times [2019-11-19 22:40:03,735 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:40:03,735 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533866562] [2019-11-19 22:40:03,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:40:03,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:40:03,897 INFO L134 CoverageAnalysis]: Checked inductivity of 574 backedges. 410 proven. 0 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2019-11-19 22:40:03,897 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533866562] [2019-11-19 22:40:03,897 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:40:03,898 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:40:03,898 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996276062] [2019-11-19 22:40:03,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:40:03,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:40:03,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:40:03,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:40:03,899 INFO L87 Difference]: Start difference. First operand 1131 states and 1595 transitions. Second operand 3 states. [2019-11-19 22:40:03,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:40:03,965 INFO L93 Difference]: Finished difference Result 3373 states and 4754 transitions. [2019-11-19 22:40:03,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:40:03,965 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 231 [2019-11-19 22:40:03,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:40:03,977 INFO L225 Difference]: With dead ends: 3373 [2019-11-19 22:40:03,977 INFO L226 Difference]: Without dead ends: 2249 [2019-11-19 22:40:03,979 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-19 22:40:03,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2249 states. [2019-11-19 22:40:04,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2249 to 2247. [2019-11-19 22:40:04,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2247 states. [2019-11-19 22:40:04,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2247 states to 2247 states and 3163 transitions. [2019-11-19 22:40:04,051 INFO L78 Accepts]: Start accepts. Automaton has 2247 states and 3163 transitions. Word has length 231 [2019-11-19 22:40:04,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:40:04,051 INFO L462 AbstractCegarLoop]: Abstraction has 2247 states and 3163 transitions. [2019-11-19 22:40:04,051 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:40:04,051 INFO L276 IsEmpty]: Start isEmpty. Operand 2247 states and 3163 transitions. [2019-11-19 22:40:04,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-11-19 22:40:04,057 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:40:04,058 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:40:04,058 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:40:04,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:40:04,058 INFO L82 PathProgramCache]: Analyzing trace with hash -1934345498, now seen corresponding path program 1 times [2019-11-19 22:40:04,058 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:40:04,062 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964306185] [2019-11-19 22:40:04,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:40:04,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:40:04,150 INFO L134 CoverageAnalysis]: Checked inductivity of 574 backedges. 359 proven. 0 refuted. 0 times theorem prover too weak. 215 trivial. 0 not checked. [2019-11-19 22:40:04,151 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964306185] [2019-11-19 22:40:04,151 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:40:04,151 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:40:04,151 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617516652] [2019-11-19 22:40:04,152 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:40:04,152 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:40:04,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:40:04,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:40:04,152 INFO L87 Difference]: Start difference. First operand 2247 states and 3163 transitions. Second operand 3 states. [2019-11-19 22:40:04,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:40:04,343 INFO L93 Difference]: Finished difference Result 4733 states and 6735 transitions. [2019-11-19 22:40:04,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:40:04,344 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 232 [2019-11-19 22:40:04,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:40:04,357 INFO L225 Difference]: With dead ends: 4733 [2019-11-19 22:40:04,357 INFO L226 Difference]: Without dead ends: 2433 [2019-11-19 22:40:04,361 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-19 22:40:04,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2433 states. [2019-11-19 22:40:04,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2433 to 2433. [2019-11-19 22:40:04,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2433 states. [2019-11-19 22:40:04,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2433 states to 2433 states and 3379 transitions. [2019-11-19 22:40:04,435 INFO L78 Accepts]: Start accepts. Automaton has 2433 states and 3379 transitions. Word has length 232 [2019-11-19 22:40:04,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:40:04,435 INFO L462 AbstractCegarLoop]: Abstraction has 2433 states and 3379 transitions. [2019-11-19 22:40:04,435 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:40:04,435 INFO L276 IsEmpty]: Start isEmpty. Operand 2433 states and 3379 transitions. [2019-11-19 22:40:04,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-11-19 22:40:04,441 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:40:04,442 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:40:04,442 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:40:04,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:40:04,442 INFO L82 PathProgramCache]: Analyzing trace with hash -462203708, now seen corresponding path program 1 times [2019-11-19 22:40:04,443 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:40:04,443 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505332897] [2019-11-19 22:40:04,443 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:40:04,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:40:04,573 INFO L134 CoverageAnalysis]: Checked inductivity of 624 backedges. 425 proven. 16 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2019-11-19 22:40:04,574 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505332897] [2019-11-19 22:40:04,574 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [589212927] [2019-11-19 22:40:04,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e8523ade-d2fd-469b-8e4d-38d5e1a815bb/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-19 22:40:04,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:40:04,687 INFO L255 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-19 22:40:04,708 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:40:04,806 INFO L134 CoverageAnalysis]: Checked inductivity of 624 backedges. 398 proven. 0 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2019-11-19 22:40:04,806 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-19 22:40:04,807 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-19 22:40:04,809 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389765302] [2019-11-19 22:40:04,809 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:40:04,810 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:40:04,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:40:04,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-19 22:40:04,810 INFO L87 Difference]: Start difference. First operand 2433 states and 3379 transitions. Second operand 3 states. [2019-11-19 22:40:04,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:40:04,905 INFO L93 Difference]: Finished difference Result 5667 states and 7870 transitions. [2019-11-19 22:40:04,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:40:04,905 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 244 [2019-11-19 22:40:04,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:40:04,922 INFO L225 Difference]: With dead ends: 5667 [2019-11-19 22:40:04,923 INFO L226 Difference]: Without dead ends: 3241 [2019-11-19 22:40:04,927 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-19 22:40:04,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3241 states. [2019-11-19 22:40:05,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3241 to 3241. [2019-11-19 22:40:05,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3241 states. [2019-11-19 22:40:05,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3241 states to 3241 states and 4500 transitions. [2019-11-19 22:40:05,030 INFO L78 Accepts]: Start accepts. Automaton has 3241 states and 4500 transitions. Word has length 244 [2019-11-19 22:40:05,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:40:05,030 INFO L462 AbstractCegarLoop]: Abstraction has 3241 states and 4500 transitions. [2019-11-19 22:40:05,031 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:40:05,031 INFO L276 IsEmpty]: Start isEmpty. Operand 3241 states and 4500 transitions. [2019-11-19 22:40:05,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-11-19 22:40:05,039 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:40:05,039 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:40:05,244 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:40:05,244 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:40:05,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:40:05,245 INFO L82 PathProgramCache]: Analyzing trace with hash 464017511, now seen corresponding path program 1 times [2019-11-19 22:40:05,245 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:40:05,245 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690698530] [2019-11-19 22:40:05,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:40:05,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:40:05,365 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 430 proven. 16 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-11-19 22:40:05,365 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690698530] [2019-11-19 22:40:05,366 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1732461213] [2019-11-19 22:40:05,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e8523ade-d2fd-469b-8e4d-38d5e1a815bb/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-19 22:40:05,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:40:05,475 INFO L255 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-19 22:40:05,493 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:40:05,588 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 430 proven. 16 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-11-19 22:40:05,589 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:40:05,589 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-19 22:40:05,590 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576849359] [2019-11-19 22:40:05,590 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 22:40:05,591 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:40:05,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 22:40:05,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 22:40:05,591 INFO L87 Difference]: Start difference. First operand 3241 states and 4500 transitions. Second operand 4 states. [2019-11-19 22:40:06,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:40:06,014 INFO L93 Difference]: Finished difference Result 8229 states and 11374 transitions. [2019-11-19 22:40:06,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-19 22:40:06,014 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 252 [2019-11-19 22:40:06,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:40:06,040 INFO L225 Difference]: With dead ends: 8229 [2019-11-19 22:40:06,040 INFO L226 Difference]: Without dead ends: 4995 [2019-11-19 22:40:06,045 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 254 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-19 22:40:06,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4995 states. [2019-11-19 22:40:06,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4995 to 4161. [2019-11-19 22:40:06,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4161 states. [2019-11-19 22:40:06,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4161 states to 4161 states and 5572 transitions. [2019-11-19 22:40:06,188 INFO L78 Accepts]: Start accepts. Automaton has 4161 states and 5572 transitions. Word has length 252 [2019-11-19 22:40:06,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:40:06,189 INFO L462 AbstractCegarLoop]: Abstraction has 4161 states and 5572 transitions. [2019-11-19 22:40:06,189 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 22:40:06,189 INFO L276 IsEmpty]: Start isEmpty. Operand 4161 states and 5572 transitions. [2019-11-19 22:40:06,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-11-19 22:40:06,199 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:40:06,199 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:40:06,411 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:40:06,411 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:40:06,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:40:06,412 INFO L82 PathProgramCache]: Analyzing trace with hash 752836901, now seen corresponding path program 1 times [2019-11-19 22:40:06,412 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:40:06,412 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151065744] [2019-11-19 22:40:06,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:40:06,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:40:06,513 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 400 proven. 0 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2019-11-19 22:40:06,513 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151065744] [2019-11-19 22:40:06,514 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:40:06,514 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:40:06,514 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143903311] [2019-11-19 22:40:06,515 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:40:06,515 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:40:06,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:40:06,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:40:06,516 INFO L87 Difference]: Start difference. First operand 4161 states and 5572 transitions. Second operand 3 states. [2019-11-19 22:40:06,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:40:06,685 INFO L93 Difference]: Finished difference Result 11621 states and 15694 transitions. [2019-11-19 22:40:06,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:40:06,685 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 252 [2019-11-19 22:40:06,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:40:06,713 INFO L225 Difference]: With dead ends: 11621 [2019-11-19 22:40:06,713 INFO L226 Difference]: Without dead ends: 5141 [2019-11-19 22:40:06,721 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-19 22:40:06,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5141 states. [2019-11-19 22:40:06,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5141 to 4886. [2019-11-19 22:40:06,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4886 states. [2019-11-19 22:40:06,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4886 states to 4886 states and 6668 transitions. [2019-11-19 22:40:06,886 INFO L78 Accepts]: Start accepts. Automaton has 4886 states and 6668 transitions. Word has length 252 [2019-11-19 22:40:06,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:40:06,886 INFO L462 AbstractCegarLoop]: Abstraction has 4886 states and 6668 transitions. [2019-11-19 22:40:06,887 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:40:06,887 INFO L276 IsEmpty]: Start isEmpty. Operand 4886 states and 6668 transitions. [2019-11-19 22:40:06,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2019-11-19 22:40:06,897 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:40:06,897 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 8, 8, 7, 7, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:40:06,897 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:40:06,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:40:06,898 INFO L82 PathProgramCache]: Analyzing trace with hash -1551518133, now seen corresponding path program 1 times [2019-11-19 22:40:06,898 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:40:06,898 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042258455] [2019-11-19 22:40:06,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:40:06,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:40:07,051 INFO L134 CoverageAnalysis]: Checked inductivity of 1066 backedges. 627 proven. 0 refuted. 0 times theorem prover too weak. 439 trivial. 0 not checked. [2019-11-19 22:40:07,054 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042258455] [2019-11-19 22:40:07,055 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:40:07,055 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:40:07,055 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80524482] [2019-11-19 22:40:07,056 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:40:07,056 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:40:07,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:40:07,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:40:07,057 INFO L87 Difference]: Start difference. First operand 4886 states and 6668 transitions. Second operand 3 states. [2019-11-19 22:40:07,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:40:07,279 INFO L93 Difference]: Finished difference Result 10137 states and 13841 transitions. [2019-11-19 22:40:07,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:40:07,280 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 321 [2019-11-19 22:40:07,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:40:07,302 INFO L225 Difference]: With dead ends: 10137 [2019-11-19 22:40:07,303 INFO L226 Difference]: Without dead ends: 5258 [2019-11-19 22:40:07,309 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-19 22:40:07,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5258 states. [2019-11-19 22:40:07,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5258 to 5234. [2019-11-19 22:40:07,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5234 states. [2019-11-19 22:40:07,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5234 states to 5234 states and 7076 transitions. [2019-11-19 22:40:07,457 INFO L78 Accepts]: Start accepts. Automaton has 5234 states and 7076 transitions. Word has length 321 [2019-11-19 22:40:07,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:40:07,457 INFO L462 AbstractCegarLoop]: Abstraction has 5234 states and 7076 transitions. [2019-11-19 22:40:07,457 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:40:07,458 INFO L276 IsEmpty]: Start isEmpty. Operand 5234 states and 7076 transitions. [2019-11-19 22:40:07,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2019-11-19 22:40:07,469 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:40:07,469 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 9, 9, 8, 8, 7, 7, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:40:07,469 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:40:07,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:40:07,470 INFO L82 PathProgramCache]: Analyzing trace with hash -16053374, now seen corresponding path program 1 times [2019-11-19 22:40:07,470 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:40:07,470 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452595520] [2019-11-19 22:40:07,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:40:07,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:40:07,626 INFO L134 CoverageAnalysis]: Checked inductivity of 1301 backedges. 871 proven. 26 refuted. 0 times theorem prover too weak. 404 trivial. 0 not checked. [2019-11-19 22:40:07,626 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452595520] [2019-11-19 22:40:07,626 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1601018450] [2019-11-19 22:40:07,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e8523ade-d2fd-469b-8e4d-38d5e1a815bb/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-19 22:40:07,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:40:07,754 INFO L255 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-19 22:40:07,759 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:40:07,913 INFO L134 CoverageAnalysis]: Checked inductivity of 1301 backedges. 680 proven. 0 refuted. 0 times theorem prover too weak. 621 trivial. 0 not checked. [2019-11-19 22:40:07,913 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-19 22:40:07,914 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-19 22:40:07,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306253948] [2019-11-19 22:40:07,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:40:07,916 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:40:07,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:40:07,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-19 22:40:07,916 INFO L87 Difference]: Start difference. First operand 5234 states and 7076 transitions. Second operand 3 states. [2019-11-19 22:40:08,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:40:08,023 INFO L93 Difference]: Finished difference Result 6046 states and 8192 transitions. [2019-11-19 22:40:08,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:40:08,023 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 354 [2019-11-19 22:40:08,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:40:08,033 INFO L225 Difference]: With dead ends: 6046 [2019-11-19 22:40:08,034 INFO L226 Difference]: Without dead ends: 4563 [2019-11-19 22:40:08,037 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 354 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-19 22:40:08,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4563 states. [2019-11-19 22:40:08,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4563 to 3753. [2019-11-19 22:40:08,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3753 states. [2019-11-19 22:40:08,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3753 states to 3753 states and 5068 transitions. [2019-11-19 22:40:08,172 INFO L78 Accepts]: Start accepts. Automaton has 3753 states and 5068 transitions. Word has length 354 [2019-11-19 22:40:08,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:40:08,173 INFO L462 AbstractCegarLoop]: Abstraction has 3753 states and 5068 transitions. [2019-11-19 22:40:08,173 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:40:08,173 INFO L276 IsEmpty]: Start isEmpty. Operand 3753 states and 5068 transitions. [2019-11-19 22:40:08,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 417 [2019-11-19 22:40:08,187 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:40:08,188 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:40:08,392 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:40:08,392 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:40:08,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:40:08,393 INFO L82 PathProgramCache]: Analyzing trace with hash -235980636, now seen corresponding path program 1 times [2019-11-19 22:40:08,393 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:40:08,394 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018192952] [2019-11-19 22:40:08,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:40:08,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:40:08,649 INFO L134 CoverageAnalysis]: Checked inductivity of 2004 backedges. 1251 proven. 26 refuted. 0 times theorem prover too weak. 727 trivial. 0 not checked. [2019-11-19 22:40:08,650 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018192952] [2019-11-19 22:40:08,650 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1982338000] [2019-11-19 22:40:08,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e8523ade-d2fd-469b-8e4d-38d5e1a815bb/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-19 22:40:08,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:40:08,782 INFO L255 TraceCheckSpWp]: Trace formula consists of 647 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-19 22:40:08,786 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:40:08,895 INFO L134 CoverageAnalysis]: Checked inductivity of 2004 backedges. 1251 proven. 26 refuted. 0 times theorem prover too weak. 727 trivial. 0 not checked. [2019-11-19 22:40:08,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:40:08,896 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-19 22:40:08,897 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016630740] [2019-11-19 22:40:08,899 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 22:40:08,899 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:40:08,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 22:40:08,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 22:40:08,900 INFO L87 Difference]: Start difference. First operand 3753 states and 5068 transitions. Second operand 4 states. [2019-11-19 22:40:09,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:40:09,321 INFO L93 Difference]: Finished difference Result 8431 states and 11397 transitions. [2019-11-19 22:40:09,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-19 22:40:09,321 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 416 [2019-11-19 22:40:09,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:40:09,330 INFO L225 Difference]: With dead ends: 8431 [2019-11-19 22:40:09,330 INFO L226 Difference]: Without dead ends: 4516 [2019-11-19 22:40:09,335 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 421 GetRequests, 418 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-19 22:40:09,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4516 states. [2019-11-19 22:40:09,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4516 to 3782. [2019-11-19 22:40:09,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3782 states. [2019-11-19 22:40:09,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3782 states to 3782 states and 5040 transitions. [2019-11-19 22:40:09,448 INFO L78 Accepts]: Start accepts. Automaton has 3782 states and 5040 transitions. Word has length 416 [2019-11-19 22:40:09,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:40:09,448 INFO L462 AbstractCegarLoop]: Abstraction has 3782 states and 5040 transitions. [2019-11-19 22:40:09,448 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 22:40:09,449 INFO L276 IsEmpty]: Start isEmpty. Operand 3782 states and 5040 transitions. [2019-11-19 22:40:09,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 449 [2019-11-19 22:40:09,462 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:40:09,464 INFO L410 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 14, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 6, 6, 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, 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-19 22:40:09,668 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:40:09,669 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:40:09,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:40:09,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1952122078, now seen corresponding path program 1 times [2019-11-19 22:40:09,670 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:40:09,670 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001056050] [2019-11-19 22:40:09,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:40:09,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:40:09,890 INFO L134 CoverageAnalysis]: Checked inductivity of 2412 backedges. 1354 proven. 13 refuted. 0 times theorem prover too weak. 1045 trivial. 0 not checked. [2019-11-19 22:40:09,891 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001056050] [2019-11-19 22:40:09,891 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1404822692] [2019-11-19 22:40:09,891 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e8523ade-d2fd-469b-8e4d-38d5e1a815bb/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-19 22:40:10,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:40:10,022 INFO L255 TraceCheckSpWp]: Trace formula consists of 707 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-19 22:40:10,027 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:40:10,152 INFO L134 CoverageAnalysis]: Checked inductivity of 2412 backedges. 1354 proven. 13 refuted. 0 times theorem prover too weak. 1045 trivial. 0 not checked. [2019-11-19 22:40:10,154 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:40:10,155 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-19 22:40:10,155 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922795819] [2019-11-19 22:40:10,156 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 22:40:10,156 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:40:10,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 22:40:10,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 22:40:10,157 INFO L87 Difference]: Start difference. First operand 3782 states and 5040 transitions. Second operand 4 states. [2019-11-19 22:40:10,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:40:10,612 INFO L93 Difference]: Finished difference Result 11074 states and 14738 transitions. [2019-11-19 22:40:10,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-19 22:40:10,612 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 448 [2019-11-19 22:40:10,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:40:10,626 INFO L225 Difference]: With dead ends: 11074 [2019-11-19 22:40:10,626 INFO L226 Difference]: Without dead ends: 7488 [2019-11-19 22:40:10,633 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 453 GetRequests, 450 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-19 22:40:10,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7488 states. [2019-11-19 22:40:10,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7488 to 5198. [2019-11-19 22:40:10,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5198 states. [2019-11-19 22:40:10,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5198 states to 5198 states and 6920 transitions. [2019-11-19 22:40:10,798 INFO L78 Accepts]: Start accepts. Automaton has 5198 states and 6920 transitions. Word has length 448 [2019-11-19 22:40:10,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:40:10,799 INFO L462 AbstractCegarLoop]: Abstraction has 5198 states and 6920 transitions. [2019-11-19 22:40:10,799 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 22:40:10,799 INFO L276 IsEmpty]: Start isEmpty. Operand 5198 states and 6920 transitions. [2019-11-19 22:40:10,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 494 [2019-11-19 22:40:10,815 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:40:10,816 INFO L410 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 16, 16, 16, 14, 14, 12, 12, 10, 10, 8, 8, 8, 8, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2019-11-19 22:40:11,019 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:40:11,019 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:40:11,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:40:11,020 INFO L82 PathProgramCache]: Analyzing trace with hash -671064672, now seen corresponding path program 1 times [2019-11-19 22:40:11,024 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:40:11,024 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329485632] [2019-11-19 22:40:11,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:40:11,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:40:11,349 INFO L134 CoverageAnalysis]: Checked inductivity of 2900 backedges. 1662 proven. 0 refuted. 0 times theorem prover too weak. 1238 trivial. 0 not checked. [2019-11-19 22:40:11,350 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329485632] [2019-11-19 22:40:11,350 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:40:11,350 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:40:11,350 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341324464] [2019-11-19 22:40:11,351 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:40:11,351 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:40:11,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:40:11,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:40:11,353 INFO L87 Difference]: Start difference. First operand 5198 states and 6920 transitions. Second operand 3 states. [2019-11-19 22:40:11,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:40:11,567 INFO L93 Difference]: Finished difference Result 11001 states and 14577 transitions. [2019-11-19 22:40:11,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:40:11,568 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 493 [2019-11-19 22:40:11,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:40:11,578 INFO L225 Difference]: With dead ends: 11001 [2019-11-19 22:40:11,578 INFO L226 Difference]: Without dead ends: 5810 [2019-11-19 22:40:11,586 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-19 22:40:11,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5810 states. [2019-11-19 22:40:11,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5810 to 5776. [2019-11-19 22:40:11,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5776 states. [2019-11-19 22:40:11,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5776 states to 5776 states and 7583 transitions. [2019-11-19 22:40:11,736 INFO L78 Accepts]: Start accepts. Automaton has 5776 states and 7583 transitions. Word has length 493 [2019-11-19 22:40:11,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:40:11,736 INFO L462 AbstractCegarLoop]: Abstraction has 5776 states and 7583 transitions. [2019-11-19 22:40:11,736 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:40:11,736 INFO L276 IsEmpty]: Start isEmpty. Operand 5776 states and 7583 transitions. [2019-11-19 22:40:11,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 509 [2019-11-19 22:40:11,753 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:40:11,754 INFO L410 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 16, 16, 16, 14, 14, 12, 12, 10, 10, 8, 8, 8, 8, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:40:11,754 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:40:11,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:40:11,755 INFO L82 PathProgramCache]: Analyzing trace with hash 1196437202, now seen corresponding path program 1 times [2019-11-19 22:40:11,755 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:40:11,755 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390156974] [2019-11-19 22:40:11,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:40:11,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:40:11,975 INFO L134 CoverageAnalysis]: Checked inductivity of 3138 backedges. 1660 proven. 77 refuted. 0 times theorem prover too weak. 1401 trivial. 0 not checked. [2019-11-19 22:40:11,975 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390156974] [2019-11-19 22:40:11,975 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1427563949] [2019-11-19 22:40:11,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e8523ade-d2fd-469b-8e4d-38d5e1a815bb/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-19 22:40:12,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:40:12,127 INFO L255 TraceCheckSpWp]: Trace formula consists of 785 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-19 22:40:12,132 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:40:12,323 INFO L134 CoverageAnalysis]: Checked inductivity of 3138 backedges. 1671 proven. 0 refuted. 0 times theorem prover too weak. 1467 trivial. 0 not checked. [2019-11-19 22:40:12,324 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-19 22:40:12,324 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-19 22:40:12,324 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144354668] [2019-11-19 22:40:12,325 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:40:12,325 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:40:12,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:40:12,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-19 22:40:12,326 INFO L87 Difference]: Start difference. First operand 5776 states and 7583 transitions. Second operand 3 states. [2019-11-19 22:40:12,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:40:12,561 INFO L93 Difference]: Finished difference Result 11733 states and 15463 transitions. [2019-11-19 22:40:12,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:40:12,561 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 508 [2019-11-19 22:40:12,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:40:12,570 INFO L225 Difference]: With dead ends: 11733 [2019-11-19 22:40:12,571 INFO L226 Difference]: Without dead ends: 5964 [2019-11-19 22:40:12,577 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 511 GetRequests, 508 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-19 22:40:12,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5964 states. [2019-11-19 22:40:12,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5964 to 5864. [2019-11-19 22:40:12,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5864 states. [2019-11-19 22:40:12,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5864 states to 5864 states and 7707 transitions. [2019-11-19 22:40:12,713 INFO L78 Accepts]: Start accepts. Automaton has 5864 states and 7707 transitions. Word has length 508 [2019-11-19 22:40:12,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:40:12,714 INFO L462 AbstractCegarLoop]: Abstraction has 5864 states and 7707 transitions. [2019-11-19 22:40:12,714 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:40:12,714 INFO L276 IsEmpty]: Start isEmpty. Operand 5864 states and 7707 transitions. [2019-11-19 22:40:12,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 513 [2019-11-19 22:40:12,733 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:40:12,733 INFO L410 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 16, 14, 14, 12, 12, 10, 10, 8, 8, 8, 8, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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-19 22:40:12,937 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:40:12,937 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:40:12,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:40:12,938 INFO L82 PathProgramCache]: Analyzing trace with hash -1496383928, now seen corresponding path program 1 times [2019-11-19 22:40:12,938 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:40:12,938 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445731483] [2019-11-19 22:40:12,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:40:12,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:40:13,806 INFO L134 CoverageAnalysis]: Checked inductivity of 3204 backedges. 1744 proven. 206 refuted. 0 times theorem prover too weak. 1254 trivial. 0 not checked. [2019-11-19 22:40:13,806 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445731483] [2019-11-19 22:40:13,807 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [215730105] [2019-11-19 22:40:13,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e8523ade-d2fd-469b-8e4d-38d5e1a815bb/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-19 22:40:14,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:40:14,016 INFO L255 TraceCheckSpWp]: Trace formula consists of 789 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-19 22:40:14,022 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:40:14,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:40:14,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:40:14,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:40:14,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:40:15,063 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((ULTIMATE.start_ssl3_accept_~ag_Y~0 Int) (ULTIMATE.start_ssl3_accept_~ag_X~0 Int)) (let ((.cse0 (mod (+ (* ULTIMATE.start_ssl3_accept_~ag_Y~0 2) (* ULTIMATE.start_ssl3_accept_~ag_X~0 2)) 4294967296))) (and (<= c_ULTIMATE.start_ssl3_accept_~s__state~0 .cse0) (<= .cse0 2147483647) (< 2147483647 .cse0)))) (exists ((ULTIMATE.start_ssl3_accept_~ag_Y~0 Int) (ULTIMATE.start_ssl3_accept_~ag_X~0 Int)) (let ((.cse1 (mod (+ (* ULTIMATE.start_ssl3_accept_~ag_Y~0 2) (* ULTIMATE.start_ssl3_accept_~ag_X~0 2)) 4294967296))) (and (<= c_ULTIMATE.start_ssl3_accept_~s__state~0 .cse1) (<= .cse1 2147483647) (<= .cse1 8496)))) (exists ((ULTIMATE.start_ssl3_accept_~ag_Y~0 Int) (ULTIMATE.start_ssl3_accept_~ag_X~0 Int)) (let ((.cse2 (mod (+ (* ULTIMATE.start_ssl3_accept_~ag_Y~0 2) (* ULTIMATE.start_ssl3_accept_~ag_X~0 2)) 4294967296))) (and (<= (+ c_ULTIMATE.start_ssl3_accept_~s__state~0 4294967296) .cse2) (< 2147483647 .cse2)))) (exists ((ULTIMATE.start_ssl3_accept_~ag_Y~0 Int) (ULTIMATE.start_ssl3_accept_~ag_X~0 Int)) (let ((.cse3 (mod (+ (* ULTIMATE.start_ssl3_accept_~ag_Y~0 2) (* ULTIMATE.start_ssl3_accept_~ag_X~0 2)) 4294967296))) (and (<= (+ c_ULTIMATE.start_ssl3_accept_~s__state~0 4294967296) .cse3) (< 2147483647 .cse3) (<= .cse3 8496))))) is different from true [2019-11-19 22:40:17,156 WARN L191 SmtUtils]: Spent 1.65 s on a formula simplification. DAG size of input: 50 DAG size of output: 16 [2019-11-19 22:40:17,832 INFO L134 CoverageAnalysis]: Checked inductivity of 3204 backedges. 1792 proven. 232 refuted. 0 times theorem prover too weak. 1173 trivial. 7 not checked. [2019-11-19 22:40:17,832 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:40:17,832 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 9 [2019-11-19 22:40:17,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565740830] [2019-11-19 22:40:17,835 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-19 22:40:17,835 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:40:17,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-19 22:40:17,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=41, Unknown=1, NotChecked=12, Total=72 [2019-11-19 22:40:17,836 INFO L87 Difference]: Start difference. First operand 5864 states and 7707 transitions. Second operand 9 states. [2019-11-19 22:40:34,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:40:34,692 INFO L93 Difference]: Finished difference Result 24395 states and 31719 transitions. [2019-11-19 22:40:34,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-19 22:40:34,693 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 512 [2019-11-19 22:40:34,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:40:34,773 INFO L225 Difference]: With dead ends: 24395 [2019-11-19 22:40:34,776 INFO L226 Difference]: Without dead ends: 17838 [2019-11-19 22:40:34,785 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 531 GetRequests, 515 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=68, Invalid=145, Unknown=1, NotChecked=26, Total=240 [2019-11-19 22:40:34,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17838 states. [2019-11-19 22:40:35,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17838 to 16029. [2019-11-19 22:40:35,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16029 states. [2019-11-19 22:40:35,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16029 states to 16029 states and 20135 transitions. [2019-11-19 22:40:35,187 INFO L78 Accepts]: Start accepts. Automaton has 16029 states and 20135 transitions. Word has length 512 [2019-11-19 22:40:35,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:40:35,187 INFO L462 AbstractCegarLoop]: Abstraction has 16029 states and 20135 transitions. [2019-11-19 22:40:35,188 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-19 22:40:35,188 INFO L276 IsEmpty]: Start isEmpty. Operand 16029 states and 20135 transitions. [2019-11-19 22:40:35,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 525 [2019-11-19 22:40:35,219 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:40:35,220 INFO L410 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 17, 15, 15, 13, 13, 11, 11, 9, 9, 9, 9, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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, 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] [2019-11-19 22:40:35,426 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:40:35,426 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:40:35,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:40:35,427 INFO L82 PathProgramCache]: Analyzing trace with hash 76731436, now seen corresponding path program 1 times [2019-11-19 22:40:35,427 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:40:35,427 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376629113] [2019-11-19 22:40:35,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:40:35,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:40:35,630 INFO L134 CoverageAnalysis]: Checked inductivity of 3360 backedges. 354 proven. 0 refuted. 0 times theorem prover too weak. 3006 trivial. 0 not checked. [2019-11-19 22:40:35,630 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376629113] [2019-11-19 22:40:35,631 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:40:35,631 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 22:40:35,631 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332810965] [2019-11-19 22:40:35,632 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:40:35,632 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:40:35,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:40:35,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:40:35,633 INFO L87 Difference]: Start difference. First operand 16029 states and 20135 transitions. Second operand 3 states. [2019-11-19 22:40:36,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:40:36,058 INFO L93 Difference]: Finished difference Result 33490 states and 41898 transitions. [2019-11-19 22:40:36,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:40:36,058 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 524 [2019-11-19 22:40:36,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:40:36,083 INFO L225 Difference]: With dead ends: 33490 [2019-11-19 22:40:36,083 INFO L226 Difference]: Without dead ends: 15881 [2019-11-19 22:40:36,101 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:40:36,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15881 states. [2019-11-19 22:40:36,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15881 to 15136. [2019-11-19 22:40:36,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15136 states. [2019-11-19 22:40:36,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15136 states to 15136 states and 18911 transitions. [2019-11-19 22:40:36,464 INFO L78 Accepts]: Start accepts. Automaton has 15136 states and 18911 transitions. Word has length 524 [2019-11-19 22:40:36,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:40:36,464 INFO L462 AbstractCegarLoop]: Abstraction has 15136 states and 18911 transitions. [2019-11-19 22:40:36,464 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:40:36,464 INFO L276 IsEmpty]: Start isEmpty. Operand 15136 states and 18911 transitions. [2019-11-19 22:40:36,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 537 [2019-11-19 22:40:36,480 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:40:36,480 INFO L410 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 20, 20, 20, 19, 19, 19, 19, 19, 19, 19, 17, 15, 15, 13, 13, 11, 11, 9, 9, 9, 9, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:40:36,480 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:40:36,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:40:36,481 INFO L82 PathProgramCache]: Analyzing trace with hash -1215376266, now seen corresponding path program 1 times [2019-11-19 22:40:36,481 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:40:36,481 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331229245] [2019-11-19 22:40:36,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:40:36,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:40:36,938 INFO L134 CoverageAnalysis]: Checked inductivity of 3548 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 3396 trivial. 0 not checked. [2019-11-19 22:40:36,939 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331229245] [2019-11-19 22:40:36,939 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:40:36,939 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 22:40:36,939 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008750327] [2019-11-19 22:40:36,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:40:36,940 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:40:36,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:40:36,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:40:36,941 INFO L87 Difference]: Start difference. First operand 15136 states and 18911 transitions. Second operand 3 states. [2019-11-19 22:40:37,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:40:37,324 INFO L93 Difference]: Finished difference Result 29994 states and 37432 transitions. [2019-11-19 22:40:37,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:40:37,324 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 536 [2019-11-19 22:40:37,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:40:37,347 INFO L225 Difference]: With dead ends: 29994 [2019-11-19 22:40:37,347 INFO L226 Difference]: Without dead ends: 15184 [2019-11-19 22:40:37,356 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:40:37,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15184 states. [2019-11-19 22:40:37,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15184 to 15136. [2019-11-19 22:40:37,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15136 states. [2019-11-19 22:40:37,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15136 states to 15136 states and 18868 transitions. [2019-11-19 22:40:37,724 INFO L78 Accepts]: Start accepts. Automaton has 15136 states and 18868 transitions. Word has length 536 [2019-11-19 22:40:37,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:40:37,724 INFO L462 AbstractCegarLoop]: Abstraction has 15136 states and 18868 transitions. [2019-11-19 22:40:37,724 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:40:37,724 INFO L276 IsEmpty]: Start isEmpty. Operand 15136 states and 18868 transitions. [2019-11-19 22:40:37,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 538 [2019-11-19 22:40:37,739 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:40:37,740 INFO L410 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 19, 19, 19, 19, 19, 19, 17, 15, 15, 13, 13, 11, 11, 9, 9, 9, 9, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:40:37,740 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:40:37,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:40:37,740 INFO L82 PathProgramCache]: Analyzing trace with hash -943603990, now seen corresponding path program 1 times [2019-11-19 22:40:37,741 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:40:37,741 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470176733] [2019-11-19 22:40:37,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:40:37,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:40:37,933 INFO L134 CoverageAnalysis]: Checked inductivity of 3567 backedges. 171 proven. 0 refuted. 0 times theorem prover too weak. 3396 trivial. 0 not checked. [2019-11-19 22:40:37,933 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470176733] [2019-11-19 22:40:37,933 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:40:37,934 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 22:40:37,934 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471097822] [2019-11-19 22:40:37,934 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:40:37,934 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:40:37,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:40:37,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:40:37,935 INFO L87 Difference]: Start difference. First operand 15136 states and 18868 transitions. Second operand 3 states. [2019-11-19 22:40:38,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:40:38,304 INFO L93 Difference]: Finished difference Result 29994 states and 37349 transitions. [2019-11-19 22:40:38,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:40:38,304 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 537 [2019-11-19 22:40:38,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:40:38,328 INFO L225 Difference]: With dead ends: 29994 [2019-11-19 22:40:38,328 INFO L226 Difference]: Without dead ends: 15184 [2019-11-19 22:40:38,337 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:40:38,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15184 states. [2019-11-19 22:40:38,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15184 to 15136. [2019-11-19 22:40:38,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15136 states. [2019-11-19 22:40:38,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15136 states to 15136 states and 18825 transitions. [2019-11-19 22:40:38,696 INFO L78 Accepts]: Start accepts. Automaton has 15136 states and 18825 transitions. Word has length 537 [2019-11-19 22:40:38,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:40:38,696 INFO L462 AbstractCegarLoop]: Abstraction has 15136 states and 18825 transitions. [2019-11-19 22:40:38,696 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:40:38,696 INFO L276 IsEmpty]: Start isEmpty. Operand 15136 states and 18825 transitions. [2019-11-19 22:40:38,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 581 [2019-11-19 22:40:38,711 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:40:38,712 INFO L410 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 19, 19, 19, 19, 19, 17, 17, 15, 15, 13, 13, 11, 11, 11, 11, 8, 6, 6, 4, 4, 4, 4, 4, 4, 3, 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, 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] [2019-11-19 22:40:38,712 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:40:38,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:40:38,713 INFO L82 PathProgramCache]: Analyzing trace with hash 780560607, now seen corresponding path program 1 times [2019-11-19 22:40:38,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:40:38,715 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667034156] [2019-11-19 22:40:38,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:40:38,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:40:39,098 INFO L134 CoverageAnalysis]: Checked inductivity of 3937 backedges. 2204 proven. 0 refuted. 0 times theorem prover too weak. 1733 trivial. 0 not checked. [2019-11-19 22:40:39,099 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667034156] [2019-11-19 22:40:39,099 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:40:39,099 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:40:39,100 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970084607] [2019-11-19 22:40:39,100 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:40:39,100 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:40:39,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:40:39,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:40:39,101 INFO L87 Difference]: Start difference. First operand 15136 states and 18825 transitions. Second operand 3 states. [2019-11-19 22:40:39,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:40:39,414 INFO L93 Difference]: Finished difference Result 30231 states and 37579 transitions. [2019-11-19 22:40:39,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:40:39,415 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 580 [2019-11-19 22:40:39,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:40:39,433 INFO L225 Difference]: With dead ends: 30231 [2019-11-19 22:40:39,434 INFO L226 Difference]: Without dead ends: 15114 [2019-11-19 22:40:39,443 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-19 22:40:39,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15114 states. [2019-11-19 22:40:39,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15114 to 13798. [2019-11-19 22:40:39,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13798 states. [2019-11-19 22:40:39,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13798 states to 13798 states and 17082 transitions. [2019-11-19 22:40:39,752 INFO L78 Accepts]: Start accepts. Automaton has 13798 states and 17082 transitions. Word has length 580 [2019-11-19 22:40:39,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:40:39,753 INFO L462 AbstractCegarLoop]: Abstraction has 13798 states and 17082 transitions. [2019-11-19 22:40:39,753 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:40:39,753 INFO L276 IsEmpty]: Start isEmpty. Operand 13798 states and 17082 transitions. [2019-11-19 22:40:39,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 583 [2019-11-19 22:40:39,768 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:40:39,768 INFO L410 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 20, 20, 20, 20, 18, 16, 16, 14, 14, 12, 12, 10, 10, 10, 10, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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, 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] [2019-11-19 22:40:39,769 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:40:39,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:40:39,769 INFO L82 PathProgramCache]: Analyzing trace with hash -1763345373, now seen corresponding path program 2 times [2019-11-19 22:40:39,769 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:40:39,769 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189082653] [2019-11-19 22:40:39,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:40:39,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:40:40,010 INFO L134 CoverageAnalysis]: Checked inductivity of 4078 backedges. 1321 proven. 16 refuted. 0 times theorem prover too weak. 2741 trivial. 0 not checked. [2019-11-19 22:40:40,010 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189082653] [2019-11-19 22:40:40,010 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [233874712] [2019-11-19 22:40:40,010 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e8523ade-d2fd-469b-8e4d-38d5e1a815bb/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-19 22:40:40,146 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-19 22:40:40,146 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 22:40:40,148 INFO L255 TraceCheckSpWp]: Trace formula consists of 875 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-19 22:40:40,154 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:40:40,536 INFO L134 CoverageAnalysis]: Checked inductivity of 4078 backedges. 1321 proven. 16 refuted. 0 times theorem prover too weak. 2741 trivial. 0 not checked. [2019-11-19 22:40:40,536 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:40:40,536 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-19 22:40:40,536 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883391782] [2019-11-19 22:40:40,538 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 22:40:40,538 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:40:40,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 22:40:40,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 22:40:40,539 INFO L87 Difference]: Start difference. First operand 13798 states and 17082 transitions. Second operand 4 states. [2019-11-19 22:40:40,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:40:40,750 INFO L93 Difference]: Finished difference Result 19952 states and 24719 transitions. [2019-11-19 22:40:40,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 22:40:40,751 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 582 [2019-11-19 22:40:40,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:40:40,751 INFO L225 Difference]: With dead ends: 19952 [2019-11-19 22:40:40,751 INFO L226 Difference]: Without dead ends: 0 [2019-11-19 22:40:40,758 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 587 GetRequests, 584 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-19 22:40:40,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-19 22:40:40,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-19 22:40:40,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-19 22:40:40,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-19 22:40:40,759 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 582 [2019-11-19 22:40:40,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:40:40,760 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-19 22:40:40,760 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 22:40:40,760 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-19 22:40:40,760 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-19 22:40:40,963 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:40:40,967 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-19 22:40:43,584 WARN L191 SmtUtils]: Spent 2.53 s on a formula simplification. DAG size of input: 809 DAG size of output: 455 [2019-11-19 22:40:45,615 WARN L191 SmtUtils]: Spent 1.43 s on a formula simplification. DAG size of input: 810 DAG size of output: 456 [2019-11-19 22:40:45,947 WARN L191 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 43 [2019-11-19 22:40:56,682 WARN L191 SmtUtils]: Spent 10.73 s on a formula simplification. DAG size of input: 372 DAG size of output: 119 [2019-11-19 22:41:05,061 WARN L191 SmtUtils]: Spent 8.37 s on a formula simplification. DAG size of input: 137 DAG size of output: 62 [2019-11-19 22:41:07,999 WARN L191 SmtUtils]: Spent 2.94 s on a formula simplification. DAG size of input: 114 DAG size of output: 42 [2019-11-19 22:41:08,438 WARN L191 SmtUtils]: Spent 438.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 44 [2019-11-19 22:41:08,676 WARN L191 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 37 [2019-11-19 22:41:08,876 WARN L191 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 36 [2019-11-19 22:41:09,064 WARN L191 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 33 [2019-11-19 22:41:09,264 WARN L191 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 36 [2019-11-19 22:41:09,586 WARN L191 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 38 [2019-11-19 22:41:14,715 WARN L191 SmtUtils]: Spent 5.13 s on a formula simplification. DAG size of input: 120 DAG size of output: 54 [2019-11-19 22:41:14,994 WARN L191 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 38 [2019-11-19 22:41:15,193 WARN L191 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 37 [2019-11-19 22:41:15,453 WARN L191 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 37 [2019-11-19 22:41:15,737 WARN L191 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 39 [2019-11-19 22:41:16,087 WARN L191 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 37 [2019-11-19 22:41:16,288 WARN L191 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 41 [2019-11-19 22:41:16,510 WARN L191 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 53 [2019-11-19 22:41:23,748 WARN L191 SmtUtils]: Spent 7.24 s on a formula simplification. DAG size of input: 373 DAG size of output: 116 [2019-11-19 22:41:24,005 WARN L191 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 39 [2019-11-19 22:41:24,010 INFO L444 ceAbstractionStarter]: For program point L663(lines 663 667) no Hoare annotation was computed. [2019-11-19 22:41:24,010 INFO L444 ceAbstractionStarter]: For program point L630(lines 630 639) no Hoare annotation was computed. [2019-11-19 22:41:24,010 INFO L444 ceAbstractionStarter]: For program point L663-2(lines 663 667) no Hoare annotation was computed. [2019-11-19 22:41:24,010 INFO L444 ceAbstractionStarter]: For program point L630-2(lines 629 651) no Hoare annotation was computed. [2019-11-19 22:41:24,010 INFO L444 ceAbstractionStarter]: For program point L465(lines 465 469) no Hoare annotation was computed. [2019-11-19 22:41:24,010 INFO L444 ceAbstractionStarter]: For program point L333-1(lines 333 342) no Hoare annotation was computed. [2019-11-19 22:41:24,010 INFO L440 ceAbstractionStarter]: At program point L168(lines 167 606) the Hoare annotation is: (let ((.cse5 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (let ((.cse3 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 1)) (.cse6 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3)) (.cse7 (not .cse5)) (.cse8 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse4 (let ((.cse9 (mod (+ (* ULTIMATE.start_ssl3_accept_~ag_Y~0 2) (* ULTIMATE.start_ssl3_accept_~ag_X~0 2)) 4294967296))) (or (< 2147483647 .cse9) (<= .cse9 8496))))) (or (and .cse0 .cse1 .cse2 (<= 8576 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0)) (and (and .cse3 .cse2 .cse4 .cse5) .cse6) (and (<= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0) .cse3 .cse2 .cse7) (and .cse2 .cse0 .cse4) (and .cse0 .cse6 .cse2) (and .cse8 .cse2 .cse7) (and .cse8 .cse1 .cse2 .cse4)))) [2019-11-19 22:41:24,011 INFO L440 ceAbstractionStarter]: At program point L135(lines 128 619) the Hoare annotation is: (let ((.cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse3 (exists ((v_prenex_2 Int) (v_prenex_1 Int)) (let ((.cse7 (mod (+ (* v_prenex_1 2) (* v_prenex_2 2)) 4294967296))) (and (<= .cse7 8496) (<= ULTIMATE.start_ssl3_accept_~s__state~0 .cse7) (<= .cse7 2147483647))))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and .cse0 .cse1 (and .cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse3 .cse4 (let ((.cse5 (mod (+ (* ULTIMATE.start_ssl3_accept_~ag_Y~0 2) (* ULTIMATE.start_ssl3_accept_~ag_X~0 2)) 4294967296))) (or (< 2147483647 .cse5) (<= .cse5 8496)))) .cse6) (and .cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) .cse4 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (and .cse4 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 1)) .cse0 .cse1 .cse3 .cse6))) [2019-11-19 22:41:24,011 INFO L444 ceAbstractionStarter]: For program point L102(line 102) no Hoare annotation was computed. [2019-11-19 22:41:24,011 INFO L444 ceAbstractionStarter]: For program point L632(lines 632 636) no Hoare annotation was computed. [2019-11-19 22:41:24,011 INFO L444 ceAbstractionStarter]: For program point L203(lines 203 594) no Hoare annotation was computed. [2019-11-19 22:41:24,011 INFO L444 ceAbstractionStarter]: For program point L170(lines 170 605) no Hoare annotation was computed. [2019-11-19 22:41:24,011 INFO L444 ceAbstractionStarter]: For program point L137(lines 137 616) no Hoare annotation was computed. [2019-11-19 22:41:24,011 INFO L444 ceAbstractionStarter]: For program point L104(lines 104 627) no Hoare annotation was computed. [2019-11-19 22:41:24,011 INFO L440 ceAbstractionStarter]: At program point L204(lines 200 595) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse1 (<= 8656 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and .cse0 .cse1 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse1) (and (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse0 .cse1) (let ((.cse2 (mod (+ (* ULTIMATE.start_ssl3_accept_~ag_Y~0 2) (* ULTIMATE.start_ssl3_accept_~ag_X~0 2)) 4294967296))) (or (< 2147483647 .cse2) (<= .cse2 8496)))))) [2019-11-19 22:41:24,011 INFO L440 ceAbstractionStarter]: At program point L105(lines 104 627) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) [2019-11-19 22:41:24,011 INFO L444 ceAbstractionStarter]: For program point L337(lines 337 341) no Hoare annotation was computed. [2019-11-19 22:41:24,012 INFO L444 ceAbstractionStarter]: For program point L470(lines 470 481) no Hoare annotation was computed. [2019-11-19 22:41:24,012 INFO L444 ceAbstractionStarter]: For program point L437(lines 437 441) no Hoare annotation was computed. [2019-11-19 22:41:24,012 INFO L440 ceAbstractionStarter]: At program point L371(lines 354 389) the Hoare annotation is: (let ((.cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse0 (<= 8512 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse1) (and .cse2 .cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and .cse2 .cse0 .cse1 (let ((.cse3 (mod (+ (* ULTIMATE.start_ssl3_accept_~ag_Y~0 2) (* ULTIMATE.start_ssl3_accept_~ag_X~0 2)) 4294967296))) (or (< 2147483647 .cse3) (<= .cse3 8496)))))) [2019-11-19 22:41:24,012 INFO L444 ceAbstractionStarter]: For program point L239(lines 239 244) no Hoare annotation was computed. [2019-11-19 22:41:24,012 INFO L444 ceAbstractionStarter]: For program point L206(lines 206 593) no Hoare annotation was computed. [2019-11-19 22:41:24,012 INFO L444 ceAbstractionStarter]: For program point L173(lines 173 604) no Hoare annotation was computed. [2019-11-19 22:41:24,012 INFO L444 ceAbstractionStarter]: For program point L140(lines 140 615) no Hoare annotation was computed. [2019-11-19 22:41:24,012 INFO L444 ceAbstractionStarter]: For program point L107(lines 107 626) no Hoare annotation was computed. [2019-11-19 22:41:24,012 INFO L440 ceAbstractionStarter]: At program point L405(lines 396 427) the Hoare annotation is: (let ((.cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse0 (<= 8512 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and .cse0 .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (and .cse0 .cse1 .cse2) (let ((.cse3 (mod (+ (* ULTIMATE.start_ssl3_accept_~ag_Y~0 2) (* ULTIMATE.start_ssl3_accept_~ag_X~0 2)) 4294967296))) (or (< 2147483647 .cse3) (<= .cse3 8496)))) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse2))) [2019-11-19 22:41:24,012 INFO L440 ceAbstractionStarter]: At program point L207(lines 206 593) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) [2019-11-19 22:41:24,013 INFO L440 ceAbstractionStarter]: At program point L174(lines 170 605) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse3 (<= 8576 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)))) (or (and .cse0 (<= 8512 ULTIMATE.start_ssl3_accept_~s__state~0) .cse1 .cse2 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and .cse3 (and .cse1 .cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 1))) (and .cse0 .cse2 .cse3 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse1 (let ((.cse4 (mod (+ (* ULTIMATE.start_ssl3_accept_~ag_Y~0 2) (* ULTIMATE.start_ssl3_accept_~ag_X~0 2)) 4294967296))) (or (< 2147483647 .cse4) (<= .cse4 8496)))))) [2019-11-19 22:41:24,013 INFO L440 ceAbstractionStarter]: At program point L141(lines 137 616) the Hoare annotation is: (let ((.cse8 (mod (+ (* ULTIMATE.start_ssl3_accept_~ag_Y~0 2) (* ULTIMATE.start_ssl3_accept_~ag_X~0 2)) 4294967296))) (let ((.cse7 (< 2147483647 .cse8))) (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse1 (<= 8466 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse2 (or (<= .cse8 ULTIMATE.start_ssl3_accept_~s__state~0) (and (<= .cse8 (+ ULTIMATE.start_ssl3_accept_~s__state~0 4294967296)) .cse7))) (.cse6 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse3 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse4 (or .cse7 (<= .cse8 8496)))) (or (and .cse0 (and .cse1 .cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse3 .cse4) .cse5) (and .cse6 (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and .cse0 .cse5 (and .cse1 .cse2 (and .cse6 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse3) .cse4)))))) [2019-11-19 22:41:24,013 INFO L444 ceAbstractionStarter]: For program point L75(lines 75 83) no Hoare annotation was computed. [2019-11-19 22:41:24,013 INFO L444 ceAbstractionStarter]: For program point L373(lines 373 377) no Hoare annotation was computed. [2019-11-19 22:41:24,013 INFO L444 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2019-11-19 22:41:24,013 INFO L444 ceAbstractionStarter]: For program point L176(lines 176 603) no Hoare annotation was computed. [2019-11-19 22:41:24,013 INFO L444 ceAbstractionStarter]: For program point L143(lines 143 614) no Hoare annotation was computed. [2019-11-19 22:41:24,013 INFO L444 ceAbstractionStarter]: For program point L110(lines 110 625) no Hoare annotation was computed. [2019-11-19 22:41:24,013 INFO L444 ceAbstractionStarter]: For program point L573(lines 573 583) no Hoare annotation was computed. [2019-11-19 22:41:24,014 INFO L444 ceAbstractionStarter]: For program point L573-1(lines 573 583) no Hoare annotation was computed. [2019-11-19 22:41:24,014 INFO L444 ceAbstractionStarter]: For program point L474(lines 474 478) no Hoare annotation was computed. [2019-11-19 22:41:24,014 INFO L444 ceAbstractionStarter]: For program point L276(lines 276 280) no Hoare annotation was computed. [2019-11-19 22:41:24,014 INFO L440 ceAbstractionStarter]: At program point L210(lines 209 592) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) [2019-11-19 22:41:24,014 INFO L444 ceAbstractionStarter]: For program point L78(lines 78 82) no Hoare annotation was computed. [2019-11-19 22:41:24,014 INFO L444 ceAbstractionStarter]: For program point L78-2(lines 75 83) no Hoare annotation was computed. [2019-11-19 22:41:24,014 INFO L444 ceAbstractionStarter]: For program point L508(lines 508 512) no Hoare annotation was computed. [2019-11-19 22:41:24,014 INFO L444 ceAbstractionStarter]: For program point L310(lines 310 318) no Hoare annotation was computed. [2019-11-19 22:41:24,014 INFO L447 ceAbstractionStarter]: At program point L674(lines 66 676) the Hoare annotation is: true [2019-11-19 22:41:24,014 INFO L444 ceAbstractionStarter]: For program point L641(lines 641 647) no Hoare annotation was computed. [2019-11-19 22:41:24,014 INFO L444 ceAbstractionStarter]: For program point L542(lines 542 547) no Hoare annotation was computed. [2019-11-19 22:41:24,014 INFO L444 ceAbstractionStarter]: For program point L179(lines 179 602) no Hoare annotation was computed. [2019-11-19 22:41:24,015 INFO L444 ceAbstractionStarter]: For program point L146(lines 146 613) no Hoare annotation was computed. [2019-11-19 22:41:24,015 INFO L444 ceAbstractionStarter]: For program point L113(lines 113 624) no Hoare annotation was computed. [2019-11-19 22:41:24,015 INFO L447 ceAbstractionStarter]: At program point L675(lines 9 677) the Hoare annotation is: true [2019-11-19 22:41:24,015 INFO L444 ceAbstractionStarter]: For program point L576(lines 576 580) no Hoare annotation was computed. [2019-11-19 22:41:24,015 INFO L440 ceAbstractionStarter]: At program point L180(lines 176 603) 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 8672))) (.cse3 (<= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and .cse0 (<= 8512 ULTIMATE.start_ssl3_accept_~s__state~0) .cse1 .cse2 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and .cse0 .cse3 .cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse1 (let ((.cse4 (mod (+ (* ULTIMATE.start_ssl3_accept_~ag_Y~0 2) (* ULTIMATE.start_ssl3_accept_~ag_X~0 2)) 4294967296))) (or (< 2147483647 .cse4) (<= .cse4 8496)))) (and (and .cse1 .cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 1)) .cse3))) [2019-11-19 22:41:24,015 INFO L440 ceAbstractionStarter]: At program point L147(lines 143 614) the Hoare annotation is: (let ((.cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse0 (<= 8512 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse1) (and .cse2 .cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (and .cse2 .cse0 .cse1) (let ((.cse3 (mod (+ (* ULTIMATE.start_ssl3_accept_~ag_Y~0 2) (* ULTIMATE.start_ssl3_accept_~ag_X~0 2)) 4294967296))) (or (< 2147483647 .cse3) (<= .cse3 8496)))))) [2019-11-19 22:41:24,015 INFO L444 ceAbstractionStarter]: For program point L313(lines 313 317) no Hoare annotation was computed. [2019-11-19 22:41:24,015 INFO L444 ceAbstractionStarter]: For program point L313-2(lines 211 589) no Hoare annotation was computed. [2019-11-19 22:41:24,015 INFO L440 ceAbstractionStarter]: At program point L214(lines 107 626) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) [2019-11-19 22:41:24,016 INFO L444 ceAbstractionStarter]: For program point L182(lines 182 601) no Hoare annotation was computed. [2019-11-19 22:41:24,016 INFO L444 ceAbstractionStarter]: For program point L149(lines 149 612) no Hoare annotation was computed. [2019-11-19 22:41:24,016 INFO L444 ceAbstractionStarter]: For program point L116(lines 116 623) no Hoare annotation was computed. [2019-11-19 22:41:24,016 INFO L444 ceAbstractionStarter]: For program point L513(lines 513 517) no Hoare annotation was computed. [2019-11-19 22:41:24,016 INFO L444 ceAbstractionStarter]: For program point L513-2(lines 513 517) no Hoare annotation was computed. [2019-11-19 22:41:24,016 INFO L444 ceAbstractionStarter]: For program point L447-1(lines 447 459) no Hoare annotation was computed. [2019-11-19 22:41:24,016 INFO L440 ceAbstractionStarter]: At program point L415(lines 406 426) the Hoare annotation is: (let ((.cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse0 (<= 8512 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and .cse0 .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (and .cse0 .cse1 .cse2) (let ((.cse3 (mod (+ (* ULTIMATE.start_ssl3_accept_~ag_Y~0 2) (* ULTIMATE.start_ssl3_accept_~ag_X~0 2)) 4294967296))) (or (< 2147483647 .cse3) (<= .cse3 8496)))) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse2))) [2019-11-19 22:41:24,016 INFO L444 ceAbstractionStarter]: For program point L349(lines 349 353) no Hoare annotation was computed. [2019-11-19 22:41:24,016 INFO L444 ceAbstractionStarter]: For program point L349-2(lines 211 589) no Hoare annotation was computed. [2019-11-19 22:41:24,016 INFO L444 ceAbstractionStarter]: For program point L85(lines 85 93) no Hoare annotation was computed. [2019-11-19 22:41:24,016 INFO L444 ceAbstractionStarter]: For program point L85-1(lines 66 676) no Hoare annotation was computed. [2019-11-19 22:41:24,016 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-19 22:41:24,017 INFO L444 ceAbstractionStarter]: For program point L185(lines 185 600) no Hoare annotation was computed. [2019-11-19 22:41:24,017 INFO L444 ceAbstractionStarter]: For program point L152(lines 152 611) no Hoare annotation was computed. [2019-11-19 22:41:24,017 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 622) no Hoare annotation was computed. [2019-11-19 22:41:24,017 INFO L444 ceAbstractionStarter]: For program point L86(lines 86 90) no Hoare annotation was computed. [2019-11-19 22:41:24,017 INFO L444 ceAbstractionStarter]: For program point L450(lines 450 455) no Hoare annotation was computed. [2019-11-19 22:41:24,017 INFO L444 ceAbstractionStarter]: For program point L219(lines 219 223) no Hoare annotation was computed. [2019-11-19 22:41:24,017 INFO L440 ceAbstractionStarter]: At program point L186(lines 182 601) the Hoare annotation is: (let ((.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)))) (let ((.cse0 (and (<= 8576 ULTIMATE.start_ssl3_accept_~s__state~0) (and .cse3 .cse4 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 1)))) (.cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse5 (= 8608 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (let ((.cse6 (mod (+ (* ULTIMATE.start_ssl3_accept_~ag_Y~0 2) (* ULTIMATE.start_ssl3_accept_~ag_X~0 2)) 4294967296))) (or (< 2147483647 .cse6) (<= .cse6 8496))))) (or (and .cse0 .cse1) (and .cse2 (<= 8512 ULTIMATE.start_ssl3_accept_~s__state~0) .cse3 .cse4 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and .cse0 .cse5) (and .cse2 .cse5 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse1)))) [2019-11-19 22:41:24,017 INFO L440 ceAbstractionStarter]: At program point L153(lines 149 612) the Hoare annotation is: (let ((.cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse0 (<= 8512 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse1) (and .cse2 .cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and .cse2 .cse0 .cse1 (let ((.cse3 (mod (+ (* ULTIMATE.start_ssl3_accept_~ag_Y~0 2) (* ULTIMATE.start_ssl3_accept_~ag_X~0 2)) 4294967296))) (or (< 2147483647 .cse3) (<= .cse3 8496)))))) [2019-11-19 22:41:24,017 INFO L444 ceAbstractionStarter]: For program point L219-2(lines 211 589) no Hoare annotation was computed. [2019-11-19 22:41:24,017 INFO L444 ceAbstractionStarter]: For program point L418(lines 418 422) no Hoare annotation was computed. [2019-11-19 22:41:24,018 INFO L444 ceAbstractionStarter]: For program point L188(lines 188 599) no Hoare annotation was computed. [2019-11-19 22:41:24,020 INFO L444 ceAbstractionStarter]: For program point L155(lines 155 610) no Hoare annotation was computed. [2019-11-19 22:41:24,020 INFO L444 ceAbstractionStarter]: For program point L122(lines 122 621) no Hoare annotation was computed. [2019-11-19 22:41:24,020 INFO L444 ceAbstractionStarter]: For program point L552(lines 552 556) no Hoare annotation was computed. [2019-11-19 22:41:24,020 INFO L444 ceAbstractionStarter]: For program point L486(lines 486 490) no Hoare annotation was computed. [2019-11-19 22:41:24,020 INFO L440 ceAbstractionStarter]: At program point L123(lines 119 622) the Hoare annotation is: (let ((.cse4 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse0 (<= 8466 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (exists ((v_prenex_2 Int) (v_prenex_1 Int)) (let ((.cse6 (mod (+ (* v_prenex_1 2) (* v_prenex_2 2)) 4294967296))) (and (<= .cse6 8496) (<= ULTIMATE.start_ssl3_accept_~s__state~0 .cse6) (<= .cse6 2147483647))))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse2 (let ((.cse5 (mod (+ (* ULTIMATE.start_ssl3_accept_~ag_Y~0 2) (* ULTIMATE.start_ssl3_accept_~ag_X~0 2)) 4294967296))) (or (< 2147483647 .cse5) (<= .cse5 8496))))) (or (and .cse0 .cse1 .cse2 (and .cse3 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 1))) (and .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) .cse3 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and .cse4 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse0 .cse1 .cse3 .cse2))) [2019-11-19 22:41:24,020 INFO L440 ceAbstractionStarter]: At program point L553(lines 66 676) the Hoare annotation is: false [2019-11-19 22:41:24,020 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-19 22:41:24,020 INFO L444 ceAbstractionStarter]: For program point L256(lines 256 270) no Hoare annotation was computed. [2019-11-19 22:41:24,020 INFO L444 ceAbstractionStarter]: For program point L257(lines 257 262) no Hoare annotation was computed. [2019-11-19 22:41:24,020 INFO L444 ceAbstractionStarter]: For program point L191(lines 191 598) no Hoare annotation was computed. [2019-11-19 22:41:24,020 INFO L444 ceAbstractionStarter]: For program point L158(lines 158 609) no Hoare annotation was computed. [2019-11-19 22:41:24,021 INFO L444 ceAbstractionStarter]: For program point L125(lines 125 620) no Hoare annotation was computed. [2019-11-19 22:41:24,021 INFO L447 ceAbstractionStarter]: At program point L687(lines 678 689) the Hoare annotation is: true [2019-11-19 22:41:24,021 INFO L444 ceAbstractionStarter]: For program point L357(lines 357 388) no Hoare annotation was computed. [2019-11-19 22:41:24,021 INFO L444 ceAbstractionStarter]: For program point L324(lines 324 328) no Hoare annotation was computed. [2019-11-19 22:41:24,021 INFO L444 ceAbstractionStarter]: For program point L324-2(lines 324 328) no Hoare annotation was computed. [2019-11-19 22:41:24,021 INFO L440 ceAbstractionStarter]: At program point L192(lines 188 599) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse3 (<= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse5 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)))) (or (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse2 .cse3 (let ((.cse4 (mod (+ (* ULTIMATE.start_ssl3_accept_~ag_Y~0 2) (* ULTIMATE.start_ssl3_accept_~ag_X~0 2)) 4294967296))) (or (< 2147483647 .cse4) (<= .cse4 8496)))) (and .cse0 .cse2 .cse1 .cse3 .cse5) (and .cse2 .cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse3) (and (<= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0) .cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse1 .cse3 .cse5))) [2019-11-19 22:41:24,021 INFO L440 ceAbstractionStarter]: At program point L159(lines 155 610) the Hoare annotation is: (let ((.cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse0 (<= 8512 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and .cse0 .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (and .cse0 .cse1 .cse2) (let ((.cse3 (mod (+ (* ULTIMATE.start_ssl3_accept_~ag_Y~0 2) (* ULTIMATE.start_ssl3_accept_~ag_X~0 2)) 4294967296))) (or (< 2147483647 .cse3) (<= .cse3 8496)))) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse2))) [2019-11-19 22:41:24,021 INFO L440 ceAbstractionStarter]: At program point L126(lines 125 620) the Hoare annotation is: (let ((.cse1 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (.cse2 (<= 8466 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse3 (exists ((v_prenex_2 Int) (v_prenex_1 Int)) (let ((.cse4 (mod (+ (* v_prenex_1 2) (* v_prenex_2 2)) 4294967296))) (and (<= .cse4 8496) (<= ULTIMATE.start_ssl3_accept_~s__state~0 .cse4) (<= .cse4 2147483647))))) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) .cse0 (not .cse1)) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse2 .cse3 .cse0 .cse1) (and .cse2 .cse3 .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 1)))) [2019-11-19 22:41:24,021 INFO L444 ceAbstractionStarter]: For program point L523(lines 523 528) no Hoare annotation was computed. [2019-11-19 22:41:24,021 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-19 22:41:24,022 INFO L440 ceAbstractionStarter]: At program point L590(lines 101 658) the Hoare annotation is: (let ((.cse22 (+ (* ULTIMATE.start_ssl3_accept_~ag_Y~0 2) (* ULTIMATE.start_ssl3_accept_~ag_X~0 2))) (.cse6 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 1)) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse5 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3))) (let ((.cse0 (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) (.cse9 (<= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0)) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse14 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse11 (<= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse20 (and .cse19 .cse5 (<= 8656 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse15 (<= 8576 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0)) (.cse17 (and .cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse1)) (.cse21 (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (.cse10 (not .cse6)) (.cse7 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3)) (.cse8 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse3 (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse18 (= 8608 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse13 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse4 (let ((.cse24 (mod .cse22 4294967296))) (or (< 2147483647 .cse24) (<= .cse24 8496)))) (.cse23 (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and .cse0 .cse1) (and .cse2 .cse3 .cse4) (and .cse2 .cse0 .cse4) (and .cse5 .cse6 .cse7 .cse8 .cse4) (and .cse2 (= ULTIMATE.start_ssl3_accept_~s__state~0 8512) .cse4) (and .cse9 .cse5 .cse8 .cse10) (and .cse9 .cse5 .cse11 .cse10) (and .cse12 .cse8 .cse1) (and .cse13 (<= 8576 ULTIMATE.start_ssl3_accept_~s__state~0) .cse1 .cse14 .cse15) (and .cse13 .cse12 .cse8 .cse6) (and (<= 8466 ULTIMATE.start_ssl3_accept_~s__state~0) .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (exists ((v_prenex_2 Int) (v_prenex_1 Int)) (let ((.cse16 (mod (+ (* v_prenex_1 2) (* v_prenex_2 2)) 4294967296))) (and (<= .cse16 8496) (<= ULTIMATE.start_ssl3_accept_~s__state~0 .cse16) (<= .cse16 2147483647)))) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (and .cse17 .cse18) (and .cse2 .cse13 .cse14 .cse4) (and .cse1 .cse4) (and .cse19 .cse1 .cse11) (and .cse2 .cse13 .cse19 .cse11 .cse4) (and .cse20 .cse10) (and (and .cse13 .cse20) .cse4) (and .cse1 .cse13 .cse8 .cse15) (and .cse21 .cse17) (and .cse2 .cse21 .cse13 .cse4) (and (= (+ ULTIMATE.start_ssl3_accept_~s__state~0 (* 4294967296 (div .cse22 4294967296))) (+ (* 2 ULTIMATE.start_ssl3_accept_~ag_Y~0) (* 2 ULTIMATE.start_ssl3_accept_~ag_X~0))) .cse1) (and .cse2 .cse10) (and .cse1 .cse7 .cse8) (and .cse3 .cse1) (and (and .cse2 .cse23) .cse4) (and .cse2 .cse18 .cse13 .cse4) (and .cse23 .cse1)))) [2019-11-19 22:41:24,022 INFO L444 ceAbstractionStarter]: For program point L557(lines 557 561) no Hoare annotation was computed. [2019-11-19 22:41:24,022 INFO L444 ceAbstractionStarter]: For program point L293(lines 293 297) no Hoare annotation was computed. [2019-11-19 22:41:24,022 INFO L444 ceAbstractionStarter]: For program point L293-2(lines 211 589) no Hoare annotation was computed. [2019-11-19 22:41:24,022 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 597) no Hoare annotation was computed. [2019-11-19 22:41:24,022 INFO L444 ceAbstractionStarter]: For program point L161(lines 161 608) no Hoare annotation was computed. [2019-11-19 22:41:24,022 INFO L444 ceAbstractionStarter]: For program point L128(lines 128 619) no Hoare annotation was computed. [2019-11-19 22:41:24,022 INFO L444 ceAbstractionStarter]: For program point L360(lines 360 387) no Hoare annotation was computed. [2019-11-19 22:41:24,022 INFO L444 ceAbstractionStarter]: For program point L360-1(lines 360 387) no Hoare annotation was computed. [2019-11-19 22:41:24,022 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 384) no Hoare annotation was computed. [2019-11-19 22:41:24,022 INFO L447 ceAbstractionStarter]: At program point L659(lines 100 660) the Hoare annotation is: true [2019-11-19 22:41:24,022 INFO L444 ceAbstractionStarter]: For program point L197(lines 197 596) no Hoare annotation was computed. [2019-11-19 22:41:24,022 INFO L444 ceAbstractionStarter]: For program point L164(lines 164 607) no Hoare annotation was computed. [2019-11-19 22:41:24,023 INFO L444 ceAbstractionStarter]: For program point L131(lines 131 618) no Hoare annotation was computed. [2019-11-19 22:41:24,023 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 670) no Hoare annotation was computed. [2019-11-19 22:41:24,023 INFO L444 ceAbstractionStarter]: For program point L396(lines 396 427) no Hoare annotation was computed. [2019-11-19 22:41:24,023 INFO L444 ceAbstractionStarter]: For program point L231(lines 231 248) no Hoare annotation was computed. [2019-11-19 22:41:24,023 INFO L440 ceAbstractionStarter]: At program point L198(lines 194 597) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse2 (<= 8656 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse3 (let ((.cse4 (mod (+ (* ULTIMATE.start_ssl3_accept_~ag_Y~0 2) (* ULTIMATE.start_ssl3_accept_~ag_X~0 2)) 4294967296))) (or (< 2147483647 .cse4) (<= .cse4 8496)))) (and .cse3 .cse0 .cse1 .cse2 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and .cse3 .cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse2))) [2019-11-19 22:41:24,023 INFO L440 ceAbstractionStarter]: At program point L165(lines 161 608) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse1 (<= 8512 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and .cse0 .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (and .cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 1)) .cse2) (and (and .cse0 .cse1 .cse2) (let ((.cse3 (mod (+ (* ULTIMATE.start_ssl3_accept_~ag_Y~0 2) (* ULTIMATE.start_ssl3_accept_~ag_X~0 2)) 4294967296))) (or (< 2147483647 .cse3) (<= .cse3 8496)))))) [2019-11-19 22:41:24,023 INFO L444 ceAbstractionStarter]: For program point L231-2(lines 211 589) no Hoare annotation was computed. [2019-11-19 22:41:24,023 INFO L444 ceAbstractionStarter]: For program point L628(lines 628 656) no Hoare annotation was computed. [2019-11-19 22:41:24,023 INFO L444 ceAbstractionStarter]: For program point L397(lines 397 403) no Hoare annotation was computed. [2019-11-19 22:41:24,023 INFO L444 ceAbstractionStarter]: For program point L364(lines 364 383) no Hoare annotation was computed. [2019-11-19 22:41:24,023 INFO L444 ceAbstractionStarter]: For program point L629(lines 629 653) no Hoare annotation was computed. [2019-11-19 22:41:24,023 INFO L444 ceAbstractionStarter]: For program point L563(lines 563 567) no Hoare annotation was computed. [2019-11-19 22:41:24,023 INFO L444 ceAbstractionStarter]: For program point L530(lines 530 534) no Hoare annotation was computed. [2019-11-19 22:41:24,024 INFO L444 ceAbstractionStarter]: For program point L497(lines 497 501) no Hoare annotation was computed. [2019-11-19 22:41:24,024 INFO L444 ceAbstractionStarter]: For program point L563-2(lines 563 567) no Hoare annotation was computed. [2019-11-19 22:41:24,024 INFO L444 ceAbstractionStarter]: For program point L530-2(lines 211 589) no Hoare annotation was computed. [2019-11-19 22:41:24,024 INFO L444 ceAbstractionStarter]: For program point L365(lines 365 369) no Hoare annotation was computed. [2019-11-19 22:41:24,024 INFO L444 ceAbstractionStarter]: For program point L365-2(lines 364 381) no Hoare annotation was computed. [2019-11-19 22:41:24,024 INFO L444 ceAbstractionStarter]: For program point L233(lines 233 238) no Hoare annotation was computed. [2019-11-19 22:41:24,024 INFO L444 ceAbstractionStarter]: For program point L200(lines 200 595) no Hoare annotation was computed. [2019-11-19 22:41:24,024 INFO L444 ceAbstractionStarter]: For program point L167(lines 167 606) no Hoare annotation was computed. [2019-11-19 22:41:24,024 INFO L444 ceAbstractionStarter]: For program point L134(lines 134 617) no Hoare annotation was computed. [2019-11-19 22:41:24,024 INFO L440 ceAbstractionStarter]: At program point L101-2(lines 101 658) the Hoare annotation is: (let ((.cse21 (+ (* ULTIMATE.start_ssl3_accept_~ag_Y~0 2) (* ULTIMATE.start_ssl3_accept_~ag_X~0 2))) (.cse6 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 1)) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse5 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3))) (let ((.cse0 (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) (.cse9 (<= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0)) (.cse13 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse11 (<= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse19 (and .cse18 .cse5 (<= 8656 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse14 (<= 8576 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0)) (.cse16 (and .cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse1)) (.cse20 (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (.cse10 (not .cse6)) (.cse7 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3)) (.cse8 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse3 (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse17 (= 8608 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse12 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse4 (let ((.cse24 (mod .cse21 4294967296))) (or (< 2147483647 .cse24) (<= .cse24 8496)))) (.cse22 (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)))) (or (and .cse0 .cse1) (and .cse2 .cse3 .cse4) (and .cse2 .cse0 .cse4) (and .cse5 .cse6 .cse7 .cse8 .cse4) (and .cse2 (= ULTIMATE.start_ssl3_accept_~s__state~0 8512) .cse4) (and .cse9 .cse5 .cse8 .cse10) (and .cse9 .cse5 .cse11 .cse10) (and .cse12 (<= 8576 ULTIMATE.start_ssl3_accept_~s__state~0) .cse1 .cse13 .cse14) (and .cse12 .cse15 .cse8 .cse6) (and .cse16 .cse17) (and .cse2 .cse12 .cse13 .cse4) (and .cse1 .cse4) (and .cse18 .cse1 .cse11) (and .cse2 .cse12 .cse18 .cse11 .cse4) (and .cse19 .cse10) (and (and .cse12 .cse19) .cse4) (and .cse1 .cse12 .cse8 .cse14) (and .cse20 .cse16) (and .cse2 .cse20 .cse12 .cse4) (and (= (+ ULTIMATE.start_ssl3_accept_~s__state~0 (* 4294967296 (div .cse21 4294967296))) (+ (* 2 ULTIMATE.start_ssl3_accept_~ag_Y~0) (* 2 ULTIMATE.start_ssl3_accept_~ag_X~0))) .cse1) (and .cse2 .cse10) (and .cse1 .cse7 .cse8) (and .cse3 .cse1) (and (and .cse2 .cse22) .cse4) (and .cse2 .cse17 .cse12 .cse4) (and .cse22 .cse1) (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) .cse15 (exists ((v_prenex_2 Int) (v_prenex_1 Int)) (let ((.cse23 (mod (+ (* v_prenex_1 2) (* v_prenex_2 2)) 4294967296))) (and (<= .cse23 8496) (<= ULTIMATE.start_ssl3_accept_~s__state~0 .cse23) (<= .cse23 2147483647)))) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))))) [2019-11-19 22:41:24,038 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-19 22:41:24,039 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 22:41:24,040 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-19 22:41:24,040 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 22:41:24,040 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-19 22:41:24,041 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 22:41:24,048 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-19 22:41:24,049 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 22:41:24,049 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-19 22:41:24,049 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 22:41:24,050 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-19 22:41:24,050 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 22:41:24,055 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-19 22:41:24,056 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 22:41:24,056 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-19 22:41:24,056 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 22:41:24,056 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-19 22:41:24,057 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 22:41:24,057 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-19 22:41:24,057 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 22:41:24,057 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-19 22:41:24,058 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 22:41:24,058 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-19 22:41:24,058 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 22:41:24,059 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-19 22:41:24,059 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 22:41:24,059 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-19 22:41:24,060 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 22:41:24,060 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-19 22:41:24,060 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 22:41:24,061 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-19 22:41:24,061 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 22:41:24,061 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-19 22:41:24,061 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 22:41:24,062 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-19 22:41:24,062 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 22:41:24,065 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-19 22:41:24,065 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 22:41:24,066 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-19 22:41:24,066 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 22:41:24,066 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-19 22:41:24,066 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 22:41:24,067 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-19 22:41:24,067 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 22:41:24,067 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-19 22:41:24,067 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 22:41:24,067 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-19 22:41:24,068 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 22:41:24,068 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-19 22:41:24,069 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 22:41:24,069 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-19 22:41:24,069 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 22:41:24,069 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-19 22:41:24,070 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 22:41:24,070 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-19 22:41:24,070 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 22:41:24,070 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-19 22:41:24,071 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 22:41:24,071 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-19 22:41:24,071 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 22:41:24,075 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-19 22:41:24,075 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 22:41:24,076 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-19 22:41:24,076 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 22:41:24,076 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-19 22:41:24,076 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 22:41:24,077 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-19 22:41:24,077 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 22:41:24,077 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-19 22:41:24,077 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 22:41:24,078 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-19 22:41:24,078 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 22:41:24,079 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-19 22:41:24,079 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 22:41:24,079 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-19 22:41:24,079 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 22:41:24,080 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-19 22:41:24,080 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 22:41:24,080 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-19 22:41:24,080 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 22:41:24,081 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-19 22:41:24,081 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 22:41:24,081 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-19 22:41:24,081 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 22:41:24,088 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-19 22:41:24,088 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 22:41:24,088 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-19 22:41:24,089 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 22:41:24,089 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-19 22:41:24,089 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 22:41:24,091 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-19 22:41:24,091 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 22:41:24,092 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-19 22:41:24,092 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 22:41:24,092 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-19 22:41:24,092 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 22:41:24,096 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 10:41:24 BoogieIcfgContainer [2019-11-19 22:41:24,096 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-19 22:41:24,097 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-19 22:41:24,097 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-19 22:41:24,097 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-19 22:41:24,098 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:40:00" (3/4) ... [2019-11-19 22:41:24,100 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-19 22:41:24,121 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-19 22:41:24,122 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-19 22:41:24,170 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((s__state == 8528 && blastFlag <= 1) || ((blastFlag <= 2 && s__state == 8544) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || ((blastFlag <= 2 && s__state == 8528) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || ((((blastFlag <= 3 && 0 == s__hit) && s__s3__tmp__next_state___0 <= 3) && s__state <= 8448) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || ((blastFlag <= 2 && s__state == 8512) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || (((8640 <= s__s3__tmp__next_state___0 && blastFlag <= 3) && s__state <= 8448) && !(0 == s__hit))) || (((8640 <= s__s3__tmp__next_state___0 && blastFlag <= 3) && 8640 <= s__state) && !(0 == s__hit))) || ((((s__s3__tmp__next_state___0 <= 8576 && 8576 <= s__state) && blastFlag <= 1) && s__state <= 8576) && 8576 <= s__s3__tmp__next_state___0)) || (((s__s3__tmp__next_state___0 <= 8576 && !(s__state == 8448)) && s__state <= 8448) && 0 == s__hit)) || (((!(s__state == 8673) && !(s__state == 8672)) && blastFlag <= 1) && 8608 == s__state)) || (((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || (blastFlag <= 1 && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || ((!(s__state == 8673) && blastFlag <= 1) && 8640 <= s__state)) || ((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8673)) && 8640 <= s__state) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || (((!(s__state == 8673) && blastFlag <= 3) && 8656 <= s__state) && !(0 == s__hit))) || ((s__s3__tmp__next_state___0 <= 8576 && (!(s__state == 8673) && blastFlag <= 3) && 8656 <= s__state) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || (((blastFlag <= 1 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8448) && 8576 <= s__s3__tmp__next_state___0)) || (s__state == 8592 && (!(s__state == 8673) && !(s__state == 8672)) && blastFlag <= 1)) || (((blastFlag <= 2 && s__state == 8592) && s__s3__tmp__next_state___0 <= 8576) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || (s__state + 4294967296 * ((ag_Y * 2 + ag_X * 2) / 4294967296) == 2 * ag_Y + 2 * ag_X && blastFlag <= 1)) || (blastFlag <= 2 && !(0 == s__hit))) || ((blastFlag <= 1 && s__s3__tmp__next_state___0 <= 3) && s__state <= 8448)) || (s__state == 8544 && blastFlag <= 1)) || ((blastFlag <= 2 && 8560 == s__state) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || (((blastFlag <= 2 && 8608 == s__state) && s__s3__tmp__next_state___0 <= 8576) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || (8560 == s__state && blastFlag <= 1)) || (((((!(s__state == 8481) && !(s__state == 8448)) && (\exists v_prenex_2 : int, v_prenex_1 : int :: ((v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296 <= 8496 && s__state <= (v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296) && (v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296 <= 2147483647)) && !(s__state == 8496)) && blastFlag <= 1) && !(s__state == 8480)) [2019-11-19 22:41:24,170 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((8466 <= s__state && (\exists v_prenex_2 : int, v_prenex_1 : int :: ((v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296 <= 8496 && s__state <= (v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296) && (v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296 <= 2147483647)) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496)) && !(s__state == 8496) && blastFlag <= 1) || (((((blastFlag <= 2 && !(s__state == 8673)) && !(s__state == 8672)) && !(s__state == 8497)) && !(s__state == 8496)) && !(0 == s__hit))) || (((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && 8466 <= s__state) && (\exists v_prenex_2 : int, v_prenex_1 : int :: ((v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296 <= 8496 && s__state <= (v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296) && (v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296 <= 2147483647)) && !(s__state == 8496)) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496)) [2019-11-19 22:41:24,171 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((blastFlag <= 2 && !(s__state == 8673)) && !(s__state == 8672)) && !(s__state == 8497)) && !(s__state == 8496)) && !(0 == s__hit)) || ((((s__s3__tmp__next_state___0 <= 8576 && 8466 <= s__state) && (\exists v_prenex_2 : int, v_prenex_1 : int :: ((v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296 <= 8496 && s__state <= (v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296) && (v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296 <= 2147483647)) && !(s__state == 8496)) && 0 == s__hit)) || (((8466 <= s__state && (\exists v_prenex_2 : int, v_prenex_1 : int :: ((v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296 <= 8496 && s__state <= (v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296) && (v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296 <= 2147483647)) && !(s__state == 8496)) && blastFlag <= 1) [2019-11-19 22:41:24,171 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((s__state == 8528 && blastFlag <= 1) || ((blastFlag <= 2 && s__state == 8544) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || ((blastFlag <= 2 && s__state == 8528) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || ((((blastFlag <= 3 && 0 == s__hit) && s__s3__tmp__next_state___0 <= 3) && s__state <= 8448) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || ((blastFlag <= 2 && s__state == 8512) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || (((8640 <= s__s3__tmp__next_state___0 && blastFlag <= 3) && s__state <= 8448) && !(0 == s__hit))) || (((8640 <= s__s3__tmp__next_state___0 && blastFlag <= 3) && 8640 <= s__state) && !(0 == s__hit))) || ((!(s__state == 8448) && s__state <= 8448) && blastFlag <= 1)) || ((((s__s3__tmp__next_state___0 <= 8576 && 8576 <= s__state) && blastFlag <= 1) && s__state <= 8576) && 8576 <= s__s3__tmp__next_state___0)) || (((s__s3__tmp__next_state___0 <= 8576 && !(s__state == 8448)) && s__state <= 8448) && 0 == s__hit)) || (((((8466 <= s__state && blastFlag <= 1) && !(s__state == 8481)) && (\exists v_prenex_2 : int, v_prenex_1 : int :: ((v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296 <= 8496 && s__state <= (v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296) && (v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296 <= 2147483647)) && !(s__state == 8496)) && !(s__state == 8480))) || (((!(s__state == 8673) && !(s__state == 8672)) && blastFlag <= 1) && 8608 == s__state)) || (((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || (blastFlag <= 1 && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || ((!(s__state == 8673) && blastFlag <= 1) && 8640 <= s__state)) || ((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8673)) && 8640 <= s__state) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || (((!(s__state == 8673) && blastFlag <= 3) && 8656 <= s__state) && !(0 == s__hit))) || ((s__s3__tmp__next_state___0 <= 8576 && (!(s__state == 8673) && blastFlag <= 3) && 8656 <= s__state) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || (((blastFlag <= 1 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8448) && 8576 <= s__s3__tmp__next_state___0)) || (s__state == 8592 && (!(s__state == 8673) && !(s__state == 8672)) && blastFlag <= 1)) || (((blastFlag <= 2 && s__state == 8592) && s__s3__tmp__next_state___0 <= 8576) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || (s__state + 4294967296 * ((ag_Y * 2 + ag_X * 2) / 4294967296) == 2 * ag_Y + 2 * ag_X && blastFlag <= 1)) || (blastFlag <= 2 && !(0 == s__hit))) || ((blastFlag <= 1 && s__s3__tmp__next_state___0 <= 3) && s__state <= 8448)) || (s__state == 8544 && blastFlag <= 1)) || ((blastFlag <= 2 && 8560 == s__state) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || (((blastFlag <= 2 && 8608 == s__state) && s__s3__tmp__next_state___0 <= 8576) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || (8560 == s__state && blastFlag <= 1) [2019-11-19 22:41:24,171 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((!(s__state == 8481) && !(s__state == 8448)) && (((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && (\exists v_prenex_2 : int, v_prenex_1 : int :: ((v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296 <= 8496 && s__state <= (v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296) && (v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296 <= 2147483647)) && !(s__state == 8496)) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496)) && !(s__state == 8480)) || (((((blastFlag <= 2 && !(s__state == 8673)) && !(s__state == 8672)) && !(s__state == 8497)) && !(s__state == 8496)) && !(0 == s__hit))) || (((((!(s__state == 8496) && blastFlag <= 1) && !(s__state == 8481)) && !(s__state == 8448)) && (\exists v_prenex_2 : int, v_prenex_1 : int :: ((v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296 <= 8496 && s__state <= (v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296) && (v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296 <= 2147483647)) && !(s__state == 8480)) [2019-11-19 22:41:24,275 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_e8523ade-d2fd-469b-8e4d-38d5e1a815bb/bin/uautomizer/witness.graphml [2019-11-19 22:41:24,275 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-19 22:41:24,277 INFO L168 Benchmark]: Toolchain (without parser) took 85430.52 ms. Allocated memory was 1.0 GB in the beginning and 3.0 GB in the end (delta: 2.0 GB). Free memory was 944.7 MB in the beginning and 1.9 GB in the end (delta: -929.7 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2019-11-19 22:41:24,277 INFO L168 Benchmark]: CDTParser took 0.24 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-19 22:41:24,277 INFO L168 Benchmark]: CACSL2BoogieTranslator took 453.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -186.3 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. [2019-11-19 22:41:24,278 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.27 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 22:41:24,278 INFO L168 Benchmark]: Boogie Preprocessor took 37.53 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-19 22:41:24,279 INFO L168 Benchmark]: RCFGBuilder took 743.79 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-19 22:41:24,279 INFO L168 Benchmark]: TraceAbstraction took 83963.66 ms. Allocated memory was 1.2 GB in the beginning and 3.0 GB in the end (delta: 1.9 GB). Free memory was 1.1 GB in the beginning and 1.9 GB in the end (delta: -818.4 MB). Peak memory consumption was 2.1 GB. Max. memory is 11.5 GB. [2019-11-19 22:41:24,280 INFO L168 Benchmark]: Witness Printer took 178.82 ms. Allocated memory is still 3.0 GB. Free memory was 1.9 GB in the beginning and 1.9 GB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. [2019-11-19 22:41:24,282 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.24 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 453.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -186.3 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 49.27 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 37.53 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 743.79 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 83963.66 ms. Allocated memory was 1.2 GB in the beginning and 3.0 GB in the end (delta: 1.9 GB). Free memory was 1.1 GB in the beginning and 1.9 GB in the end (delta: -818.4 MB). Peak memory consumption was 2.1 GB. Max. memory is 11.5 GB. * Witness Printer took 178.82 ms. Allocated memory is still 3.0 GB. Free memory was 1.9 GB in the beginning and 1.9 GB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 670]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 182]: Loop Invariant Derived loop invariant: ((((8576 <= s__state && (!(s__state == 8673) && !(s__state == 8672)) && blastFlag <= 1) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496)) || ((((blastFlag <= 2 && 8512 <= s__state) && !(s__state == 8673)) && !(s__state == 8672)) && !(0 == s__hit))) || ((8576 <= s__state && (!(s__state == 8673) && !(s__state == 8672)) && blastFlag <= 1) && 8608 == s__state)) || (((blastFlag <= 2 && 8608 == s__state) && s__s3__tmp__next_state___0 <= 8576) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496)) - InvariantResult [Line: 101]: Loop Invariant [2019-11-19 22:41:24,302 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-19 22:41:24,302 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 22:41:24,302 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-19 22:41:24,302 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 22:41:24,303 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-19 22:41:24,303 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 22:41:24,305 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-19 22:41:24,306 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 22:41:24,306 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-19 22:41:24,306 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 22:41:24,307 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-19 22:41:24,307 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((((s__state == 8528 && blastFlag <= 1) || ((blastFlag <= 2 && s__state == 8544) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || ((blastFlag <= 2 && s__state == 8528) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || ((((blastFlag <= 3 && 0 == s__hit) && s__s3__tmp__next_state___0 <= 3) && s__state <= 8448) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || ((blastFlag <= 2 && s__state == 8512) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || (((8640 <= s__s3__tmp__next_state___0 && blastFlag <= 3) && s__state <= 8448) && !(0 == s__hit))) || (((8640 <= s__s3__tmp__next_state___0 && blastFlag <= 3) && 8640 <= s__state) && !(0 == s__hit))) || ((!(s__state == 8448) && s__state <= 8448) && blastFlag <= 1)) || ((((s__s3__tmp__next_state___0 <= 8576 && 8576 <= s__state) && blastFlag <= 1) && s__state <= 8576) && 8576 <= s__s3__tmp__next_state___0)) || (((s__s3__tmp__next_state___0 <= 8576 && !(s__state == 8448)) && s__state <= 8448) && 0 == s__hit)) || (((((8466 <= s__state && blastFlag <= 1) && !(s__state == 8481)) && (\exists v_prenex_2 : int, v_prenex_1 : int :: ((v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296 <= 8496 && s__state <= (v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296) && (v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296 <= 2147483647)) && !(s__state == 8496)) && !(s__state == 8480))) || (((!(s__state == 8673) && !(s__state == 8672)) && blastFlag <= 1) && 8608 == s__state)) || (((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || (blastFlag <= 1 && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || ((!(s__state == 8673) && blastFlag <= 1) && 8640 <= s__state)) || ((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8673)) && 8640 <= s__state) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || (((!(s__state == 8673) && blastFlag <= 3) && 8656 <= s__state) && !(0 == s__hit))) || ((s__s3__tmp__next_state___0 <= 8576 && (!(s__state == 8673) && blastFlag <= 3) && 8656 <= s__state) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || (((blastFlag <= 1 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8448) && 8576 <= s__s3__tmp__next_state___0)) || (s__state == 8592 && (!(s__state == 8673) && !(s__state == 8672)) && blastFlag <= 1)) || (((blastFlag <= 2 && s__state == 8592) && s__s3__tmp__next_state___0 <= 8576) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || (s__state + 4294967296 * ((ag_Y * 2 + ag_X * 2) / 4294967296) == 2 * ag_Y + 2 * ag_X && blastFlag <= 1)) || (blastFlag <= 2 && !(0 == s__hit))) || ((blastFlag <= 1 && s__s3__tmp__next_state___0 <= 3) && s__state <= 8448)) || (s__state == 8544 && blastFlag <= 1)) || ((blastFlag <= 2 && 8560 == s__state) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || (((blastFlag <= 2 && 8608 == s__state) && s__s3__tmp__next_state___0 <= 8576) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || (8560 == s__state && blastFlag <= 1) - InvariantResult [Line: 66]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 128]: Loop Invariant [2019-11-19 22:41:24,309 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-19 22:41:24,309 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 22:41:24,310 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-19 22:41:24,310 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 22:41:24,310 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-19 22:41:24,310 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 22:41:24,310 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-19 22:41:24,311 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 22:41:24,311 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-19 22:41:24,311 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 22:41:24,311 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-19 22:41:24,311 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 22:41:24,312 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-19 22:41:24,313 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 22:41:24,313 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-19 22:41:24,313 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 22:41:24,314 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-19 22:41:24,314 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 22:41:24,314 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-19 22:41:24,314 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 22:41:24,315 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-19 22:41:24,315 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 22:41:24,315 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-19 22:41:24,315 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] Derived loop invariant: ((((!(s__state == 8481) && !(s__state == 8448)) && (((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && (\exists v_prenex_2 : int, v_prenex_1 : int :: ((v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296 <= 8496 && s__state <= (v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296) && (v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296 <= 2147483647)) && !(s__state == 8496)) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496)) && !(s__state == 8480)) || (((((blastFlag <= 2 && !(s__state == 8673)) && !(s__state == 8672)) && !(s__state == 8497)) && !(s__state == 8496)) && !(0 == s__hit))) || (((((!(s__state == 8496) && blastFlag <= 1) && !(s__state == 8481)) && !(s__state == 8448)) && (\exists v_prenex_2 : int, v_prenex_1 : int :: ((v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296 <= 8496 && s__state <= (v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296) && (v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296 <= 2147483647)) && !(s__state == 8480)) - InvariantResult [Line: 209]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 167]: Loop Invariant Derived loop invariant: ((((((((blastFlag <= 1 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8448) && 8576 <= s__s3__tmp__next_state___0) || ((((blastFlag <= 3 && s__state <= 8448) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496)) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 3)) || (((8640 <= s__s3__tmp__next_state___0 && blastFlag <= 3) && s__state <= 8448) && !(0 == s__hit))) || ((s__state <= 8448 && blastFlag <= 1) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || ((blastFlag <= 1 && s__s3__tmp__next_state___0 <= 3) && s__state <= 8448)) || ((blastFlag <= 2 && s__state <= 8448) && !(0 == s__hit))) || (((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8448) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496)) - InvariantResult [Line: 125]: Loop Invariant [2019-11-19 22:41:24,317 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-19 22:41:24,317 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 22:41:24,317 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-19 22:41:24,317 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 22:41:24,318 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-19 22:41:24,318 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 22:41:24,318 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-19 22:41:24,318 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 22:41:24,318 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-19 22:41:24,319 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 22:41:24,319 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-19 22:41:24,319 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 22:41:24,320 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-19 22:41:24,320 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 22:41:24,320 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-19 22:41:24,321 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 22:41:24,321 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-19 22:41:24,321 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 22:41:24,321 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-19 22:41:24,321 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 22:41:24,322 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-19 22:41:24,322 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 22:41:24,322 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-19 22:41:24,322 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] Derived loop invariant: ((((((blastFlag <= 2 && !(s__state == 8673)) && !(s__state == 8672)) && !(s__state == 8497)) && !(s__state == 8496)) && !(0 == s__hit)) || ((((s__s3__tmp__next_state___0 <= 8576 && 8466 <= s__state) && (\exists v_prenex_2 : int, v_prenex_1 : int :: ((v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296 <= 8496 && s__state <= (v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296) && (v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296 <= 2147483647)) && !(s__state == 8496)) && 0 == s__hit)) || (((8466 <= s__state && (\exists v_prenex_2 : int, v_prenex_1 : int :: ((v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296 <= 8496 && s__state <= (v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296) && (v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296 <= 2147483647)) && !(s__state == 8496)) && blastFlag <= 1) - InvariantResult [Line: 396]: Loop Invariant Derived loop invariant: (((((8512 <= s__state && blastFlag <= 2) && !(s__state == 8673)) && !(s__state == 8672)) && !(0 == s__hit)) || (((8512 <= s__state && blastFlag <= 2) && s__state <= 8576) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || ((8512 <= s__state && blastFlag <= 1) && s__state <= 8576) - InvariantResult [Line: 354]: Loop Invariant Derived loop invariant: (((8512 <= s__state && blastFlag <= 1) && s__state <= 8576) || ((((blastFlag <= 2 && 8512 <= s__state) && !(s__state == 8673)) && !(s__state == 8672)) && !(0 == s__hit))) || (((blastFlag <= 2 && 8512 <= s__state) && s__state <= 8576) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496)) - InvariantResult [Line: 200]: Loop Invariant Derived loop invariant: (((blastFlag <= 3 && 8656 <= s__state) && !(0 == s__hit)) || (blastFlag <= 1 && 8656 <= s__state)) || (((s__s3__tmp__next_state___0 <= 8576 && blastFlag <= 3) && 8656 <= s__state) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496)) - InvariantResult [Line: 149]: Loop Invariant Derived loop invariant: (((8512 <= s__state && blastFlag <= 1) && s__state <= 8576) || ((((blastFlag <= 2 && 8512 <= s__state) && !(s__state == 8673)) && !(s__state == 8672)) && !(0 == s__hit))) || (((blastFlag <= 2 && 8512 <= s__state) && s__state <= 8576) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496)) - InvariantResult [Line: 678]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 206]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 161]: Loop Invariant Derived loop invariant: (((((blastFlag <= 2 && 8512 <= s__state) && !(s__state == 8673)) && !(s__state == 8672)) && !(0 == s__hit)) || ((8512 <= s__state && blastFlag <= 1) && s__state <= 8576)) || (((blastFlag <= 2 && 8512 <= s__state) && s__state <= 8576) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496)) - InvariantResult [Line: 9]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 119]: Loop Invariant [2019-11-19 22:41:24,327 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-19 22:41:24,327 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 22:41:24,327 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-19 22:41:24,327 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 22:41:24,328 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-19 22:41:24,328 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 22:41:24,328 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-19 22:41:24,328 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 22:41:24,328 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-19 22:41:24,328 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 22:41:24,329 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-19 22:41:24,329 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 22:41:24,331 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-19 22:41:24,331 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 22:41:24,331 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-19 22:41:24,331 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 22:41:24,331 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-19 22:41:24,332 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 22:41:24,332 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-19 22:41:24,332 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 22:41:24,332 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-19 22:41:24,332 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 22:41:24,333 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-19 22:41:24,333 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] Derived loop invariant: ((((8466 <= s__state && (\exists v_prenex_2 : int, v_prenex_1 : int :: ((v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296 <= 8496 && s__state <= (v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296) && (v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296 <= 2147483647)) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496)) && !(s__state == 8496) && blastFlag <= 1) || (((((blastFlag <= 2 && !(s__state == 8673)) && !(s__state == 8672)) && !(s__state == 8497)) && !(s__state == 8496)) && !(0 == s__hit))) || (((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && 8466 <= s__state) && (\exists v_prenex_2 : int, v_prenex_1 : int :: ((v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296 <= 8496 && s__state <= (v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296) && (v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296 <= 2147483647)) && !(s__state == 8496)) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496)) - InvariantResult [Line: 194]: Loop Invariant Derived loop invariant: ((((((blastFlag <= 3 && !(s__state == 8672)) && 8656 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8673)) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496)) || ((((!(s__state == 8673) && blastFlag <= 3) && !(s__state == 8672)) && 8656 <= s__state) && !(0 == s__hit))) || (((!(s__state == 8673) && !(s__state == 8672)) && blastFlag <= 1) && 8656 <= s__state) - InvariantResult [Line: 143]: Loop Invariant Derived loop invariant: (((8512 <= s__state && blastFlag <= 1) && s__state <= 8576) || ((((blastFlag <= 2 && 8512 <= s__state) && !(s__state == 8673)) && !(s__state == 8672)) && !(0 == s__hit))) || (((blastFlag <= 2 && 8512 <= s__state) && s__state <= 8576) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496)) - InvariantResult [Line: 104]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 406]: Loop Invariant Derived loop invariant: (((((8512 <= s__state && blastFlag <= 2) && !(s__state == 8673)) && !(s__state == 8672)) && !(0 == s__hit)) || (((8512 <= s__state && blastFlag <= 2) && s__state <= 8576) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || ((8512 <= s__state && blastFlag <= 1) && s__state <= 8576) - InvariantResult [Line: 176]: Loop Invariant Derived loop invariant: (((((blastFlag <= 2 && 8512 <= s__state) && !(s__state == 8673)) && !(s__state == 8672)) && !(0 == s__hit)) || (((((blastFlag <= 2 && 8576 <= s__state) && !(s__state == 8672)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8673)) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || (((!(s__state == 8673) && !(s__state == 8672)) && blastFlag <= 1) && 8576 <= s__state) - InvariantResult [Line: 155]: Loop Invariant Derived loop invariant: (((((8512 <= s__state && blastFlag <= 2) && !(s__state == 8673)) && !(s__state == 8672)) && !(0 == s__hit)) || (((8512 <= s__state && blastFlag <= 2) && s__state <= 8576) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || ((8512 <= s__state && blastFlag <= 1) && s__state <= 8576) - InvariantResult [Line: 66]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 100]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 188]: Loop Invariant Derived loop invariant: (((((((blastFlag <= 2 && !(s__state == 8672)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8673)) && 8640 <= s__state) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496)) || ((((blastFlag <= 2 && !(s__state == 8673)) && !(s__state == 8672)) && 8640 <= s__state) && !(0 == s__hit))) || (((!(s__state == 8673) && !(s__state == 8672)) && blastFlag <= 1) && 8640 <= s__state)) || (((((8640 <= s__s3__tmp__next_state___0 && !(s__state == 8673)) && blastFlag <= 3) && !(s__state == 8672)) && 8640 <= s__state) && !(0 == s__hit)) - InvariantResult [Line: 107]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 137]: Loop Invariant Derived loop invariant: (((!(s__state == 8481) && (((8466 <= s__state && ((ag_Y * 2 + ag_X * 2) % 4294967296 <= s__state || ((ag_Y * 2 + ag_X * 2) % 4294967296 <= s__state + 4294967296 && 2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296))) && blastFlag <= 1) && s__state <= 8576) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496)) && !(s__state == 8480)) || ((blastFlag <= 2 && !(s__state == 8673) && !(s__state == 8672)) && !(0 == s__hit))) || ((!(s__state == 8481) && !(s__state == 8480)) && ((8466 <= s__state && ((ag_Y * 2 + ag_X * 2) % 4294967296 <= s__state || ((ag_Y * 2 + ag_X * 2) % 4294967296 <= s__state + 4294967296 && 2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296))) && (blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496)) - InvariantResult [Line: 101]: Loop Invariant [2019-11-19 22:41:24,337 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-19 22:41:24,337 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 22:41:24,338 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-19 22:41:24,338 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 22:41:24,338 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-19 22:41:24,338 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 22:41:24,340 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-19 22:41:24,340 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 22:41:24,340 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-19 22:41:24,340 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 22:41:24,340 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-19 22:41:24,341 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((((s__state == 8528 && blastFlag <= 1) || ((blastFlag <= 2 && s__state == 8544) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || ((blastFlag <= 2 && s__state == 8528) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || ((((blastFlag <= 3 && 0 == s__hit) && s__s3__tmp__next_state___0 <= 3) && s__state <= 8448) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || ((blastFlag <= 2 && s__state == 8512) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || (((8640 <= s__s3__tmp__next_state___0 && blastFlag <= 3) && s__state <= 8448) && !(0 == s__hit))) || (((8640 <= s__s3__tmp__next_state___0 && blastFlag <= 3) && 8640 <= s__state) && !(0 == s__hit))) || ((((s__s3__tmp__next_state___0 <= 8576 && 8576 <= s__state) && blastFlag <= 1) && s__state <= 8576) && 8576 <= s__s3__tmp__next_state___0)) || (((s__s3__tmp__next_state___0 <= 8576 && !(s__state == 8448)) && s__state <= 8448) && 0 == s__hit)) || (((!(s__state == 8673) && !(s__state == 8672)) && blastFlag <= 1) && 8608 == s__state)) || (((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || (blastFlag <= 1 && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || ((!(s__state == 8673) && blastFlag <= 1) && 8640 <= s__state)) || ((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8673)) && 8640 <= s__state) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || (((!(s__state == 8673) && blastFlag <= 3) && 8656 <= s__state) && !(0 == s__hit))) || ((s__s3__tmp__next_state___0 <= 8576 && (!(s__state == 8673) && blastFlag <= 3) && 8656 <= s__state) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || (((blastFlag <= 1 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8448) && 8576 <= s__s3__tmp__next_state___0)) || (s__state == 8592 && (!(s__state == 8673) && !(s__state == 8672)) && blastFlag <= 1)) || (((blastFlag <= 2 && s__state == 8592) && s__s3__tmp__next_state___0 <= 8576) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || (s__state + 4294967296 * ((ag_Y * 2 + ag_X * 2) / 4294967296) == 2 * ag_Y + 2 * ag_X && blastFlag <= 1)) || (blastFlag <= 2 && !(0 == s__hit))) || ((blastFlag <= 1 && s__s3__tmp__next_state___0 <= 3) && s__state <= 8448)) || (s__state == 8544 && blastFlag <= 1)) || ((blastFlag <= 2 && 8560 == s__state) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || (((blastFlag <= 2 && 8608 == s__state) && s__s3__tmp__next_state___0 <= 8576) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || (8560 == s__state && blastFlag <= 1)) || (((((!(s__state == 8481) && !(s__state == 8448)) && (\exists v_prenex_2 : int, v_prenex_1 : int :: ((v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296 <= 8496 && s__state <= (v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296) && (v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296 <= 2147483647)) && !(s__state == 8496)) && blastFlag <= 1) && !(s__state == 8480)) - InvariantResult [Line: 170]: Loop Invariant Derived loop invariant: (((((blastFlag <= 2 && 8512 <= s__state) && !(s__state == 8673)) && !(s__state == 8672)) && !(0 == s__hit)) || (8576 <= s__state && (!(s__state == 8673) && !(s__state == 8672)) && blastFlag <= 1)) || (((((blastFlag <= 2 && !(s__state == 8672)) && 8576 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8673)) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 137 locations, 1 error locations. Result: SAFE, OverallTime: 83.8s, OverallIterations: 29, TraceHistogramMax: 21, AutomataDifference: 23.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 43.0s, HoareTripleCheckerStatistics: 5783 SDtfs, 3193 SDslu, 4200 SDs, 0 SdLazy, 4248 SolverSat, 665 SolverUnsat, 7 SolverUnknown, 0 SolverNotchecked, 18.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3420 GetRequests, 3362 SyntacticMatches, 2 SemanticMatches, 56 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16029occurred in iteration=24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.5s AutomataMinimizationTime, 29 MinimizatonAttempts, 10200 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 29 LocationsWithAnnotation, 29 PreInvPairs, 955 NumberOfFragments, 2969 HoareAnnotationTreeSize, 29 FomulaSimplifications, 204025 FormulaSimplificationTreeSizeReduction, 4.6s HoareSimplificationTime, 29 FomulaSimplificationsInter, 92428 FormulaSimplificationTreeSizeReductionInter, 38.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 6.5s InterpolantComputationTime, 11805 NumberOfCodeBlocks, 11805 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 11768 ConstructedInterpolants, 35 QuantifiedInterpolants, 10985739 SizeOfPredicates, 13 NumberOfNonLiveVariables, 5190 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 37 InterpolantComputations, 24 PerfectInterpolantSequences, 56363/57069 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...