./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem11_label55.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_c0fb2568-b80f-49d3-a5a5-98c2eeae2c48/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_c0fb2568-b80f-49d3-a5a5-98c2eeae2c48/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_c0fb2568-b80f-49d3-a5a5-98c2eeae2c48/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_c0fb2568-b80f-49d3-a5a5-98c2eeae2c48/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem11_label55.c -s /tmp/vcloud-vcloud-master/worker/run_dir_c0fb2568-b80f-49d3-a5a5-98c2eeae2c48/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_c0fb2568-b80f-49d3-a5a5-98c2eeae2c48/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 d551d8685b85ae72a74f40e5098a20631eb2112d ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 23:40:06,692 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:40:06,693 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:40:06,703 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:40:06,704 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:40:06,705 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:40:06,706 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:40:06,708 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:40:06,710 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:40:06,711 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:40:06,712 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:40:06,713 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:40:06,714 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:40:06,715 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:40:06,715 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:40:06,717 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:40:06,717 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:40:06,718 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:40:06,720 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:40:06,722 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:40:06,724 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:40:06,725 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:40:06,727 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:40:06,727 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:40:06,731 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:40:06,731 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:40:06,731 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:40:06,732 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:40:06,733 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:40:06,734 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:40:06,734 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:40:06,735 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:40:06,736 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:40:06,737 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:40:06,738 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:40:06,738 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:40:06,739 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:40:06,739 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:40:06,740 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:40:06,741 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:40:06,741 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:40:06,742 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_c0fb2568-b80f-49d3-a5a5-98c2eeae2c48/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 23:40:06,755 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:40:06,756 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:40:06,757 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:40:06,757 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:40:06,758 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:40:06,758 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:40:06,758 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 23:40:06,759 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:40:06,759 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 23:40:06,759 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:40:06,759 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 23:40:06,759 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 23:40:06,760 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 23:40:06,760 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 23:40:06,760 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 23:40:06,760 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:40:06,761 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 23:40:06,761 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:40:06,761 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:40:06,762 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 23:40:06,762 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 23:40:06,762 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:40:06,762 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:40:06,763 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 23:40:06,763 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 23:40:06,763 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 23:40:06,763 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 23:40:06,764 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 23:40:06,764 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_c0fb2568-b80f-49d3-a5a5-98c2eeae2c48/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 -> d551d8685b85ae72a74f40e5098a20631eb2112d [2019-11-15 23:40:06,790 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:40:06,800 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:40:06,803 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:40:06,804 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:40:06,805 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:40:06,806 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_c0fb2568-b80f-49d3-a5a5-98c2eeae2c48/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem11_label55.c [2019-11-15 23:40:06,857 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c0fb2568-b80f-49d3-a5a5-98c2eeae2c48/bin/uautomizer/data/68e171082/3321adba052940d298a904883155a29f/FLAGfacb045ac [2019-11-15 23:40:07,435 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:40:07,438 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_c0fb2568-b80f-49d3-a5a5-98c2eeae2c48/sv-benchmarks/c/eca-rers2012/Problem11_label55.c [2019-11-15 23:40:07,455 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c0fb2568-b80f-49d3-a5a5-98c2eeae2c48/bin/uautomizer/data/68e171082/3321adba052940d298a904883155a29f/FLAGfacb045ac [2019-11-15 23:40:07,646 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_c0fb2568-b80f-49d3-a5a5-98c2eeae2c48/bin/uautomizer/data/68e171082/3321adba052940d298a904883155a29f [2019-11-15 23:40:07,649 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:40:07,650 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 23:40:07,651 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:40:07,651 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:40:07,655 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:40:07,655 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:40:07" (1/1) ... [2019-11-15 23:40:07,658 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d80e170 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:40:07, skipping insertion in model container [2019-11-15 23:40:07,658 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:40:07" (1/1) ... [2019-11-15 23:40:07,665 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:40:07,720 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:40:08,309 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:40:08,313 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:40:08,525 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:40:08,541 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:40:08,541 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:40:08 WrapperNode [2019-11-15 23:40:08,542 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:40:08,542 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 23:40:08,543 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 23:40:08,543 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 23:40:08,550 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:40:08" (1/1) ... [2019-11-15 23:40:08,574 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:40:08" (1/1) ... [2019-11-15 23:40:08,676 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 23:40:08,678 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:40:08,678 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:40:08,678 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:40:08,687 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:40:08" (1/1) ... [2019-11-15 23:40:08,687 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:40:08" (1/1) ... [2019-11-15 23:40:08,698 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:40:08" (1/1) ... [2019-11-15 23:40:08,699 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:40:08" (1/1) ... [2019-11-15 23:40:08,749 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:40:08" (1/1) ... [2019-11-15 23:40:08,771 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:40:08" (1/1) ... [2019-11-15 23:40:08,793 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:40:08" (1/1) ... [2019-11-15 23:40:08,810 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:40:08,810 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:40:08,810 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:40:08,811 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:40:08,811 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:40:08" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c0fb2568-b80f-49d3-a5a5-98c2eeae2c48/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-15 23:40:08,872 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:40:08,872 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:40:10,883 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:40:10,884 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-15 23:40:10,885 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:40:10 BoogieIcfgContainer [2019-11-15 23:40:10,885 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:40:10,886 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 23:40:10,887 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 23:40:10,889 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 23:40:10,890 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 11:40:07" (1/3) ... [2019-11-15 23:40:10,890 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52cc0615 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:40:10, skipping insertion in model container [2019-11-15 23:40:10,890 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:40:08" (2/3) ... [2019-11-15 23:40:10,891 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52cc0615 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:40:10, skipping insertion in model container [2019-11-15 23:40:10,891 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:40:10" (3/3) ... [2019-11-15 23:40:10,893 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem11_label55.c [2019-11-15 23:40:10,902 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 23:40:10,909 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 23:40:10,919 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 23:40:10,944 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 23:40:10,944 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 23:40:10,944 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 23:40:10,944 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:40:10,945 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:40:10,945 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 23:40:10,945 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:40:10,945 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 23:40:10,966 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states. [2019-11-15 23:40:10,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-15 23:40:10,973 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:40:10,974 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 23:40:10,975 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:40:10,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:40:10,981 INFO L82 PathProgramCache]: Analyzing trace with hash -2068820151, now seen corresponding path program 1 times [2019-11-15 23:40:10,989 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:40:10,990 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807126693] [2019-11-15 23:40:10,990 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:10,990 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:10,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:40:11,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:40:11,336 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-15 23:40:11,337 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807126693] [2019-11-15 23:40:11,338 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:40:11,338 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:40:11,339 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023255896] [2019-11-15 23:40:11,343 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:40:11,343 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:40:11,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:40:11,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:40:11,358 INFO L87 Difference]: Start difference. First operand 283 states. Second operand 4 states. [2019-11-15 23:40:13,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:40:13,667 INFO L93 Difference]: Finished difference Result 951 states and 1718 transitions. [2019-11-15 23:40:13,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:40:13,669 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2019-11-15 23:40:13,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:40:13,687 INFO L225 Difference]: With dead ends: 951 [2019-11-15 23:40:13,687 INFO L226 Difference]: Without dead ends: 600 [2019-11-15 23:40:13,691 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:40:13,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2019-11-15 23:40:13,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 410. [2019-11-15 23:40:13,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-11-15 23:40:13,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 593 transitions. [2019-11-15 23:40:13,758 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 593 transitions. Word has length 45 [2019-11-15 23:40:13,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:40:13,758 INFO L462 AbstractCegarLoop]: Abstraction has 410 states and 593 transitions. [2019-11-15 23:40:13,759 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:40:13,759 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 593 transitions. [2019-11-15 23:40:13,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-11-15 23:40:13,763 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:40:13,764 INFO L380 BasicCegarLoop]: trace histogram [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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:40:13,764 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:40:13,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:40:13,764 INFO L82 PathProgramCache]: Analyzing trace with hash -954308976, now seen corresponding path program 1 times [2019-11-15 23:40:13,765 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:40:13,765 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139386394] [2019-11-15 23:40:13,765 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:13,765 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:13,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:40:13,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:40:13,932 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:40:13,933 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139386394] [2019-11-15 23:40:13,933 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:40:13,933 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:40:13,934 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266408492] [2019-11-15 23:40:13,936 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:40:13,936 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:40:13,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:40:13,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:40:13,937 INFO L87 Difference]: Start difference. First operand 410 states and 593 transitions. Second operand 4 states. [2019-11-15 23:40:15,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:40:15,650 INFO L93 Difference]: Finished difference Result 1572 states and 2289 transitions. [2019-11-15 23:40:15,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:40:15,650 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2019-11-15 23:40:15,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:40:15,657 INFO L225 Difference]: With dead ends: 1572 [2019-11-15 23:40:15,658 INFO L226 Difference]: Without dead ends: 1164 [2019-11-15 23:40:15,660 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:40:15,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1164 states. [2019-11-15 23:40:15,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1164 to 1150. [2019-11-15 23:40:15,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1150 states. [2019-11-15 23:40:15,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1150 states to 1150 states and 1569 transitions. [2019-11-15 23:40:15,710 INFO L78 Accepts]: Start accepts. Automaton has 1150 states and 1569 transitions. Word has length 113 [2019-11-15 23:40:15,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:40:15,711 INFO L462 AbstractCegarLoop]: Abstraction has 1150 states and 1569 transitions. [2019-11-15 23:40:15,711 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:40:15,711 INFO L276 IsEmpty]: Start isEmpty. Operand 1150 states and 1569 transitions. [2019-11-15 23:40:15,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-15 23:40:15,717 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:40:15,717 INFO L380 BasicCegarLoop]: trace histogram [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, 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-15 23:40:15,717 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:40:15,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:40:15,718 INFO L82 PathProgramCache]: Analyzing trace with hash 1653006500, now seen corresponding path program 1 times [2019-11-15 23:40:15,718 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:40:15,718 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077923024] [2019-11-15 23:40:15,718 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:15,719 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:15,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:40:15,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:40:15,864 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:40:15,865 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077923024] [2019-11-15 23:40:15,865 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:40:15,865 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:40:15,866 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654886412] [2019-11-15 23:40:15,866 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:40:15,867 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:40:15,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:40:15,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:40:15,867 INFO L87 Difference]: Start difference. First operand 1150 states and 1569 transitions. Second operand 4 states. [2019-11-15 23:40:17,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:40:17,302 INFO L93 Difference]: Finished difference Result 3966 states and 5435 transitions. [2019-11-15 23:40:17,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:40:17,302 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2019-11-15 23:40:17,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:40:17,317 INFO L225 Difference]: With dead ends: 3966 [2019-11-15 23:40:17,317 INFO L226 Difference]: Without dead ends: 2818 [2019-11-15 23:40:17,320 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:40:17,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2818 states. [2019-11-15 23:40:17,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2818 to 2255. [2019-11-15 23:40:17,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2255 states. [2019-11-15 23:40:17,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2255 states to 2255 states and 2823 transitions. [2019-11-15 23:40:17,373 INFO L78 Accepts]: Start accepts. Automaton has 2255 states and 2823 transitions. Word has length 121 [2019-11-15 23:40:17,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:40:17,375 INFO L462 AbstractCegarLoop]: Abstraction has 2255 states and 2823 transitions. [2019-11-15 23:40:17,375 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:40:17,375 INFO L276 IsEmpty]: Start isEmpty. Operand 2255 states and 2823 transitions. [2019-11-15 23:40:17,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-11-15 23:40:17,384 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:40:17,385 INFO L380 BasicCegarLoop]: trace histogram [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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:40:17,385 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:40:17,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:40:17,385 INFO L82 PathProgramCache]: Analyzing trace with hash -1015853899, now seen corresponding path program 1 times [2019-11-15 23:40:17,385 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:40:17,385 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546055902] [2019-11-15 23:40:17,385 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:17,386 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:17,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:40:17,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:40:17,572 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:40:17,572 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546055902] [2019-11-15 23:40:17,572 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:40:17,572 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:40:17,573 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974254112] [2019-11-15 23:40:17,573 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:40:17,574 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:40:17,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:40:17,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:40:17,574 INFO L87 Difference]: Start difference. First operand 2255 states and 2823 transitions. Second operand 5 states. [2019-11-15 23:40:19,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:40:19,333 INFO L93 Difference]: Finished difference Result 7660 states and 9979 transitions. [2019-11-15 23:40:19,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:40:19,333 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 172 [2019-11-15 23:40:19,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:40:19,362 INFO L225 Difference]: With dead ends: 7660 [2019-11-15 23:40:19,363 INFO L226 Difference]: Without dead ends: 5591 [2019-11-15 23:40:19,367 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:40:19,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5591 states. [2019-11-15 23:40:19,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5591 to 5590. [2019-11-15 23:40:19,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5590 states. [2019-11-15 23:40:19,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5590 states to 5590 states and 7033 transitions. [2019-11-15 23:40:19,484 INFO L78 Accepts]: Start accepts. Automaton has 5590 states and 7033 transitions. Word has length 172 [2019-11-15 23:40:19,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:40:19,485 INFO L462 AbstractCegarLoop]: Abstraction has 5590 states and 7033 transitions. [2019-11-15 23:40:19,485 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:40:19,485 INFO L276 IsEmpty]: Start isEmpty. Operand 5590 states and 7033 transitions. [2019-11-15 23:40:19,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2019-11-15 23:40:19,491 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:40:19,492 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 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-15 23:40:19,492 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:40:19,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:40:19,492 INFO L82 PathProgramCache]: Analyzing trace with hash 1806172888, now seen corresponding path program 1 times [2019-11-15 23:40:19,492 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:40:19,493 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648502476] [2019-11-15 23:40:19,493 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:19,493 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:19,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:40:19,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:40:19,747 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-11-15 23:40:19,748 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648502476] [2019-11-15 23:40:19,748 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:40:19,748 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:40:19,748 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089309830] [2019-11-15 23:40:19,749 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:40:19,749 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:40:19,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:40:19,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:40:19,750 INFO L87 Difference]: Start difference. First operand 5590 states and 7033 transitions. Second operand 4 states. [2019-11-15 23:40:21,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:40:21,096 INFO L93 Difference]: Finished difference Result 12489 states and 15870 transitions. [2019-11-15 23:40:21,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:40:21,096 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 249 [2019-11-15 23:40:21,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:40:21,132 INFO L225 Difference]: With dead ends: 12489 [2019-11-15 23:40:21,132 INFO L226 Difference]: Without dead ends: 7085 [2019-11-15 23:40:21,139 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:40:21,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7085 states. [2019-11-15 23:40:21,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7085 to 6878. [2019-11-15 23:40:21,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6878 states. [2019-11-15 23:40:21,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6878 states to 6878 states and 8515 transitions. [2019-11-15 23:40:21,273 INFO L78 Accepts]: Start accepts. Automaton has 6878 states and 8515 transitions. Word has length 249 [2019-11-15 23:40:21,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:40:21,274 INFO L462 AbstractCegarLoop]: Abstraction has 6878 states and 8515 transitions. [2019-11-15 23:40:21,274 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:40:21,274 INFO L276 IsEmpty]: Start isEmpty. Operand 6878 states and 8515 transitions. [2019-11-15 23:40:21,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2019-11-15 23:40:21,286 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:40:21,287 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 23:40:21,287 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:40:21,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:40:21,288 INFO L82 PathProgramCache]: Analyzing trace with hash 1851926517, now seen corresponding path program 1 times [2019-11-15 23:40:21,288 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:40:21,288 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636909815] [2019-11-15 23:40:21,288 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:21,288 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:21,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:40:21,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:40:21,545 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 305 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-11-15 23:40:21,545 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636909815] [2019-11-15 23:40:21,546 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:40:21,546 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:40:21,546 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26330499] [2019-11-15 23:40:21,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:40:21,547 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:40:21,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:40:21,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:40:21,548 INFO L87 Difference]: Start difference. First operand 6878 states and 8515 transitions. Second operand 4 states. [2019-11-15 23:40:23,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:40:23,019 INFO L93 Difference]: Finished difference Result 15060 states and 18819 transitions. [2019-11-15 23:40:23,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:40:23,019 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 328 [2019-11-15 23:40:23,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:40:23,058 INFO L225 Difference]: With dead ends: 15060 [2019-11-15 23:40:23,058 INFO L226 Difference]: Without dead ends: 8368 [2019-11-15 23:40:23,066 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:40:23,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8368 states. [2019-11-15 23:40:23,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8368 to 8166. [2019-11-15 23:40:23,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8166 states. [2019-11-15 23:40:23,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8166 states to 8166 states and 9905 transitions. [2019-11-15 23:40:23,222 INFO L78 Accepts]: Start accepts. Automaton has 8166 states and 9905 transitions. Word has length 328 [2019-11-15 23:40:23,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:40:23,222 INFO L462 AbstractCegarLoop]: Abstraction has 8166 states and 9905 transitions. [2019-11-15 23:40:23,222 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:40:23,223 INFO L276 IsEmpty]: Start isEmpty. Operand 8166 states and 9905 transitions. [2019-11-15 23:40:23,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2019-11-15 23:40:23,235 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:40:23,236 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 23:40:23,236 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:40:23,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:40:23,243 INFO L82 PathProgramCache]: Analyzing trace with hash 976606001, now seen corresponding path program 1 times [2019-11-15 23:40:23,243 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:40:23,244 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799251418] [2019-11-15 23:40:23,244 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:23,244 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:23,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:40:23,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:40:23,544 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 292 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2019-11-15 23:40:23,545 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799251418] [2019-11-15 23:40:23,545 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:40:23,545 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:40:23,545 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911931352] [2019-11-15 23:40:23,546 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:40:23,546 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:40:23,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:40:23,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:40:23,546 INFO L87 Difference]: Start difference. First operand 8166 states and 9905 transitions. Second operand 3 states. [2019-11-15 23:40:24,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:40:24,571 INFO L93 Difference]: Finished difference Result 17072 states and 20672 transitions. [2019-11-15 23:40:24,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:40:24,572 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 337 [2019-11-15 23:40:24,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:40:24,605 INFO L225 Difference]: With dead ends: 17072 [2019-11-15 23:40:24,605 INFO L226 Difference]: Without dead ends: 8538 [2019-11-15 23:40:24,613 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:40:24,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8538 states. [2019-11-15 23:40:24,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8538 to 8167. [2019-11-15 23:40:24,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8167 states. [2019-11-15 23:40:24,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8167 states to 8167 states and 9716 transitions. [2019-11-15 23:40:24,733 INFO L78 Accepts]: Start accepts. Automaton has 8167 states and 9716 transitions. Word has length 337 [2019-11-15 23:40:24,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:40:24,734 INFO L462 AbstractCegarLoop]: Abstraction has 8167 states and 9716 transitions. [2019-11-15 23:40:24,734 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:40:24,735 INFO L276 IsEmpty]: Start isEmpty. Operand 8167 states and 9716 transitions. [2019-11-15 23:40:24,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2019-11-15 23:40:24,748 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:40:24,748 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 1, 1, 1, 1, 1, 1, 1, 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-15 23:40:24,748 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:40:24,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:40:24,749 INFO L82 PathProgramCache]: Analyzing trace with hash 162175160, now seen corresponding path program 1 times [2019-11-15 23:40:24,749 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:40:24,749 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104421747] [2019-11-15 23:40:24,750 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:24,750 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:24,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:40:24,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:40:25,139 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 0 proven. 209 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:40:25,140 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104421747] [2019-11-15 23:40:25,140 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1802523633] [2019-11-15 23:40:25,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c0fb2568-b80f-49d3-a5a5-98c2eeae2c48/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-15 23:40:25,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:40:25,279 INFO L256 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 23:40:25,309 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:40:25,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:40:25,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:40:25,971 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 166 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:40:25,971 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:40:25,972 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 10 [2019-11-15 23:40:25,972 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622288509] [2019-11-15 23:40:25,973 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 23:40:25,973 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:40:25,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 23:40:25,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:40:25,974 INFO L87 Difference]: Start difference. First operand 8167 states and 9716 transitions. Second operand 10 states. [2019-11-15 23:40:38,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:40:38,466 INFO L93 Difference]: Finished difference Result 41479 states and 49499 transitions. [2019-11-15 23:40:38,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-11-15 23:40:38,466 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 343 [2019-11-15 23:40:38,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:40:38,531 INFO L225 Difference]: With dead ends: 41479 [2019-11-15 23:40:38,532 INFO L226 Difference]: Without dead ends: 33498 [2019-11-15 23:40:38,543 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 364 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=327, Invalid=863, Unknown=0, NotChecked=0, Total=1190 [2019-11-15 23:40:38,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33498 states. [2019-11-15 23:40:39,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33498 to 27389. [2019-11-15 23:40:39,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27389 states. [2019-11-15 23:40:39,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27389 states to 27389 states and 31496 transitions. [2019-11-15 23:40:39,077 INFO L78 Accepts]: Start accepts. Automaton has 27389 states and 31496 transitions. Word has length 343 [2019-11-15 23:40:39,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:40:39,078 INFO L462 AbstractCegarLoop]: Abstraction has 27389 states and 31496 transitions. [2019-11-15 23:40:39,078 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 23:40:39,078 INFO L276 IsEmpty]: Start isEmpty. Operand 27389 states and 31496 transitions. [2019-11-15 23:40:39,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2019-11-15 23:40:39,107 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:40:39,107 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:40:39,314 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:40:39,315 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:40:39,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:40:39,315 INFO L82 PathProgramCache]: Analyzing trace with hash -1310153897, now seen corresponding path program 1 times [2019-11-15 23:40:39,315 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:40:39,316 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226989760] [2019-11-15 23:40:39,316 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:39,316 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:39,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:40:39,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:40:40,279 INFO L134 CoverageAnalysis]: Checked inductivity of 412 backedges. 0 proven. 412 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:40:40,280 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226989760] [2019-11-15 23:40:40,281 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1254118285] [2019-11-15 23:40:40,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c0fb2568-b80f-49d3-a5a5-98c2eeae2c48/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-15 23:40:40,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:40:40,409 INFO L256 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-15 23:40:40,420 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:40:40,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:40:40,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:40:40,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:40:40,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:40:40,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:40:40,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:40:40,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:40:40,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:40:40,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:40:40,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:40:40,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:40:40,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:40:40,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:40:40,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:40:40,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:40:40,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:40:40,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:40:40,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:40:40,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:40:40,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:40:40,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:40:40,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:40:40,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:40:40,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:40:40,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:40:40,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:40:40,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:40:40,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:40:40,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:40:41,387 WARN L191 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 26 [2019-11-15 23:40:41,828 INFO L134 CoverageAnalysis]: Checked inductivity of 412 backedges. 0 proven. 307 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-11-15 23:40:41,828 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:40:41,829 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4] total 10 [2019-11-15 23:40:41,829 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454606637] [2019-11-15 23:40:41,830 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-15 23:40:41,830 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:40:41,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-15 23:40:41,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-11-15 23:40:41,831 INFO L87 Difference]: Start difference. First operand 27389 states and 31496 transitions. Second operand 11 states. [2019-11-15 23:40:53,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:40:53,099 INFO L93 Difference]: Finished difference Result 67562 states and 77913 transitions. [2019-11-15 23:40:53,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-15 23:40:53,100 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 353 [2019-11-15 23:40:53,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:40:53,165 INFO L225 Difference]: With dead ends: 67562 [2019-11-15 23:40:53,166 INFO L226 Difference]: Without dead ends: 40359 [2019-11-15 23:40:53,199 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 371 GetRequests, 350 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=101, Invalid=361, Unknown=0, NotChecked=0, Total=462 [2019-11-15 23:40:53,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40359 states. [2019-11-15 23:40:53,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40359 to 26278. [2019-11-15 23:40:53,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26278 states. [2019-11-15 23:40:53,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26278 states to 26278 states and 29447 transitions. [2019-11-15 23:40:53,810 INFO L78 Accepts]: Start accepts. Automaton has 26278 states and 29447 transitions. Word has length 353 [2019-11-15 23:40:53,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:40:53,810 INFO L462 AbstractCegarLoop]: Abstraction has 26278 states and 29447 transitions. [2019-11-15 23:40:53,811 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-15 23:40:53,811 INFO L276 IsEmpty]: Start isEmpty. Operand 26278 states and 29447 transitions. [2019-11-15 23:40:53,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 432 [2019-11-15 23:40:53,846 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:40:53,847 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-15 23:40:54,048 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:40:54,048 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:40:54,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:40:54,048 INFO L82 PathProgramCache]: Analyzing trace with hash 273234903, now seen corresponding path program 1 times [2019-11-15 23:40:54,049 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:40:54,049 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434193116] [2019-11-15 23:40:54,049 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:54,049 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:54,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:40:54,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:40:54,404 INFO L134 CoverageAnalysis]: Checked inductivity of 692 backedges. 570 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2019-11-15 23:40:54,404 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434193116] [2019-11-15 23:40:54,404 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:40:54,404 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:40:54,405 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368173656] [2019-11-15 23:40:54,405 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:40:54,405 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:40:54,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:40:54,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:40:54,406 INFO L87 Difference]: Start difference. First operand 26278 states and 29447 transitions. Second operand 4 states. [2019-11-15 23:40:55,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:40:55,831 INFO L93 Difference]: Finished difference Result 50728 states and 56908 transitions. [2019-11-15 23:40:55,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:40:55,831 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 431 [2019-11-15 23:40:55,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:40:55,859 INFO L225 Difference]: With dead ends: 50728 [2019-11-15 23:40:55,859 INFO L226 Difference]: Without dead ends: 26852 [2019-11-15 23:40:55,874 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:40:55,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26852 states. [2019-11-15 23:40:56,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26852 to 24802. [2019-11-15 23:40:56,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24802 states. [2019-11-15 23:40:56,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24802 states to 24802 states and 27654 transitions. [2019-11-15 23:40:56,201 INFO L78 Accepts]: Start accepts. Automaton has 24802 states and 27654 transitions. Word has length 431 [2019-11-15 23:40:56,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:40:56,202 INFO L462 AbstractCegarLoop]: Abstraction has 24802 states and 27654 transitions. [2019-11-15 23:40:56,202 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:40:56,202 INFO L276 IsEmpty]: Start isEmpty. Operand 24802 states and 27654 transitions. [2019-11-15 23:40:56,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 468 [2019-11-15 23:40:56,234 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:40:56,235 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 23:40:56,235 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:40:56,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:40:56,236 INFO L82 PathProgramCache]: Analyzing trace with hash -268191883, now seen corresponding path program 1 times [2019-11-15 23:40:56,236 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:40:56,236 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115569062] [2019-11-15 23:40:56,236 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:56,236 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:56,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:40:56,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:40:56,825 INFO L134 CoverageAnalysis]: Checked inductivity of 700 backedges. 387 proven. 0 refuted. 0 times theorem prover too weak. 313 trivial. 0 not checked. [2019-11-15 23:40:56,825 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115569062] [2019-11-15 23:40:56,825 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:40:56,826 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:40:56,826 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406558369] [2019-11-15 23:40:56,826 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:40:56,827 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:40:56,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:40:56,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:40:56,827 INFO L87 Difference]: Start difference. First operand 24802 states and 27654 transitions. Second operand 3 states. [2019-11-15 23:40:57,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:40:57,884 INFO L93 Difference]: Finished difference Result 49772 states and 55451 transitions. [2019-11-15 23:40:57,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:40:57,884 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 467 [2019-11-15 23:40:57,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:40:57,908 INFO L225 Difference]: With dead ends: 49772 [2019-11-15 23:40:57,909 INFO L226 Difference]: Without dead ends: 22024 [2019-11-15 23:40:57,924 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:40:57,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22024 states. [2019-11-15 23:40:58,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22024 to 19443. [2019-11-15 23:40:58,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19443 states. [2019-11-15 23:40:58,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19443 states to 19443 states and 21088 transitions. [2019-11-15 23:40:58,203 INFO L78 Accepts]: Start accepts. Automaton has 19443 states and 21088 transitions. Word has length 467 [2019-11-15 23:40:58,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:40:58,204 INFO L462 AbstractCegarLoop]: Abstraction has 19443 states and 21088 transitions. [2019-11-15 23:40:58,204 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:40:58,204 INFO L276 IsEmpty]: Start isEmpty. Operand 19443 states and 21088 transitions. [2019-11-15 23:40:58,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 563 [2019-11-15 23:40:58,234 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:40:58,234 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1] [2019-11-15 23:40:58,235 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:40:58,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:40:58,235 INFO L82 PathProgramCache]: Analyzing trace with hash -1445886331, now seen corresponding path program 1 times [2019-11-15 23:40:58,236 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:40:58,236 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491917193] [2019-11-15 23:40:58,236 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:58,236 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:58,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:40:58,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:40:59,124 INFO L134 CoverageAnalysis]: Checked inductivity of 803 backedges. 477 proven. 176 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2019-11-15 23:40:59,125 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491917193] [2019-11-15 23:40:59,125 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [377306246] [2019-11-15 23:40:59,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c0fb2568-b80f-49d3-a5a5-98c2eeae2c48/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-15 23:40:59,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:40:59,301 INFO L256 TraceCheckSpWp]: Trace formula consists of 716 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-15 23:40:59,310 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:40:59,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:40:59,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:40:59,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:40:59,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:06,281 WARN L191 SmtUtils]: Spent 6.69 s on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2019-11-15 23:41:06,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:06,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:06,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:07,857 INFO L134 CoverageAnalysis]: Checked inductivity of 803 backedges. 261 proven. 392 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2019-11-15 23:41:07,858 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:41:07,858 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4] total 11 [2019-11-15 23:41:07,858 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300449174] [2019-11-15 23:41:07,860 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-15 23:41:07,860 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:41:07,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-15 23:41:07,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-11-15 23:41:07,861 INFO L87 Difference]: Start difference. First operand 19443 states and 21088 transitions. Second operand 11 states. [2019-11-15 23:41:15,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:41:15,921 INFO L93 Difference]: Finished difference Result 41467 states and 45227 transitions. [2019-11-15 23:41:15,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-15 23:41:15,923 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 562 [2019-11-15 23:41:15,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:41:15,947 INFO L225 Difference]: With dead ends: 41467 [2019-11-15 23:41:15,947 INFO L226 Difference]: Without dead ends: 22210 [2019-11-15 23:41:15,959 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 589 GetRequests, 569 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-11-15 23:41:15,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22210 states. [2019-11-15 23:41:16,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22210 to 12940. [2019-11-15 23:41:16,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12940 states. [2019-11-15 23:41:16,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12940 states to 12940 states and 14046 transitions. [2019-11-15 23:41:16,183 INFO L78 Accepts]: Start accepts. Automaton has 12940 states and 14046 transitions. Word has length 562 [2019-11-15 23:41:16,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:41:16,184 INFO L462 AbstractCegarLoop]: Abstraction has 12940 states and 14046 transitions. [2019-11-15 23:41:16,184 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-15 23:41:16,185 INFO L276 IsEmpty]: Start isEmpty. Operand 12940 states and 14046 transitions. [2019-11-15 23:41:16,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 583 [2019-11-15 23:41:16,196 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:41:16,196 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:41:16,400 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:41:16,401 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:41:16,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:41:16,402 INFO L82 PathProgramCache]: Analyzing trace with hash -933871913, now seen corresponding path program 1 times [2019-11-15 23:41:16,402 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:41:16,402 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817800487] [2019-11-15 23:41:16,402 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:41:16,402 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:41:16,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:41:16,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:41:17,265 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 678 proven. 176 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2019-11-15 23:41:17,266 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817800487] [2019-11-15 23:41:17,266 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [996235541] [2019-11-15 23:41:17,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c0fb2568-b80f-49d3-a5a5-98c2eeae2c48/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-15 23:41:17,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:41:17,411 INFO L256 TraceCheckSpWp]: Trace formula consists of 762 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-15 23:41:17,418 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:41:17,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:17,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:17,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:17,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:17,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:17,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:18,969 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 765 proven. 89 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2019-11-15 23:41:18,970 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:41:18,970 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 13 [2019-11-15 23:41:18,970 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479427493] [2019-11-15 23:41:18,971 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-15 23:41:18,971 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:41:18,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-15 23:41:18,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-11-15 23:41:18,972 INFO L87 Difference]: Start difference. First operand 12940 states and 14046 transitions. Second operand 13 states. [2019-11-15 23:41:23,312 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2019-11-15 23:41:30,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:41:30,816 INFO L93 Difference]: Finished difference Result 35006 states and 37966 transitions. [2019-11-15 23:41:30,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-11-15 23:41:30,816 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 582 [2019-11-15 23:41:30,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:41:30,817 INFO L225 Difference]: With dead ends: 35006 [2019-11-15 23:41:30,817 INFO L226 Difference]: Without dead ends: 0 [2019-11-15 23:41:30,827 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 650 GetRequests, 606 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 516 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=397, Invalid=1583, Unknown=0, NotChecked=0, Total=1980 [2019-11-15 23:41:30,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-15 23:41:30,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-15 23:41:30,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-15 23:41:30,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 23:41:30,828 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 582 [2019-11-15 23:41:30,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:41:30,828 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:41:30,828 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-15 23:41:30,829 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-15 23:41:30,829 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-15 23:41:31,032 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:41:31,036 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-15 23:41:32,351 WARN L191 SmtUtils]: Spent 1.31 s on a formula simplification. DAG size of input: 740 DAG size of output: 539 [2019-11-15 23:41:33,544 WARN L191 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 740 DAG size of output: 539 [2019-11-15 23:41:37,840 WARN L191 SmtUtils]: Spent 4.29 s on a formula simplification. DAG size of input: 515 DAG size of output: 152 [2019-11-15 23:41:41,848 WARN L191 SmtUtils]: Spent 4.00 s on a formula simplification. DAG size of input: 515 DAG size of output: 152 [2019-11-15 23:41:41,850 INFO L443 ceAbstractionStarter]: For program point L168(line 168) no Hoare annotation was computed. [2019-11-15 23:41:41,850 INFO L443 ceAbstractionStarter]: For program point L102(line 102) no Hoare annotation was computed. [2019-11-15 23:41:41,850 INFO L443 ceAbstractionStarter]: For program point L36(line 36) no Hoare annotation was computed. [2019-11-15 23:41:41,850 INFO L446 ceAbstractionStarter]: At program point L1028(lines 1028 1044) the Hoare annotation is: true [2019-11-15 23:41:41,850 INFO L443 ceAbstractionStarter]: For program point L566(lines 566 1024) no Hoare annotation was computed. [2019-11-15 23:41:41,850 INFO L443 ceAbstractionStarter]: For program point L500(lines 500 1024) no Hoare annotation was computed. [2019-11-15 23:41:41,850 INFO L443 ceAbstractionStarter]: For program point L170-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:41:41,850 INFO L443 ceAbstractionStarter]: For program point L104-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:41:41,851 INFO L443 ceAbstractionStarter]: For program point L38-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:41:41,851 INFO L443 ceAbstractionStarter]: For program point L963(lines 963 1024) no Hoare annotation was computed. [2019-11-15 23:41:41,851 INFO L443 ceAbstractionStarter]: For program point L831(lines 831 1024) no Hoare annotation was computed. [2019-11-15 23:41:41,851 INFO L443 ceAbstractionStarter]: For program point L171(line 171) no Hoare annotation was computed. [2019-11-15 23:41:41,851 INFO L443 ceAbstractionStarter]: For program point L105(line 105) no Hoare annotation was computed. [2019-11-15 23:41:41,851 INFO L443 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2019-11-15 23:41:41,851 INFO L443 ceAbstractionStarter]: For program point L898(lines 898 1024) no Hoare annotation was computed. [2019-11-15 23:41:41,851 INFO L443 ceAbstractionStarter]: For program point L436(lines 436 1024) no Hoare annotation was computed. [2019-11-15 23:41:41,851 INFO L443 ceAbstractionStarter]: For program point L370(lines 370 1024) no Hoare annotation was computed. [2019-11-15 23:41:41,851 INFO L443 ceAbstractionStarter]: For program point L635(lines 635 1024) no Hoare annotation was computed. [2019-11-15 23:41:41,851 INFO L443 ceAbstractionStarter]: For program point L305(lines 305 1024) no Hoare annotation was computed. [2019-11-15 23:41:41,851 INFO L443 ceAbstractionStarter]: For program point L173-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:41:41,852 INFO L443 ceAbstractionStarter]: For program point L107-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:41:41,852 INFO L443 ceAbstractionStarter]: For program point L41-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:41:41,852 INFO L443 ceAbstractionStarter]: For program point L240(lines 240 1024) no Hoare annotation was computed. [2019-11-15 23:41:41,852 INFO L443 ceAbstractionStarter]: For program point L174(line 174) no Hoare annotation was computed. [2019-11-15 23:41:41,852 INFO L443 ceAbstractionStarter]: For program point L108(line 108) no Hoare annotation was computed. [2019-11-15 23:41:41,852 INFO L443 ceAbstractionStarter]: For program point L42(line 42) no Hoare annotation was computed. [2019-11-15 23:41:41,852 INFO L443 ceAbstractionStarter]: For program point L769(lines 769 1024) no Hoare annotation was computed. [2019-11-15 23:41:41,852 INFO L439 ceAbstractionStarter]: At program point L1034-2(lines 1034 1043) the Hoare annotation is: (let ((.cse16 (= ~a25~0 13)) (.cse26 (<= ~a29~0 140))) (let ((.cse14 (<= ~a23~0 312)) (.cse9 (and (not .cse16) .cse26)) (.cse25 (< 245 ~a29~0)) (.cse27 (< 306 ~a23~0)) (.cse8 (<= ~a23~0 138)) (.cse19 (= ~a25~0 9))) (let ((.cse6 (<= 0 (+ ~a23~0 599772))) (.cse0 (and (not .cse19) (<= 312 ~a23~0))) (.cse12 (or .cse27 .cse8)) (.cse20 (<= 141 ~a29~0)) (.cse15 (or (<= ~a29~0 243) .cse25)) (.cse10 (<= (+ ~a29~0 193245) 0)) (.cse21 (and .cse14 .cse19 .cse9)) (.cse11 (= 1 ~a4~0)) (.cse7 (= 12 ~a25~0)) (.cse4 (<= 130 ~a29~0)) (.cse5 (exists ((v_~a29~0_501 Int)) (and (<= ~a29~0 (+ (mod (+ v_~a29~0_501 26) 52) 192)) (<= 130 v_~a29~0_501) (<= 0 (+ v_~a29~0_501 370578))))) (.cse13 (= ~a25~0 11)) (.cse17 (= 10 ~a25~0)) (.cse1 (= 1 ~a3~0)) (.cse2 (= ~a4~0 1)) (.cse18 (<= ~a29~0 277)) (.cse3 (= 15 ~a8~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse2 (and .cse6 .cse7 .cse8 .cse9)) (and .cse10 .cse1 .cse3 .cse7) (and (<= (+ ~a29~0 181700) ~a23~0) .cse3 .cse11 .cse4 .cse5 .cse1) (and .cse6 .cse1 .cse8 .cse3) (and (exists ((v_~a29~0_504 Int)) (and (<= ~a29~0 (+ (div v_~a29~0_504 5) 206649)) (<= 0 v_~a29~0_504) (<= v_~a29~0_504 140))) (<= 13 ~a25~0) .cse1 .cse12 .cse6 .cse3 .cse11) (and .cse6 .cse2 .cse8 .cse13) (and .cse14 .cse7 .cse1 .cse2 .cse3) (and .cse15 .cse1 .cse8 .cse3 .cse13) (and .cse1 .cse3 (and .cse16 .cse2 (<= ~a29~0 130))) (and (and .cse1 .cse2 .cse17) .cse3 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse13 .cse4) (and .cse2 .cse8 .cse17) (and .cse15 .cse1 .cse19 .cse2 .cse3 .cse20) (and (and .cse1 .cse21) .cse12 .cse3) (and .cse1 (and .cse15 .cse14 .cse2 .cse13) .cse3) (and (and .cse2 .cse17) .cse1 .cse12 .cse3) (and (<= ~a29~0 206673) .cse16 (< 0 (+ ~a23~0 43)) .cse1 .cse3 .cse20 .cse11) (and .cse15 .cse19 .cse1 .cse8 .cse3) (and .cse19 .cse8 .cse11) (and (and (and (exists ((v_~a23~0_472 Int)) (let ((.cse24 (div v_~a23~0_472 5))) (let ((.cse23 (+ .cse24 371130))) (let ((.cse22 (div .cse23 5))) (and (<= 0 (+ .cse22 1)) (<= 0 v_~a23~0_472) (<= 0 .cse23) (<= 312 v_~a23~0_472) (< 0 (+ .cse24 370824)) (<= (+ ~a23~0 127612) (div .cse22 5)) (<= 0 .cse22) (<= v_~a23~0_472 312)))))) .cse9) .cse13) .cse2) (and .cse10 .cse1 .cse2 .cse3 .cse13) (and .cse7 .cse1 .cse3 .cse18 .cse25) (and .cse16 .cse2 .cse8 .cse18) (and .cse7 .cse1 .cse8 .cse3) (and .cse21 .cse11) (and .cse7 .cse1 .cse3 .cse4 .cse5) (and .cse2 .cse8 .cse18 .cse25 .cse13) (and .cse1 (and .cse17 .cse26) .cse3) (and .cse1 (and .cse2 (and .cse27 .cse18 .cse25)) .cse3))))) [2019-11-15 23:41:41,852 INFO L443 ceAbstractionStarter]: For program point L836(lines 836 1024) no Hoare annotation was computed. [2019-11-15 23:41:41,852 INFO L443 ceAbstractionStarter]: For program point L572(lines 572 1024) no Hoare annotation was computed. [2019-11-15 23:41:41,852 INFO L443 ceAbstractionStarter]: For program point L176-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:41:41,852 INFO L443 ceAbstractionStarter]: For program point L110-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:41:41,853 INFO L443 ceAbstractionStarter]: For program point L44-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:41:41,853 INFO L443 ceAbstractionStarter]: For program point L969(lines 969 1024) no Hoare annotation was computed. [2019-11-15 23:41:41,853 INFO L443 ceAbstractionStarter]: For program point L903(lines 903 1024) no Hoare annotation was computed. [2019-11-15 23:41:41,853 INFO L443 ceAbstractionStarter]: For program point L507(lines 507 1024) no Hoare annotation was computed. [2019-11-15 23:41:41,853 INFO L443 ceAbstractionStarter]: For program point L177(line 177) no Hoare annotation was computed. [2019-11-15 23:41:41,853 INFO L443 ceAbstractionStarter]: For program point L111(line 111) no Hoare annotation was computed. [2019-11-15 23:41:41,853 INFO L443 ceAbstractionStarter]: For program point L45(line 45) no Hoare annotation was computed. [2019-11-15 23:41:41,853 INFO L443 ceAbstractionStarter]: For program point L970(lines 970 980) no Hoare annotation was computed. [2019-11-15 23:41:41,853 INFO L443 ceAbstractionStarter]: For program point L904(lines 904 914) no Hoare annotation was computed. [2019-11-15 23:41:41,853 INFO L443 ceAbstractionStarter]: For program point L970-2(lines 970 980) no Hoare annotation was computed. [2019-11-15 23:41:41,853 INFO L443 ceAbstractionStarter]: For program point L904-2(lines 904 914) no Hoare annotation was computed. [2019-11-15 23:41:41,853 INFO L443 ceAbstractionStarter]: For program point L706(lines 706 1024) no Hoare annotation was computed. [2019-11-15 23:41:41,853 INFO L443 ceAbstractionStarter]: For program point L310(lines 310 1024) no Hoare annotation was computed. [2019-11-15 23:41:41,854 INFO L443 ceAbstractionStarter]: For program point L575(lines 575 1024) no Hoare annotation was computed. [2019-11-15 23:41:41,854 INFO L443 ceAbstractionStarter]: For program point L443(lines 443 1024) no Hoare annotation was computed. [2019-11-15 23:41:41,854 INFO L443 ceAbstractionStarter]: For program point L377(lines 377 1024) no Hoare annotation was computed. [2019-11-15 23:41:41,854 INFO L443 ceAbstractionStarter]: For program point L179-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:41:41,854 INFO L443 ceAbstractionStarter]: For program point L113-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:41:41,854 INFO L443 ceAbstractionStarter]: For program point L47-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:41:41,854 INFO L443 ceAbstractionStarter]: For program point L774(lines 774 1024) no Hoare annotation was computed. [2019-11-15 23:41:41,854 INFO L443 ceAbstractionStarter]: For program point L642(lines 642 1024) no Hoare annotation was computed. [2019-11-15 23:41:41,854 INFO L443 ceAbstractionStarter]: For program point L180(line 180) no Hoare annotation was computed. [2019-11-15 23:41:41,854 INFO L443 ceAbstractionStarter]: For program point L114(line 114) no Hoare annotation was computed. [2019-11-15 23:41:41,854 INFO L443 ceAbstractionStarter]: For program point L48(line 48) no Hoare annotation was computed. [2019-11-15 23:41:41,854 INFO L443 ceAbstractionStarter]: For program point L1039(line 1039) no Hoare annotation was computed. [2019-11-15 23:41:41,854 INFO L443 ceAbstractionStarter]: For program point L841(lines 841 1024) no Hoare annotation was computed. [2019-11-15 23:41:41,855 INFO L443 ceAbstractionStarter]: For program point L247(lines 247 1024) no Hoare annotation was computed. [2019-11-15 23:41:41,855 INFO L443 ceAbstractionStarter]: For program point L182-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:41:41,855 INFO L443 ceAbstractionStarter]: For program point L116-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:41:41,855 INFO L443 ceAbstractionStarter]: For program point L50-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:41:41,855 INFO L443 ceAbstractionStarter]: For program point L183(line 183) no Hoare annotation was computed. [2019-11-15 23:41:41,855 INFO L443 ceAbstractionStarter]: For program point L117(line 117) no Hoare annotation was computed. [2019-11-15 23:41:41,855 INFO L443 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2019-11-15 23:41:41,855 INFO L443 ceAbstractionStarter]: For program point L712(lines 712 1024) no Hoare annotation was computed. [2019-11-15 23:41:41,855 INFO L443 ceAbstractionStarter]: For program point L514(lines 514 1024) no Hoare annotation was computed. [2019-11-15 23:41:41,855 INFO L443 ceAbstractionStarter]: For program point L647(lines 647 1024) no Hoare annotation was computed. [2019-11-15 23:41:41,855 INFO L443 ceAbstractionStarter]: For program point L581(lines 581 1024) no Hoare annotation was computed. [2019-11-15 23:41:41,855 INFO L443 ceAbstractionStarter]: For program point L515(lines 515 525) no Hoare annotation was computed. [2019-11-15 23:41:41,856 INFO L443 ceAbstractionStarter]: For program point L515-2(lines 515 525) no Hoare annotation was computed. [2019-11-15 23:41:41,856 INFO L443 ceAbstractionStarter]: For program point L317(lines 317 1024) no Hoare annotation was computed. [2019-11-15 23:41:41,856 INFO L443 ceAbstractionStarter]: For program point L185-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:41:41,856 INFO L443 ceAbstractionStarter]: For program point L119-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:41:41,856 INFO L443 ceAbstractionStarter]: For program point L53-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:41:41,856 INFO L443 ceAbstractionStarter]: For program point L846(lines 846 1024) no Hoare annotation was computed. [2019-11-15 23:41:41,856 INFO L443 ceAbstractionStarter]: For program point L780(lines 780 1024) no Hoare annotation was computed. [2019-11-15 23:41:41,856 INFO L443 ceAbstractionStarter]: For program point L648(lines 648 657) no Hoare annotation was computed. [2019-11-15 23:41:41,856 INFO L443 ceAbstractionStarter]: For program point L648-2(lines 648 657) no Hoare annotation was computed. [2019-11-15 23:41:41,856 INFO L443 ceAbstractionStarter]: For program point L450(lines 450 1024) no Hoare annotation was computed. [2019-11-15 23:41:41,856 INFO L443 ceAbstractionStarter]: For program point L384(lines 384 1024) no Hoare annotation was computed. [2019-11-15 23:41:41,856 INFO L443 ceAbstractionStarter]: For program point L186(line 186) no Hoare annotation was computed. [2019-11-15 23:41:41,856 INFO L443 ceAbstractionStarter]: For program point L120(line 120) no Hoare annotation was computed. [2019-11-15 23:41:41,857 INFO L443 ceAbstractionStarter]: For program point L54(line 54) no Hoare annotation was computed. [2019-11-15 23:41:41,857 INFO L443 ceAbstractionStarter]: For program point L254(lines 254 1024) no Hoare annotation was computed. [2019-11-15 23:41:41,857 INFO L443 ceAbstractionStarter]: For program point L188-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:41:41,857 INFO L443 ceAbstractionStarter]: For program point L122-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:41:41,857 INFO L443 ceAbstractionStarter]: For program point L56-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:41:41,857 INFO L443 ceAbstractionStarter]: For program point L981(lines 981 1024) no Hoare annotation was computed. [2019-11-15 23:41:41,857 INFO L443 ceAbstractionStarter]: For program point L915(lines 915 1024) no Hoare annotation was computed. [2019-11-15 23:41:41,857 INFO L443 ceAbstractionStarter]: For program point L717(lines 717 1024) no Hoare annotation was computed. [2019-11-15 23:41:41,857 INFO L443 ceAbstractionStarter]: For program point L189(line 189) no Hoare annotation was computed. [2019-11-15 23:41:41,857 INFO L443 ceAbstractionStarter]: For program point L123(line 123) no Hoare annotation was computed. [2019-11-15 23:41:41,857 INFO L443 ceAbstractionStarter]: For program point L57(line 57) no Hoare annotation was computed. [2019-11-15 23:41:41,857 INFO L443 ceAbstractionStarter]: For program point L916(lines 916 926) no Hoare annotation was computed. [2019-11-15 23:41:41,857 INFO L443 ceAbstractionStarter]: For program point L916-2(lines 916 926) no Hoare annotation was computed. [2019-11-15 23:41:41,858 INFO L443 ceAbstractionStarter]: For program point L718(lines 718 730) no Hoare annotation was computed. [2019-11-15 23:41:41,858 INFO L443 ceAbstractionStarter]: For program point L718-2(lines 718 730) no Hoare annotation was computed. [2019-11-15 23:41:41,858 INFO L443 ceAbstractionStarter]: For program point L586(lines 586 1024) no Hoare annotation was computed. [2019-11-15 23:41:41,858 INFO L443 ceAbstractionStarter]: For program point L322(lines 322 1024) no Hoare annotation was computed. [2019-11-15 23:41:41,858 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-15 23:41:41,858 INFO L443 ceAbstractionStarter]: For program point L587(lines 587 597) no Hoare annotation was computed. [2019-11-15 23:41:41,858 INFO L443 ceAbstractionStarter]: For program point L587-2(lines 587 597) no Hoare annotation was computed. [2019-11-15 23:41:41,858 INFO L443 ceAbstractionStarter]: For program point L191-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:41:41,858 INFO L443 ceAbstractionStarter]: For program point L125-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:41:41,858 INFO L443 ceAbstractionStarter]: For program point L59-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:41:41,858 INFO L443 ceAbstractionStarter]: For program point L852(lines 852 1024) no Hoare annotation was computed. [2019-11-15 23:41:41,858 INFO L443 ceAbstractionStarter]: For program point L456(lines 456 1024) no Hoare annotation was computed. [2019-11-15 23:41:41,859 INFO L443 ceAbstractionStarter]: For program point L192(line 192) no Hoare annotation was computed. [2019-11-15 23:41:41,859 INFO L443 ceAbstractionStarter]: For program point L126(line 126) no Hoare annotation was computed. [2019-11-15 23:41:41,859 INFO L443 ceAbstractionStarter]: For program point L60(line 60) no Hoare annotation was computed. [2019-11-15 23:41:41,859 INFO L443 ceAbstractionStarter]: For program point L787(lines 787 1024) no Hoare annotation was computed. [2019-11-15 23:41:41,859 INFO L443 ceAbstractionStarter]: For program point L391(lines 391 1024) no Hoare annotation was computed. [2019-11-15 23:41:41,859 INFO L443 ceAbstractionStarter]: For program point L260(lines 260 1024) no Hoare annotation was computed. [2019-11-15 23:41:41,859 INFO L443 ceAbstractionStarter]: For program point L194-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:41:41,859 INFO L443 ceAbstractionStarter]: For program point L128-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:41:41,859 INFO L443 ceAbstractionStarter]: For program point L62-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:41:41,859 INFO L443 ceAbstractionStarter]: For program point L195(line 195) no Hoare annotation was computed. [2019-11-15 23:41:41,859 INFO L443 ceAbstractionStarter]: For program point L129(line 129) no Hoare annotation was computed. [2019-11-15 23:41:41,859 INFO L443 ceAbstractionStarter]: For program point L63(line 63) no Hoare annotation was computed. [2019-11-15 23:41:41,859 INFO L443 ceAbstractionStarter]: For program point L988(lines 988 1024) no Hoare annotation was computed. [2019-11-15 23:41:41,860 INFO L443 ceAbstractionStarter]: For program point L658(lines 658 1024) no Hoare annotation was computed. [2019-11-15 23:41:41,860 INFO L443 ceAbstractionStarter]: For program point L526(lines 526 1024) no Hoare annotation was computed. [2019-11-15 23:41:41,860 INFO L443 ceAbstractionStarter]: For program point L329(lines 329 1024) no Hoare annotation was computed. [2019-11-15 23:41:41,860 INFO L443 ceAbstractionStarter]: For program point L197-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:41:41,860 INFO L443 ceAbstractionStarter]: For program point L131-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:41:41,860 INFO L443 ceAbstractionStarter]: For program point L65-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:41:41,860 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-15 23:41:41,860 INFO L443 ceAbstractionStarter]: For program point L792(lines 792 1024) no Hoare annotation was computed. [2019-11-15 23:41:41,860 INFO L443 ceAbstractionStarter]: For program point L198(line 198) no Hoare annotation was computed. [2019-11-15 23:41:41,860 INFO L443 ceAbstractionStarter]: For program point L132(line 132) no Hoare annotation was computed. [2019-11-15 23:41:41,860 INFO L443 ceAbstractionStarter]: For program point L66(line 66) no Hoare annotation was computed. [2019-11-15 23:41:41,860 INFO L443 ceAbstractionStarter]: For program point L859(lines 859 1024) no Hoare annotation was computed. [2019-11-15 23:41:41,861 INFO L443 ceAbstractionStarter]: For program point L463(lines 463 1024) no Hoare annotation was computed. [2019-11-15 23:41:41,861 INFO L443 ceAbstractionStarter]: For program point L265(lines 265 1024) no Hoare annotation was computed. [2019-11-15 23:41:41,861 INFO L443 ceAbstractionStarter]: For program point L398(lines 398 1024) no Hoare annotation was computed. [2019-11-15 23:41:41,861 INFO L443 ceAbstractionStarter]: For program point L200-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:41:41,861 INFO L443 ceAbstractionStarter]: For program point L134-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:41:41,861 INFO L443 ceAbstractionStarter]: For program point L68-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:41:41,863 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 141) no Hoare annotation was computed. [2019-11-15 23:41:41,863 INFO L443 ceAbstractionStarter]: For program point L993(lines 993 1024) no Hoare annotation was computed. [2019-11-15 23:41:41,863 INFO L443 ceAbstractionStarter]: For program point L927(lines 927 1024) no Hoare annotation was computed. [2019-11-15 23:41:41,863 INFO L443 ceAbstractionStarter]: For program point L663(lines 663 1024) no Hoare annotation was computed. [2019-11-15 23:41:41,863 INFO L443 ceAbstractionStarter]: For program point L531(lines 531 1024) no Hoare annotation was computed. [2019-11-15 23:41:41,863 INFO L443 ceAbstractionStarter]: For program point L399(lines 399 410) no Hoare annotation was computed. [2019-11-15 23:41:41,863 INFO L443 ceAbstractionStarter]: For program point L399-2(lines 399 410) no Hoare annotation was computed. [2019-11-15 23:41:41,864 INFO L443 ceAbstractionStarter]: For program point L201(line 201) no Hoare annotation was computed. [2019-11-15 23:41:41,864 INFO L443 ceAbstractionStarter]: For program point L135(line 135) no Hoare annotation was computed. [2019-11-15 23:41:41,864 INFO L443 ceAbstractionStarter]: For program point L69(line 69) no Hoare annotation was computed. [2019-11-15 23:41:41,864 INFO L443 ceAbstractionStarter]: For program point L598(lines 598 1024) no Hoare annotation was computed. [2019-11-15 23:41:41,864 INFO L443 ceAbstractionStarter]: For program point L334(lines 334 1024) no Hoare annotation was computed. [2019-11-15 23:41:41,864 INFO L443 ceAbstractionStarter]: For program point L268(lines 268 1024) no Hoare annotation was computed. [2019-11-15 23:41:41,864 INFO L443 ceAbstractionStarter]: For program point L731(lines 731 1024) no Hoare annotation was computed. [2019-11-15 23:41:41,864 INFO L443 ceAbstractionStarter]: For program point L203-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:41:41,864 INFO L443 ceAbstractionStarter]: For program point L137-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:41:41,864 INFO L443 ceAbstractionStarter]: For program point L71-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:41:41,864 INFO L443 ceAbstractionStarter]: For program point L204(line 204) no Hoare annotation was computed. [2019-11-15 23:41:41,864 INFO L443 ceAbstractionStarter]: For program point L138(line 138) no Hoare annotation was computed. [2019-11-15 23:41:41,864 INFO L443 ceAbstractionStarter]: For program point L72(line 72) no Hoare annotation was computed. [2019-11-15 23:41:41,864 INFO L443 ceAbstractionStarter]: For program point L865(lines 865 1024) no Hoare annotation was computed. [2019-11-15 23:41:41,864 INFO L443 ceAbstractionStarter]: For program point L799(lines 799 1024) no Hoare annotation was computed. [2019-11-15 23:41:41,865 INFO L443 ceAbstractionStarter]: For program point L932(lines 932 1024) no Hoare annotation was computed. [2019-11-15 23:41:41,865 INFO L443 ceAbstractionStarter]: For program point L866(lines 866 875) no Hoare annotation was computed. [2019-11-15 23:41:41,865 INFO L443 ceAbstractionStarter]: For program point L866-2(lines 866 875) no Hoare annotation was computed. [2019-11-15 23:41:41,865 INFO L443 ceAbstractionStarter]: For program point L470(lines 470 1024) no Hoare annotation was computed. [2019-11-15 23:41:41,865 INFO L443 ceAbstractionStarter]: For program point L140-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:41:41,865 INFO L443 ceAbstractionStarter]: For program point L74-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:41:41,865 INFO L443 ceAbstractionStarter]: For program point L603(lines 603 1024) no Hoare annotation was computed. [2019-11-15 23:41:41,865 INFO L443 ceAbstractionStarter]: For program point L537(lines 537 1024) no Hoare annotation was computed. [2019-11-15 23:41:41,865 INFO L443 ceAbstractionStarter]: For program point L141(line 141) no Hoare annotation was computed. [2019-11-15 23:41:41,865 INFO L443 ceAbstractionStarter]: For program point L75(line 75) no Hoare annotation was computed. [2019-11-15 23:41:41,865 INFO L443 ceAbstractionStarter]: For program point L1000(lines 1000 1024) no Hoare annotation was computed. [2019-11-15 23:41:41,865 INFO L443 ceAbstractionStarter]: For program point L670(lines 670 1024) no Hoare annotation was computed. [2019-11-15 23:41:41,865 INFO L443 ceAbstractionStarter]: For program point L604(lines 604 614) no Hoare annotation was computed. [2019-11-15 23:41:41,865 INFO L443 ceAbstractionStarter]: For program point L604-2(lines 604 614) no Hoare annotation was computed. [2019-11-15 23:41:41,866 INFO L443 ceAbstractionStarter]: For program point L340(lines 340 1024) no Hoare annotation was computed. [2019-11-15 23:41:41,866 INFO L443 ceAbstractionStarter]: For program point L275(lines 275 1024) no Hoare annotation was computed. [2019-11-15 23:41:41,866 INFO L443 ceAbstractionStarter]: For program point L143-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:41:41,866 INFO L443 ceAbstractionStarter]: For program point L77-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:41:41,866 INFO L443 ceAbstractionStarter]: For program point L804(lines 804 1024) no Hoare annotation was computed. [2019-11-15 23:41:41,866 INFO L443 ceAbstractionStarter]: For program point L738(lines 738 1024) no Hoare annotation was computed. [2019-11-15 23:41:41,866 INFO L443 ceAbstractionStarter]: For program point L144(line 144) no Hoare annotation was computed. [2019-11-15 23:41:41,866 INFO L443 ceAbstractionStarter]: For program point L78(line 78) no Hoare annotation was computed. [2019-11-15 23:41:41,866 INFO L443 ceAbstractionStarter]: For program point L805(lines 805 815) no Hoare annotation was computed. [2019-11-15 23:41:41,866 INFO L443 ceAbstractionStarter]: For program point L805-2(lines 805 815) no Hoare annotation was computed. [2019-11-15 23:41:41,866 INFO L443 ceAbstractionStarter]: For program point L542(lines 542 1024) no Hoare annotation was computed. [2019-11-15 23:41:41,866 INFO L443 ceAbstractionStarter]: For program point L146-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:41:41,866 INFO L443 ceAbstractionStarter]: For program point L80-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:41:41,866 INFO L443 ceAbstractionStarter]: For program point L1005(lines 1005 1024) no Hoare annotation was computed. [2019-11-15 23:41:41,866 INFO L443 ceAbstractionStarter]: For program point L939(lines 939 1024) no Hoare annotation was computed. [2019-11-15 23:41:41,867 INFO L443 ceAbstractionStarter]: For program point L675(lines 675 1024) no Hoare annotation was computed. [2019-11-15 23:41:41,867 INFO L443 ceAbstractionStarter]: For program point L477(lines 477 1024) no Hoare annotation was computed. [2019-11-15 23:41:41,867 INFO L443 ceAbstractionStarter]: For program point L411(lines 411 1024) no Hoare annotation was computed. [2019-11-15 23:41:41,867 INFO L443 ceAbstractionStarter]: For program point L147(line 147) no Hoare annotation was computed. [2019-11-15 23:41:41,867 INFO L443 ceAbstractionStarter]: For program point L81(line 81) no Hoare annotation was computed. [2019-11-15 23:41:41,867 INFO L443 ceAbstractionStarter]: For program point L940(lines 940 952) no Hoare annotation was computed. [2019-11-15 23:41:41,867 INFO L443 ceAbstractionStarter]: For program point L940-2(lines 940 952) no Hoare annotation was computed. [2019-11-15 23:41:41,867 INFO L443 ceAbstractionStarter]: For program point L478(lines 478 486) no Hoare annotation was computed. [2019-11-15 23:41:41,867 INFO L443 ceAbstractionStarter]: For program point L478-2(lines 478 486) no Hoare annotation was computed. [2019-11-15 23:41:41,867 INFO L443 ceAbstractionStarter]: For program point L346(lines 346 1024) no Hoare annotation was computed. [2019-11-15 23:41:41,867 INFO L443 ceAbstractionStarter]: For program point L280(lines 280 1024) no Hoare annotation was computed. [2019-11-15 23:41:41,867 INFO L443 ceAbstractionStarter]: For program point L214(lines 214 1024) no Hoare annotation was computed. [2019-11-15 23:41:41,867 INFO L443 ceAbstractionStarter]: For program point L743(lines 743 1024) no Hoare annotation was computed. [2019-11-15 23:41:41,867 INFO L443 ceAbstractionStarter]: For program point L149-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:41:41,868 INFO L443 ceAbstractionStarter]: For program point L83-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:41:41,868 INFO L443 ceAbstractionStarter]: For program point L876(lines 876 1024) no Hoare annotation was computed. [2019-11-15 23:41:41,868 INFO L443 ceAbstractionStarter]: For program point L150(line 150) no Hoare annotation was computed. [2019-11-15 23:41:41,868 INFO L443 ceAbstractionStarter]: For program point L84(line 84) no Hoare annotation was computed. [2019-11-15 23:41:41,868 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-15 23:41:41,868 INFO L443 ceAbstractionStarter]: For program point L152-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:41:41,868 INFO L443 ceAbstractionStarter]: For program point L86-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:41:41,869 INFO L443 ceAbstractionStarter]: For program point L681(lines 681 1024) no Hoare annotation was computed. [2019-11-15 23:41:41,869 INFO L443 ceAbstractionStarter]: For program point L615(lines 615 1024) no Hoare annotation was computed. [2019-11-15 23:41:41,869 INFO L443 ceAbstractionStarter]: For program point L549(lines 549 1024) no Hoare annotation was computed. [2019-11-15 23:41:41,869 INFO L443 ceAbstractionStarter]: For program point L417(lines 417 1024) no Hoare annotation was computed. [2019-11-15 23:41:41,869 INFO L443 ceAbstractionStarter]: For program point L153(line 153) no Hoare annotation was computed. [2019-11-15 23:41:41,869 INFO L443 ceAbstractionStarter]: For program point L87(line 87) no Hoare annotation was computed. [2019-11-15 23:41:41,869 INFO L443 ceAbstractionStarter]: For program point L1012(lines 1012 1024) no Hoare annotation was computed. [2019-11-15 23:41:41,869 INFO L443 ceAbstractionStarter]: For program point L881(lines 881 1024) no Hoare annotation was computed. [2019-11-15 23:41:41,870 INFO L443 ceAbstractionStarter]: For program point L353(lines 353 1024) no Hoare annotation was computed. [2019-11-15 23:41:41,870 INFO L443 ceAbstractionStarter]: For program point L287(lines 287 1024) no Hoare annotation was computed. [2019-11-15 23:41:41,870 INFO L443 ceAbstractionStarter]: For program point L221(lines 221 1024) no Hoare annotation was computed. [2019-11-15 23:41:41,870 INFO L443 ceAbstractionStarter]: For program point L155-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:41:41,870 INFO L443 ceAbstractionStarter]: For program point L89-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:41:41,870 INFO L443 ceAbstractionStarter]: For program point L23(lines 23 25) no Hoare annotation was computed. [2019-11-15 23:41:41,870 INFO L443 ceAbstractionStarter]: For program point L23-2(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:41:41,871 INFO L443 ceAbstractionStarter]: For program point L816(lines 816 1024) no Hoare annotation was computed. [2019-11-15 23:41:41,871 INFO L443 ceAbstractionStarter]: For program point L750(lines 750 1024) no Hoare annotation was computed. [2019-11-15 23:41:41,871 INFO L443 ceAbstractionStarter]: For program point L156(line 156) no Hoare annotation was computed. [2019-11-15 23:41:41,871 INFO L443 ceAbstractionStarter]: For program point L90(line 90) no Hoare annotation was computed. [2019-11-15 23:41:41,871 INFO L443 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2019-11-15 23:41:41,871 INFO L443 ceAbstractionStarter]: For program point L487(lines 487 1024) no Hoare annotation was computed. [2019-11-15 23:41:41,871 INFO L443 ceAbstractionStarter]: For program point L488(lines 488 499) no Hoare annotation was computed. [2019-11-15 23:41:41,872 INFO L443 ceAbstractionStarter]: For program point L422(lines 422 1024) no Hoare annotation was computed. [2019-11-15 23:41:41,872 INFO L443 ceAbstractionStarter]: For program point L488-2(lines 488 499) no Hoare annotation was computed. [2019-11-15 23:41:41,872 INFO L443 ceAbstractionStarter]: For program point L158-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:41:41,872 INFO L443 ceAbstractionStarter]: For program point L92-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:41:41,872 INFO L443 ceAbstractionStarter]: For program point L26-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:41:41,872 INFO L443 ceAbstractionStarter]: For program point L1017(lines 1017 1024) no Hoare annotation was computed. [2019-11-15 23:41:41,872 INFO L443 ceAbstractionStarter]: For program point L621(lines 621 1024) no Hoare annotation was computed. [2019-11-15 23:41:41,873 INFO L443 ceAbstractionStarter]: For program point L555(lines 555 1024) no Hoare annotation was computed. [2019-11-15 23:41:41,873 INFO L443 ceAbstractionStarter]: For program point L159(line 159) no Hoare annotation was computed. [2019-11-15 23:41:41,873 INFO L443 ceAbstractionStarter]: For program point L93(line 93) no Hoare annotation was computed. [2019-11-15 23:41:41,873 INFO L443 ceAbstractionStarter]: For program point L27(line 27) no Hoare annotation was computed. [2019-11-15 23:41:41,873 INFO L443 ceAbstractionStarter]: For program point L886(lines 886 1024) no Hoare annotation was computed. [2019-11-15 23:41:41,873 INFO L443 ceAbstractionStarter]: For program point L688(lines 688 1024) no Hoare annotation was computed. [2019-11-15 23:41:41,873 INFO L443 ceAbstractionStarter]: For program point L358(lines 358 1024) no Hoare annotation was computed. [2019-11-15 23:41:41,873 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-15 23:41:41,874 INFO L443 ceAbstractionStarter]: For program point L953(lines 953 1024) no Hoare annotation was computed. [2019-11-15 23:41:41,874 INFO L443 ceAbstractionStarter]: For program point L227(lines 227 1024) no Hoare annotation was computed. [2019-11-15 23:41:41,874 INFO L443 ceAbstractionStarter]: For program point L161-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:41:41,874 INFO L443 ceAbstractionStarter]: For program point L95-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:41:41,874 INFO L443 ceAbstractionStarter]: For program point L29-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:41:41,874 INFO L443 ceAbstractionStarter]: For program point L822(lines 822 1024) no Hoare annotation was computed. [2019-11-15 23:41:41,874 INFO L443 ceAbstractionStarter]: For program point L294(lines 294 1024) no Hoare annotation was computed. [2019-11-15 23:41:41,875 INFO L443 ceAbstractionStarter]: For program point L162(line 162) no Hoare annotation was computed. [2019-11-15 23:41:41,875 INFO L443 ceAbstractionStarter]: For program point L96(line 96) no Hoare annotation was computed. [2019-11-15 23:41:41,875 INFO L443 ceAbstractionStarter]: For program point L30(line 30) no Hoare annotation was computed. [2019-11-15 23:41:41,875 INFO L443 ceAbstractionStarter]: For program point L757(lines 757 1024) no Hoare annotation was computed. [2019-11-15 23:41:41,875 INFO L443 ceAbstractionStarter]: For program point L758(lines 758 768) no Hoare annotation was computed. [2019-11-15 23:41:41,875 INFO L443 ceAbstractionStarter]: For program point L758-2(lines 758 768) no Hoare annotation was computed. [2019-11-15 23:41:41,875 INFO L443 ceAbstractionStarter]: For program point L164-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:41:41,876 INFO L443 ceAbstractionStarter]: For program point L98-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:41:41,876 INFO L443 ceAbstractionStarter]: For program point L32-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:41:41,876 INFO L443 ceAbstractionStarter]: For program point L825(lines 825 1024) no Hoare annotation was computed. [2019-11-15 23:41:41,876 INFO L443 ceAbstractionStarter]: For program point L561(lines 561 1024) no Hoare annotation was computed. [2019-11-15 23:41:41,876 INFO L443 ceAbstractionStarter]: For program point L429(lines 429 1024) no Hoare annotation was computed. [2019-11-15 23:41:41,876 INFO L443 ceAbstractionStarter]: For program point L165(line 165) no Hoare annotation was computed. [2019-11-15 23:41:41,876 INFO L443 ceAbstractionStarter]: For program point L99(line 99) no Hoare annotation was computed. [2019-11-15 23:41:41,876 INFO L443 ceAbstractionStarter]: For program point L33(line 33) no Hoare annotation was computed. [2019-11-15 23:41:41,877 INFO L443 ceAbstractionStarter]: For program point L958(lines 958 1024) no Hoare annotation was computed. [2019-11-15 23:41:41,877 INFO L443 ceAbstractionStarter]: For program point L694(lines 694 1024) no Hoare annotation was computed. [2019-11-15 23:41:41,877 INFO L443 ceAbstractionStarter]: For program point L628(lines 628 1024) no Hoare annotation was computed. [2019-11-15 23:41:41,878 INFO L439 ceAbstractionStarter]: At program point L1025(lines 22 1026) the Hoare annotation is: (let ((.cse16 (= ~a25~0 13)) (.cse26 (<= ~a29~0 140))) (let ((.cse14 (<= ~a23~0 312)) (.cse9 (and (not .cse16) .cse26)) (.cse25 (< 245 ~a29~0)) (.cse27 (< 306 ~a23~0)) (.cse8 (<= ~a23~0 138)) (.cse19 (= ~a25~0 9))) (let ((.cse6 (<= 0 (+ ~a23~0 599772))) (.cse0 (and (not .cse19) (<= 312 ~a23~0))) (.cse12 (or .cse27 .cse8)) (.cse20 (<= 141 ~a29~0)) (.cse15 (or (<= ~a29~0 243) .cse25)) (.cse10 (<= (+ ~a29~0 193245) 0)) (.cse21 (and .cse14 .cse19 .cse9)) (.cse11 (= 1 ~a4~0)) (.cse7 (= 12 ~a25~0)) (.cse4 (<= 130 ~a29~0)) (.cse5 (exists ((v_~a29~0_501 Int)) (and (<= ~a29~0 (+ (mod (+ v_~a29~0_501 26) 52) 192)) (<= 130 v_~a29~0_501) (<= 0 (+ v_~a29~0_501 370578))))) (.cse13 (= ~a25~0 11)) (.cse17 (= 10 ~a25~0)) (.cse1 (= 1 ~a3~0)) (.cse2 (= ~a4~0 1)) (.cse18 (<= ~a29~0 277)) (.cse3 (= 15 ~a8~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse2 (and .cse6 .cse7 .cse8 .cse9)) (and .cse10 .cse1 .cse3 .cse7) (and (<= (+ ~a29~0 181700) ~a23~0) .cse3 .cse11 .cse4 .cse5 .cse1) (and .cse6 .cse1 .cse8 .cse3) (and (exists ((v_~a29~0_504 Int)) (and (<= ~a29~0 (+ (div v_~a29~0_504 5) 206649)) (<= 0 v_~a29~0_504) (<= v_~a29~0_504 140))) (<= 13 ~a25~0) .cse1 .cse12 .cse6 .cse3 .cse11) (and .cse6 .cse2 .cse8 .cse13) (and .cse14 .cse7 .cse1 .cse2 .cse3) (and .cse15 .cse1 .cse8 .cse3 .cse13) (and .cse1 .cse3 (and .cse16 .cse2 (<= ~a29~0 130))) (and (and .cse1 .cse2 .cse17) .cse3 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse13 .cse4) (and .cse2 .cse8 .cse17) (and .cse15 .cse1 .cse19 .cse2 .cse3 .cse20) (and (and .cse1 .cse21) .cse12 .cse3) (and .cse1 (and .cse15 .cse14 .cse2 .cse13) .cse3) (and (and .cse2 .cse17) .cse1 .cse12 .cse3) (and (<= ~a29~0 206673) .cse16 (< 0 (+ ~a23~0 43)) .cse1 .cse3 .cse20 .cse11) (and .cse15 .cse19 .cse1 .cse8 .cse3) (and .cse19 .cse8 .cse11) (and (and (and (exists ((v_~a23~0_472 Int)) (let ((.cse24 (div v_~a23~0_472 5))) (let ((.cse23 (+ .cse24 371130))) (let ((.cse22 (div .cse23 5))) (and (<= 0 (+ .cse22 1)) (<= 0 v_~a23~0_472) (<= 0 .cse23) (<= 312 v_~a23~0_472) (< 0 (+ .cse24 370824)) (<= (+ ~a23~0 127612) (div .cse22 5)) (<= 0 .cse22) (<= v_~a23~0_472 312)))))) .cse9) .cse13) .cse2) (and .cse10 .cse1 .cse2 .cse3 .cse13) (and .cse7 .cse1 .cse3 .cse18 .cse25) (and .cse16 .cse2 .cse8 .cse18) (and .cse7 .cse1 .cse8 .cse3) (and .cse21 .cse11) (and .cse7 .cse1 .cse3 .cse4 .cse5) (and .cse2 .cse8 .cse18 .cse25 .cse13) (and .cse1 (and .cse17 .cse26) .cse3) (and .cse1 (and .cse2 (and .cse27 .cse18 .cse25)) .cse3))))) [2019-11-15 23:41:41,878 INFO L443 ceAbstractionStarter]: For program point L893(lines 893 1024) no Hoare annotation was computed. [2019-11-15 23:41:41,878 INFO L443 ceAbstractionStarter]: For program point L695(lines 695 705) no Hoare annotation was computed. [2019-11-15 23:41:41,878 INFO L443 ceAbstractionStarter]: For program point L695-2(lines 695 705) no Hoare annotation was computed. [2019-11-15 23:41:41,878 INFO L443 ceAbstractionStarter]: For program point L365(lines 365 1024) no Hoare annotation was computed. [2019-11-15 23:41:41,878 INFO L443 ceAbstractionStarter]: For program point L299(lines 299 1024) no Hoare annotation was computed. [2019-11-15 23:41:41,878 INFO L443 ceAbstractionStarter]: For program point L233(lines 233 1024) no Hoare annotation was computed. [2019-11-15 23:41:41,879 INFO L443 ceAbstractionStarter]: For program point L167-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:41:41,879 INFO L443 ceAbstractionStarter]: For program point L101-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:41:41,879 INFO L443 ceAbstractionStarter]: For program point L35-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:41:41,890 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-11-15 23:41:41,891 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-11-15 23:41:41,892 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-11-15 23:41:41,892 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-11-15 23:41:41,893 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-11-15 23:41:41,893 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-11-15 23:41:41,893 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-11-15 23:41:41,894 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-11-15 23:41:41,894 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-11-15 23:41:41,896 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 23:41:41,896 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 23:41:41,896 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 23:41:41,897 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 23:41:41,897 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 23:41:41,897 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 23:41:41,898 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 23:41:41,898 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 23:41:41,899 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-11-15 23:41:41,899 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-11-15 23:41:41,899 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-11-15 23:41:41,912 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-11-15 23:41:41,912 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-11-15 23:41:41,913 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-11-15 23:41:41,913 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-11-15 23:41:41,914 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-11-15 23:41:41,914 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-11-15 23:41:41,914 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-11-15 23:41:41,915 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-11-15 23:41:41,915 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-11-15 23:41:41,916 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 23:41:41,916 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 23:41:41,917 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 23:41:41,917 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 23:41:41,917 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 23:41:41,918 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 23:41:41,918 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 23:41:41,918 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 23:41:41,919 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-11-15 23:41:41,919 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-11-15 23:41:41,919 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-11-15 23:41:41,923 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-11-15 23:41:41,924 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-11-15 23:41:41,924 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-11-15 23:41:41,925 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-11-15 23:41:41,925 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-11-15 23:41:41,925 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-11-15 23:41:41,926 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-11-15 23:41:41,926 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-11-15 23:41:41,927 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-11-15 23:41:41,927 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 23:41:41,928 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 23:41:41,928 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 23:41:41,928 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 23:41:41,929 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 23:41:41,929 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 23:41:41,929 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 23:41:41,930 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 23:41:41,930 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-11-15 23:41:41,930 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-11-15 23:41:41,930 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-11-15 23:41:41,933 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-11-15 23:41:41,934 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-11-15 23:41:41,934 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-11-15 23:41:41,935 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-11-15 23:41:41,935 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-11-15 23:41:41,935 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-11-15 23:41:41,936 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-11-15 23:41:41,936 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-11-15 23:41:41,937 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-11-15 23:41:41,937 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 23:41:41,938 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 23:41:41,938 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 23:41:41,938 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 23:41:41,939 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 23:41:41,939 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 23:41:41,939 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 23:41:41,939 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 23:41:41,940 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-11-15 23:41:41,940 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-11-15 23:41:41,940 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-11-15 23:41:41,944 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 11:41:41 BoogieIcfgContainer [2019-11-15 23:41:41,944 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 23:41:41,945 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 23:41:41,945 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 23:41:41,945 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 23:41:41,946 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:40:10" (3/4) ... [2019-11-15 23:41:41,949 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-15 23:41:41,973 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-15 23:41:41,975 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-15 23:41:42,003 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((((!(a25 == 9) && 312 <= a23) && 1 == a3) && a4 == 1) && 15 == a8) && 130 <= a29) && (\exists v_~a29~0_501 : int :: (a29 <= (v_~a29~0_501 + 26) % 52 + 192 && 130 <= v_~a29~0_501) && 0 <= v_~a29~0_501 + 370578)) || (a4 == 1 && ((0 <= a23 + 599772 && 12 == a25) && a23 <= 138) && !(a25 == 13) && a29 <= 140)) || (((a29 + 193245 <= 0 && 1 == a3) && 15 == a8) && 12 == a25)) || (((((a29 + 181700 <= a23 && 15 == a8) && 1 == a4) && 130 <= a29) && (\exists v_~a29~0_501 : int :: (a29 <= (v_~a29~0_501 + 26) % 52 + 192 && 130 <= v_~a29~0_501) && 0 <= v_~a29~0_501 + 370578)) && 1 == a3)) || (((0 <= a23 + 599772 && 1 == a3) && a23 <= 138) && 15 == a8)) || (((((((\exists v_~a29~0_504 : int :: (a29 <= v_~a29~0_504 / 5 + 206649 && 0 <= v_~a29~0_504) && v_~a29~0_504 <= 140) && 13 <= a25) && 1 == a3) && (306 < a23 || a23 <= 138)) && 0 <= a23 + 599772) && 15 == a8) && 1 == a4)) || (((0 <= a23 + 599772 && a4 == 1) && a23 <= 138) && a25 == 11)) || ((((a23 <= 312 && 12 == a25) && 1 == a3) && a4 == 1) && 15 == a8)) || (((((a29 <= 243 || 245 < a29) && 1 == a3) && a23 <= 138) && 15 == a8) && a25 == 11)) || ((1 == a3 && 15 == a8) && (a25 == 13 && a4 == 1) && a29 <= 130)) || ((((1 == a3 && a4 == 1) && 10 == a25) && 15 == a8) && a29 <= 277)) || ((((((!(a25 == 9) && 312 <= a23) && 1 == a3) && a4 == 1) && 15 == a8) && a25 == 11) && 130 <= a29)) || ((a4 == 1 && a23 <= 138) && 10 == a25)) || ((((((a29 <= 243 || 245 < a29) && 1 == a3) && a25 == 9) && a4 == 1) && 15 == a8) && 141 <= a29)) || (((1 == a3 && (a23 <= 312 && a25 == 9) && !(a25 == 13) && a29 <= 140) && (306 < a23 || a23 <= 138)) && 15 == a8)) || ((1 == a3 && (((a29 <= 243 || 245 < a29) && a23 <= 312) && a4 == 1) && a25 == 11) && 15 == a8)) || ((((a4 == 1 && 10 == a25) && 1 == a3) && (306 < a23 || a23 <= 138)) && 15 == a8)) || ((((((a29 <= 206673 && a25 == 13) && 0 < a23 + 43) && 1 == a3) && 15 == a8) && 141 <= a29) && 1 == a4)) || (((((a29 <= 243 || 245 < a29) && a25 == 9) && 1 == a3) && a23 <= 138) && 15 == a8)) || ((a25 == 9 && a23 <= 138) && 1 == a4)) || ((((\exists v_~a23~0_472 : int :: ((((((0 <= (v_~a23~0_472 / 5 + 371130) / 5 + 1 && 0 <= v_~a23~0_472) && 0 <= v_~a23~0_472 / 5 + 371130) && 312 <= v_~a23~0_472) && 0 < v_~a23~0_472 / 5 + 370824) && a23 + 127612 <= (v_~a23~0_472 / 5 + 371130) / 5 / 5) && 0 <= (v_~a23~0_472 / 5 + 371130) / 5) && v_~a23~0_472 <= 312) && !(a25 == 13) && a29 <= 140) && a25 == 11) && a4 == 1)) || ((((a29 + 193245 <= 0 && 1 == a3) && a4 == 1) && 15 == a8) && a25 == 11)) || ((((12 == a25 && 1 == a3) && 15 == a8) && a29 <= 277) && 245 < a29)) || (((a25 == 13 && a4 == 1) && a23 <= 138) && a29 <= 277)) || (((12 == a25 && 1 == a3) && a23 <= 138) && 15 == a8)) || (((a23 <= 312 && a25 == 9) && !(a25 == 13) && a29 <= 140) && 1 == a4)) || ((((12 == a25 && 1 == a3) && 15 == a8) && 130 <= a29) && (\exists v_~a29~0_501 : int :: (a29 <= (v_~a29~0_501 + 26) % 52 + 192 && 130 <= v_~a29~0_501) && 0 <= v_~a29~0_501 + 370578))) || ((((a4 == 1 && a23 <= 138) && a29 <= 277) && 245 < a29) && a25 == 11)) || ((1 == a3 && 10 == a25 && a29 <= 140) && 15 == a8)) || ((1 == a3 && a4 == 1 && (306 < a23 && a29 <= 277) && 245 < a29) && 15 == a8) [2019-11-15 23:41:42,007 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((((!(a25 == 9) && 312 <= a23) && 1 == a3) && a4 == 1) && 15 == a8) && 130 <= a29) && (\exists v_~a29~0_501 : int :: (a29 <= (v_~a29~0_501 + 26) % 52 + 192 && 130 <= v_~a29~0_501) && 0 <= v_~a29~0_501 + 370578)) || (a4 == 1 && ((0 <= a23 + 599772 && 12 == a25) && a23 <= 138) && !(a25 == 13) && a29 <= 140)) || (((a29 + 193245 <= 0 && 1 == a3) && 15 == a8) && 12 == a25)) || (((((a29 + 181700 <= a23 && 15 == a8) && 1 == a4) && 130 <= a29) && (\exists v_~a29~0_501 : int :: (a29 <= (v_~a29~0_501 + 26) % 52 + 192 && 130 <= v_~a29~0_501) && 0 <= v_~a29~0_501 + 370578)) && 1 == a3)) || (((0 <= a23 + 599772 && 1 == a3) && a23 <= 138) && 15 == a8)) || (((((((\exists v_~a29~0_504 : int :: (a29 <= v_~a29~0_504 / 5 + 206649 && 0 <= v_~a29~0_504) && v_~a29~0_504 <= 140) && 13 <= a25) && 1 == a3) && (306 < a23 || a23 <= 138)) && 0 <= a23 + 599772) && 15 == a8) && 1 == a4)) || (((0 <= a23 + 599772 && a4 == 1) && a23 <= 138) && a25 == 11)) || ((((a23 <= 312 && 12 == a25) && 1 == a3) && a4 == 1) && 15 == a8)) || (((((a29 <= 243 || 245 < a29) && 1 == a3) && a23 <= 138) && 15 == a8) && a25 == 11)) || ((1 == a3 && 15 == a8) && (a25 == 13 && a4 == 1) && a29 <= 130)) || ((((1 == a3 && a4 == 1) && 10 == a25) && 15 == a8) && a29 <= 277)) || ((((((!(a25 == 9) && 312 <= a23) && 1 == a3) && a4 == 1) && 15 == a8) && a25 == 11) && 130 <= a29)) || ((a4 == 1 && a23 <= 138) && 10 == a25)) || ((((((a29 <= 243 || 245 < a29) && 1 == a3) && a25 == 9) && a4 == 1) && 15 == a8) && 141 <= a29)) || (((1 == a3 && (a23 <= 312 && a25 == 9) && !(a25 == 13) && a29 <= 140) && (306 < a23 || a23 <= 138)) && 15 == a8)) || ((1 == a3 && (((a29 <= 243 || 245 < a29) && a23 <= 312) && a4 == 1) && a25 == 11) && 15 == a8)) || ((((a4 == 1 && 10 == a25) && 1 == a3) && (306 < a23 || a23 <= 138)) && 15 == a8)) || ((((((a29 <= 206673 && a25 == 13) && 0 < a23 + 43) && 1 == a3) && 15 == a8) && 141 <= a29) && 1 == a4)) || (((((a29 <= 243 || 245 < a29) && a25 == 9) && 1 == a3) && a23 <= 138) && 15 == a8)) || ((a25 == 9 && a23 <= 138) && 1 == a4)) || ((((\exists v_~a23~0_472 : int :: ((((((0 <= (v_~a23~0_472 / 5 + 371130) / 5 + 1 && 0 <= v_~a23~0_472) && 0 <= v_~a23~0_472 / 5 + 371130) && 312 <= v_~a23~0_472) && 0 < v_~a23~0_472 / 5 + 370824) && a23 + 127612 <= (v_~a23~0_472 / 5 + 371130) / 5 / 5) && 0 <= (v_~a23~0_472 / 5 + 371130) / 5) && v_~a23~0_472 <= 312) && !(a25 == 13) && a29 <= 140) && a25 == 11) && a4 == 1)) || ((((a29 + 193245 <= 0 && 1 == a3) && a4 == 1) && 15 == a8) && a25 == 11)) || ((((12 == a25 && 1 == a3) && 15 == a8) && a29 <= 277) && 245 < a29)) || (((a25 == 13 && a4 == 1) && a23 <= 138) && a29 <= 277)) || (((12 == a25 && 1 == a3) && a23 <= 138) && 15 == a8)) || (((a23 <= 312 && a25 == 9) && !(a25 == 13) && a29 <= 140) && 1 == a4)) || ((((12 == a25 && 1 == a3) && 15 == a8) && 130 <= a29) && (\exists v_~a29~0_501 : int :: (a29 <= (v_~a29~0_501 + 26) % 52 + 192 && 130 <= v_~a29~0_501) && 0 <= v_~a29~0_501 + 370578))) || ((((a4 == 1 && a23 <= 138) && a29 <= 277) && 245 < a29) && a25 == 11)) || ((1 == a3 && 10 == a25 && a29 <= 140) && 15 == a8)) || ((1 == a3 && a4 == 1 && (306 < a23 && a29 <= 277) && 245 < a29) && 15 == a8) [2019-11-15 23:41:42,135 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_c0fb2568-b80f-49d3-a5a5-98c2eeae2c48/bin/uautomizer/witness.graphml [2019-11-15 23:41:42,135 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 23:41:42,136 INFO L168 Benchmark]: Toolchain (without parser) took 94486.30 ms. Allocated memory was 1.0 GB in the beginning and 3.1 GB in the end (delta: 2.1 GB). Free memory was 937.9 MB in the beginning and 1.1 GB in the end (delta: -154.5 MB). Peak memory consumption was 1.9 GB. Max. memory is 11.5 GB. [2019-11-15 23:41:42,136 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 966.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:41:42,137 INFO L168 Benchmark]: CACSL2BoogieTranslator took 890.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 937.9 MB in the beginning and 1.1 GB in the end (delta: -149.7 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. [2019-11-15 23:41:42,137 INFO L168 Benchmark]: Boogie Procedure Inliner took 135.10 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: 17.6 MB). Peak memory consumption was 17.6 MB. Max. memory is 11.5 GB. [2019-11-15 23:41:42,138 INFO L168 Benchmark]: Boogie Preprocessor took 132.13 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: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 11.5 GB. [2019-11-15 23:41:42,138 INFO L168 Benchmark]: RCFGBuilder took 2075.14 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 885.1 MB in the end (delta: 174.1 MB). Peak memory consumption was 174.1 MB. Max. memory is 11.5 GB. [2019-11-15 23:41:42,138 INFO L168 Benchmark]: TraceAbstraction took 91058.15 ms. Allocated memory was 1.2 GB in the beginning and 3.1 GB in the end (delta: 1.9 GB). Free memory was 885.1 MB in the beginning and 1.1 GB in the end (delta: -262.8 MB). Peak memory consumption was 2.0 GB. Max. memory is 11.5 GB. [2019-11-15 23:41:42,139 INFO L168 Benchmark]: Witness Printer took 190.08 ms. Allocated memory is still 3.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 55.5 MB). Peak memory consumption was 55.5 MB. Max. memory is 11.5 GB. [2019-11-15 23:41:42,141 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 966.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 890.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 937.9 MB in the beginning and 1.1 GB in the end (delta: -149.7 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 135.10 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: 17.6 MB). Peak memory consumption was 17.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 132.13 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: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2075.14 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 885.1 MB in the end (delta: 174.1 MB). Peak memory consumption was 174.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 91058.15 ms. Allocated memory was 1.2 GB in the beginning and 3.1 GB in the end (delta: 1.9 GB). Free memory was 885.1 MB in the beginning and 1.1 GB in the end (delta: -262.8 MB). Peak memory consumption was 2.0 GB. Max. memory is 11.5 GB. * Witness Printer took 190.08 ms. Allocated memory is still 3.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 55.5 MB). Peak memory consumption was 55.5 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_~a29~0_501,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 141]: 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: 1028]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1034]: Loop Invariant [2019-11-15 23:41:42,155 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-11-15 23:41:42,155 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-11-15 23:41:42,155 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-11-15 23:41:42,156 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-11-15 23:41:42,156 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-11-15 23:41:42,156 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-11-15 23:41:42,157 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-11-15 23:41:42,157 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-11-15 23:41:42,157 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-11-15 23:41:42,158 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 23:41:42,158 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 23:41:42,159 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 23:41:42,159 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 23:41:42,159 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 23:41:42,159 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 23:41:42,160 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 23:41:42,160 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 23:41:42,160 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-11-15 23:41:42,161 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-11-15 23:41:42,161 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-11-15 23:41:42,163 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-11-15 23:41:42,163 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-11-15 23:41:42,164 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-11-15 23:41:42,164 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-11-15 23:41:42,164 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-11-15 23:41:42,165 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-11-15 23:41:42,165 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-11-15 23:41:42,165 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-11-15 23:41:42,166 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-11-15 23:41:42,166 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 23:41:42,166 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 23:41:42,167 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 23:41:42,167 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 23:41:42,167 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 23:41:42,168 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 23:41:42,168 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 23:41:42,168 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 23:41:42,168 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-11-15 23:41:42,169 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-11-15 23:41:42,169 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((((((((((((!(a25 == 9) && 312 <= a23) && 1 == a3) && a4 == 1) && 15 == a8) && 130 <= a29) && (\exists v_~a29~0_501 : int :: (a29 <= (v_~a29~0_501 + 26) % 52 + 192 && 130 <= v_~a29~0_501) && 0 <= v_~a29~0_501 + 370578)) || (a4 == 1 && ((0 <= a23 + 599772 && 12 == a25) && a23 <= 138) && !(a25 == 13) && a29 <= 140)) || (((a29 + 193245 <= 0 && 1 == a3) && 15 == a8) && 12 == a25)) || (((((a29 + 181700 <= a23 && 15 == a8) && 1 == a4) && 130 <= a29) && (\exists v_~a29~0_501 : int :: (a29 <= (v_~a29~0_501 + 26) % 52 + 192 && 130 <= v_~a29~0_501) && 0 <= v_~a29~0_501 + 370578)) && 1 == a3)) || (((0 <= a23 + 599772 && 1 == a3) && a23 <= 138) && 15 == a8)) || (((((((\exists v_~a29~0_504 : int :: (a29 <= v_~a29~0_504 / 5 + 206649 && 0 <= v_~a29~0_504) && v_~a29~0_504 <= 140) && 13 <= a25) && 1 == a3) && (306 < a23 || a23 <= 138)) && 0 <= a23 + 599772) && 15 == a8) && 1 == a4)) || (((0 <= a23 + 599772 && a4 == 1) && a23 <= 138) && a25 == 11)) || ((((a23 <= 312 && 12 == a25) && 1 == a3) && a4 == 1) && 15 == a8)) || (((((a29 <= 243 || 245 < a29) && 1 == a3) && a23 <= 138) && 15 == a8) && a25 == 11)) || ((1 == a3 && 15 == a8) && (a25 == 13 && a4 == 1) && a29 <= 130)) || ((((1 == a3 && a4 == 1) && 10 == a25) && 15 == a8) && a29 <= 277)) || ((((((!(a25 == 9) && 312 <= a23) && 1 == a3) && a4 == 1) && 15 == a8) && a25 == 11) && 130 <= a29)) || ((a4 == 1 && a23 <= 138) && 10 == a25)) || ((((((a29 <= 243 || 245 < a29) && 1 == a3) && a25 == 9) && a4 == 1) && 15 == a8) && 141 <= a29)) || (((1 == a3 && (a23 <= 312 && a25 == 9) && !(a25 == 13) && a29 <= 140) && (306 < a23 || a23 <= 138)) && 15 == a8)) || ((1 == a3 && (((a29 <= 243 || 245 < a29) && a23 <= 312) && a4 == 1) && a25 == 11) && 15 == a8)) || ((((a4 == 1 && 10 == a25) && 1 == a3) && (306 < a23 || a23 <= 138)) && 15 == a8)) || ((((((a29 <= 206673 && a25 == 13) && 0 < a23 + 43) && 1 == a3) && 15 == a8) && 141 <= a29) && 1 == a4)) || (((((a29 <= 243 || 245 < a29) && a25 == 9) && 1 == a3) && a23 <= 138) && 15 == a8)) || ((a25 == 9 && a23 <= 138) && 1 == a4)) || ((((\exists v_~a23~0_472 : int :: ((((((0 <= (v_~a23~0_472 / 5 + 371130) / 5 + 1 && 0 <= v_~a23~0_472) && 0 <= v_~a23~0_472 / 5 + 371130) && 312 <= v_~a23~0_472) && 0 < v_~a23~0_472 / 5 + 370824) && a23 + 127612 <= (v_~a23~0_472 / 5 + 371130) / 5 / 5) && 0 <= (v_~a23~0_472 / 5 + 371130) / 5) && v_~a23~0_472 <= 312) && !(a25 == 13) && a29 <= 140) && a25 == 11) && a4 == 1)) || ((((a29 + 193245 <= 0 && 1 == a3) && a4 == 1) && 15 == a8) && a25 == 11)) || ((((12 == a25 && 1 == a3) && 15 == a8) && a29 <= 277) && 245 < a29)) || (((a25 == 13 && a4 == 1) && a23 <= 138) && a29 <= 277)) || (((12 == a25 && 1 == a3) && a23 <= 138) && 15 == a8)) || (((a23 <= 312 && a25 == 9) && !(a25 == 13) && a29 <= 140) && 1 == a4)) || ((((12 == a25 && 1 == a3) && 15 == a8) && 130 <= a29) && (\exists v_~a29~0_501 : int :: (a29 <= (v_~a29~0_501 + 26) % 52 + 192 && 130 <= v_~a29~0_501) && 0 <= v_~a29~0_501 + 370578))) || ((((a4 == 1 && a23 <= 138) && a29 <= 277) && 245 < a29) && a25 == 11)) || ((1 == a3 && 10 == a25 && a29 <= 140) && 15 == a8)) || ((1 == a3 && a4 == 1 && (306 < a23 && a29 <= 277) && 245 < a29) && 15 == a8) - InvariantResult [Line: 22]: Loop Invariant [2019-11-15 23:41:42,171 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-11-15 23:41:42,171 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-11-15 23:41:42,171 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-11-15 23:41:42,172 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-11-15 23:41:42,172 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-11-15 23:41:42,172 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-11-15 23:41:42,173 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-11-15 23:41:42,173 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-11-15 23:41:42,173 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-11-15 23:41:42,174 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 23:41:42,174 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 23:41:42,174 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 23:41:42,175 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 23:41:42,175 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 23:41:42,175 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 23:41:42,175 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 23:41:42,176 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 23:41:42,176 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-11-15 23:41:42,176 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-11-15 23:41:42,176 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-11-15 23:41:42,178 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-11-15 23:41:42,178 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-11-15 23:41:42,179 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-11-15 23:41:42,179 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-11-15 23:41:42,179 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-11-15 23:41:42,180 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-11-15 23:41:42,180 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-11-15 23:41:42,180 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-11-15 23:41:42,181 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-11-15 23:41:42,181 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 23:41:42,181 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 23:41:42,182 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 23:41:42,182 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 23:41:42,182 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 23:41:42,183 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 23:41:42,183 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 23:41:42,183 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 23:41:42,183 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-11-15 23:41:42,184 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-11-15 23:41:42,184 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((((((((((((!(a25 == 9) && 312 <= a23) && 1 == a3) && a4 == 1) && 15 == a8) && 130 <= a29) && (\exists v_~a29~0_501 : int :: (a29 <= (v_~a29~0_501 + 26) % 52 + 192 && 130 <= v_~a29~0_501) && 0 <= v_~a29~0_501 + 370578)) || (a4 == 1 && ((0 <= a23 + 599772 && 12 == a25) && a23 <= 138) && !(a25 == 13) && a29 <= 140)) || (((a29 + 193245 <= 0 && 1 == a3) && 15 == a8) && 12 == a25)) || (((((a29 + 181700 <= a23 && 15 == a8) && 1 == a4) && 130 <= a29) && (\exists v_~a29~0_501 : int :: (a29 <= (v_~a29~0_501 + 26) % 52 + 192 && 130 <= v_~a29~0_501) && 0 <= v_~a29~0_501 + 370578)) && 1 == a3)) || (((0 <= a23 + 599772 && 1 == a3) && a23 <= 138) && 15 == a8)) || (((((((\exists v_~a29~0_504 : int :: (a29 <= v_~a29~0_504 / 5 + 206649 && 0 <= v_~a29~0_504) && v_~a29~0_504 <= 140) && 13 <= a25) && 1 == a3) && (306 < a23 || a23 <= 138)) && 0 <= a23 + 599772) && 15 == a8) && 1 == a4)) || (((0 <= a23 + 599772 && a4 == 1) && a23 <= 138) && a25 == 11)) || ((((a23 <= 312 && 12 == a25) && 1 == a3) && a4 == 1) && 15 == a8)) || (((((a29 <= 243 || 245 < a29) && 1 == a3) && a23 <= 138) && 15 == a8) && a25 == 11)) || ((1 == a3 && 15 == a8) && (a25 == 13 && a4 == 1) && a29 <= 130)) || ((((1 == a3 && a4 == 1) && 10 == a25) && 15 == a8) && a29 <= 277)) || ((((((!(a25 == 9) && 312 <= a23) && 1 == a3) && a4 == 1) && 15 == a8) && a25 == 11) && 130 <= a29)) || ((a4 == 1 && a23 <= 138) && 10 == a25)) || ((((((a29 <= 243 || 245 < a29) && 1 == a3) && a25 == 9) && a4 == 1) && 15 == a8) && 141 <= a29)) || (((1 == a3 && (a23 <= 312 && a25 == 9) && !(a25 == 13) && a29 <= 140) && (306 < a23 || a23 <= 138)) && 15 == a8)) || ((1 == a3 && (((a29 <= 243 || 245 < a29) && a23 <= 312) && a4 == 1) && a25 == 11) && 15 == a8)) || ((((a4 == 1 && 10 == a25) && 1 == a3) && (306 < a23 || a23 <= 138)) && 15 == a8)) || ((((((a29 <= 206673 && a25 == 13) && 0 < a23 + 43) && 1 == a3) && 15 == a8) && 141 <= a29) && 1 == a4)) || (((((a29 <= 243 || 245 < a29) && a25 == 9) && 1 == a3) && a23 <= 138) && 15 == a8)) || ((a25 == 9 && a23 <= 138) && 1 == a4)) || ((((\exists v_~a23~0_472 : int :: ((((((0 <= (v_~a23~0_472 / 5 + 371130) / 5 + 1 && 0 <= v_~a23~0_472) && 0 <= v_~a23~0_472 / 5 + 371130) && 312 <= v_~a23~0_472) && 0 < v_~a23~0_472 / 5 + 370824) && a23 + 127612 <= (v_~a23~0_472 / 5 + 371130) / 5 / 5) && 0 <= (v_~a23~0_472 / 5 + 371130) / 5) && v_~a23~0_472 <= 312) && !(a25 == 13) && a29 <= 140) && a25 == 11) && a4 == 1)) || ((((a29 + 193245 <= 0 && 1 == a3) && a4 == 1) && 15 == a8) && a25 == 11)) || ((((12 == a25 && 1 == a3) && 15 == a8) && a29 <= 277) && 245 < a29)) || (((a25 == 13 && a4 == 1) && a23 <= 138) && a29 <= 277)) || (((12 == a25 && 1 == a3) && a23 <= 138) && 15 == a8)) || (((a23 <= 312 && a25 == 9) && !(a25 == 13) && a29 <= 140) && 1 == a4)) || ((((12 == a25 && 1 == a3) && 15 == a8) && 130 <= a29) && (\exists v_~a29~0_501 : int :: (a29 <= (v_~a29~0_501 + 26) % 52 + 192 && 130 <= v_~a29~0_501) && 0 <= v_~a29~0_501 + 370578))) || ((((a4 == 1 && a23 <= 138) && a29 <= 277) && 245 < a29) && a25 == 11)) || ((1 == a3 && 10 == a25 && a29 <= 140) && 15 == a8)) || ((1 == a3 && a4 == 1 && (306 < a23 && a29 <= 277) && 245 < a29) && 15 == a8) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 283 locations, 1 error locations. Result: SAFE, OverallTime: 90.9s, OverallIterations: 13, TraceHistogramMax: 6, AutomataDifference: 57.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 10.8s, HoareTripleCheckerStatistics: 1919 SDtfs, 18953 SDslu, 1284 SDs, 0 SdLazy, 46651 SolverSat, 6372 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 45.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2040 GetRequests, 1902 SyntacticMatches, 6 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 958 ImplicationChecksByTransitivity, 10.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27389occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.6s AutomataMinimizationTime, 13 MinimizatonAttempts, 35639 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 290 NumberOfFragments, 1361 HoareAnnotationTreeSize, 3 FomulaSimplifications, 42778 FormulaSimplificationTreeSizeReduction, 2.5s HoareSimplificationTime, 3 FomulaSimplificationsInter, 46846 FormulaSimplificationTreeSizeReductionInter, 8.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 14.4s InterpolantComputationTime, 5943 NumberOfCodeBlocks, 5943 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 5926 ConstructedInterpolants, 508 QuantifiedInterpolants, 20713806 SizeOfPredicates, 9 NumberOfNonLiveVariables, 2395 ConjunctsInSsa, 52 ConjunctsInUnsatCore, 17 InterpolantComputations, 9 PerfectInterpolantSequences, 5645/7449 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...