./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem18_label40.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_e26f7284-6e77-4951-96b3-766207c9d9df/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_e26f7284-6e77-4951-96b3-766207c9d9df/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_e26f7284-6e77-4951-96b3-766207c9d9df/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_e26f7284-6e77-4951-96b3-766207c9d9df/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem18_label40.c -s /tmp/vcloud-vcloud-master/worker/run_dir_e26f7284-6e77-4951-96b3-766207c9d9df/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_e26f7284-6e77-4951-96b3-766207c9d9df/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 2bd40a46208fa8849cda7746f8f61eaf455843a5 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 20:44:53,701 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 20:44:53,702 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 20:44:53,716 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 20:44:53,716 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 20:44:53,717 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 20:44:53,719 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 20:44:53,728 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 20:44:53,732 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 20:44:53,735 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 20:44:53,736 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 20:44:53,738 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 20:44:53,739 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 20:44:53,740 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 20:44:53,741 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 20:44:53,742 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 20:44:53,743 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 20:44:53,743 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 20:44:53,746 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 20:44:53,749 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 20:44:53,752 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 20:44:53,753 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 20:44:53,755 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 20:44:53,756 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 20:44:53,758 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 20:44:53,758 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 20:44:53,759 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 20:44:53,760 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 20:44:53,760 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 20:44:53,761 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 20:44:53,761 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 20:44:53,762 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 20:44:53,762 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 20:44:53,763 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 20:44:53,764 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 20:44:53,765 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 20:44:53,765 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 20:44:53,765 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 20:44:53,766 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 20:44:53,766 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 20:44:53,767 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 20:44:53,768 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_e26f7284-6e77-4951-96b3-766207c9d9df/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 20:44:53,791 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 20:44:53,801 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 20:44:53,802 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 20:44:53,802 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 20:44:53,803 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 20:44:53,803 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 20:44:53,803 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 20:44:53,803 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 20:44:53,804 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 20:44:53,804 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 20:44:53,804 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 20:44:53,804 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 20:44:53,805 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 20:44:53,805 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 20:44:53,805 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 20:44:53,805 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 20:44:53,806 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 20:44:53,807 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 20:44:53,807 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 20:44:53,807 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 20:44:53,807 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 20:44:53,807 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 20:44:53,808 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 20:44:53,808 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 20:44:53,808 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 20:44:53,809 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 20:44:53,809 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 20:44:53,809 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 20:44:53,809 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_e26f7284-6e77-4951-96b3-766207c9d9df/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 -> 2bd40a46208fa8849cda7746f8f61eaf455843a5 [2019-11-15 20:44:53,833 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 20:44:53,842 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 20:44:53,845 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 20:44:53,846 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 20:44:53,846 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 20:44:53,847 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_e26f7284-6e77-4951-96b3-766207c9d9df/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem18_label40.c [2019-11-15 20:44:53,894 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e26f7284-6e77-4951-96b3-766207c9d9df/bin/uautomizer/data/f8cd786ad/1fc9fb32337a4b48bc878d9ac3d129ff/FLAGb436598eb [2019-11-15 20:44:54,580 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 20:44:54,580 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_e26f7284-6e77-4951-96b3-766207c9d9df/sv-benchmarks/c/eca-rers2012/Problem18_label40.c [2019-11-15 20:44:54,600 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e26f7284-6e77-4951-96b3-766207c9d9df/bin/uautomizer/data/f8cd786ad/1fc9fb32337a4b48bc878d9ac3d129ff/FLAGb436598eb [2019-11-15 20:44:54,683 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_e26f7284-6e77-4951-96b3-766207c9d9df/bin/uautomizer/data/f8cd786ad/1fc9fb32337a4b48bc878d9ac3d129ff [2019-11-15 20:44:54,685 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 20:44:54,686 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 20:44:54,686 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 20:44:54,687 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 20:44:54,690 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 20:44:54,690 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:44:54" (1/1) ... [2019-11-15 20:44:54,693 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e68467f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:44:54, skipping insertion in model container [2019-11-15 20:44:54,693 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:44:54" (1/1) ... [2019-11-15 20:44:54,700 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 20:44:54,792 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 20:44:55,777 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:44:55,783 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 20:44:56,216 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:44:56,238 INFO L192 MainTranslator]: Completed translation [2019-11-15 20:44:56,239 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:44:56 WrapperNode [2019-11-15 20:44:56,239 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 20:44:56,240 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 20:44:56,240 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 20:44:56,240 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 20:44:56,248 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:44:56" (1/1) ... [2019-11-15 20:44:56,295 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:44:56" (1/1) ... [2019-11-15 20:44:56,457 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 20:44:56,459 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 20:44:56,459 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 20:44:56,459 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 20:44:56,468 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:44:56" (1/1) ... [2019-11-15 20:44:56,468 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:44:56" (1/1) ... [2019-11-15 20:44:56,499 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:44:56" (1/1) ... [2019-11-15 20:44:56,499 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:44:56" (1/1) ... [2019-11-15 20:44:56,596 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:44:56" (1/1) ... [2019-11-15 20:44:56,628 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:44:56" (1/1) ... [2019-11-15 20:44:56,660 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:44:56" (1/1) ... [2019-11-15 20:44:56,699 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 20:44:56,700 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 20:44:56,700 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 20:44:56,700 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 20:44:56,701 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:44:56" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e26f7284-6e77-4951-96b3-766207c9d9df/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 20:44:56,754 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 20:44:56,755 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 20:45:00,466 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 20:45:00,467 INFO L284 CfgBuilder]: Removed 11 assume(true) statements. [2019-11-15 20:45:00,468 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:45:00 BoogieIcfgContainer [2019-11-15 20:45:00,468 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 20:45:00,469 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 20:45:00,469 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 20:45:00,472 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 20:45:00,472 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 08:44:54" (1/3) ... [2019-11-15 20:45:00,473 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7930736f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 08:45:00, skipping insertion in model container [2019-11-15 20:45:00,473 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:44:56" (2/3) ... [2019-11-15 20:45:00,474 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7930736f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 08:45:00, skipping insertion in model container [2019-11-15 20:45:00,475 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:45:00" (3/3) ... [2019-11-15 20:45:00,477 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem18_label40.c [2019-11-15 20:45:00,487 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 20:45:00,495 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 20:45:00,505 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 20:45:00,542 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 20:45:00,542 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 20:45:00,542 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 20:45:00,542 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 20:45:00,542 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 20:45:00,542 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 20:45:00,542 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 20:45:00,543 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 20:45:00,573 INFO L276 IsEmpty]: Start isEmpty. Operand 757 states. [2019-11-15 20:45:00,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-15 20:45:00,583 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:45:00,584 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] [2019-11-15 20:45:00,585 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:45:00,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:45:00,590 INFO L82 PathProgramCache]: Analyzing trace with hash 626000386, now seen corresponding path program 1 times [2019-11-15 20:45:00,598 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:45:00,598 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366127337] [2019-11-15 20:45:00,599 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:00,599 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:00,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:45:00,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:00,887 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 20:45:00,888 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366127337] [2019-11-15 20:45:00,889 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:45:00,889 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:45:00,890 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602794984] [2019-11-15 20:45:00,893 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:45:00,894 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:45:00,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:45:00,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:45:00,908 INFO L87 Difference]: Start difference. First operand 757 states. Second operand 4 states. [2019-11-15 20:45:06,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:45:06,798 INFO L93 Difference]: Finished difference Result 2898 states and 5646 transitions. [2019-11-15 20:45:06,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:45:06,801 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2019-11-15 20:45:06,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:45:06,844 INFO L225 Difference]: With dead ends: 2898 [2019-11-15 20:45:06,845 INFO L226 Difference]: Without dead ends: 2074 [2019-11-15 20:45:06,854 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 20:45:06,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2074 states. [2019-11-15 20:45:06,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2074 to 2074. [2019-11-15 20:45:06,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2074 states. [2019-11-15 20:45:06,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2074 states to 2074 states and 3388 transitions. [2019-11-15 20:45:06,981 INFO L78 Accepts]: Start accepts. Automaton has 2074 states and 3388 transitions. Word has length 44 [2019-11-15 20:45:06,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:45:06,981 INFO L462 AbstractCegarLoop]: Abstraction has 2074 states and 3388 transitions. [2019-11-15 20:45:06,982 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:45:06,982 INFO L276 IsEmpty]: Start isEmpty. Operand 2074 states and 3388 transitions. [2019-11-15 20:45:06,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-11-15 20:45:06,992 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:45:06,993 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:45:06,993 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:45:06,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:45:06,994 INFO L82 PathProgramCache]: Analyzing trace with hash -1913531970, now seen corresponding path program 1 times [2019-11-15 20:45:06,994 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:45:06,994 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101276186] [2019-11-15 20:45:06,995 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:06,995 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:06,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:45:07,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:07,237 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:45:07,238 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101276186] [2019-11-15 20:45:07,238 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:45:07,238 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:45:07,239 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2214384] [2019-11-15 20:45:07,241 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:45:07,241 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:45:07,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:45:07,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:45:07,242 INFO L87 Difference]: Start difference. First operand 2074 states and 3388 transitions. Second operand 4 states. [2019-11-15 20:45:11,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:45:11,952 INFO L93 Difference]: Finished difference Result 8286 states and 13544 transitions. [2019-11-15 20:45:11,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:45:11,953 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 128 [2019-11-15 20:45:11,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:45:11,987 INFO L225 Difference]: With dead ends: 8286 [2019-11-15 20:45:11,987 INFO L226 Difference]: Without dead ends: 6214 [2019-11-15 20:45:11,991 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 20:45:12,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6214 states. [2019-11-15 20:45:12,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6214 to 6214. [2019-11-15 20:45:12,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6214 states. [2019-11-15 20:45:12,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6214 states to 6214 states and 8694 transitions. [2019-11-15 20:45:12,109 INFO L78 Accepts]: Start accepts. Automaton has 6214 states and 8694 transitions. Word has length 128 [2019-11-15 20:45:12,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:45:12,110 INFO L462 AbstractCegarLoop]: Abstraction has 6214 states and 8694 transitions. [2019-11-15 20:45:12,110 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:45:12,111 INFO L276 IsEmpty]: Start isEmpty. Operand 6214 states and 8694 transitions. [2019-11-15 20:45:12,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2019-11-15 20:45:12,115 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:45:12,116 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, 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] [2019-11-15 20:45:12,116 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:45:12,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:45:12,117 INFO L82 PathProgramCache]: Analyzing trace with hash -1003652762, now seen corresponding path program 1 times [2019-11-15 20:45:12,117 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:45:12,117 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656285183] [2019-11-15 20:45:12,117 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:12,118 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:12,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:45:12,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:12,522 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 158 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-11-15 20:45:12,523 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656285183] [2019-11-15 20:45:12,523 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:45:12,523 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:45:12,524 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962692142] [2019-11-15 20:45:12,526 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 20:45:12,526 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:45:12,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 20:45:12,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:45:12,530 INFO L87 Difference]: Start difference. First operand 6214 states and 8694 transitions. Second operand 5 states. [2019-11-15 20:45:17,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:45:17,067 INFO L93 Difference]: Finished difference Result 15186 states and 20554 transitions. [2019-11-15 20:45:17,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:45:17,068 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 293 [2019-11-15 20:45:17,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:45:17,114 INFO L225 Difference]: With dead ends: 15186 [2019-11-15 20:45:17,115 INFO L226 Difference]: Without dead ends: 8974 [2019-11-15 20:45:17,122 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:45:17,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8974 states. [2019-11-15 20:45:17,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8974 to 8974. [2019-11-15 20:45:17,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8974 states. [2019-11-15 20:45:17,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8974 states to 8974 states and 11724 transitions. [2019-11-15 20:45:17,287 INFO L78 Accepts]: Start accepts. Automaton has 8974 states and 11724 transitions. Word has length 293 [2019-11-15 20:45:17,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:45:17,288 INFO L462 AbstractCegarLoop]: Abstraction has 8974 states and 11724 transitions. [2019-11-15 20:45:17,288 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 20:45:17,288 INFO L276 IsEmpty]: Start isEmpty. Operand 8974 states and 11724 transitions. [2019-11-15 20:45:17,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 425 [2019-11-15 20:45:17,295 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:45:17,296 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:45:17,296 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:45:17,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:45:17,297 INFO L82 PathProgramCache]: Analyzing trace with hash 955697193, now seen corresponding path program 1 times [2019-11-15 20:45:17,297 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:45:17,297 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270716738] [2019-11-15 20:45:17,298 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:17,298 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:17,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:45:17,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:17,787 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 280 proven. 3 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-11-15 20:45:17,787 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270716738] [2019-11-15 20:45:17,788 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [919916830] [2019-11-15 20:45:17,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e26f7284-6e77-4951-96b3-766207c9d9df/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 20:45:17,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:17,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 537 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 20:45:17,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:45:18,137 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 346 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-11-15 20:45:18,138 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 20:45:18,138 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2019-11-15 20:45:18,138 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820804491] [2019-11-15 20:45:18,141 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:45:18,141 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:45:18,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:45:18,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:45:18,142 INFO L87 Difference]: Start difference. First operand 8974 states and 11724 transitions. Second operand 3 states. [2019-11-15 20:45:21,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:45:21,469 INFO L93 Difference]: Finished difference Result 24846 states and 32905 transitions. [2019-11-15 20:45:21,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:45:21,469 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 424 [2019-11-15 20:45:21,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:45:21,525 INFO L225 Difference]: With dead ends: 24846 [2019-11-15 20:45:21,525 INFO L226 Difference]: Without dead ends: 15874 [2019-11-15 20:45:21,535 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 426 GetRequests, 424 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 20:45:21,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15874 states. [2019-11-15 20:45:21,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15874 to 15184. [2019-11-15 20:45:21,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15184 states. [2019-11-15 20:45:21,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15184 states to 15184 states and 18765 transitions. [2019-11-15 20:45:21,776 INFO L78 Accepts]: Start accepts. Automaton has 15184 states and 18765 transitions. Word has length 424 [2019-11-15 20:45:21,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:45:21,777 INFO L462 AbstractCegarLoop]: Abstraction has 15184 states and 18765 transitions. [2019-11-15 20:45:21,777 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:45:21,777 INFO L276 IsEmpty]: Start isEmpty. Operand 15184 states and 18765 transitions. [2019-11-15 20:45:21,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 476 [2019-11-15 20:45:21,787 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:45:21,787 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:45:21,991 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:45:21,991 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:45:21,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:45:21,991 INFO L82 PathProgramCache]: Analyzing trace with hash 1312787295, now seen corresponding path program 1 times [2019-11-15 20:45:21,992 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:45:21,992 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097831412] [2019-11-15 20:45:21,992 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:21,992 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:21,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:45:22,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:22,639 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 378 proven. 3 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-11-15 20:45:22,640 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097831412] [2019-11-15 20:45:22,641 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [497867056] [2019-11-15 20:45:22,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e26f7284-6e77-4951-96b3-766207c9d9df/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 20:45:22,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:22,774 INFO L256 TraceCheckSpWp]: Trace formula consists of 584 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 20:45:22,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:45:22,966 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2019-11-15 20:45:22,966 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 20:45:22,967 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2019-11-15 20:45:22,967 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445868325] [2019-11-15 20:45:22,968 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:45:22,969 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:45:22,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:45:22,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:45:22,970 INFO L87 Difference]: Start difference. First operand 15184 states and 18765 transitions. Second operand 3 states. [2019-11-15 20:45:25,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:45:25,930 INFO L93 Difference]: Finished difference Result 39336 states and 49508 transitions. [2019-11-15 20:45:25,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:45:25,931 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 475 [2019-11-15 20:45:25,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:45:25,970 INFO L225 Difference]: With dead ends: 39336 [2019-11-15 20:45:25,970 INFO L226 Difference]: Without dead ends: 24154 [2019-11-15 20:45:25,987 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 479 GetRequests, 474 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:45:26,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24154 states. [2019-11-15 20:45:26,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24154 to 22084. [2019-11-15 20:45:26,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22084 states. [2019-11-15 20:45:26,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22084 states to 22084 states and 26750 transitions. [2019-11-15 20:45:26,340 INFO L78 Accepts]: Start accepts. Automaton has 22084 states and 26750 transitions. Word has length 475 [2019-11-15 20:45:26,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:45:26,341 INFO L462 AbstractCegarLoop]: Abstraction has 22084 states and 26750 transitions. [2019-11-15 20:45:26,341 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:45:26,341 INFO L276 IsEmpty]: Start isEmpty. Operand 22084 states and 26750 transitions. [2019-11-15 20:45:26,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 498 [2019-11-15 20:45:26,352 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:45:26,353 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, 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, 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] [2019-11-15 20:45:26,564 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:45:26,565 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:45:26,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:45:26,567 INFO L82 PathProgramCache]: Analyzing trace with hash 110309686, now seen corresponding path program 1 times [2019-11-15 20:45:26,568 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:45:26,568 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961057879] [2019-11-15 20:45:26,568 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:26,568 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:26,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:45:26,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:27,196 INFO L134 CoverageAnalysis]: Checked inductivity of 657 backedges. 450 proven. 3 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2019-11-15 20:45:27,197 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961057879] [2019-11-15 20:45:27,197 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1488001150] [2019-11-15 20:45:27,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e26f7284-6e77-4951-96b3-766207c9d9df/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 20:45:27,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:27,335 INFO L256 TraceCheckSpWp]: Trace formula consists of 633 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 20:45:27,341 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:45:27,646 INFO L134 CoverageAnalysis]: Checked inductivity of 657 backedges. 498 proven. 0 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2019-11-15 20:45:27,647 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 20:45:27,647 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2019-11-15 20:45:27,647 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938132552] [2019-11-15 20:45:27,648 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:45:27,648 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:45:27,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:45:27,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:45:27,649 INFO L87 Difference]: Start difference. First operand 22084 states and 26750 transitions. Second operand 3 states. [2019-11-15 20:45:30,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:45:30,294 INFO L93 Difference]: Finished difference Result 51756 states and 62894 transitions. [2019-11-15 20:45:30,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:45:30,297 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 497 [2019-11-15 20:45:30,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:45:30,339 INFO L225 Difference]: With dead ends: 51756 [2019-11-15 20:45:30,339 INFO L226 Difference]: Without dead ends: 26914 [2019-11-15 20:45:30,364 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 501 GetRequests, 496 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:45:30,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26914 states. [2019-11-15 20:45:30,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26914 to 26914. [2019-11-15 20:45:30,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26914 states. [2019-11-15 20:45:30,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26914 states to 26914 states and 29118 transitions. [2019-11-15 20:45:30,673 INFO L78 Accepts]: Start accepts. Automaton has 26914 states and 29118 transitions. Word has length 497 [2019-11-15 20:45:30,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:45:30,674 INFO L462 AbstractCegarLoop]: Abstraction has 26914 states and 29118 transitions. [2019-11-15 20:45:30,674 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:45:30,674 INFO L276 IsEmpty]: Start isEmpty. Operand 26914 states and 29118 transitions. [2019-11-15 20:45:30,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 678 [2019-11-15 20:45:30,696 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:45:30,697 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, 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, 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, 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, 1, 1, 1, 1] [2019-11-15 20:45:30,901 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:45:30,904 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:45:30,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:45:30,905 INFO L82 PathProgramCache]: Analyzing trace with hash -434418335, now seen corresponding path program 1 times [2019-11-15 20:45:30,907 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:45:30,907 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259630665] [2019-11-15 20:45:30,907 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:30,907 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:30,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:45:30,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:31,576 INFO L134 CoverageAnalysis]: Checked inductivity of 543 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 418 trivial. 0 not checked. [2019-11-15 20:45:31,576 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259630665] [2019-11-15 20:45:31,576 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:45:31,577 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:45:31,577 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92614642] [2019-11-15 20:45:31,577 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:45:31,578 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:45:31,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:45:31,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:45:31,578 INFO L87 Difference]: Start difference. First operand 26914 states and 29118 transitions. Second operand 3 states. [2019-11-15 20:45:33,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:45:33,368 INFO L93 Difference]: Finished difference Result 53826 states and 58234 transitions. [2019-11-15 20:45:33,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:45:33,369 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 677 [2019-11-15 20:45:33,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:45:33,403 INFO L225 Difference]: With dead ends: 53826 [2019-11-15 20:45:33,403 INFO L226 Difference]: Without dead ends: 26914 [2019-11-15 20:45:33,420 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 3 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 20:45:33,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26914 states. [2019-11-15 20:45:33,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26914 to 26914. [2019-11-15 20:45:33,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26914 states. [2019-11-15 20:45:33,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26914 states to 26914 states and 28747 transitions. [2019-11-15 20:45:33,706 INFO L78 Accepts]: Start accepts. Automaton has 26914 states and 28747 transitions. Word has length 677 [2019-11-15 20:45:33,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:45:33,707 INFO L462 AbstractCegarLoop]: Abstraction has 26914 states and 28747 transitions. [2019-11-15 20:45:33,707 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:45:33,707 INFO L276 IsEmpty]: Start isEmpty. Operand 26914 states and 28747 transitions. [2019-11-15 20:45:33,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 683 [2019-11-15 20:45:33,732 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:45:33,733 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:45:33,733 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:45:33,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:45:33,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1637826363, now seen corresponding path program 1 times [2019-11-15 20:45:33,734 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:45:33,734 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753394233] [2019-11-15 20:45:33,735 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:33,735 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:33,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:45:33,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:34,286 INFO L134 CoverageAnalysis]: Checked inductivity of 999 backedges. 209 proven. 0 refuted. 0 times theorem prover too weak. 790 trivial. 0 not checked. [2019-11-15 20:45:34,287 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753394233] [2019-11-15 20:45:34,287 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:45:34,287 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:45:34,287 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198182095] [2019-11-15 20:45:34,288 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:45:34,288 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:45:34,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:45:34,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:45:34,289 INFO L87 Difference]: Start difference. First operand 26914 states and 28747 transitions. Second operand 4 states. [2019-11-15 20:45:38,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:45:38,004 INFO L93 Difference]: Finished difference Result 76596 states and 82596 transitions. [2019-11-15 20:45:38,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:45:38,005 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 682 [2019-11-15 20:45:38,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:45:38,061 INFO L225 Difference]: With dead ends: 76596 [2019-11-15 20:45:38,061 INFO L226 Difference]: Without dead ends: 49684 [2019-11-15 20:45:38,081 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 20:45:38,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49684 states. [2019-11-15 20:45:38,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49684 to 46924. [2019-11-15 20:45:38,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46924 states. [2019-11-15 20:45:38,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46924 states to 46924 states and 50231 transitions. [2019-11-15 20:45:38,550 INFO L78 Accepts]: Start accepts. Automaton has 46924 states and 50231 transitions. Word has length 682 [2019-11-15 20:45:38,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:45:38,551 INFO L462 AbstractCegarLoop]: Abstraction has 46924 states and 50231 transitions. [2019-11-15 20:45:38,551 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:45:38,551 INFO L276 IsEmpty]: Start isEmpty. Operand 46924 states and 50231 transitions. [2019-11-15 20:45:38,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 995 [2019-11-15 20:45:38,592 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:45:38,593 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:45:38,593 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:45:38,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:45:38,594 INFO L82 PathProgramCache]: Analyzing trace with hash -72179627, now seen corresponding path program 1 times [2019-11-15 20:45:38,594 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:45:38,595 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449914227] [2019-11-15 20:45:38,595 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:38,595 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:38,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:45:38,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:39,569 INFO L134 CoverageAnalysis]: Checked inductivity of 1151 backedges. 779 proven. 169 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2019-11-15 20:45:39,569 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449914227] [2019-11-15 20:45:39,569 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1998784859] [2019-11-15 20:45:39,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e26f7284-6e77-4951-96b3-766207c9d9df/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 20:45:39,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:39,752 INFO L256 TraceCheckSpWp]: Trace formula consists of 1174 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 20:45:39,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:45:40,559 INFO L134 CoverageAnalysis]: Checked inductivity of 1151 backedges. 557 proven. 0 refuted. 0 times theorem prover too weak. 594 trivial. 0 not checked. [2019-11-15 20:45:40,559 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 20:45:40,560 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2019-11-15 20:45:40,560 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147220829] [2019-11-15 20:45:40,561 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:45:40,561 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:45:40,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:45:40,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:45:40,562 INFO L87 Difference]: Start difference. First operand 46924 states and 50231 transitions. Second operand 3 states. [2019-11-15 20:45:42,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:45:42,849 INFO L93 Difference]: Finished difference Result 94536 states and 101224 transitions. [2019-11-15 20:45:42,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:45:42,850 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 994 [2019-11-15 20:45:42,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:45:42,884 INFO L225 Difference]: With dead ends: 94536 [2019-11-15 20:45:42,884 INFO L226 Difference]: Without dead ends: 48304 [2019-11-15 20:45:42,905 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 999 GetRequests, 995 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:45:42,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48304 states. [2019-11-15 20:45:43,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48304 to 48304. [2019-11-15 20:45:43,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48304 states. [2019-11-15 20:45:43,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48304 states to 48304 states and 51237 transitions. [2019-11-15 20:45:43,362 INFO L78 Accepts]: Start accepts. Automaton has 48304 states and 51237 transitions. Word has length 994 [2019-11-15 20:45:43,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:45:43,363 INFO L462 AbstractCegarLoop]: Abstraction has 48304 states and 51237 transitions. [2019-11-15 20:45:43,363 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:45:43,363 INFO L276 IsEmpty]: Start isEmpty. Operand 48304 states and 51237 transitions. [2019-11-15 20:45:43,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1510 [2019-11-15 20:45:43,397 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:45:43,398 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 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, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:45:43,602 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:45:43,602 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:45:43,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:45:43,603 INFO L82 PathProgramCache]: Analyzing trace with hash -1708669501, now seen corresponding path program 1 times [2019-11-15 20:45:43,603 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:45:43,603 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733900894] [2019-11-15 20:45:43,603 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:43,603 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:43,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:45:43,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:45,654 INFO L134 CoverageAnalysis]: Checked inductivity of 2142 backedges. 1473 proven. 169 refuted. 0 times theorem prover too weak. 500 trivial. 0 not checked. [2019-11-15 20:45:45,655 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733900894] [2019-11-15 20:45:45,655 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [983348022] [2019-11-15 20:45:45,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e26f7284-6e77-4951-96b3-766207c9d9df/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:45:45,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:45,921 INFO L256 TraceCheckSpWp]: Trace formula consists of 1725 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 20:45:45,935 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:45:45,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:45:47,214 INFO L134 CoverageAnalysis]: Checked inductivity of 2142 backedges. 253 proven. 0 refuted. 0 times theorem prover too weak. 1889 trivial. 0 not checked. [2019-11-15 20:45:47,215 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 20:45:47,215 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 5 [2019-11-15 20:45:47,216 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734350211] [2019-11-15 20:45:47,217 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:45:47,217 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:45:47,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:45:47,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:45:47,218 INFO L87 Difference]: Start difference. First operand 48304 states and 51237 transitions. Second operand 3 states. [2019-11-15 20:45:49,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:45:49,606 INFO L93 Difference]: Finished difference Result 112476 states and 119808 transitions. [2019-11-15 20:45:49,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:45:49,607 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1509 [2019-11-15 20:45:49,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:45:49,658 INFO L225 Difference]: With dead ends: 112476 [2019-11-15 20:45:49,659 INFO L226 Difference]: Without dead ends: 64864 [2019-11-15 20:45:49,677 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 1514 GetRequests, 1510 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:45:49,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64864 states. [2019-11-15 20:45:50,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64864 to 64174. [2019-11-15 20:45:50,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64174 states. [2019-11-15 20:45:50,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64174 states to 64174 states and 67509 transitions. [2019-11-15 20:45:50,204 INFO L78 Accepts]: Start accepts. Automaton has 64174 states and 67509 transitions. Word has length 1509 [2019-11-15 20:45:50,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:45:50,207 INFO L462 AbstractCegarLoop]: Abstraction has 64174 states and 67509 transitions. [2019-11-15 20:45:50,207 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:45:50,207 INFO L276 IsEmpty]: Start isEmpty. Operand 64174 states and 67509 transitions. [2019-11-15 20:45:50,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1588 [2019-11-15 20:45:50,258 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:45:50,259 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 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, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:45:50,463 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:45:50,463 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:45:50,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:45:50,464 INFO L82 PathProgramCache]: Analyzing trace with hash -1487587763, now seen corresponding path program 1 times [2019-11-15 20:45:50,464 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:45:50,464 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777733696] [2019-11-15 20:45:50,464 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:50,464 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:50,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:45:50,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:55,692 INFO L134 CoverageAnalysis]: Checked inductivity of 2729 backedges. 812 proven. 1657 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2019-11-15 20:45:55,693 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777733696] [2019-11-15 20:45:55,693 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [881986614] [2019-11-15 20:45:55,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e26f7284-6e77-4951-96b3-766207c9d9df/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:45:55,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:55,970 INFO L256 TraceCheckSpWp]: Trace formula consists of 1828 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 20:45:55,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:45:57,306 INFO L134 CoverageAnalysis]: Checked inductivity of 2729 backedges. 1664 proven. 0 refuted. 0 times theorem prover too weak. 1065 trivial. 0 not checked. [2019-11-15 20:45:57,307 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 20:45:57,308 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 12 [2019-11-15 20:45:57,308 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511533001] [2019-11-15 20:45:57,309 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:45:57,309 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:45:57,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:45:57,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-11-15 20:45:57,310 INFO L87 Difference]: Start difference. First operand 64174 states and 67509 transitions. Second operand 3 states. [2019-11-15 20:45:59,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:45:59,565 INFO L93 Difference]: Finished difference Result 127656 states and 134325 transitions. [2019-11-15 20:45:59,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:45:59,566 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1587 [2019-11-15 20:45:59,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:45:59,617 INFO L225 Difference]: With dead ends: 127656 [2019-11-15 20:45:59,618 INFO L226 Difference]: Without dead ends: 64174 [2019-11-15 20:45:59,637 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 1599 GetRequests, 1587 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-11-15 20:45:59,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64174 states. [2019-11-15 20:46:00,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64174 to 63484. [2019-11-15 20:46:00,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63484 states. [2019-11-15 20:46:00,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63484 states to 63484 states and 65806 transitions. [2019-11-15 20:46:00,105 INFO L78 Accepts]: Start accepts. Automaton has 63484 states and 65806 transitions. Word has length 1587 [2019-11-15 20:46:00,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:46:00,107 INFO L462 AbstractCegarLoop]: Abstraction has 63484 states and 65806 transitions. [2019-11-15 20:46:00,107 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:46:00,107 INFO L276 IsEmpty]: Start isEmpty. Operand 63484 states and 65806 transitions. [2019-11-15 20:46:00,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1669 [2019-11-15 20:46:00,159 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:46:00,160 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 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, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:46:00,364 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:46:00,365 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:46:00,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:46:00,365 INFO L82 PathProgramCache]: Analyzing trace with hash 185880196, now seen corresponding path program 1 times [2019-11-15 20:46:00,365 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:46:00,365 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686787177] [2019-11-15 20:46:00,365 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:00,366 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:00,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:46:00,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:02,534 INFO L134 CoverageAnalysis]: Checked inductivity of 2726 backedges. 2015 proven. 0 refuted. 0 times theorem prover too weak. 711 trivial. 0 not checked. [2019-11-15 20:46:02,535 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686787177] [2019-11-15 20:46:02,535 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:46:02,535 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:46:02,535 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875352470] [2019-11-15 20:46:02,537 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:46:02,537 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:46:02,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:46:02,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:46:02,538 INFO L87 Difference]: Start difference. First operand 63484 states and 65806 transitions. Second operand 4 states. [2019-11-15 20:46:05,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:46:05,502 INFO L93 Difference]: Finished difference Result 126966 states and 131624 transitions. [2019-11-15 20:46:05,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:46:05,503 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1668 [2019-11-15 20:46:05,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:46:05,566 INFO L225 Difference]: With dead ends: 126966 [2019-11-15 20:46:05,566 INFO L226 Difference]: Without dead ends: 64174 [2019-11-15 20:46:05,586 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 20:46:05,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64174 states. [2019-11-15 20:46:06,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64174 to 63484. [2019-11-15 20:46:06,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63484 states. [2019-11-15 20:46:06,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63484 states to 63484 states and 65516 transitions. [2019-11-15 20:46:06,069 INFO L78 Accepts]: Start accepts. Automaton has 63484 states and 65516 transitions. Word has length 1668 [2019-11-15 20:46:06,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:46:06,069 INFO L462 AbstractCegarLoop]: Abstraction has 63484 states and 65516 transitions. [2019-11-15 20:46:06,070 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:46:06,070 INFO L276 IsEmpty]: Start isEmpty. Operand 63484 states and 65516 transitions. [2019-11-15 20:46:06,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1670 [2019-11-15 20:46:06,105 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:46:06,106 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 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, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:46:06,106 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:46:06,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:46:06,107 INFO L82 PathProgramCache]: Analyzing trace with hash 512084973, now seen corresponding path program 1 times [2019-11-15 20:46:06,107 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:46:06,108 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917244219] [2019-11-15 20:46:06,108 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:06,108 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:06,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:46:06,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:07,972 INFO L134 CoverageAnalysis]: Checked inductivity of 2731 backedges. 1905 proven. 0 refuted. 0 times theorem prover too weak. 826 trivial. 0 not checked. [2019-11-15 20:46:07,972 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917244219] [2019-11-15 20:46:07,972 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:46:07,972 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:46:07,972 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000867083] [2019-11-15 20:46:07,973 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:46:07,974 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:46:07,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:46:07,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:46:07,974 INFO L87 Difference]: Start difference. First operand 63484 states and 65516 transitions. Second operand 4 states. [2019-11-15 20:46:11,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:46:11,574 INFO L93 Difference]: Finished difference Result 138696 states and 143460 transitions. [2019-11-15 20:46:11,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:46:11,575 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1669 [2019-11-15 20:46:11,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:46:11,632 INFO L225 Difference]: With dead ends: 138696 [2019-11-15 20:46:11,633 INFO L226 Difference]: Without dead ends: 75904 [2019-11-15 20:46:11,659 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 20:46:11,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75904 states. [2019-11-15 20:46:12,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75904 to 73834. [2019-11-15 20:46:12,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73834 states. [2019-11-15 20:46:12,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73834 states to 73834 states and 76121 transitions. [2019-11-15 20:46:12,233 INFO L78 Accepts]: Start accepts. Automaton has 73834 states and 76121 transitions. Word has length 1669 [2019-11-15 20:46:12,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:46:12,234 INFO L462 AbstractCegarLoop]: Abstraction has 73834 states and 76121 transitions. [2019-11-15 20:46:12,234 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:46:12,234 INFO L276 IsEmpty]: Start isEmpty. Operand 73834 states and 76121 transitions. [2019-11-15 20:46:12,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1686 [2019-11-15 20:46:12,273 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:46:12,274 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, 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, 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, 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, 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, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:46:12,275 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:46:12,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:46:12,275 INFO L82 PathProgramCache]: Analyzing trace with hash 1804123104, now seen corresponding path program 1 times [2019-11-15 20:46:12,276 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:46:12,276 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875327709] [2019-11-15 20:46:12,276 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:12,276 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:12,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:46:12,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:14,640 INFO L134 CoverageAnalysis]: Checked inductivity of 2544 backedges. 1336 proven. 0 refuted. 0 times theorem prover too weak. 1208 trivial. 0 not checked. [2019-11-15 20:46:14,640 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875327709] [2019-11-15 20:46:14,641 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:46:14,641 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:46:14,641 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23171929] [2019-11-15 20:46:14,642 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:46:14,642 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:46:14,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:46:14,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:46:14,642 INFO L87 Difference]: Start difference. First operand 73834 states and 76121 transitions. Second operand 4 states. [2019-11-15 20:46:17,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:46:17,946 INFO L93 Difference]: Finished difference Result 149046 states and 153637 transitions. [2019-11-15 20:46:17,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:46:17,946 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1685 [2019-11-15 20:46:17,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:46:18,006 INFO L225 Difference]: With dead ends: 149046 [2019-11-15 20:46:18,007 INFO L226 Difference]: Without dead ends: 75904 [2019-11-15 20:46:18,036 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 20:46:18,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75904 states. [2019-11-15 20:46:18,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75904 to 73834. [2019-11-15 20:46:18,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73834 states. [2019-11-15 20:46:18,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73834 states to 73834 states and 75713 transitions. [2019-11-15 20:46:18,612 INFO L78 Accepts]: Start accepts. Automaton has 73834 states and 75713 transitions. Word has length 1685 [2019-11-15 20:46:18,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:46:18,614 INFO L462 AbstractCegarLoop]: Abstraction has 73834 states and 75713 transitions. [2019-11-15 20:46:18,614 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:46:18,614 INFO L276 IsEmpty]: Start isEmpty. Operand 73834 states and 75713 transitions. [2019-11-15 20:46:18,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1828 [2019-11-15 20:46:18,665 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:46:18,666 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 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, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:46:18,666 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:46:18,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:46:18,667 INFO L82 PathProgramCache]: Analyzing trace with hash -2086344840, now seen corresponding path program 1 times [2019-11-15 20:46:18,667 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:46:18,667 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623749043] [2019-11-15 20:46:18,667 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:18,668 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:18,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:46:18,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:21,437 INFO L134 CoverageAnalysis]: Checked inductivity of 3381 backedges. 2333 proven. 0 refuted. 0 times theorem prover too weak. 1048 trivial. 0 not checked. [2019-11-15 20:46:21,438 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623749043] [2019-11-15 20:46:21,438 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:46:21,438 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:46:21,438 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483052736] [2019-11-15 20:46:21,439 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:46:21,439 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:46:21,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:46:21,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:46:21,440 INFO L87 Difference]: Start difference. First operand 73834 states and 75713 transitions. Second operand 4 states. [2019-11-15 20:46:24,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:46:24,554 INFO L93 Difference]: Finished difference Result 155256 states and 159292 transitions. [2019-11-15 20:46:24,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:46:24,554 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1827 [2019-11-15 20:46:24,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:46:24,615 INFO L225 Difference]: With dead ends: 155256 [2019-11-15 20:46:24,616 INFO L226 Difference]: Without dead ends: 75214 [2019-11-15 20:46:24,645 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 2 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 20:46:24,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75214 states. [2019-11-15 20:46:25,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75214 to 74524. [2019-11-15 20:46:25,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74524 states. [2019-11-15 20:46:25,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74524 states to 74524 states and 75898 transitions. [2019-11-15 20:46:25,224 INFO L78 Accepts]: Start accepts. Automaton has 74524 states and 75898 transitions. Word has length 1827 [2019-11-15 20:46:25,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:46:25,225 INFO L462 AbstractCegarLoop]: Abstraction has 74524 states and 75898 transitions. [2019-11-15 20:46:25,225 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:46:25,225 INFO L276 IsEmpty]: Start isEmpty. Operand 74524 states and 75898 transitions. [2019-11-15 20:46:25,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1871 [2019-11-15 20:46:25,267 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:46:25,268 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 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, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:46:25,269 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:46:25,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:46:25,269 INFO L82 PathProgramCache]: Analyzing trace with hash 138190504, now seen corresponding path program 1 times [2019-11-15 20:46:25,269 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:46:25,269 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469504073] [2019-11-15 20:46:25,270 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:25,270 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:25,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:46:25,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:27,677 INFO L134 CoverageAnalysis]: Checked inductivity of 3237 backedges. 2300 proven. 0 refuted. 0 times theorem prover too weak. 937 trivial. 0 not checked. [2019-11-15 20:46:27,678 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469504073] [2019-11-15 20:46:27,678 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:46:27,678 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:46:27,678 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197108576] [2019-11-15 20:46:27,679 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:46:27,679 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:46:27,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:46:27,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:46:27,680 INFO L87 Difference]: Start difference. First operand 74524 states and 75898 transitions. Second operand 3 states. [2019-11-15 20:46:29,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:46:29,545 INFO L93 Difference]: Finished difference Result 148356 states and 151103 transitions. [2019-11-15 20:46:29,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:46:29,545 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1870 [2019-11-15 20:46:29,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:46:29,604 INFO L225 Difference]: With dead ends: 148356 [2019-11-15 20:46:29,604 INFO L226 Difference]: Without dead ends: 74524 [2019-11-15 20:46:29,632 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 20:46:29,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74524 states. [2019-11-15 20:46:30,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74524 to 74524. [2019-11-15 20:46:30,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74524 states. [2019-11-15 20:46:30,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74524 states to 74524 states and 75875 transitions. [2019-11-15 20:46:30,188 INFO L78 Accepts]: Start accepts. Automaton has 74524 states and 75875 transitions. Word has length 1870 [2019-11-15 20:46:30,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:46:30,189 INFO L462 AbstractCegarLoop]: Abstraction has 74524 states and 75875 transitions. [2019-11-15 20:46:30,189 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:46:30,189 INFO L276 IsEmpty]: Start isEmpty. Operand 74524 states and 75875 transitions. [2019-11-15 20:46:30,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2089 [2019-11-15 20:46:30,250 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:46:30,251 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 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, 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, 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, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:46:30,251 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:46:30,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:46:30,252 INFO L82 PathProgramCache]: Analyzing trace with hash -2092346945, now seen corresponding path program 1 times [2019-11-15 20:46:30,252 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:46:30,252 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516481219] [2019-11-15 20:46:30,253 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:30,253 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:30,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:46:30,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:34,489 INFO L134 CoverageAnalysis]: Checked inductivity of 4072 backedges. 2474 proven. 260 refuted. 0 times theorem prover too weak. 1338 trivial. 0 not checked. [2019-11-15 20:46:34,490 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516481219] [2019-11-15 20:46:34,490 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1769502433] [2019-11-15 20:46:34,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e26f7284-6e77-4951-96b3-766207c9d9df/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:46:34,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:34,859 INFO L256 TraceCheckSpWp]: Trace formula consists of 2314 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 20:46:34,885 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:46:34,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:46:34,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:46:39,353 INFO L134 CoverageAnalysis]: Checked inductivity of 4072 backedges. 3133 proven. 0 refuted. 0 times theorem prover too weak. 939 trivial. 0 not checked. [2019-11-15 20:46:39,353 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 20:46:39,354 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2019-11-15 20:46:39,355 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890830526] [2019-11-15 20:46:39,356 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:46:39,356 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:46:39,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:46:39,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-11-15 20:46:39,356 INFO L87 Difference]: Start difference. First operand 74524 states and 75875 transitions. Second operand 3 states. [2019-11-15 20:46:42,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:46:42,423 INFO L93 Difference]: Finished difference Result 168366 states and 171628 transitions. [2019-11-15 20:46:42,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:46:42,423 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2088 [2019-11-15 20:46:42,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:46:42,498 INFO L225 Difference]: With dead ends: 168366 [2019-11-15 20:46:42,498 INFO L226 Difference]: Without dead ends: 94534 [2019-11-15 20:46:42,525 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2097 GetRequests, 2089 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-11-15 20:46:42,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94534 states. [2019-11-15 20:46:43,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94534 to 94534. [2019-11-15 20:46:43,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94534 states. [2019-11-15 20:46:43,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94534 states to 94534 states and 96322 transitions. [2019-11-15 20:46:43,320 INFO L78 Accepts]: Start accepts. Automaton has 94534 states and 96322 transitions. Word has length 2088 [2019-11-15 20:46:43,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:46:43,322 INFO L462 AbstractCegarLoop]: Abstraction has 94534 states and 96322 transitions. [2019-11-15 20:46:43,322 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:46:43,322 INFO L276 IsEmpty]: Start isEmpty. Operand 94534 states and 96322 transitions. [2019-11-15 20:46:43,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2091 [2019-11-15 20:46:43,388 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:46:43,389 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 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, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:46:43,590 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:46:43,590 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:46:43,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:46:43,591 INFO L82 PathProgramCache]: Analyzing trace with hash -1532011101, now seen corresponding path program 1 times [2019-11-15 20:46:43,591 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:46:43,591 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278160471] [2019-11-15 20:46:43,591 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:43,591 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:43,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:46:43,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:48,373 INFO L134 CoverageAnalysis]: Checked inductivity of 4515 backedges. 2904 proven. 0 refuted. 0 times theorem prover too weak. 1611 trivial. 0 not checked. [2019-11-15 20:46:48,374 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278160471] [2019-11-15 20:46:48,374 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:46:48,374 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:46:48,375 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200562549] [2019-11-15 20:46:48,376 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:46:48,376 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:46:48,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:46:48,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:46:48,376 INFO L87 Difference]: Start difference. First operand 94534 states and 96322 transitions. Second operand 4 states. [2019-11-15 20:46:51,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:46:51,496 INFO L93 Difference]: Finished difference Result 207696 states and 211606 transitions. [2019-11-15 20:46:51,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:46:51,496 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 2090 [2019-11-15 20:46:51,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:46:51,596 INFO L225 Difference]: With dead ends: 207696 [2019-11-15 20:46:51,596 INFO L226 Difference]: Without dead ends: 113854 [2019-11-15 20:46:51,634 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 20:46:51,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113854 states. [2019-11-15 20:46:52,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113854 to 100054. [2019-11-15 20:46:52,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100054 states. [2019-11-15 20:46:52,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100054 states to 100054 states and 101796 transitions. [2019-11-15 20:46:52,570 INFO L78 Accepts]: Start accepts. Automaton has 100054 states and 101796 transitions. Word has length 2090 [2019-11-15 20:46:52,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:46:52,571 INFO L462 AbstractCegarLoop]: Abstraction has 100054 states and 101796 transitions. [2019-11-15 20:46:52,571 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:46:52,571 INFO L276 IsEmpty]: Start isEmpty. Operand 100054 states and 101796 transitions. [2019-11-15 20:46:52,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2126 [2019-11-15 20:46:52,641 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:46:52,642 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:46:52,642 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:46:52,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:46:52,643 INFO L82 PathProgramCache]: Analyzing trace with hash 86066292, now seen corresponding path program 1 times [2019-11-15 20:46:52,643 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:46:52,643 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427152452] [2019-11-15 20:46:52,644 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:52,644 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:52,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:46:52,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:56,291 INFO L134 CoverageAnalysis]: Checked inductivity of 4725 backedges. 3472 proven. 0 refuted. 0 times theorem prover too weak. 1253 trivial. 0 not checked. [2019-11-15 20:46:56,291 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427152452] [2019-11-15 20:46:56,291 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:46:56,292 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:46:56,292 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830608927] [2019-11-15 20:46:56,293 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:46:56,293 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:46:56,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:46:56,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:46:56,294 INFO L87 Difference]: Start difference. First operand 100054 states and 101796 transitions. Second operand 4 states. [2019-11-15 20:46:59,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:46:59,534 INFO L93 Difference]: Finished difference Result 202176 states and 205689 transitions. [2019-11-15 20:46:59,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:46:59,535 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 2125 [2019-11-15 20:46:59,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:46:59,638 INFO L225 Difference]: With dead ends: 202176 [2019-11-15 20:46:59,638 INFO L226 Difference]: Without dead ends: 102814 [2019-11-15 20:46:59,675 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 4 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 20:46:59,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102814 states. [2019-11-15 20:47:00,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102814 to 97294. [2019-11-15 20:47:00,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97294 states. [2019-11-15 20:47:00,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97294 states to 97294 states and 98744 transitions. [2019-11-15 20:47:00,486 INFO L78 Accepts]: Start accepts. Automaton has 97294 states and 98744 transitions. Word has length 2125 [2019-11-15 20:47:00,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:47:00,487 INFO L462 AbstractCegarLoop]: Abstraction has 97294 states and 98744 transitions. [2019-11-15 20:47:00,487 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:47:00,487 INFO L276 IsEmpty]: Start isEmpty. Operand 97294 states and 98744 transitions. [2019-11-15 20:47:00,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2377 [2019-11-15 20:47:00,564 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:47:00,565 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 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, 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, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:47:00,565 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:47:00,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:47:00,566 INFO L82 PathProgramCache]: Analyzing trace with hash -1688109098, now seen corresponding path program 1 times [2019-11-15 20:47:00,566 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:47:00,566 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976302837] [2019-11-15 20:47:00,566 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:47:00,566 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:47:00,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:47:00,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:47:04,341 INFO L134 CoverageAnalysis]: Checked inductivity of 5586 backedges. 297 proven. 0 refuted. 0 times theorem prover too weak. 5289 trivial. 0 not checked. [2019-11-15 20:47:04,341 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976302837] [2019-11-15 20:47:04,342 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:47:04,342 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:47:04,342 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549034010] [2019-11-15 20:47:04,343 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:47:04,343 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:47:04,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:47:04,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:47:04,344 INFO L87 Difference]: Start difference. First operand 97294 states and 98744 transitions. Second operand 3 states. [2019-11-15 20:47:06,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:47:06,771 INFO L93 Difference]: Finished difference Result 199414 states and 202487 transitions. [2019-11-15 20:47:06,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:47:06,772 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2376 [2019-11-15 20:47:06,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:47:06,774 INFO L225 Difference]: With dead ends: 199414 [2019-11-15 20:47:06,774 INFO L226 Difference]: Without dead ends: 0 [2019-11-15 20:47:06,815 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 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 20:47:06,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-15 20:47:06,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-15 20:47:06,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-15 20:47:06,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 20:47:06,816 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 2376 [2019-11-15 20:47:06,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:47:06,817 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 20:47:06,817 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:47:06,817 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-15 20:47:06,817 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-15 20:47:06,821 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-15 20:47:07,314 WARN L191 SmtUtils]: Spent 478.00 ms on a formula simplification. DAG size of input: 361 DAG size of output: 215 [2019-11-15 20:47:07,762 WARN L191 SmtUtils]: Spent 446.00 ms on a formula simplification. DAG size of input: 361 DAG size of output: 215 [2019-11-15 20:47:08,174 WARN L191 SmtUtils]: Spent 409.00 ms on a formula simplification. DAG size of input: 361 DAG size of output: 215 [2019-11-15 20:47:08,507 WARN L191 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 361 DAG size of output: 215 [2019-11-15 20:47:10,507 WARN L191 SmtUtils]: Spent 2.00 s on a formula simplification. DAG size of input: 202 DAG size of output: 108 [2019-11-15 20:47:12,339 WARN L191 SmtUtils]: Spent 1.83 s on a formula simplification. DAG size of input: 202 DAG size of output: 108 [2019-11-15 20:47:14,168 WARN L191 SmtUtils]: Spent 1.83 s on a formula simplification. DAG size of input: 202 DAG size of output: 108 [2019-11-15 20:47:16,021 WARN L191 SmtUtils]: Spent 1.85 s on a formula simplification. DAG size of input: 202 DAG size of output: 108 [2019-11-15 20:47:16,023 INFO L443 ceAbstractionStarter]: For program point L2876(lines 2876 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,023 INFO L443 ceAbstractionStarter]: For program point L3933(lines 3933 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,023 INFO L443 ceAbstractionStarter]: For program point L1687(lines 1687 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,023 INFO L443 ceAbstractionStarter]: For program point L498(lines 498 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,023 INFO L443 ceAbstractionStarter]: For program point L2480(lines 2480 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,023 INFO L443 ceAbstractionStarter]: For program point L102(line 102) no Hoare annotation was computed. [2019-11-15 20:47:16,023 INFO L443 ceAbstractionStarter]: For program point L4066(lines 4066 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,023 INFO L443 ceAbstractionStarter]: For program point L1952(lines 1952 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,024 INFO L443 ceAbstractionStarter]: For program point L631(lines 631 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,024 INFO L443 ceAbstractionStarter]: For program point L367(lines 367 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,024 INFO L443 ceAbstractionStarter]: For program point L2349(lines 2349 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,024 INFO L443 ceAbstractionStarter]: For program point L896(lines 896 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,024 INFO L443 ceAbstractionStarter]: For program point L1557(lines 1557 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,024 INFO L443 ceAbstractionStarter]: For program point L1425(lines 1425 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,024 INFO L443 ceAbstractionStarter]: For program point L3407(lines 3407 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,024 INFO L443 ceAbstractionStarter]: For program point L3275(lines 3275 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,024 INFO L443 ceAbstractionStarter]: For program point L104-1(lines 25 1638) no Hoare annotation was computed. [2019-11-15 20:47:16,024 INFO L443 ceAbstractionStarter]: For program point L3011(lines 3011 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,024 INFO L443 ceAbstractionStarter]: For program point L3804(lines 3804 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,024 INFO L443 ceAbstractionStarter]: For program point L2747(lines 2747 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,024 INFO L443 ceAbstractionStarter]: For program point L105(line 105) no Hoare annotation was computed. [2019-11-15 20:47:16,024 INFO L443 ceAbstractionStarter]: For program point L4201(lines 4201 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,024 INFO L443 ceAbstractionStarter]: For program point L2087(lines 2087 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,025 INFO L443 ceAbstractionStarter]: For program point L1823(lines 1823 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,025 INFO L443 ceAbstractionStarter]: For program point L766(lines 766 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,025 INFO L443 ceAbstractionStarter]: For program point L3541(lines 3541 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,025 INFO L443 ceAbstractionStarter]: For program point L238(lines 238 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,025 INFO L443 ceAbstractionStarter]: For program point L2220(lines 2220 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,025 INFO L443 ceAbstractionStarter]: For program point L1163(lines 1163 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,025 INFO L443 ceAbstractionStarter]: For program point L3145(lines 3145 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,025 INFO L443 ceAbstractionStarter]: For program point L3674(lines 3674 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,025 INFO L443 ceAbstractionStarter]: For program point L2617(lines 2617 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,025 INFO L443 ceAbstractionStarter]: For program point L503(lines 503 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,025 INFO L443 ceAbstractionStarter]: For program point L107-1(lines 25 1638) no Hoare annotation was computed. [2019-11-15 20:47:16,025 INFO L443 ceAbstractionStarter]: For program point L4071(lines 4071 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,025 INFO L443 ceAbstractionStarter]: For program point L2882(lines 2882 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,025 INFO L443 ceAbstractionStarter]: For program point L3939(lines 3939 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,025 INFO L443 ceAbstractionStarter]: For program point L1693(lines 1693 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,026 INFO L443 ceAbstractionStarter]: For program point L636(lines 636 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,026 INFO L443 ceAbstractionStarter]: For program point L1297(lines 1297 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,026 INFO L443 ceAbstractionStarter]: For program point L108(line 108) no Hoare annotation was computed. [2019-11-15 20:47:16,026 INFO L443 ceAbstractionStarter]: For program point L1033(lines 1033 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,026 INFO L443 ceAbstractionStarter]: For program point L2487(lines 2487 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,026 INFO L443 ceAbstractionStarter]: For program point L373(lines 373 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,026 INFO L443 ceAbstractionStarter]: For program point L1959(lines 1959 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,026 INFO L443 ceAbstractionStarter]: For program point L1563(lines 1563 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,026 INFO L443 ceAbstractionStarter]: For program point L2356(lines 2356 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,026 INFO L443 ceAbstractionStarter]: For program point L3413(lines 3413 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,026 INFO L443 ceAbstractionStarter]: For program point L110-1(lines 25 1638) no Hoare annotation was computed. [2019-11-15 20:47:16,026 INFO L443 ceAbstractionStarter]: For program point L903(lines 903 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,026 INFO L443 ceAbstractionStarter]: For program point L1432(lines 1432 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,026 INFO L443 ceAbstractionStarter]: For program point L3282(lines 3282 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,026 INFO L443 ceAbstractionStarter]: For program point L111(line 111) no Hoare annotation was computed. [2019-11-15 20:47:16,026 INFO L443 ceAbstractionStarter]: For program point L3018(lines 3018 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,026 INFO L443 ceAbstractionStarter]: For program point L2754(lines 2754 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,026 INFO L443 ceAbstractionStarter]: For program point L3811(lines 3811 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,026 INFO L443 ceAbstractionStarter]: For program point L3547(lines 3547 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,026 INFO L443 ceAbstractionStarter]: For program point L2226(lines 2226 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,026 INFO L443 ceAbstractionStarter]: For program point L1169(lines 1169 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,027 INFO L443 ceAbstractionStarter]: For program point L2094(lines 2094 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,027 INFO L443 ceAbstractionStarter]: For program point L4208(lines 4208 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,027 INFO L443 ceAbstractionStarter]: For program point L4076(lines 4076 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,027 INFO L443 ceAbstractionStarter]: For program point L1830(lines 1830 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,027 INFO L443 ceAbstractionStarter]: For program point L773(lines 773 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,027 INFO L443 ceAbstractionStarter]: For program point L509(lines 509 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,027 INFO L443 ceAbstractionStarter]: For program point L245(lines 245 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,027 INFO L443 ceAbstractionStarter]: For program point L3152(lines 3152 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,027 INFO L443 ceAbstractionStarter]: For program point L113-1(lines 25 1638) no Hoare annotation was computed. [2019-11-15 20:47:16,027 INFO L443 ceAbstractionStarter]: For program point L1699(lines 1699 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,027 INFO L443 ceAbstractionStarter]: For program point L2624(lines 2624 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,027 INFO L443 ceAbstractionStarter]: For program point L3681(lines 3681 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,027 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 141) no Hoare annotation was computed. [2019-11-15 20:47:16,027 INFO L443 ceAbstractionStarter]: For program point L114(line 114) no Hoare annotation was computed. [2019-11-15 20:47:16,027 INFO L443 ceAbstractionStarter]: For program point L1039(lines 1039 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,027 INFO L443 ceAbstractionStarter]: For program point L3946(lines 3946 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,027 INFO L443 ceAbstractionStarter]: For program point L2889(lines 2889 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,027 INFO L443 ceAbstractionStarter]: For program point L643(lines 643 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,028 INFO L443 ceAbstractionStarter]: For program point L2493(lines 2493 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,028 INFO L443 ceAbstractionStarter]: For program point L1304(lines 1304 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,028 INFO L443 ceAbstractionStarter]: For program point L1569(lines 1569 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,028 INFO L443 ceAbstractionStarter]: For program point L380(lines 380 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,028 INFO L443 ceAbstractionStarter]: For program point L3419(lines 3419 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,028 INFO L443 ceAbstractionStarter]: For program point L116-1(lines 25 1638) no Hoare annotation was computed. [2019-11-15 20:47:16,028 INFO L443 ceAbstractionStarter]: For program point L1966(lines 1966 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,028 INFO L443 ceAbstractionStarter]: For program point L3023(lines 3023 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,028 INFO L443 ceAbstractionStarter]: For program point L909(lines 909 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,028 INFO L443 ceAbstractionStarter]: For program point L2363(lines 2363 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,028 INFO L443 ceAbstractionStarter]: For program point L3288(lines 3288 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,028 INFO L443 ceAbstractionStarter]: For program point L117(line 117) no Hoare annotation was computed. [2019-11-15 20:47:16,028 INFO L443 ceAbstractionStarter]: For program point L1835(lines 1835 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,029 INFO L443 ceAbstractionStarter]: For program point L778(lines 778 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,029 INFO L443 ceAbstractionStarter]: For program point L2760(lines 2760 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,029 INFO L443 ceAbstractionStarter]: For program point L3553(lines 3553 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,029 INFO L443 ceAbstractionStarter]: For program point L1439(lines 1439 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,029 INFO L443 ceAbstractionStarter]: For program point L3157(lines 3157 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,029 INFO L443 ceAbstractionStarter]: For program point L3818(lines 3818 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,029 INFO L443 ceAbstractionStarter]: For program point L515(lines 515 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,029 INFO L443 ceAbstractionStarter]: For program point L4215(lines 4215 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,030 INFO L443 ceAbstractionStarter]: For program point L1176(lines 1176 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,030 INFO L443 ceAbstractionStarter]: For program point L2233(lines 2233 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,030 INFO L443 ceAbstractionStarter]: For program point L119-1(lines 25 1638) no Hoare annotation was computed. [2019-11-15 20:47:16,030 INFO L443 ceAbstractionStarter]: For program point L2101(lines 2101 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,030 INFO L443 ceAbstractionStarter]: For program point L4083(lines 4083 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,030 INFO L443 ceAbstractionStarter]: For program point L2630(lines 2630 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,030 INFO L443 ceAbstractionStarter]: For program point L2498(lines 2498 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,030 INFO L443 ceAbstractionStarter]: For program point L252(lines 252 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,030 INFO L443 ceAbstractionStarter]: For program point L120(line 120) no Hoare annotation was computed. [2019-11-15 20:47:16,030 INFO L443 ceAbstractionStarter]: For program point L1045(lines 1045 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,030 INFO L443 ceAbstractionStarter]: For program point L2895(lines 2895 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,030 INFO L443 ceAbstractionStarter]: For program point L1706(lines 1706 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,030 INFO L443 ceAbstractionStarter]: For program point L649(lines 649 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,031 INFO L443 ceAbstractionStarter]: For program point L3688(lines 3688 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,031 INFO L443 ceAbstractionStarter]: For program point L1971(lines 1971 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,031 INFO L443 ceAbstractionStarter]: For program point L3953(lines 3953 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,031 INFO L443 ceAbstractionStarter]: For program point L3425(lines 3425 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,031 INFO L443 ceAbstractionStarter]: For program point L1311(lines 1311 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,031 INFO L443 ceAbstractionStarter]: For program point L122-1(lines 25 1638) no Hoare annotation was computed. [2019-11-15 20:47:16,031 INFO L443 ceAbstractionStarter]: For program point L915(lines 915 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,031 INFO L443 ceAbstractionStarter]: For program point L1576(lines 1576 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,031 INFO L443 ceAbstractionStarter]: For program point L387(lines 387 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,031 INFO L443 ceAbstractionStarter]: For program point L3294(lines 3294 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,031 INFO L443 ceAbstractionStarter]: For program point L123(line 123) no Hoare annotation was computed. [2019-11-15 20:47:16,031 INFO L443 ceAbstractionStarter]: For program point L3030(lines 3030 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,031 INFO L443 ceAbstractionStarter]: For program point L1841(lines 1841 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,031 INFO L443 ceAbstractionStarter]: For program point L784(lines 784 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,031 INFO L443 ceAbstractionStarter]: For program point L2766(lines 2766 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,031 INFO L443 ceAbstractionStarter]: For program point L2370(lines 2370 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,032 INFO L443 ceAbstractionStarter]: For program point L3824(lines 3824 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,032 INFO L443 ceAbstractionStarter]: For program point L3560(lines 3560 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,032 INFO L443 ceAbstractionStarter]: For program point L1446(lines 1446 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,032 INFO L443 ceAbstractionStarter]: For program point L2239(lines 2239 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,032 INFO L443 ceAbstractionStarter]: For program point L3164(lines 3164 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,032 INFO L443 ceAbstractionStarter]: For program point L125-1(lines 25 1638) no Hoare annotation was computed. [2019-11-15 20:47:16,032 INFO L443 ceAbstractionStarter]: For program point L2636(lines 2636 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,032 INFO L443 ceAbstractionStarter]: For program point L522(lines 522 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,032 INFO L443 ceAbstractionStarter]: For program point L2504(lines 2504 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,032 INFO L443 ceAbstractionStarter]: For program point L258(lines 258 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,032 INFO L443 ceAbstractionStarter]: For program point L4222(lines 4222 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,032 INFO L443 ceAbstractionStarter]: For program point L1183(lines 1183 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,032 INFO L443 ceAbstractionStarter]: For program point L126(line 126) no Hoare annotation was computed. [2019-11-15 20:47:16,032 INFO L443 ceAbstractionStarter]: For program point L2108(lines 2108 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,032 INFO L443 ceAbstractionStarter]: For program point L1051(lines 1051 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,032 INFO L443 ceAbstractionStarter]: For program point L4090(lines 4090 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,033 INFO L443 ceAbstractionStarter]: For program point L2901(lines 2901 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,033 INFO L443 ceAbstractionStarter]: For program point L1712(lines 1712 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,033 INFO L443 ceAbstractionStarter]: For program point L656(lines 656 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,033 INFO L443 ceAbstractionStarter]: For program point L3695(lines 3695 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,033 INFO L443 ceAbstractionStarter]: For program point L1317(lines 1317 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,033 INFO L443 ceAbstractionStarter]: For program point L128-1(lines 25 1638) no Hoare annotation was computed. [2019-11-15 20:47:16,033 INFO L443 ceAbstractionStarter]: For program point L1978(lines 1978 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,033 INFO L443 ceAbstractionStarter]: For program point L3960(lines 3960 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,033 INFO L443 ceAbstractionStarter]: For program point L1582(lines 1582 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,033 INFO L443 ceAbstractionStarter]: For program point L393(lines 393 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,033 INFO L443 ceAbstractionStarter]: For program point L3432(lines 3432 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,033 INFO L443 ceAbstractionStarter]: For program point L129(line 129) no Hoare annotation was computed. [2019-11-15 20:47:16,033 INFO L443 ceAbstractionStarter]: For program point L922(lines 922 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,033 INFO L443 ceAbstractionStarter]: For program point L1847(lines 1847 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,033 INFO L443 ceAbstractionStarter]: For program point L790(lines 790 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,033 INFO L443 ceAbstractionStarter]: For program point L2772(lines 2772 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,033 INFO L443 ceAbstractionStarter]: For program point L2376(lines 2376 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,034 INFO L443 ceAbstractionStarter]: For program point L3301(lines 3301 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,034 INFO L443 ceAbstractionStarter]: For program point L3037(lines 3037 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,034 INFO L443 ceAbstractionStarter]: For program point L3830(lines 3830 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,034 INFO L443 ceAbstractionStarter]: For program point L1452(lines 1452 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,034 INFO L443 ceAbstractionStarter]: For program point L263(lines 263 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,040 INFO L443 ceAbstractionStarter]: For program point L2245(lines 2245 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,040 INFO L443 ceAbstractionStarter]: For program point L131-1(lines 25 1638) no Hoare annotation was computed. [2019-11-15 20:47:16,040 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-15 20:47:16,041 INFO L443 ceAbstractionStarter]: For program point L2510(lines 2510 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,041 INFO L443 ceAbstractionStarter]: For program point L3567(lines 3567 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,041 INFO L443 ceAbstractionStarter]: For program point L132(line 132) no Hoare annotation was computed. [2019-11-15 20:47:16,041 INFO L443 ceAbstractionStarter]: For program point L2114(lines 2114 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,041 INFO L443 ceAbstractionStarter]: For program point L3171(lines 3171 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,041 INFO L443 ceAbstractionStarter]: For program point L4096(lines 4096 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,041 INFO L443 ceAbstractionStarter]: For program point L1718(lines 1718 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,042 INFO L443 ceAbstractionStarter]: For program point L2643(lines 2643 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,042 INFO L443 ceAbstractionStarter]: For program point L529(lines 529 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,042 INFO L443 ceAbstractionStarter]: For program point L1190(lines 1190 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,042 INFO L443 ceAbstractionStarter]: For program point L4229(lines 4229 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,042 INFO L443 ceAbstractionStarter]: For program point L1058(lines 1058 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,042 INFO L443 ceAbstractionStarter]: For program point L2908(lines 2908 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,042 INFO L443 ceAbstractionStarter]: For program point L1323(lines 1323 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,042 INFO L443 ceAbstractionStarter]: For program point L134-1(lines 25 1638) no Hoare annotation was computed. [2019-11-15 20:47:16,042 INFO L443 ceAbstractionStarter]: For program point L3966(lines 3966 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,042 INFO L443 ceAbstractionStarter]: For program point L663(lines 663 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,042 INFO L443 ceAbstractionStarter]: For program point L3702(lines 3702 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,042 INFO L443 ceAbstractionStarter]: For program point L1588(lines 1588 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,043 INFO L443 ceAbstractionStarter]: For program point L399(lines 399 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,043 INFO L443 ceAbstractionStarter]: For program point L3438(lines 3438 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,043 INFO L443 ceAbstractionStarter]: For program point L135(line 135) no Hoare annotation was computed. [2019-11-15 20:47:16,043 INFO L443 ceAbstractionStarter]: For program point L3042(lines 3042 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,043 INFO L443 ceAbstractionStarter]: For program point L1985(lines 1985 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,043 INFO L443 ceAbstractionStarter]: For program point L928(lines 928 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,043 INFO L443 ceAbstractionStarter]: For program point L3835(lines 3835 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,043 INFO L443 ceAbstractionStarter]: For program point L2382(lines 2382 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,043 INFO L443 ceAbstractionStarter]: For program point L1854(lines 1854 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,043 INFO L443 ceAbstractionStarter]: For program point L797(lines 797 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,043 INFO L443 ceAbstractionStarter]: For program point L2779(lines 2779 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,043 INFO L443 ceAbstractionStarter]: For program point L3308(lines 3308 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,043 INFO L443 ceAbstractionStarter]: For program point L2251(lines 2251 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,043 INFO L443 ceAbstractionStarter]: For program point L137-1(lines 25 1638) no Hoare annotation was computed. [2019-11-15 20:47:16,043 INFO L443 ceAbstractionStarter]: For program point L2516(lines 2516 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,043 INFO L443 ceAbstractionStarter]: For program point L3573(lines 3573 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,044 INFO L443 ceAbstractionStarter]: For program point L1459(lines 1459 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,044 INFO L443 ceAbstractionStarter]: For program point L270(lines 270 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,044 INFO L443 ceAbstractionStarter]: For program point L138(line 138) no Hoare annotation was computed. [2019-11-15 20:47:16,044 INFO L443 ceAbstractionStarter]: For program point L3177(lines 3177 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,044 INFO L443 ceAbstractionStarter]: For program point L2649(lines 2649 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,044 INFO L443 ceAbstractionStarter]: For program point L535(lines 535 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,044 INFO L443 ceAbstractionStarter]: For program point L2121(lines 2121 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,044 INFO L443 ceAbstractionStarter]: For program point L4103(lines 4103 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,045 INFO L443 ceAbstractionStarter]: For program point L1725(lines 1725 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,045 INFO L443 ceAbstractionStarter]: For program point L1197(lines 1197 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,045 INFO L443 ceAbstractionStarter]: For program point L140-1(lines 25 1638) no Hoare annotation was computed. [2019-11-15 20:47:16,045 INFO L443 ceAbstractionStarter]: For program point L4236(lines 4236 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,045 INFO L443 ceAbstractionStarter]: For program point L1065(lines 1065 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,045 INFO L443 ceAbstractionStarter]: For program point L1990(lines 1990 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,045 INFO L443 ceAbstractionStarter]: For program point L2915(lines 2915 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,045 INFO L443 ceAbstractionStarter]: For program point L3444(lines 3444 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,046 INFO L443 ceAbstractionStarter]: For program point L1330(lines 1330 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,046 INFO L443 ceAbstractionStarter]: For program point L2387(lines 2387 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,046 INFO L443 ceAbstractionStarter]: For program point L141(line 141) no Hoare annotation was computed. [2019-11-15 20:47:16,046 INFO L443 ceAbstractionStarter]: For program point L3973(lines 3973 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,046 INFO L443 ceAbstractionStarter]: For program point L670(lines 670 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,046 INFO L443 ceAbstractionStarter]: For program point L3709(lines 3709 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,046 INFO L443 ceAbstractionStarter]: For program point L1595(lines 1595 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,047 INFO L443 ceAbstractionStarter]: For program point L406(lines 406 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,047 INFO L443 ceAbstractionStarter]: For program point L935(lines 935 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,047 INFO L443 ceAbstractionStarter]: For program point L1860(lines 1860 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,047 INFO L443 ceAbstractionStarter]: For program point L3842(lines 3842 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,047 INFO L443 ceAbstractionStarter]: For program point L143-1(lines 25 1638) no Hoare annotation was computed. [2019-11-15 20:47:16,048 INFO L439 ceAbstractionStarter]: At program point L3050(lines 1640 3051) the Hoare annotation is: (let ((.cse1 (= ~a24~0 3))) (let ((.cse4 (< 306 ~a3~0)) (.cse18 (<= 418 ~a3~0)) (.cse11 (= ~a18~0 9)) (.cse19 (<= ~a24~0 0)) (.cse21 (<= ~a18~0 9)) (.cse17 (= ~a24~0 4)) (.cse9 (<= ~a3~0 417)) (.cse15 (= 10 ~a18~0)) (.cse10 (<= 116 ~a3~0)) (.cse8 (= 4 ~a15~0)) (.cse5 (= 12 ~a18~0)) (.cse20 (not (= ~a24~0 0))) (.cse16 (not (= ~a15~0 4))) (.cse6 (exists ((v_~a3~0_1866 Int)) (and (<= 0 (* 4 v_~a3~0_1866)) (< 306 v_~a3~0_1866) (<= (+ (div (* v_~a3~0_1866 4) 10) 67) ~a3~0)))) (.cse14 (not (= 6 ~a15~0))) (.cse3 (<= ~a18~0 8)) (.cse0 (<= ~a3~0 115)) (.cse7 (= ~a24~0 1)) (.cse12 (not .cse1)) (.cse13 (= ~a18~0 11)) (.cse2 (<= 6 ~a15~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4) (and .cse5 .cse6 .cse7) (and .cse3 .cse1 .cse6) (and .cse8 .cse9 .cse10 .cse11) (and .cse12 .cse8 .cse3 .cse0) (and .cse13 .cse1 .cse9 .cse14) (and .cse12 .cse15 .cse16 .cse14) (and .cse15 .cse6 .cse17) (and (or (and .cse13 .cse17) (and .cse5 .cse8 .cse17)) .cse10) (and (and (not (= 8 ~a18~0)) .cse8 .cse0 .cse1) (not .cse5)) (and .cse2 .cse4 .cse11) (and .cse8 .cse3 .cse17) (and .cse3 .cse16 .cse10) (and .cse16 .cse13 .cse18) (and .cse12 .cse16 .cse14 .cse11) (and .cse19 .cse13) (and .cse8 .cse13 .cse17) (and .cse15 .cse2 .cse20) (and .cse7 .cse21) (and .cse15 .cse7) (and .cse12 .cse13 (<= 336 ~a3~0)) (and .cse5 .cse16 .cse4 .cse14) (and .cse5 .cse19 .cse10) (and .cse19 .cse8) (and .cse15 .cse16 .cse18) (and .cse12 .cse5 .cse2 .cse20) (and .cse12 .cse20 .cse10 .cse11) (and .cse5 .cse2 .cse9 .cse10) (and .cse2 .cse20 .cse21) (and .cse5 .cse0 .cse17) (and .cse8 .cse15 .cse1) (and .cse8 .cse13 .cse7) (and .cse19 .cse21 .cse14) (and .cse15 .cse0 .cse17) (and (and .cse5 .cse8 .cse1 .cse9) .cse10) (and .cse15 .cse2 .cse10) (and .cse5 .cse8 .cse7) (and .cse5 .cse16 .cse0 .cse20) (and .cse16 .cse13 .cse6 .cse14) (and .cse3 .cse2) (and .cse13 .cse0 .cse7) (and .cse12 .cse13 .cse2)))) [2019-11-15 20:47:16,048 INFO L443 ceAbstractionStarter]: For program point L804(lines 804 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,048 INFO L443 ceAbstractionStarter]: For program point L2786(lines 2786 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,048 INFO L443 ceAbstractionStarter]: For program point L2522(lines 2522 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,048 INFO L443 ceAbstractionStarter]: For program point L3579(lines 3579 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,048 INFO L443 ceAbstractionStarter]: For program point L1465(lines 1465 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,049 INFO L443 ceAbstractionStarter]: For program point L276(lines 276 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,049 INFO L443 ceAbstractionStarter]: For program point L2258(lines 2258 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,049 INFO L443 ceAbstractionStarter]: For program point L3315(lines 3315 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,049 INFO L443 ceAbstractionStarter]: For program point L144(line 144) no Hoare annotation was computed. [2019-11-15 20:47:16,049 INFO L443 ceAbstractionStarter]: For program point L3183(lines 3183 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,049 INFO L443 ceAbstractionStarter]: For program point L1730(lines 1730 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,049 INFO L443 ceAbstractionStarter]: For program point L2655(lines 2655 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,050 INFO L443 ceAbstractionStarter]: For program point L4109(lines 4109 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,050 INFO L443 ceAbstractionStarter]: For program point L542(lines 542 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,050 INFO L443 ceAbstractionStarter]: For program point L1203(lines 1203 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,050 INFO L443 ceAbstractionStarter]: For program point L146-1(lines 25 1638) no Hoare annotation was computed. [2019-11-15 20:47:16,050 INFO L443 ceAbstractionStarter]: For program point L2128(lines 2128 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,050 INFO L443 ceAbstractionStarter]: For program point L1996(lines 1996 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,050 INFO L443 ceAbstractionStarter]: For program point L2921(lines 2921 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,051 INFO L443 ceAbstractionStarter]: For program point L1336(lines 1336 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,051 INFO L443 ceAbstractionStarter]: For program point L2393(lines 2393 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,051 INFO L443 ceAbstractionStarter]: For program point L4243(lines 4243 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,051 INFO L443 ceAbstractionStarter]: For program point L147(line 147) no Hoare annotation was computed. [2019-11-15 20:47:16,051 INFO L443 ceAbstractionStarter]: For program point L1072(lines 1072 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,051 INFO L443 ceAbstractionStarter]: For program point L3979(lines 3979 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,051 INFO L443 ceAbstractionStarter]: For program point L676(lines 676 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,051 INFO L443 ceAbstractionStarter]: For program point L3451(lines 3451 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,052 INFO L443 ceAbstractionStarter]: For program point L941(lines 941 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,052 INFO L443 ceAbstractionStarter]: For program point L1866(lines 1866 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,052 INFO L443 ceAbstractionStarter]: For program point L3848(lines 3848 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,052 INFO L443 ceAbstractionStarter]: For program point L3716(lines 3716 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,052 INFO L443 ceAbstractionStarter]: For program point L1602(lines 1602 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,052 INFO L443 ceAbstractionStarter]: For program point L3584(lines 3584 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,052 INFO L443 ceAbstractionStarter]: For program point L413(lines 413 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,053 INFO L443 ceAbstractionStarter]: For program point L149-1(lines 25 1638) no Hoare annotation was computed. [2019-11-15 20:47:16,053 INFO L443 ceAbstractionStarter]: For program point L3056(lines 3056 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,053 INFO L443 ceAbstractionStarter]: For program point L2792(lines 2792 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,053 INFO L443 ceAbstractionStarter]: For program point L2528(lines 2528 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,053 INFO L443 ceAbstractionStarter]: For program point L2264(lines 2264 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,053 INFO L443 ceAbstractionStarter]: For program point L150(line 150) no Hoare annotation was computed. [2019-11-15 20:47:16,053 INFO L443 ceAbstractionStarter]: For program point L3189(lines 3189 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,054 INFO L443 ceAbstractionStarter]: For program point L811(lines 811 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,054 INFO L443 ceAbstractionStarter]: For program point L2661(lines 2661 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,054 INFO L443 ceAbstractionStarter]: For program point L1472(lines 1472 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,054 INFO L443 ceAbstractionStarter]: For program point L283(lines 283 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,054 INFO L443 ceAbstractionStarter]: For program point L3322(lines 3322 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,054 INFO L443 ceAbstractionStarter]: For program point L1737(lines 1737 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,054 INFO L443 ceAbstractionStarter]: For program point L152-1(lines 25 1638) no Hoare annotation was computed. [2019-11-15 20:47:16,054 INFO L443 ceAbstractionStarter]: For program point L4116(lines 4116 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,055 INFO L443 ceAbstractionStarter]: For program point L2927(lines 2927 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,055 INFO L443 ceAbstractionStarter]: For program point L549(lines 549 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,055 INFO L443 ceAbstractionStarter]: For program point L2399(lines 2399 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,055 INFO L443 ceAbstractionStarter]: For program point L1210(lines 1210 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,055 INFO L443 ceAbstractionStarter]: For program point L153(line 153) no Hoare annotation was computed. [2019-11-15 20:47:16,055 INFO L443 ceAbstractionStarter]: For program point L1078(lines 1078 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,055 INFO L443 ceAbstractionStarter]: For program point L2135(lines 2135 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,056 INFO L443 ceAbstractionStarter]: For program point L2003(lines 2003 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,056 INFO L443 ceAbstractionStarter]: For program point L3985(lines 3985 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,056 INFO L443 ceAbstractionStarter]: For program point L1343(lines 1343 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,056 INFO L439 ceAbstractionStarter]: At program point L4250(lines 3053 4251) the Hoare annotation is: (let ((.cse1 (= ~a24~0 3))) (let ((.cse4 (< 306 ~a3~0)) (.cse18 (<= 418 ~a3~0)) (.cse11 (= ~a18~0 9)) (.cse19 (<= ~a24~0 0)) (.cse21 (<= ~a18~0 9)) (.cse17 (= ~a24~0 4)) (.cse9 (<= ~a3~0 417)) (.cse15 (= 10 ~a18~0)) (.cse10 (<= 116 ~a3~0)) (.cse8 (= 4 ~a15~0)) (.cse5 (= 12 ~a18~0)) (.cse20 (not (= ~a24~0 0))) (.cse16 (not (= ~a15~0 4))) (.cse6 (exists ((v_~a3~0_1866 Int)) (and (<= 0 (* 4 v_~a3~0_1866)) (< 306 v_~a3~0_1866) (<= (+ (div (* v_~a3~0_1866 4) 10) 67) ~a3~0)))) (.cse14 (not (= 6 ~a15~0))) (.cse3 (<= ~a18~0 8)) (.cse0 (<= ~a3~0 115)) (.cse7 (= ~a24~0 1)) (.cse12 (not .cse1)) (.cse13 (= ~a18~0 11)) (.cse2 (<= 6 ~a15~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4) (and .cse5 .cse6 .cse7) (and .cse3 .cse1 .cse6) (and .cse8 .cse9 .cse10 .cse11) (and .cse12 .cse8 .cse3 .cse0) (and .cse13 .cse1 .cse9 .cse14) (and .cse12 .cse15 .cse16 .cse14) (and .cse15 .cse6 .cse17) (and (or (and .cse13 .cse17) (and .cse5 .cse8 .cse17)) .cse10) (and (and (not (= 8 ~a18~0)) .cse8 .cse0 .cse1) (not .cse5)) (and .cse2 .cse4 .cse11) (and .cse8 .cse3 .cse17) (and .cse3 .cse16 .cse10) (and .cse16 .cse13 .cse18) (and .cse12 .cse16 .cse14 .cse11) (and .cse19 .cse13) (and .cse8 .cse13 .cse17) (and .cse15 .cse2 .cse20) (and .cse7 .cse21) (and .cse15 .cse7) (and .cse12 .cse13 (<= 336 ~a3~0)) (and .cse5 .cse16 .cse4 .cse14) (and .cse5 .cse19 .cse10) (and .cse19 .cse8) (and .cse15 .cse16 .cse18) (and .cse12 .cse5 .cse2 .cse20) (and .cse12 .cse20 .cse10 .cse11) (and .cse5 .cse2 .cse9 .cse10) (and .cse2 .cse20 .cse21) (and .cse5 .cse0 .cse17) (and .cse8 .cse15 .cse1) (and .cse8 .cse13 .cse7) (and .cse19 .cse21 .cse14) (and .cse15 .cse0 .cse17) (and (and .cse5 .cse8 .cse1 .cse9) .cse10) (and .cse15 .cse2 .cse10) (and .cse5 .cse8 .cse7) (and .cse5 .cse16 .cse0 .cse20) (and .cse16 .cse13 .cse6 .cse14) (and .cse3 .cse2) (and .cse13 .cse0 .cse7) (and .cse12 .cse13 .cse2)))) [2019-11-15 20:47:16,056 INFO L443 ceAbstractionStarter]: For program point L3854(lines 3854 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,057 INFO L443 ceAbstractionStarter]: For program point L683(lines 683 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,057 INFO L443 ceAbstractionStarter]: For program point L3458(lines 3458 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,057 INFO L443 ceAbstractionStarter]: For program point L155-1(lines 25 1638) no Hoare annotation was computed. [2019-11-15 20:47:16,057 INFO L443 ceAbstractionStarter]: For program point L948(lines 948 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,057 INFO L443 ceAbstractionStarter]: For program point L1873(lines 1873 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,057 INFO L443 ceAbstractionStarter]: For program point L2798(lines 2798 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,057 INFO L443 ceAbstractionStarter]: For program point L3723(lines 3723 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,057 INFO L443 ceAbstractionStarter]: For program point L1609(lines 1609 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,058 INFO L443 ceAbstractionStarter]: For program point L2534(lines 2534 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,058 INFO L443 ceAbstractionStarter]: For program point L3591(lines 3591 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,058 INFO L443 ceAbstractionStarter]: For program point L420(lines 420 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,058 INFO L443 ceAbstractionStarter]: For program point L156(line 156) no Hoare annotation was computed. [2019-11-15 20:47:16,058 INFO L443 ceAbstractionStarter]: For program point L3063(lines 3063 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,058 INFO L443 ceAbstractionStarter]: For program point L2667(lines 2667 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,058 INFO L443 ceAbstractionStarter]: For program point L1346(lines 1346 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,058 INFO L443 ceAbstractionStarter]: For program point L2271(lines 2271 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,058 INFO L443 ceAbstractionStarter]: For program point L3196(lines 3196 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,059 INFO L446 ceAbstractionStarter]: At program point L4253(lines 4253 4269) the Hoare annotation is: true [2019-11-15 20:47:16,059 INFO L443 ceAbstractionStarter]: For program point L2932(lines 2932 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,059 INFO L443 ceAbstractionStarter]: For program point L818(lines 818 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,059 INFO L443 ceAbstractionStarter]: For program point L1479(lines 1479 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,059 INFO L443 ceAbstractionStarter]: For program point L290(lines 290 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,059 INFO L443 ceAbstractionStarter]: For program point L3329(lines 3329 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,059 INFO L443 ceAbstractionStarter]: For program point L158-1(lines 25 1638) no Hoare annotation was computed. [2019-11-15 20:47:16,059 INFO L443 ceAbstractionStarter]: For program point L4122(lines 4122 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,059 INFO L443 ceAbstractionStarter]: For program point L26(lines 26 28) no Hoare annotation was computed. [2019-11-15 20:47:16,059 INFO L443 ceAbstractionStarter]: For program point L26-2(lines 25 1638) no Hoare annotation was computed. [2019-11-15 20:47:16,059 INFO L443 ceAbstractionStarter]: For program point L1744(lines 1744 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,059 INFO L443 ceAbstractionStarter]: For program point L159(line 159) no Hoare annotation was computed. [2019-11-15 20:47:16,059 INFO L443 ceAbstractionStarter]: For program point L1084(lines 1084 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,059 INFO L443 ceAbstractionStarter]: For program point L2141(lines 2141 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,059 INFO L443 ceAbstractionStarter]: For program point L27(line 27) no Hoare annotation was computed. [2019-11-15 20:47:16,059 INFO L443 ceAbstractionStarter]: For program point L3991(lines 3991 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,060 INFO L443 ceAbstractionStarter]: For program point L556(lines 556 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,060 INFO L443 ceAbstractionStarter]: For program point L2406(lines 2406 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,060 INFO L443 ceAbstractionStarter]: For program point L1217(lines 1217 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,060 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-15 20:47:16,060 INFO L443 ceAbstractionStarter]: For program point L2010(lines 2010 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,060 INFO L443 ceAbstractionStarter]: For program point L689(lines 689 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,060 INFO L443 ceAbstractionStarter]: For program point L3464(lines 3464 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,060 INFO L443 ceAbstractionStarter]: For program point L161-1(lines 25 1638) no Hoare annotation was computed. [2019-11-15 20:47:16,060 INFO L443 ceAbstractionStarter]: For program point L29-1(lines 25 1638) no Hoare annotation was computed. [2019-11-15 20:47:16,060 INFO L443 ceAbstractionStarter]: For program point L954(lines 954 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,060 INFO L443 ceAbstractionStarter]: For program point L1879(lines 1879 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,060 INFO L443 ceAbstractionStarter]: For program point L3861(lines 3861 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,060 INFO L443 ceAbstractionStarter]: For program point L2540(lines 2540 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,060 INFO L443 ceAbstractionStarter]: For program point L3597(lines 3597 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,060 INFO L443 ceAbstractionStarter]: For program point L426(lines 426 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,060 INFO L443 ceAbstractionStarter]: For program point L162(line 162) no Hoare annotation was computed. [2019-11-15 20:47:16,061 INFO L443 ceAbstractionStarter]: For program point L30(line 30) no Hoare annotation was computed. [2019-11-15 20:47:16,061 INFO L443 ceAbstractionStarter]: For program point L2805(lines 2805 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,061 INFO L443 ceAbstractionStarter]: For program point L3730(lines 3730 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,061 INFO L443 ceAbstractionStarter]: For program point L1616(lines 1616 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,061 INFO L443 ceAbstractionStarter]: For program point L1352(lines 1352 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,061 INFO L443 ceAbstractionStarter]: For program point L295(lines 295 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,061 INFO L443 ceAbstractionStarter]: For program point L2277(lines 2277 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,062 INFO L443 ceAbstractionStarter]: For program point L3070(lines 3070 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,062 INFO L439 ceAbstractionStarter]: At program point L4259-2(lines 4259 4268) the Hoare annotation is: (let ((.cse1 (= ~a24~0 3))) (let ((.cse4 (< 306 ~a3~0)) (.cse18 (<= 418 ~a3~0)) (.cse11 (= ~a18~0 9)) (.cse19 (<= ~a24~0 0)) (.cse21 (<= ~a18~0 9)) (.cse17 (= ~a24~0 4)) (.cse9 (<= ~a3~0 417)) (.cse15 (= 10 ~a18~0)) (.cse10 (<= 116 ~a3~0)) (.cse8 (= 4 ~a15~0)) (.cse5 (= 12 ~a18~0)) (.cse20 (not (= ~a24~0 0))) (.cse16 (not (= ~a15~0 4))) (.cse6 (exists ((v_~a3~0_1866 Int)) (and (<= 0 (* 4 v_~a3~0_1866)) (< 306 v_~a3~0_1866) (<= (+ (div (* v_~a3~0_1866 4) 10) 67) ~a3~0)))) (.cse14 (not (= 6 ~a15~0))) (.cse3 (<= ~a18~0 8)) (.cse0 (<= ~a3~0 115)) (.cse7 (= ~a24~0 1)) (.cse12 (not .cse1)) (.cse13 (= ~a18~0 11)) (.cse2 (<= 6 ~a15~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4) (and .cse5 .cse6 .cse7) (and .cse3 .cse1 .cse6) (and .cse8 .cse9 .cse10 .cse11) (and .cse12 .cse8 .cse3 .cse0) (and .cse13 .cse1 .cse9 .cse14) (and .cse12 .cse15 .cse16 .cse14) (and .cse15 .cse6 .cse17) (and (or (and .cse13 .cse17) (and .cse5 .cse8 .cse17)) .cse10) (and (and (not (= 8 ~a18~0)) .cse8 .cse0 .cse1) (not .cse5)) (and .cse2 .cse4 .cse11) (and .cse8 .cse3 .cse17) (and .cse3 .cse16 .cse10) (and .cse16 .cse13 .cse18) (and .cse12 .cse16 .cse14 .cse11) (and .cse19 .cse13) (and .cse8 .cse13 .cse17) (and .cse15 .cse2 .cse20) (and .cse7 .cse21) (and .cse15 .cse7) (and .cse12 .cse13 (<= 336 ~a3~0)) (and .cse5 .cse16 .cse4 .cse14) (and .cse5 .cse19 .cse10) (and .cse19 .cse8) (and .cse15 .cse16 .cse18) (and .cse12 .cse5 .cse2 .cse20) (and .cse12 .cse20 .cse10 .cse11) (and .cse5 .cse2 .cse9 .cse10) (and .cse2 .cse20 .cse21) (and .cse5 .cse0 .cse17) (and .cse8 .cse15 .cse1) (and .cse8 .cse13 .cse7) (and .cse19 .cse21 .cse14) (and .cse15 .cse0 .cse17) (and (and .cse5 .cse8 .cse1 .cse9) .cse10) (and .cse15 .cse2 .cse10) (and .cse5 .cse8 .cse7) (and .cse5 .cse16 .cse0 .cse20) (and .cse16 .cse13 .cse6 .cse14) (and .cse3 .cse2) (and .cse13 .cse0 .cse7) (and .cse12 .cse13 .cse2)))) [2019-11-15 20:47:16,062 INFO L443 ceAbstractionStarter]: For program point L2674(lines 2674 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,062 INFO L443 ceAbstractionStarter]: For program point L164-1(lines 25 1638) no Hoare annotation was computed. [2019-11-15 20:47:16,062 INFO L443 ceAbstractionStarter]: For program point L3203(lines 3203 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,063 INFO L443 ceAbstractionStarter]: For program point L32-1(lines 25 1638) no Hoare annotation was computed. [2019-11-15 20:47:16,063 INFO L443 ceAbstractionStarter]: For program point L2939(lines 2939 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,063 INFO L443 ceAbstractionStarter]: For program point L825(lines 825 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,063 INFO L443 ceAbstractionStarter]: For program point L1750(lines 1750 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,063 INFO L443 ceAbstractionStarter]: For program point L1486(lines 1486 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,063 INFO L443 ceAbstractionStarter]: For program point L3336(lines 3336 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,063 INFO L443 ceAbstractionStarter]: For program point L165(line 165) no Hoare annotation was computed. [2019-11-15 20:47:16,063 INFO L443 ceAbstractionStarter]: For program point L1090(lines 1090 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,063 INFO L443 ceAbstractionStarter]: For program point L33(line 33) no Hoare annotation was computed. [2019-11-15 20:47:16,063 INFO L443 ceAbstractionStarter]: For program point L4129(lines 4129 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,063 INFO L443 ceAbstractionStarter]: For program point L694(lines 694 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,063 INFO L443 ceAbstractionStarter]: For program point L298(lines 298 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,063 INFO L443 ceAbstractionStarter]: For program point L2148(lines 2148 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,063 INFO L443 ceAbstractionStarter]: For program point L2016(lines 2016 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,063 INFO L443 ceAbstractionStarter]: For program point L3998(lines 3998 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,063 INFO L443 ceAbstractionStarter]: For program point L1884(lines 1884 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,064 INFO L443 ceAbstractionStarter]: For program point L563(lines 563 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,064 INFO L443 ceAbstractionStarter]: For program point L3602(lines 3602 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,064 INFO L443 ceAbstractionStarter]: For program point L2413(lines 2413 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,064 INFO L443 ceAbstractionStarter]: For program point L1224(lines 1224 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,064 INFO L443 ceAbstractionStarter]: For program point L167-1(lines 25 1638) no Hoare annotation was computed. [2019-11-15 20:47:16,064 INFO L443 ceAbstractionStarter]: For program point L35-1(lines 25 1638) no Hoare annotation was computed. [2019-11-15 20:47:16,064 INFO L443 ceAbstractionStarter]: For program point L960(lines 960 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,064 INFO L443 ceAbstractionStarter]: For program point L3867(lines 3867 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,064 INFO L443 ceAbstractionStarter]: For program point L2546(lines 2546 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,064 INFO L443 ceAbstractionStarter]: For program point L432(lines 432 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,064 INFO L443 ceAbstractionStarter]: For program point L3471(lines 3471 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,064 INFO L443 ceAbstractionStarter]: For program point L168(line 168) no Hoare annotation was computed. [2019-11-15 20:47:16,064 INFO L443 ceAbstractionStarter]: For program point L4264(line 4264) no Hoare annotation was computed. [2019-11-15 20:47:16,064 INFO L443 ceAbstractionStarter]: For program point L36(line 36) no Hoare annotation was computed. [2019-11-15 20:47:16,064 INFO L443 ceAbstractionStarter]: For program point L2811(lines 2811 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,064 INFO L443 ceAbstractionStarter]: For program point L1358(lines 1358 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,064 INFO L443 ceAbstractionStarter]: For program point L3076(lines 3076 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,065 INFO L443 ceAbstractionStarter]: For program point L3737(lines 3737 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,065 INFO L443 ceAbstractionStarter]: For program point L1623(lines 1623 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,065 INFO L443 ceAbstractionStarter]: For program point L2284(lines 2284 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,065 INFO L443 ceAbstractionStarter]: For program point L170-1(lines 25 1638) no Hoare annotation was computed. [2019-11-15 20:47:16,065 INFO L443 ceAbstractionStarter]: For program point L38-1(lines 25 1638) no Hoare annotation was computed. [2019-11-15 20:47:16,065 INFO L443 ceAbstractionStarter]: For program point L2945(lines 2945 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,065 INFO L443 ceAbstractionStarter]: For program point L831(lines 831 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,065 INFO L443 ceAbstractionStarter]: For program point L1756(lines 1756 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,065 INFO L443 ceAbstractionStarter]: For program point L2681(lines 2681 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,065 INFO L443 ceAbstractionStarter]: For program point L3342(lines 3342 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,065 INFO L443 ceAbstractionStarter]: For program point L171(line 171) no Hoare annotation was computed. [2019-11-15 20:47:16,065 INFO L443 ceAbstractionStarter]: For program point L3210(lines 3210 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,065 INFO L443 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2019-11-15 20:47:16,065 INFO L443 ceAbstractionStarter]: For program point L1493(lines 1493 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,065 INFO L443 ceAbstractionStarter]: For program point L1097(lines 1097 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,065 INFO L443 ceAbstractionStarter]: For program point L4136(lines 4136 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,065 INFO L443 ceAbstractionStarter]: For program point L2022(lines 2022 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,066 INFO L443 ceAbstractionStarter]: For program point L701(lines 701 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,066 INFO L443 ceAbstractionStarter]: For program point L3608(lines 3608 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,066 INFO L443 ceAbstractionStarter]: For program point L305(lines 305 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,066 INFO L443 ceAbstractionStarter]: For program point L173-1(lines 25 1638) no Hoare annotation was computed. [2019-11-15 20:47:16,066 INFO L443 ceAbstractionStarter]: For program point L2155(lines 2155 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,066 INFO L443 ceAbstractionStarter]: For program point L41-1(lines 25 1638) no Hoare annotation was computed. [2019-11-15 20:47:16,066 INFO L443 ceAbstractionStarter]: For program point L966(lines 966 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,066 INFO L443 ceAbstractionStarter]: For program point L4005(lines 4005 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,067 INFO L443 ceAbstractionStarter]: For program point L1891(lines 1891 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,067 INFO L443 ceAbstractionStarter]: For program point L3873(lines 3873 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,067 INFO L443 ceAbstractionStarter]: For program point L570(lines 570 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,067 INFO L443 ceAbstractionStarter]: For program point L2420(lines 2420 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,067 INFO L443 ceAbstractionStarter]: For program point L3477(lines 3477 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,067 INFO L443 ceAbstractionStarter]: For program point L1231(lines 1231 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,067 INFO L443 ceAbstractionStarter]: For program point L174(line 174) no Hoare annotation was computed. [2019-11-15 20:47:16,067 INFO L443 ceAbstractionStarter]: For program point L42(line 42) no Hoare annotation was computed. [2019-11-15 20:47:16,067 INFO L443 ceAbstractionStarter]: For program point L2817(lines 2817 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,067 INFO L443 ceAbstractionStarter]: For program point L2553(lines 2553 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,067 INFO L443 ceAbstractionStarter]: For program point L439(lines 439 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,067 INFO L443 ceAbstractionStarter]: For program point L3082(lines 3082 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,067 INFO L443 ceAbstractionStarter]: For program point L3743(lines 3743 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,067 INFO L443 ceAbstractionStarter]: For program point L1365(lines 1365 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,067 INFO L443 ceAbstractionStarter]: For program point L2290(lines 2290 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,067 INFO L443 ceAbstractionStarter]: For program point L176-1(lines 25 1638) no Hoare annotation was computed. [2019-11-15 20:47:16,068 INFO L443 ceAbstractionStarter]: For program point L44-1(lines 25 1638) no Hoare annotation was computed. [2019-11-15 20:47:16,068 INFO L443 ceAbstractionStarter]: For program point L1762(lines 1762 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,068 INFO L443 ceAbstractionStarter]: For program point L1630(lines 1630 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,068 INFO L443 ceAbstractionStarter]: For program point L2687(lines 2687 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,068 INFO L443 ceAbstractionStarter]: For program point L177(line 177) no Hoare annotation was computed. [2019-11-15 20:47:16,068 INFO L443 ceAbstractionStarter]: For program point L45(line 45) no Hoare annotation was computed. [2019-11-15 20:47:16,068 INFO L443 ceAbstractionStarter]: For program point L2952(lines 2952 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,068 INFO L443 ceAbstractionStarter]: For program point L838(lines 838 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,068 INFO L443 ceAbstractionStarter]: For program point L706(lines 706 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,068 INFO L443 ceAbstractionStarter]: For program point L3349(lines 3349 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,068 INFO L443 ceAbstractionStarter]: For program point L3217(lines 3217 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,068 INFO L443 ceAbstractionStarter]: For program point L4010(lines 4010 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,068 INFO L443 ceAbstractionStarter]: For program point L3614(lines 3614 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,068 INFO L443 ceAbstractionStarter]: For program point L1500(lines 1500 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,069 INFO L443 ceAbstractionStarter]: For program point L179-1(lines 25 1638) no Hoare annotation was computed. [2019-11-15 20:47:16,069 INFO L443 ceAbstractionStarter]: For program point L1104(lines 1104 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,069 INFO L443 ceAbstractionStarter]: For program point L2161(lines 2161 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,069 INFO L443 ceAbstractionStarter]: For program point L47-1(lines 25 1638) no Hoare annotation was computed. [2019-11-15 20:47:16,069 INFO L443 ceAbstractionStarter]: For program point L4143(lines 4143 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,069 INFO L443 ceAbstractionStarter]: For program point L2029(lines 2029 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,069 INFO L443 ceAbstractionStarter]: For program point L576(lines 576 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,069 INFO L443 ceAbstractionStarter]: For program point L2558(lines 2558 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,070 INFO L443 ceAbstractionStarter]: For program point L2426(lines 2426 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,070 INFO L443 ceAbstractionStarter]: For program point L312(lines 312 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,070 INFO L443 ceAbstractionStarter]: For program point L1237(lines 1237 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,070 INFO L443 ceAbstractionStarter]: For program point L180(line 180) no Hoare annotation was computed. [2019-11-15 20:47:16,070 INFO L443 ceAbstractionStarter]: For program point L48(line 48) no Hoare annotation was computed. [2019-11-15 20:47:16,070 INFO L443 ceAbstractionStarter]: For program point L973(lines 973 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,070 INFO L443 ceAbstractionStarter]: For program point L1898(lines 1898 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,070 INFO L443 ceAbstractionStarter]: For program point L3880(lines 3880 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,071 INFO L443 ceAbstractionStarter]: For program point L3484(lines 3484 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,071 INFO L443 ceAbstractionStarter]: For program point L2824(lines 2824 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,071 INFO L443 ceAbstractionStarter]: For program point L1767(lines 1767 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,071 INFO L443 ceAbstractionStarter]: For program point L446(lines 446 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,071 INFO L443 ceAbstractionStarter]: For program point L182-1(lines 25 1638) no Hoare annotation was computed. [2019-11-15 20:47:16,071 INFO L443 ceAbstractionStarter]: For program point L50-1(lines 25 1638) no Hoare annotation was computed. [2019-11-15 20:47:16,071 INFO L443 ceAbstractionStarter]: For program point L3089(lines 3089 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,071 INFO L443 ceAbstractionStarter]: For program point L3750(lines 3750 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,072 INFO L443 ceAbstractionStarter]: For program point L2693(lines 2693 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,072 INFO L443 ceAbstractionStarter]: For program point L1372(lines 1372 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,072 INFO L443 ceAbstractionStarter]: For program point L2297(lines 2297 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,072 INFO L443 ceAbstractionStarter]: For program point L183(line 183) no Hoare annotation was computed. [2019-11-15 20:47:16,072 INFO L443 ceAbstractionStarter]: For program point L3222(lines 3222 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,072 INFO L443 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2019-11-15 20:47:16,072 INFO L443 ceAbstractionStarter]: For program point L2958(lines 2958 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,072 INFO L443 ceAbstractionStarter]: For program point L844(lines 844 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,073 INFO L439 ceAbstractionStarter]: At program point L1637(lines 25 1638) the Hoare annotation is: (let ((.cse1 (= ~a24~0 3))) (let ((.cse4 (< 306 ~a3~0)) (.cse18 (<= 418 ~a3~0)) (.cse11 (= ~a18~0 9)) (.cse19 (<= ~a24~0 0)) (.cse21 (<= ~a18~0 9)) (.cse17 (= ~a24~0 4)) (.cse9 (<= ~a3~0 417)) (.cse15 (= 10 ~a18~0)) (.cse10 (<= 116 ~a3~0)) (.cse8 (= 4 ~a15~0)) (.cse5 (= 12 ~a18~0)) (.cse20 (not (= ~a24~0 0))) (.cse16 (not (= ~a15~0 4))) (.cse6 (exists ((v_~a3~0_1866 Int)) (and (<= 0 (* 4 v_~a3~0_1866)) (< 306 v_~a3~0_1866) (<= (+ (div (* v_~a3~0_1866 4) 10) 67) ~a3~0)))) (.cse14 (not (= 6 ~a15~0))) (.cse3 (<= ~a18~0 8)) (.cse0 (<= ~a3~0 115)) (.cse7 (= ~a24~0 1)) (.cse12 (not .cse1)) (.cse13 (= ~a18~0 11)) (.cse2 (<= 6 ~a15~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4) (and .cse5 .cse6 .cse7) (and .cse3 .cse1 .cse6) (and .cse8 .cse9 .cse10 .cse11) (and .cse12 .cse8 .cse3 .cse0) (and .cse13 .cse1 .cse9 .cse14) (and .cse12 .cse15 .cse16 .cse14) (and .cse15 .cse6 .cse17) (and (or (and .cse13 .cse17) (and .cse5 .cse8 .cse17)) .cse10) (and (and (not (= 8 ~a18~0)) .cse8 .cse0 .cse1) (not .cse5)) (and .cse2 .cse4 .cse11) (and .cse8 .cse3 .cse17) (and .cse3 .cse16 .cse10) (and .cse16 .cse13 .cse18) (and .cse12 .cse16 .cse14 .cse11) (and .cse19 .cse13) (and .cse8 .cse13 .cse17) (and .cse15 .cse2 .cse20) (and .cse7 .cse21) (and .cse15 .cse7) (and .cse12 .cse13 (<= 336 ~a3~0)) (and .cse5 .cse16 .cse4 .cse14) (and .cse5 .cse19 .cse10) (and .cse19 .cse8) (and .cse15 .cse16 .cse18) (and .cse12 .cse5 .cse2 .cse20) (and .cse12 .cse20 .cse10 .cse11) (and .cse5 .cse2 .cse9 .cse10) (and .cse2 .cse20 .cse21) (and .cse5 .cse0 .cse17) (and .cse8 .cse15 .cse1) (and .cse8 .cse13 .cse7) (and .cse19 .cse21 .cse14) (and .cse15 .cse0 .cse17) (and (and .cse5 .cse8 .cse1 .cse9) .cse10) (and .cse15 .cse2 .cse10) (and .cse5 .cse8 .cse7) (and .cse5 .cse16 .cse0 .cse20) (and .cse16 .cse13 .cse6 .cse14) (and .cse3 .cse2) (and .cse13 .cse0 .cse7) (and .cse12 .cse13 .cse2)))) [2019-11-15 20:47:16,073 INFO L443 ceAbstractionStarter]: For program point L3355(lines 3355 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,073 INFO L443 ceAbstractionStarter]: For program point L4016(lines 4016 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,073 INFO L443 ceAbstractionStarter]: For program point L713(lines 713 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,074 INFO L443 ceAbstractionStarter]: For program point L185-1(lines 25 1638) no Hoare annotation was computed. [2019-11-15 20:47:16,074 INFO L443 ceAbstractionStarter]: For program point L53-1(lines 25 1638) no Hoare annotation was computed. [2019-11-15 20:47:16,074 INFO L443 ceAbstractionStarter]: For program point L4149(lines 4149 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,074 INFO L443 ceAbstractionStarter]: For program point L3621(lines 3621 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,074 INFO L443 ceAbstractionStarter]: For program point L1507(lines 1507 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,074 INFO L443 ceAbstractionStarter]: For program point L186(line 186) no Hoare annotation was computed. [2019-11-15 20:47:16,074 INFO L443 ceAbstractionStarter]: For program point L2168(lines 2168 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,075 INFO L443 ceAbstractionStarter]: For program point L1111(lines 1111 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,075 INFO L443 ceAbstractionStarter]: For program point L54(line 54) no Hoare annotation was computed. [2019-11-15 20:47:16,075 INFO L443 ceAbstractionStarter]: For program point L2036(lines 2036 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,075 INFO L443 ceAbstractionStarter]: For program point L3886(lines 3886 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,075 INFO L443 ceAbstractionStarter]: For program point L1772(lines 1772 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,075 INFO L443 ceAbstractionStarter]: For program point L583(lines 583 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,075 INFO L443 ceAbstractionStarter]: For program point L2565(lines 2565 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,075 INFO L443 ceAbstractionStarter]: For program point L2433(lines 2433 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,076 INFO L443 ceAbstractionStarter]: For program point L319(lines 319 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,076 INFO L443 ceAbstractionStarter]: For program point L1244(lines 1244 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,076 INFO L443 ceAbstractionStarter]: For program point L980(lines 980 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,076 INFO L443 ceAbstractionStarter]: For program point L1905(lines 1905 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,076 INFO L443 ceAbstractionStarter]: For program point L3491(lines 3491 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,076 INFO L443 ceAbstractionStarter]: For program point L188-1(lines 25 1638) no Hoare annotation was computed. [2019-11-15 20:47:16,076 INFO L443 ceAbstractionStarter]: For program point L56-1(lines 25 1638) no Hoare annotation was computed. [2019-11-15 20:47:16,076 INFO L443 ceAbstractionStarter]: For program point L2831(lines 2831 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,077 INFO L443 ceAbstractionStarter]: For program point L453(lines 453 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,077 INFO L443 ceAbstractionStarter]: For program point L189(line 189) no Hoare annotation was computed. [2019-11-15 20:47:16,077 INFO L443 ceAbstractionStarter]: For program point L57(line 57) no Hoare annotation was computed. [2019-11-15 20:47:16,077 INFO L443 ceAbstractionStarter]: For program point L3096(lines 3096 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,077 INFO L443 ceAbstractionStarter]: For program point L850(lines 850 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,077 INFO L443 ceAbstractionStarter]: For program point L718(lines 718 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,077 INFO L443 ceAbstractionStarter]: For program point L2700(lines 2700 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,077 INFO L443 ceAbstractionStarter]: For program point L3757(lines 3757 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,078 INFO L443 ceAbstractionStarter]: For program point L1643(lines 1643 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,078 INFO L443 ceAbstractionStarter]: For program point L1379(lines 1379 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,078 INFO L443 ceAbstractionStarter]: For program point L2304(lines 2304 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,078 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-15 20:47:16,078 INFO L443 ceAbstractionStarter]: For program point L3229(lines 3229 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,078 INFO L443 ceAbstractionStarter]: For program point L4022(lines 4022 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,078 INFO L443 ceAbstractionStarter]: For program point L2965(lines 2965 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,079 INFO L443 ceAbstractionStarter]: For program point L1512(lines 1512 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,079 INFO L443 ceAbstractionStarter]: For program point L3362(lines 3362 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,079 INFO L443 ceAbstractionStarter]: For program point L191-1(lines 25 1638) no Hoare annotation was computed. [2019-11-15 20:47:16,079 INFO L443 ceAbstractionStarter]: For program point L59-1(lines 25 1638) no Hoare annotation was computed. [2019-11-15 20:47:16,079 INFO L443 ceAbstractionStarter]: For program point L3627(lines 3627 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,079 INFO L443 ceAbstractionStarter]: For program point L1249(lines 1249 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,079 INFO L443 ceAbstractionStarter]: For program point L192(line 192) no Hoare annotation was computed. [2019-11-15 20:47:16,079 INFO L443 ceAbstractionStarter]: For program point L4156(lines 4156 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,080 INFO L443 ceAbstractionStarter]: For program point L60(line 60) no Hoare annotation was computed. [2019-11-15 20:47:16,080 INFO L443 ceAbstractionStarter]: For program point L2042(lines 2042 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,080 INFO L443 ceAbstractionStarter]: For program point L1778(lines 1778 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,080 INFO L443 ceAbstractionStarter]: For program point L589(lines 589 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,080 INFO L443 ceAbstractionStarter]: For program point L2571(lines 2571 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,080 INFO L443 ceAbstractionStarter]: For program point L1118(lines 1118 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,080 INFO L443 ceAbstractionStarter]: For program point L2175(lines 2175 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,080 INFO L443 ceAbstractionStarter]: For program point L3893(lines 3893 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,081 INFO L443 ceAbstractionStarter]: For program point L2440(lines 2440 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,081 INFO L443 ceAbstractionStarter]: For program point L326(lines 326 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,081 INFO L443 ceAbstractionStarter]: For program point L194-1(lines 25 1638) no Hoare annotation was computed. [2019-11-15 20:47:16,081 INFO L443 ceAbstractionStarter]: For program point L62-1(lines 25 1638) no Hoare annotation was computed. [2019-11-15 20:47:16,081 INFO L443 ceAbstractionStarter]: For program point L987(lines 987 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,081 INFO L443 ceAbstractionStarter]: For program point L1912(lines 1912 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,081 INFO L443 ceAbstractionStarter]: For program point L2837(lines 2837 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,082 INFO L443 ceAbstractionStarter]: For program point L1648(lines 1648 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,082 INFO L443 ceAbstractionStarter]: For program point L3498(lines 3498 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,082 INFO L443 ceAbstractionStarter]: For program point L195(line 195) no Hoare annotation was computed. [2019-11-15 20:47:16,082 INFO L443 ceAbstractionStarter]: For program point L63(line 63) no Hoare annotation was computed. [2019-11-15 20:47:16,082 INFO L443 ceAbstractionStarter]: For program point L460(lines 460 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,082 INFO L443 ceAbstractionStarter]: For program point L3235(lines 3235 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,082 INFO L443 ceAbstractionStarter]: For program point L3103(lines 3103 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,082 INFO L443 ceAbstractionStarter]: For program point L4028(lines 4028 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,083 INFO L443 ceAbstractionStarter]: For program point L857(lines 857 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,083 INFO L443 ceAbstractionStarter]: For program point L725(lines 725 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,083 INFO L443 ceAbstractionStarter]: For program point L3764(lines 3764 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,083 INFO L443 ceAbstractionStarter]: For program point L2707(lines 2707 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,083 INFO L443 ceAbstractionStarter]: For program point L1518(lines 1518 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,083 INFO L443 ceAbstractionStarter]: For program point L1386(lines 1386 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,083 INFO L443 ceAbstractionStarter]: For program point L3368(lines 3368 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,083 INFO L443 ceAbstractionStarter]: For program point L2311(lines 2311 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,084 INFO L443 ceAbstractionStarter]: For program point L197-1(lines 25 1638) no Hoare annotation was computed. [2019-11-15 20:47:16,084 INFO L443 ceAbstractionStarter]: For program point L65-1(lines 25 1638) no Hoare annotation was computed. [2019-11-15 20:47:16,084 INFO L443 ceAbstractionStarter]: For program point L2972(lines 2972 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,084 INFO L443 ceAbstractionStarter]: For program point L3633(lines 3633 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,084 INFO L443 ceAbstractionStarter]: For program point L198(line 198) no Hoare annotation was computed. [2019-11-15 20:47:16,084 INFO L443 ceAbstractionStarter]: For program point L4162(lines 4162 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,084 INFO L443 ceAbstractionStarter]: For program point L66(line 66) no Hoare annotation was computed. [2019-11-15 20:47:16,085 INFO L443 ceAbstractionStarter]: For program point L2048(lines 2048 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,085 INFO L443 ceAbstractionStarter]: For program point L1784(lines 1784 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,085 INFO L443 ceAbstractionStarter]: For program point L595(lines 595 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,085 INFO L443 ceAbstractionStarter]: For program point L1256(lines 1256 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,085 INFO L443 ceAbstractionStarter]: For program point L1124(lines 1124 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,085 INFO L443 ceAbstractionStarter]: For program point L2181(lines 2181 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,085 INFO L443 ceAbstractionStarter]: For program point L3899(lines 3899 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,085 INFO L443 ceAbstractionStarter]: For program point L2578(lines 2578 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,086 INFO L443 ceAbstractionStarter]: For program point L2446(lines 2446 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,086 INFO L443 ceAbstractionStarter]: For program point L200-1(lines 25 1638) no Hoare annotation was computed. [2019-11-15 20:47:16,086 INFO L443 ceAbstractionStarter]: For program point L68-1(lines 25 1638) no Hoare annotation was computed. [2019-11-15 20:47:16,086 INFO L443 ceAbstractionStarter]: For program point L993(lines 993 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,086 INFO L443 ceAbstractionStarter]: For program point L2843(lines 2843 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,086 INFO L443 ceAbstractionStarter]: For program point L3504(lines 3504 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,086 INFO L443 ceAbstractionStarter]: For program point L333(lines 333 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,087 INFO L443 ceAbstractionStarter]: For program point L201(line 201) no Hoare annotation was computed. [2019-11-15 20:47:16,087 INFO L443 ceAbstractionStarter]: For program point L69(line 69) no Hoare annotation was computed. [2019-11-15 20:47:16,087 INFO L443 ceAbstractionStarter]: For program point L3108(lines 3108 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,087 INFO L443 ceAbstractionStarter]: For program point L1919(lines 1919 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,087 INFO L443 ceAbstractionStarter]: For program point L1655(lines 1655 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,087 INFO L443 ceAbstractionStarter]: For program point L1523(lines 1523 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,087 INFO L443 ceAbstractionStarter]: For program point L466(lines 466 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,087 INFO L443 ceAbstractionStarter]: For program point L2977(lines 2977 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,088 INFO L443 ceAbstractionStarter]: For program point L863(lines 863 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,088 INFO L443 ceAbstractionStarter]: For program point L2713(lines 2713 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,088 INFO L443 ceAbstractionStarter]: For program point L1392(lines 1392 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,088 INFO L443 ceAbstractionStarter]: For program point L2317(lines 2317 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,088 INFO L443 ceAbstractionStarter]: For program point L3242(lines 3242 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,088 INFO L443 ceAbstractionStarter]: For program point L203-1(lines 25 1638) no Hoare annotation was computed. [2019-11-15 20:47:16,088 INFO L443 ceAbstractionStarter]: For program point L71-1(lines 25 1638) no Hoare annotation was computed. [2019-11-15 20:47:16,089 INFO L443 ceAbstractionStarter]: For program point L4035(lines 4035 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,089 INFO L443 ceAbstractionStarter]: For program point L732(lines 732 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,089 INFO L443 ceAbstractionStarter]: For program point L3771(lines 3771 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,089 INFO L443 ceAbstractionStarter]: For program point L3375(lines 3375 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,089 INFO L443 ceAbstractionStarter]: For program point L204(line 204) no Hoare annotation was computed. [2019-11-15 20:47:16,089 INFO L443 ceAbstractionStarter]: For program point L72(line 72) no Hoare annotation was computed. [2019-11-15 20:47:16,089 INFO L443 ceAbstractionStarter]: For program point L2054(lines 2054 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,089 INFO L443 ceAbstractionStarter]: For program point L601(lines 601 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,090 INFO L443 ceAbstractionStarter]: For program point L3640(lines 3640 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,090 INFO L443 ceAbstractionStarter]: For program point L2187(lines 2187 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,090 INFO L443 ceAbstractionStarter]: For program point L4169(lines 4169 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,090 INFO L443 ceAbstractionStarter]: For program point L1791(lines 1791 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,090 INFO L443 ceAbstractionStarter]: For program point L2584(lines 2584 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,090 INFO L443 ceAbstractionStarter]: For program point L1263(lines 1263 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,090 INFO L443 ceAbstractionStarter]: For program point L206-1(lines 25 1638) no Hoare annotation was computed. [2019-11-15 20:47:16,090 INFO L443 ceAbstractionStarter]: For program point L1131(lines 1131 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,091 INFO L443 ceAbstractionStarter]: For program point L74-1(lines 25 1638) no Hoare annotation was computed. [2019-11-15 20:47:16,091 INFO L443 ceAbstractionStarter]: For program point L3113(lines 3113 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,091 INFO L443 ceAbstractionStarter]: For program point L999(lines 999 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,091 INFO L443 ceAbstractionStarter]: For program point L3906(lines 3906 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,091 INFO L443 ceAbstractionStarter]: For program point L3510(lines 3510 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,091 INFO L443 ceAbstractionStarter]: For program point L2453(lines 2453 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,091 INFO L443 ceAbstractionStarter]: For program point L207(line 207) no Hoare annotation was computed. [2019-11-15 20:47:16,092 INFO L443 ceAbstractionStarter]: For program point L75(line 75) no Hoare annotation was computed. [2019-11-15 20:47:16,092 INFO L443 ceAbstractionStarter]: For program point L2850(lines 2850 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,092 INFO L443 ceAbstractionStarter]: For program point L1529(lines 1529 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,092 INFO L443 ceAbstractionStarter]: For program point L340(lines 340 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,092 INFO L443 ceAbstractionStarter]: For program point L1926(lines 1926 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,092 INFO L443 ceAbstractionStarter]: For program point L2983(lines 2983 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,092 INFO L443 ceAbstractionStarter]: For program point L1662(lines 1662 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,092 INFO L443 ceAbstractionStarter]: For program point L2719(lines 2719 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,093 INFO L443 ceAbstractionStarter]: For program point L473(lines 473 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,093 INFO L443 ceAbstractionStarter]: For program point L77-1(lines 25 1638) no Hoare annotation was computed. [2019-11-15 20:47:16,093 INFO L443 ceAbstractionStarter]: For program point L4041(lines 4041 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,093 INFO L443 ceAbstractionStarter]: For program point L870(lines 870 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,093 INFO L443 ceAbstractionStarter]: For program point L1399(lines 1399 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,093 INFO L443 ceAbstractionStarter]: For program point L2324(lines 2324 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,093 INFO L443 ceAbstractionStarter]: For program point L3249(lines 3249 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,093 INFO L443 ceAbstractionStarter]: For program point L78(line 78) no Hoare annotation was computed. [2019-11-15 20:47:16,094 INFO L443 ceAbstractionStarter]: For program point L1796(lines 1796 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,094 INFO L443 ceAbstractionStarter]: For program point L739(lines 739 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,094 INFO L443 ceAbstractionStarter]: For program point L3778(lines 3778 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,094 INFO L443 ceAbstractionStarter]: For program point L607(lines 607 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,094 INFO L443 ceAbstractionStarter]: For program point L3646(lines 3646 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,094 INFO L443 ceAbstractionStarter]: For program point L3382(lines 3382 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,094 INFO L443 ceAbstractionStarter]: For program point L2193(lines 2193 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,095 INFO L443 ceAbstractionStarter]: For program point L4175(lines 4175 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,095 INFO L443 ceAbstractionStarter]: For program point L2061(lines 2061 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,095 INFO L443 ceAbstractionStarter]: For program point L2590(lines 2590 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,095 INFO L443 ceAbstractionStarter]: For program point L80-1(lines 25 1638) no Hoare annotation was computed. [2019-11-15 20:47:16,095 INFO L443 ceAbstractionStarter]: For program point L1005(lines 1005 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,095 INFO L443 ceAbstractionStarter]: For program point L1270(lines 1270 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,095 INFO L443 ceAbstractionStarter]: For program point L1138(lines 1138 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,095 INFO L443 ceAbstractionStarter]: For program point L81(line 81) no Hoare annotation was computed. [2019-11-15 20:47:16,096 INFO L443 ceAbstractionStarter]: For program point L3120(lines 3120 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,096 INFO L443 ceAbstractionStarter]: For program point L2988(lines 2988 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,096 INFO L443 ceAbstractionStarter]: For program point L2856(lines 2856 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,096 INFO L443 ceAbstractionStarter]: For program point L3913(lines 3913 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,096 INFO L443 ceAbstractionStarter]: For program point L742(lines 742 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,096 INFO L443 ceAbstractionStarter]: For program point L2460(lines 2460 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,096 INFO L443 ceAbstractionStarter]: For program point L3517(lines 3517 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,096 INFO L443 ceAbstractionStarter]: For program point L1932(lines 1932 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,097 INFO L443 ceAbstractionStarter]: For program point L1536(lines 1536 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,097 INFO L443 ceAbstractionStarter]: For program point L347(lines 347 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,097 INFO L443 ceAbstractionStarter]: For program point L83-1(lines 25 1638) no Hoare annotation was computed. [2019-11-15 20:47:16,097 INFO L443 ceAbstractionStarter]: For program point L2726(lines 2726 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,097 INFO L443 ceAbstractionStarter]: For program point L1669(lines 1669 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,097 INFO L443 ceAbstractionStarter]: For program point L612(lines 612 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,097 INFO L443 ceAbstractionStarter]: For program point L480(lines 480 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,098 INFO L443 ceAbstractionStarter]: For program point L1405(lines 1405 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,098 INFO L443 ceAbstractionStarter]: For program point L3255(lines 3255 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,098 INFO L443 ceAbstractionStarter]: For program point L84(line 84) no Hoare annotation was computed. [2019-11-15 20:47:16,098 INFO L443 ceAbstractionStarter]: For program point L4048(lines 4048 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,098 INFO L443 ceAbstractionStarter]: For program point L877(lines 877 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,098 INFO L443 ceAbstractionStarter]: For program point L3784(lines 3784 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,098 INFO L443 ceAbstractionStarter]: For program point L3388(lines 3388 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,098 INFO L443 ceAbstractionStarter]: For program point L2331(lines 2331 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,099 INFO L443 ceAbstractionStarter]: For program point L217(lines 217 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,099 INFO L443 ceAbstractionStarter]: For program point L2067(lines 2067 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,099 INFO L443 ceAbstractionStarter]: For program point L1803(lines 1803 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,099 INFO L443 ceAbstractionStarter]: For program point L3653(lines 3653 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,099 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-15 20:47:16,099 INFO L443 ceAbstractionStarter]: For program point L2200(lines 2200 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,099 INFO L443 ceAbstractionStarter]: For program point L4182(lines 4182 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,100 INFO L443 ceAbstractionStarter]: For program point L86-1(lines 25 1638) no Hoare annotation was computed. [2019-11-15 20:47:16,100 INFO L443 ceAbstractionStarter]: For program point L2597(lines 2597 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,100 INFO L443 ceAbstractionStarter]: For program point L87(line 87) no Hoare annotation was computed. [2019-11-15 20:47:16,100 INFO L443 ceAbstractionStarter]: For program point L3126(lines 3126 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,100 INFO L443 ceAbstractionStarter]: For program point L1012(lines 1012 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,100 INFO L443 ceAbstractionStarter]: For program point L2994(lines 2994 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,100 INFO L443 ceAbstractionStarter]: For program point L2862(lines 2862 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,100 INFO L443 ceAbstractionStarter]: For program point L3523(lines 3523 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,101 INFO L443 ceAbstractionStarter]: For program point L1277(lines 1277 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,101 INFO L443 ceAbstractionStarter]: For program point L1145(lines 1145 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,101 INFO L443 ceAbstractionStarter]: For program point L1938(lines 1938 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,101 INFO L443 ceAbstractionStarter]: For program point L3920(lines 3920 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,101 INFO L443 ceAbstractionStarter]: For program point L749(lines 749 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,101 INFO L443 ceAbstractionStarter]: For program point L2467(lines 2467 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,101 INFO L443 ceAbstractionStarter]: For program point L353(lines 353 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,101 INFO L443 ceAbstractionStarter]: For program point L89-1(lines 25 1638) no Hoare annotation was computed. [2019-11-15 20:47:16,102 INFO L443 ceAbstractionStarter]: For program point L1543(lines 1543 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,102 INFO L443 ceAbstractionStarter]: For program point L486(lines 486 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,102 INFO L443 ceAbstractionStarter]: For program point L90(line 90) no Hoare annotation was computed. [2019-11-15 20:47:16,102 INFO L443 ceAbstractionStarter]: For program point L883(lines 883 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,102 INFO L443 ceAbstractionStarter]: For program point L1676(lines 1676 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,102 INFO L443 ceAbstractionStarter]: For program point L2733(lines 2733 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,102 INFO L443 ceAbstractionStarter]: For program point L619(lines 619 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,102 INFO L443 ceAbstractionStarter]: For program point L1412(lines 1412 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,103 INFO L443 ceAbstractionStarter]: For program point L3394(lines 3394 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,103 INFO L443 ceAbstractionStarter]: For program point L2337(lines 2337 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,103 INFO L443 ceAbstractionStarter]: For program point L3262(lines 3262 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,103 INFO L443 ceAbstractionStarter]: For program point L4055(lines 4055 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,103 INFO L443 ceAbstractionStarter]: For program point L3791(lines 3791 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,103 INFO L443 ceAbstractionStarter]: For program point L224(lines 224 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,103 INFO L443 ceAbstractionStarter]: For program point L4188(lines 4188 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,103 INFO L443 ceAbstractionStarter]: For program point L92-1(lines 25 1638) no Hoare annotation was computed. [2019-11-15 20:47:16,104 INFO L443 ceAbstractionStarter]: For program point L2074(lines 2074 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,104 INFO L443 ceAbstractionStarter]: For program point L1810(lines 1810 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,104 INFO L443 ceAbstractionStarter]: For program point L3660(lines 3660 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,104 INFO L443 ceAbstractionStarter]: For program point L2603(lines 2603 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,104 INFO L443 ceAbstractionStarter]: For program point L2207(lines 2207 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,104 INFO L443 ceAbstractionStarter]: For program point L93(line 93) no Hoare annotation was computed. [2019-11-15 20:47:16,104 INFO L443 ceAbstractionStarter]: For program point L3529(lines 3529 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,105 INFO L443 ceAbstractionStarter]: For program point L1151(lines 1151 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,105 INFO L443 ceAbstractionStarter]: For program point L3133(lines 3133 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,105 INFO L443 ceAbstractionStarter]: For program point L1019(lines 1019 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,105 INFO L443 ceAbstractionStarter]: For program point L3001(lines 3001 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,105 INFO L443 ceAbstractionStarter]: For program point L2869(lines 2869 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,105 INFO L443 ceAbstractionStarter]: For program point L755(lines 755 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,105 INFO L443 ceAbstractionStarter]: For program point L1284(lines 1284 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,105 INFO L443 ceAbstractionStarter]: For program point L95-1(lines 25 1638) no Hoare annotation was computed. [2019-11-15 20:47:16,106 INFO L443 ceAbstractionStarter]: For program point L1945(lines 1945 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,106 INFO L443 ceAbstractionStarter]: For program point L3927(lines 3927 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,106 INFO L443 ceAbstractionStarter]: For program point L1681(lines 1681 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,106 INFO L443 ceAbstractionStarter]: For program point L492(lines 492 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,106 INFO L443 ceAbstractionStarter]: For program point L2474(lines 2474 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,106 INFO L443 ceAbstractionStarter]: For program point L360(lines 360 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,106 INFO L443 ceAbstractionStarter]: For program point L96(line 96) no Hoare annotation was computed. [2019-11-15 20:47:16,106 INFO L443 ceAbstractionStarter]: For program point L625(lines 625 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,107 INFO L443 ceAbstractionStarter]: For program point L1550(lines 1550 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,107 INFO L443 ceAbstractionStarter]: For program point L3400(lines 3400 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,107 INFO L443 ceAbstractionStarter]: For program point L3004(lines 3004 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,107 INFO L443 ceAbstractionStarter]: For program point L4061(lines 4061 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,107 INFO L443 ceAbstractionStarter]: For program point L890(lines 890 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,107 INFO L443 ceAbstractionStarter]: For program point L2740(lines 2740 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,107 INFO L443 ceAbstractionStarter]: For program point L3797(lines 3797 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,108 INFO L443 ceAbstractionStarter]: For program point L1419(lines 1419 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,108 INFO L443 ceAbstractionStarter]: For program point L2344(lines 2344 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,108 INFO L443 ceAbstractionStarter]: For program point L3269(lines 3269 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,108 INFO L443 ceAbstractionStarter]: For program point L98-1(lines 25 1638) no Hoare annotation was computed. [2019-11-15 20:47:16,108 INFO L443 ceAbstractionStarter]: For program point L2080(lines 2080 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,108 INFO L443 ceAbstractionStarter]: For program point L231(lines 231 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,108 INFO L443 ceAbstractionStarter]: For program point L2213(lines 2213 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,108 INFO L443 ceAbstractionStarter]: For program point L99(line 99) no Hoare annotation was computed. [2019-11-15 20:47:16,109 INFO L443 ceAbstractionStarter]: For program point L4195(lines 4195 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,109 INFO L443 ceAbstractionStarter]: For program point L1817(lines 1817 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,109 INFO L443 ceAbstractionStarter]: For program point L2610(lines 2610 3049) no Hoare annotation was computed. [2019-11-15 20:47:16,109 INFO L443 ceAbstractionStarter]: For program point L3667(lines 3667 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,109 INFO L443 ceAbstractionStarter]: For program point L3535(lines 3535 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,109 INFO L443 ceAbstractionStarter]: For program point L1157(lines 1157 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,109 INFO L443 ceAbstractionStarter]: For program point L3139(lines 3139 4249) no Hoare annotation was computed. [2019-11-15 20:47:16,109 INFO L443 ceAbstractionStarter]: For program point L761(lines 761 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,110 INFO L443 ceAbstractionStarter]: For program point L1290(lines 1290 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,110 INFO L443 ceAbstractionStarter]: For program point L101-1(lines 25 1638) no Hoare annotation was computed. [2019-11-15 20:47:16,110 INFO L443 ceAbstractionStarter]: For program point L1026(lines 1026 1636) no Hoare annotation was computed. [2019-11-15 20:47:16,121 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,122 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,122 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,123 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,123 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,123 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,124 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,124 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,125 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,126 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,126 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,127 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,137 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,138 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,138 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,139 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,139 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,140 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,140 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,141 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,141 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,142 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,142 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,142 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,148 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,148 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,149 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,149 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,150 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,150 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,151 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,151 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,151 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,152 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,153 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,153 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,156 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,156 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,156 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,157 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,157 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,158 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,158 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,159 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,159 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,160 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,160 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,161 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,163 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,163 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,164 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,164 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,165 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,165 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,166 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,166 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,167 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,167 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,168 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,168 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,170 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,171 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,171 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,172 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,172 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,172 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,173 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,173 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,174 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,174 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,175 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,175 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,177 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,177 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,178 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,178 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,179 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,179 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,180 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,180 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,180 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,181 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,181 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,182 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,183 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,184 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,184 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,185 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,185 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,185 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,186 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,186 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,187 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,187 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,187 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,188 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,190 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 08:47:16 BoogieIcfgContainer [2019-11-15 20:47:16,191 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 20:47:16,191 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 20:47:16,191 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 20:47:16,191 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 20:47:16,192 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:45:00" (3/4) ... [2019-11-15 20:47:16,195 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-15 20:47:16,239 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2019-11-15 20:47:16,247 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-15 20:47:16,279 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((((((((((((a3 <= 115 && a24 == 3) && 6 <= a15) || (a18 <= 8 && 306 < a3)) || ((12 == a18 && (\exists v_~a3~0_1866 : int :: (0 <= 4 * v_~a3~0_1866 && 306 < v_~a3~0_1866) && v_~a3~0_1866 * 4 / 10 + 67 <= a3)) && a24 == 1)) || ((a18 <= 8 && a24 == 3) && (\exists v_~a3~0_1866 : int :: (0 <= 4 * v_~a3~0_1866 && 306 < v_~a3~0_1866) && v_~a3~0_1866 * 4 / 10 + 67 <= a3))) || (((4 == a15 && a3 <= 417) && 116 <= a3) && a18 == 9)) || (((!(a24 == 3) && 4 == a15) && a18 <= 8) && a3 <= 115)) || (((a18 == 11 && a24 == 3) && a3 <= 417) && !(6 == a15))) || (((!(a24 == 3) && 10 == a18) && !(a15 == 4)) && !(6 == a15))) || ((10 == a18 && (\exists v_~a3~0_1866 : int :: (0 <= 4 * v_~a3~0_1866 && 306 < v_~a3~0_1866) && v_~a3~0_1866 * 4 / 10 + 67 <= a3)) && a24 == 4)) || (((a18 == 11 && a24 == 4) || ((12 == a18 && 4 == a15) && a24 == 4)) && 116 <= a3)) || ((((!(8 == a18) && 4 == a15) && a3 <= 115) && a24 == 3) && !(12 == a18))) || ((6 <= a15 && 306 < a3) && a18 == 9)) || ((4 == a15 && a18 <= 8) && a24 == 4)) || ((a18 <= 8 && !(a15 == 4)) && 116 <= a3)) || ((!(a15 == 4) && a18 == 11) && 418 <= a3)) || (((!(a24 == 3) && !(a15 == 4)) && !(6 == a15)) && a18 == 9)) || (a24 <= 0 && a18 == 11)) || ((4 == a15 && a18 == 11) && a24 == 4)) || ((10 == a18 && 6 <= a15) && !(a24 == 0))) || (a24 == 1 && a18 <= 9)) || (10 == a18 && a24 == 1)) || ((!(a24 == 3) && a18 == 11) && 336 <= a3)) || (((12 == a18 && !(a15 == 4)) && 306 < a3) && !(6 == a15))) || ((12 == a18 && a24 <= 0) && 116 <= a3)) || (a24 <= 0 && 4 == a15)) || ((10 == a18 && !(a15 == 4)) && 418 <= a3)) || (((!(a24 == 3) && 12 == a18) && 6 <= a15) && !(a24 == 0))) || (((!(a24 == 3) && !(a24 == 0)) && 116 <= a3) && a18 == 9)) || (((12 == a18 && 6 <= a15) && a3 <= 417) && 116 <= a3)) || ((6 <= a15 && !(a24 == 0)) && a18 <= 9)) || ((12 == a18 && a3 <= 115) && a24 == 4)) || ((4 == a15 && 10 == a18) && a24 == 3)) || ((4 == a15 && a18 == 11) && a24 == 1)) || ((a24 <= 0 && a18 <= 9) && !(6 == a15))) || ((10 == a18 && a3 <= 115) && a24 == 4)) || ((((12 == a18 && 4 == a15) && a24 == 3) && a3 <= 417) && 116 <= a3)) || ((10 == a18 && 6 <= a15) && 116 <= a3)) || ((12 == a18 && 4 == a15) && a24 == 1)) || (((12 == a18 && !(a15 == 4)) && a3 <= 115) && !(a24 == 0))) || (((!(a15 == 4) && a18 == 11) && (\exists v_~a3~0_1866 : int :: (0 <= 4 * v_~a3~0_1866 && 306 < v_~a3~0_1866) && v_~a3~0_1866 * 4 / 10 + 67 <= a3)) && !(6 == a15))) || (a18 <= 8 && 6 <= a15)) || ((a18 == 11 && a3 <= 115) && a24 == 1)) || ((!(a24 == 3) && a18 == 11) && 6 <= a15) [2019-11-15 20:47:16,282 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((((((((((((a3 <= 115 && a24 == 3) && 6 <= a15) || (a18 <= 8 && 306 < a3)) || ((12 == a18 && (\exists v_~a3~0_1866 : int :: (0 <= 4 * v_~a3~0_1866 && 306 < v_~a3~0_1866) && v_~a3~0_1866 * 4 / 10 + 67 <= a3)) && a24 == 1)) || ((a18 <= 8 && a24 == 3) && (\exists v_~a3~0_1866 : int :: (0 <= 4 * v_~a3~0_1866 && 306 < v_~a3~0_1866) && v_~a3~0_1866 * 4 / 10 + 67 <= a3))) || (((4 == a15 && a3 <= 417) && 116 <= a3) && a18 == 9)) || (((!(a24 == 3) && 4 == a15) && a18 <= 8) && a3 <= 115)) || (((a18 == 11 && a24 == 3) && a3 <= 417) && !(6 == a15))) || (((!(a24 == 3) && 10 == a18) && !(a15 == 4)) && !(6 == a15))) || ((10 == a18 && (\exists v_~a3~0_1866 : int :: (0 <= 4 * v_~a3~0_1866 && 306 < v_~a3~0_1866) && v_~a3~0_1866 * 4 / 10 + 67 <= a3)) && a24 == 4)) || (((a18 == 11 && a24 == 4) || ((12 == a18 && 4 == a15) && a24 == 4)) && 116 <= a3)) || ((((!(8 == a18) && 4 == a15) && a3 <= 115) && a24 == 3) && !(12 == a18))) || ((6 <= a15 && 306 < a3) && a18 == 9)) || ((4 == a15 && a18 <= 8) && a24 == 4)) || ((a18 <= 8 && !(a15 == 4)) && 116 <= a3)) || ((!(a15 == 4) && a18 == 11) && 418 <= a3)) || (((!(a24 == 3) && !(a15 == 4)) && !(6 == a15)) && a18 == 9)) || (a24 <= 0 && a18 == 11)) || ((4 == a15 && a18 == 11) && a24 == 4)) || ((10 == a18 && 6 <= a15) && !(a24 == 0))) || (a24 == 1 && a18 <= 9)) || (10 == a18 && a24 == 1)) || ((!(a24 == 3) && a18 == 11) && 336 <= a3)) || (((12 == a18 && !(a15 == 4)) && 306 < a3) && !(6 == a15))) || ((12 == a18 && a24 <= 0) && 116 <= a3)) || (a24 <= 0 && 4 == a15)) || ((10 == a18 && !(a15 == 4)) && 418 <= a3)) || (((!(a24 == 3) && 12 == a18) && 6 <= a15) && !(a24 == 0))) || (((!(a24 == 3) && !(a24 == 0)) && 116 <= a3) && a18 == 9)) || (((12 == a18 && 6 <= a15) && a3 <= 417) && 116 <= a3)) || ((6 <= a15 && !(a24 == 0)) && a18 <= 9)) || ((12 == a18 && a3 <= 115) && a24 == 4)) || ((4 == a15 && 10 == a18) && a24 == 3)) || ((4 == a15 && a18 == 11) && a24 == 1)) || ((a24 <= 0 && a18 <= 9) && !(6 == a15))) || ((10 == a18 && a3 <= 115) && a24 == 4)) || ((((12 == a18 && 4 == a15) && a24 == 3) && a3 <= 417) && 116 <= a3)) || ((10 == a18 && 6 <= a15) && 116 <= a3)) || ((12 == a18 && 4 == a15) && a24 == 1)) || (((12 == a18 && !(a15 == 4)) && a3 <= 115) && !(a24 == 0))) || (((!(a15 == 4) && a18 == 11) && (\exists v_~a3~0_1866 : int :: (0 <= 4 * v_~a3~0_1866 && 306 < v_~a3~0_1866) && v_~a3~0_1866 * 4 / 10 + 67 <= a3)) && !(6 == a15))) || (a18 <= 8 && 6 <= a15)) || ((a18 == 11 && a3 <= 115) && a24 == 1)) || ((!(a24 == 3) && a18 == 11) && 6 <= a15) [2019-11-15 20:47:16,294 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((((((((((((a3 <= 115 && a24 == 3) && 6 <= a15) || (a18 <= 8 && 306 < a3)) || ((12 == a18 && (\exists v_~a3~0_1866 : int :: (0 <= 4 * v_~a3~0_1866 && 306 < v_~a3~0_1866) && v_~a3~0_1866 * 4 / 10 + 67 <= a3)) && a24 == 1)) || ((a18 <= 8 && a24 == 3) && (\exists v_~a3~0_1866 : int :: (0 <= 4 * v_~a3~0_1866 && 306 < v_~a3~0_1866) && v_~a3~0_1866 * 4 / 10 + 67 <= a3))) || (((4 == a15 && a3 <= 417) && 116 <= a3) && a18 == 9)) || (((!(a24 == 3) && 4 == a15) && a18 <= 8) && a3 <= 115)) || (((a18 == 11 && a24 == 3) && a3 <= 417) && !(6 == a15))) || (((!(a24 == 3) && 10 == a18) && !(a15 == 4)) && !(6 == a15))) || ((10 == a18 && (\exists v_~a3~0_1866 : int :: (0 <= 4 * v_~a3~0_1866 && 306 < v_~a3~0_1866) && v_~a3~0_1866 * 4 / 10 + 67 <= a3)) && a24 == 4)) || (((a18 == 11 && a24 == 4) || ((12 == a18 && 4 == a15) && a24 == 4)) && 116 <= a3)) || ((((!(8 == a18) && 4 == a15) && a3 <= 115) && a24 == 3) && !(12 == a18))) || ((6 <= a15 && 306 < a3) && a18 == 9)) || ((4 == a15 && a18 <= 8) && a24 == 4)) || ((a18 <= 8 && !(a15 == 4)) && 116 <= a3)) || ((!(a15 == 4) && a18 == 11) && 418 <= a3)) || (((!(a24 == 3) && !(a15 == 4)) && !(6 == a15)) && a18 == 9)) || (a24 <= 0 && a18 == 11)) || ((4 == a15 && a18 == 11) && a24 == 4)) || ((10 == a18 && 6 <= a15) && !(a24 == 0))) || (a24 == 1 && a18 <= 9)) || (10 == a18 && a24 == 1)) || ((!(a24 == 3) && a18 == 11) && 336 <= a3)) || (((12 == a18 && !(a15 == 4)) && 306 < a3) && !(6 == a15))) || ((12 == a18 && a24 <= 0) && 116 <= a3)) || (a24 <= 0 && 4 == a15)) || ((10 == a18 && !(a15 == 4)) && 418 <= a3)) || (((!(a24 == 3) && 12 == a18) && 6 <= a15) && !(a24 == 0))) || (((!(a24 == 3) && !(a24 == 0)) && 116 <= a3) && a18 == 9)) || (((12 == a18 && 6 <= a15) && a3 <= 417) && 116 <= a3)) || ((6 <= a15 && !(a24 == 0)) && a18 <= 9)) || ((12 == a18 && a3 <= 115) && a24 == 4)) || ((4 == a15 && 10 == a18) && a24 == 3)) || ((4 == a15 && a18 == 11) && a24 == 1)) || ((a24 <= 0 && a18 <= 9) && !(6 == a15))) || ((10 == a18 && a3 <= 115) && a24 == 4)) || ((((12 == a18 && 4 == a15) && a24 == 3) && a3 <= 417) && 116 <= a3)) || ((10 == a18 && 6 <= a15) && 116 <= a3)) || ((12 == a18 && 4 == a15) && a24 == 1)) || (((12 == a18 && !(a15 == 4)) && a3 <= 115) && !(a24 == 0))) || (((!(a15 == 4) && a18 == 11) && (\exists v_~a3~0_1866 : int :: (0 <= 4 * v_~a3~0_1866 && 306 < v_~a3~0_1866) && v_~a3~0_1866 * 4 / 10 + 67 <= a3)) && !(6 == a15))) || (a18 <= 8 && 6 <= a15)) || ((a18 == 11 && a3 <= 115) && a24 == 1)) || ((!(a24 == 3) && a18 == 11) && 6 <= a15) [2019-11-15 20:47:16,301 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((((((((((((a3 <= 115 && a24 == 3) && 6 <= a15) || (a18 <= 8 && 306 < a3)) || ((12 == a18 && (\exists v_~a3~0_1866 : int :: (0 <= 4 * v_~a3~0_1866 && 306 < v_~a3~0_1866) && v_~a3~0_1866 * 4 / 10 + 67 <= a3)) && a24 == 1)) || ((a18 <= 8 && a24 == 3) && (\exists v_~a3~0_1866 : int :: (0 <= 4 * v_~a3~0_1866 && 306 < v_~a3~0_1866) && v_~a3~0_1866 * 4 / 10 + 67 <= a3))) || (((4 == a15 && a3 <= 417) && 116 <= a3) && a18 == 9)) || (((!(a24 == 3) && 4 == a15) && a18 <= 8) && a3 <= 115)) || (((a18 == 11 && a24 == 3) && a3 <= 417) && !(6 == a15))) || (((!(a24 == 3) && 10 == a18) && !(a15 == 4)) && !(6 == a15))) || ((10 == a18 && (\exists v_~a3~0_1866 : int :: (0 <= 4 * v_~a3~0_1866 && 306 < v_~a3~0_1866) && v_~a3~0_1866 * 4 / 10 + 67 <= a3)) && a24 == 4)) || (((a18 == 11 && a24 == 4) || ((12 == a18 && 4 == a15) && a24 == 4)) && 116 <= a3)) || ((((!(8 == a18) && 4 == a15) && a3 <= 115) && a24 == 3) && !(12 == a18))) || ((6 <= a15 && 306 < a3) && a18 == 9)) || ((4 == a15 && a18 <= 8) && a24 == 4)) || ((a18 <= 8 && !(a15 == 4)) && 116 <= a3)) || ((!(a15 == 4) && a18 == 11) && 418 <= a3)) || (((!(a24 == 3) && !(a15 == 4)) && !(6 == a15)) && a18 == 9)) || (a24 <= 0 && a18 == 11)) || ((4 == a15 && a18 == 11) && a24 == 4)) || ((10 == a18 && 6 <= a15) && !(a24 == 0))) || (a24 == 1 && a18 <= 9)) || (10 == a18 && a24 == 1)) || ((!(a24 == 3) && a18 == 11) && 336 <= a3)) || (((12 == a18 && !(a15 == 4)) && 306 < a3) && !(6 == a15))) || ((12 == a18 && a24 <= 0) && 116 <= a3)) || (a24 <= 0 && 4 == a15)) || ((10 == a18 && !(a15 == 4)) && 418 <= a3)) || (((!(a24 == 3) && 12 == a18) && 6 <= a15) && !(a24 == 0))) || (((!(a24 == 3) && !(a24 == 0)) && 116 <= a3) && a18 == 9)) || (((12 == a18 && 6 <= a15) && a3 <= 417) && 116 <= a3)) || ((6 <= a15 && !(a24 == 0)) && a18 <= 9)) || ((12 == a18 && a3 <= 115) && a24 == 4)) || ((4 == a15 && 10 == a18) && a24 == 3)) || ((4 == a15 && a18 == 11) && a24 == 1)) || ((a24 <= 0 && a18 <= 9) && !(6 == a15))) || ((10 == a18 && a3 <= 115) && a24 == 4)) || ((((12 == a18 && 4 == a15) && a24 == 3) && a3 <= 417) && 116 <= a3)) || ((10 == a18 && 6 <= a15) && 116 <= a3)) || ((12 == a18 && 4 == a15) && a24 == 1)) || (((12 == a18 && !(a15 == 4)) && a3 <= 115) && !(a24 == 0))) || (((!(a15 == 4) && a18 == 11) && (\exists v_~a3~0_1866 : int :: (0 <= 4 * v_~a3~0_1866 && 306 < v_~a3~0_1866) && v_~a3~0_1866 * 4 / 10 + 67 <= a3)) && !(6 == a15))) || (a18 <= 8 && 6 <= a15)) || ((a18 == 11 && a3 <= 115) && a24 == 1)) || ((!(a24 == 3) && a18 == 11) && 6 <= a15) [2019-11-15 20:47:16,640 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_e26f7284-6e77-4951-96b3-766207c9d9df/bin/uautomizer/witness.graphml [2019-11-15 20:47:16,640 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 20:47:16,642 INFO L168 Benchmark]: Toolchain (without parser) took 141956.14 ms. Allocated memory was 1.0 GB in the beginning and 5.6 GB in the end (delta: 4.5 GB). Free memory was 940.7 MB in the beginning and 3.8 GB in the end (delta: -2.9 GB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. [2019-11-15 20:47:16,642 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:47:16,642 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1553.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 163.6 MB). Free memory was 940.7 MB in the beginning and 1.0 GB in the end (delta: -95.2 MB). Peak memory consumption was 83.5 MB. Max. memory is 11.5 GB. [2019-11-15 20:47:16,643 INFO L168 Benchmark]: Boogie Procedure Inliner took 218.57 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 992.9 MB in the end (delta: 43.0 MB). Peak memory consumption was 43.0 MB. Max. memory is 11.5 GB. [2019-11-15 20:47:16,643 INFO L168 Benchmark]: Boogie Preprocessor took 240.97 ms. Allocated memory is still 1.2 GB. Free memory was 992.9 MB in the beginning and 966.0 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2019-11-15 20:47:16,643 INFO L168 Benchmark]: RCFGBuilder took 3768.50 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 96.5 MB). Free memory was 966.0 MB in the beginning and 1.0 GB in the end (delta: -45.3 MB). Peak memory consumption was 126.6 MB. Max. memory is 11.5 GB. [2019-11-15 20:47:16,644 INFO L168 Benchmark]: TraceAbstraction took 135721.41 ms. Allocated memory was 1.3 GB in the beginning and 5.6 GB in the end (delta: 4.3 GB). Free memory was 1.0 GB in the beginning and 3.9 GB in the end (delta: -2.9 GB). Peak memory consumption was 4.1 GB. Max. memory is 11.5 GB. [2019-11-15 20:47:16,644 INFO L168 Benchmark]: Witness Printer took 449.49 ms. Allocated memory is still 5.6 GB. Free memory was 3.9 GB in the beginning and 3.8 GB in the end (delta: 100.8 MB). Peak memory consumption was 100.8 MB. Max. memory is 11.5 GB. [2019-11-15 20:47:16,646 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.22 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1553.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 163.6 MB). Free memory was 940.7 MB in the beginning and 1.0 GB in the end (delta: -95.2 MB). Peak memory consumption was 83.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 218.57 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 992.9 MB in the end (delta: 43.0 MB). Peak memory consumption was 43.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 240.97 ms. Allocated memory is still 1.2 GB. Free memory was 992.9 MB in the beginning and 966.0 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3768.50 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 96.5 MB). Free memory was 966.0 MB in the beginning and 1.0 GB in the end (delta: -45.3 MB). Peak memory consumption was 126.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 135721.41 ms. Allocated memory was 1.3 GB in the beginning and 5.6 GB in the end (delta: 4.3 GB). Free memory was 1.0 GB in the beginning and 3.9 GB in the end (delta: -2.9 GB). Peak memory consumption was 4.1 GB. Max. memory is 11.5 GB. * Witness Printer took 449.49 ms. Allocated memory is still 5.6 GB. Free memory was 3.9 GB in the beginning and 3.8 GB in the end (delta: 100.8 MB). Peak memory consumption was 100.8 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_~a3~0_1866,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,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: 4253]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3053]: Loop Invariant [2019-11-15 20:47:16,661 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,662 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,662 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,663 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,663 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,663 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,664 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,664 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,664 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,665 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,665 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,665 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,667 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,667 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,668 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,668 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,668 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,669 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,669 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,670 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,670 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,670 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,671 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,671 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((a3 <= 115 && a24 == 3) && 6 <= a15) || (a18 <= 8 && 306 < a3)) || ((12 == a18 && (\exists v_~a3~0_1866 : int :: (0 <= 4 * v_~a3~0_1866 && 306 < v_~a3~0_1866) && v_~a3~0_1866 * 4 / 10 + 67 <= a3)) && a24 == 1)) || ((a18 <= 8 && a24 == 3) && (\exists v_~a3~0_1866 : int :: (0 <= 4 * v_~a3~0_1866 && 306 < v_~a3~0_1866) && v_~a3~0_1866 * 4 / 10 + 67 <= a3))) || (((4 == a15 && a3 <= 417) && 116 <= a3) && a18 == 9)) || (((!(a24 == 3) && 4 == a15) && a18 <= 8) && a3 <= 115)) || (((a18 == 11 && a24 == 3) && a3 <= 417) && !(6 == a15))) || (((!(a24 == 3) && 10 == a18) && !(a15 == 4)) && !(6 == a15))) || ((10 == a18 && (\exists v_~a3~0_1866 : int :: (0 <= 4 * v_~a3~0_1866 && 306 < v_~a3~0_1866) && v_~a3~0_1866 * 4 / 10 + 67 <= a3)) && a24 == 4)) || (((a18 == 11 && a24 == 4) || ((12 == a18 && 4 == a15) && a24 == 4)) && 116 <= a3)) || ((((!(8 == a18) && 4 == a15) && a3 <= 115) && a24 == 3) && !(12 == a18))) || ((6 <= a15 && 306 < a3) && a18 == 9)) || ((4 == a15 && a18 <= 8) && a24 == 4)) || ((a18 <= 8 && !(a15 == 4)) && 116 <= a3)) || ((!(a15 == 4) && a18 == 11) && 418 <= a3)) || (((!(a24 == 3) && !(a15 == 4)) && !(6 == a15)) && a18 == 9)) || (a24 <= 0 && a18 == 11)) || ((4 == a15 && a18 == 11) && a24 == 4)) || ((10 == a18 && 6 <= a15) && !(a24 == 0))) || (a24 == 1 && a18 <= 9)) || (10 == a18 && a24 == 1)) || ((!(a24 == 3) && a18 == 11) && 336 <= a3)) || (((12 == a18 && !(a15 == 4)) && 306 < a3) && !(6 == a15))) || ((12 == a18 && a24 <= 0) && 116 <= a3)) || (a24 <= 0 && 4 == a15)) || ((10 == a18 && !(a15 == 4)) && 418 <= a3)) || (((!(a24 == 3) && 12 == a18) && 6 <= a15) && !(a24 == 0))) || (((!(a24 == 3) && !(a24 == 0)) && 116 <= a3) && a18 == 9)) || (((12 == a18 && 6 <= a15) && a3 <= 417) && 116 <= a3)) || ((6 <= a15 && !(a24 == 0)) && a18 <= 9)) || ((12 == a18 && a3 <= 115) && a24 == 4)) || ((4 == a15 && 10 == a18) && a24 == 3)) || ((4 == a15 && a18 == 11) && a24 == 1)) || ((a24 <= 0 && a18 <= 9) && !(6 == a15))) || ((10 == a18 && a3 <= 115) && a24 == 4)) || ((((12 == a18 && 4 == a15) && a24 == 3) && a3 <= 417) && 116 <= a3)) || ((10 == a18 && 6 <= a15) && 116 <= a3)) || ((12 == a18 && 4 == a15) && a24 == 1)) || (((12 == a18 && !(a15 == 4)) && a3 <= 115) && !(a24 == 0))) || (((!(a15 == 4) && a18 == 11) && (\exists v_~a3~0_1866 : int :: (0 <= 4 * v_~a3~0_1866 && 306 < v_~a3~0_1866) && v_~a3~0_1866 * 4 / 10 + 67 <= a3)) && !(6 == a15))) || (a18 <= 8 && 6 <= a15)) || ((a18 == 11 && a3 <= 115) && a24 == 1)) || ((!(a24 == 3) && a18 == 11) && 6 <= a15) - InvariantResult [Line: 25]: Loop Invariant [2019-11-15 20:47:16,672 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,673 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,673 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,674 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,674 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,674 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,675 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,675 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,675 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,676 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,676 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,676 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,678 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,678 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,679 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,679 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,679 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,680 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,680 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,681 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,681 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,681 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,682 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,682 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((a3 <= 115 && a24 == 3) && 6 <= a15) || (a18 <= 8 && 306 < a3)) || ((12 == a18 && (\exists v_~a3~0_1866 : int :: (0 <= 4 * v_~a3~0_1866 && 306 < v_~a3~0_1866) && v_~a3~0_1866 * 4 / 10 + 67 <= a3)) && a24 == 1)) || ((a18 <= 8 && a24 == 3) && (\exists v_~a3~0_1866 : int :: (0 <= 4 * v_~a3~0_1866 && 306 < v_~a3~0_1866) && v_~a3~0_1866 * 4 / 10 + 67 <= a3))) || (((4 == a15 && a3 <= 417) && 116 <= a3) && a18 == 9)) || (((!(a24 == 3) && 4 == a15) && a18 <= 8) && a3 <= 115)) || (((a18 == 11 && a24 == 3) && a3 <= 417) && !(6 == a15))) || (((!(a24 == 3) && 10 == a18) && !(a15 == 4)) && !(6 == a15))) || ((10 == a18 && (\exists v_~a3~0_1866 : int :: (0 <= 4 * v_~a3~0_1866 && 306 < v_~a3~0_1866) && v_~a3~0_1866 * 4 / 10 + 67 <= a3)) && a24 == 4)) || (((a18 == 11 && a24 == 4) || ((12 == a18 && 4 == a15) && a24 == 4)) && 116 <= a3)) || ((((!(8 == a18) && 4 == a15) && a3 <= 115) && a24 == 3) && !(12 == a18))) || ((6 <= a15 && 306 < a3) && a18 == 9)) || ((4 == a15 && a18 <= 8) && a24 == 4)) || ((a18 <= 8 && !(a15 == 4)) && 116 <= a3)) || ((!(a15 == 4) && a18 == 11) && 418 <= a3)) || (((!(a24 == 3) && !(a15 == 4)) && !(6 == a15)) && a18 == 9)) || (a24 <= 0 && a18 == 11)) || ((4 == a15 && a18 == 11) && a24 == 4)) || ((10 == a18 && 6 <= a15) && !(a24 == 0))) || (a24 == 1 && a18 <= 9)) || (10 == a18 && a24 == 1)) || ((!(a24 == 3) && a18 == 11) && 336 <= a3)) || (((12 == a18 && !(a15 == 4)) && 306 < a3) && !(6 == a15))) || ((12 == a18 && a24 <= 0) && 116 <= a3)) || (a24 <= 0 && 4 == a15)) || ((10 == a18 && !(a15 == 4)) && 418 <= a3)) || (((!(a24 == 3) && 12 == a18) && 6 <= a15) && !(a24 == 0))) || (((!(a24 == 3) && !(a24 == 0)) && 116 <= a3) && a18 == 9)) || (((12 == a18 && 6 <= a15) && a3 <= 417) && 116 <= a3)) || ((6 <= a15 && !(a24 == 0)) && a18 <= 9)) || ((12 == a18 && a3 <= 115) && a24 == 4)) || ((4 == a15 && 10 == a18) && a24 == 3)) || ((4 == a15 && a18 == 11) && a24 == 1)) || ((a24 <= 0 && a18 <= 9) && !(6 == a15))) || ((10 == a18 && a3 <= 115) && a24 == 4)) || ((((12 == a18 && 4 == a15) && a24 == 3) && a3 <= 417) && 116 <= a3)) || ((10 == a18 && 6 <= a15) && 116 <= a3)) || ((12 == a18 && 4 == a15) && a24 == 1)) || (((12 == a18 && !(a15 == 4)) && a3 <= 115) && !(a24 == 0))) || (((!(a15 == 4) && a18 == 11) && (\exists v_~a3~0_1866 : int :: (0 <= 4 * v_~a3~0_1866 && 306 < v_~a3~0_1866) && v_~a3~0_1866 * 4 / 10 + 67 <= a3)) && !(6 == a15))) || (a18 <= 8 && 6 <= a15)) || ((a18 == 11 && a3 <= 115) && a24 == 1)) || ((!(a24 == 3) && a18 == 11) && 6 <= a15) - InvariantResult [Line: 4259]: Loop Invariant [2019-11-15 20:47:16,683 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,684 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,684 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,685 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,685 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,685 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,686 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,686 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,687 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,687 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,687 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,687 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,689 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,689 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,690 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,690 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,690 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,691 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,691 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,692 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,692 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,692 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,693 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,693 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((a3 <= 115 && a24 == 3) && 6 <= a15) || (a18 <= 8 && 306 < a3)) || ((12 == a18 && (\exists v_~a3~0_1866 : int :: (0 <= 4 * v_~a3~0_1866 && 306 < v_~a3~0_1866) && v_~a3~0_1866 * 4 / 10 + 67 <= a3)) && a24 == 1)) || ((a18 <= 8 && a24 == 3) && (\exists v_~a3~0_1866 : int :: (0 <= 4 * v_~a3~0_1866 && 306 < v_~a3~0_1866) && v_~a3~0_1866 * 4 / 10 + 67 <= a3))) || (((4 == a15 && a3 <= 417) && 116 <= a3) && a18 == 9)) || (((!(a24 == 3) && 4 == a15) && a18 <= 8) && a3 <= 115)) || (((a18 == 11 && a24 == 3) && a3 <= 417) && !(6 == a15))) || (((!(a24 == 3) && 10 == a18) && !(a15 == 4)) && !(6 == a15))) || ((10 == a18 && (\exists v_~a3~0_1866 : int :: (0 <= 4 * v_~a3~0_1866 && 306 < v_~a3~0_1866) && v_~a3~0_1866 * 4 / 10 + 67 <= a3)) && a24 == 4)) || (((a18 == 11 && a24 == 4) || ((12 == a18 && 4 == a15) && a24 == 4)) && 116 <= a3)) || ((((!(8 == a18) && 4 == a15) && a3 <= 115) && a24 == 3) && !(12 == a18))) || ((6 <= a15 && 306 < a3) && a18 == 9)) || ((4 == a15 && a18 <= 8) && a24 == 4)) || ((a18 <= 8 && !(a15 == 4)) && 116 <= a3)) || ((!(a15 == 4) && a18 == 11) && 418 <= a3)) || (((!(a24 == 3) && !(a15 == 4)) && !(6 == a15)) && a18 == 9)) || (a24 <= 0 && a18 == 11)) || ((4 == a15 && a18 == 11) && a24 == 4)) || ((10 == a18 && 6 <= a15) && !(a24 == 0))) || (a24 == 1 && a18 <= 9)) || (10 == a18 && a24 == 1)) || ((!(a24 == 3) && a18 == 11) && 336 <= a3)) || (((12 == a18 && !(a15 == 4)) && 306 < a3) && !(6 == a15))) || ((12 == a18 && a24 <= 0) && 116 <= a3)) || (a24 <= 0 && 4 == a15)) || ((10 == a18 && !(a15 == 4)) && 418 <= a3)) || (((!(a24 == 3) && 12 == a18) && 6 <= a15) && !(a24 == 0))) || (((!(a24 == 3) && !(a24 == 0)) && 116 <= a3) && a18 == 9)) || (((12 == a18 && 6 <= a15) && a3 <= 417) && 116 <= a3)) || ((6 <= a15 && !(a24 == 0)) && a18 <= 9)) || ((12 == a18 && a3 <= 115) && a24 == 4)) || ((4 == a15 && 10 == a18) && a24 == 3)) || ((4 == a15 && a18 == 11) && a24 == 1)) || ((a24 <= 0 && a18 <= 9) && !(6 == a15))) || ((10 == a18 && a3 <= 115) && a24 == 4)) || ((((12 == a18 && 4 == a15) && a24 == 3) && a3 <= 417) && 116 <= a3)) || ((10 == a18 && 6 <= a15) && 116 <= a3)) || ((12 == a18 && 4 == a15) && a24 == 1)) || (((12 == a18 && !(a15 == 4)) && a3 <= 115) && !(a24 == 0))) || (((!(a15 == 4) && a18 == 11) && (\exists v_~a3~0_1866 : int :: (0 <= 4 * v_~a3~0_1866 && 306 < v_~a3~0_1866) && v_~a3~0_1866 * 4 / 10 + 67 <= a3)) && !(6 == a15))) || (a18 <= 8 && 6 <= a15)) || ((a18 == 11 && a3 <= 115) && a24 == 1)) || ((!(a24 == 3) && a18 == 11) && 6 <= a15) - InvariantResult [Line: 1640]: Loop Invariant [2019-11-15 20:47:16,694 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,695 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,695 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,695 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,696 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,696 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,697 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,697 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,697 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,698 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,698 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,698 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,700 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,700 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,700 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,701 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,701 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,702 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,702 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,702 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,703 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,703 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,703 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] [2019-11-15 20:47:16,704 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1866,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((a3 <= 115 && a24 == 3) && 6 <= a15) || (a18 <= 8 && 306 < a3)) || ((12 == a18 && (\exists v_~a3~0_1866 : int :: (0 <= 4 * v_~a3~0_1866 && 306 < v_~a3~0_1866) && v_~a3~0_1866 * 4 / 10 + 67 <= a3)) && a24 == 1)) || ((a18 <= 8 && a24 == 3) && (\exists v_~a3~0_1866 : int :: (0 <= 4 * v_~a3~0_1866 && 306 < v_~a3~0_1866) && v_~a3~0_1866 * 4 / 10 + 67 <= a3))) || (((4 == a15 && a3 <= 417) && 116 <= a3) && a18 == 9)) || (((!(a24 == 3) && 4 == a15) && a18 <= 8) && a3 <= 115)) || (((a18 == 11 && a24 == 3) && a3 <= 417) && !(6 == a15))) || (((!(a24 == 3) && 10 == a18) && !(a15 == 4)) && !(6 == a15))) || ((10 == a18 && (\exists v_~a3~0_1866 : int :: (0 <= 4 * v_~a3~0_1866 && 306 < v_~a3~0_1866) && v_~a3~0_1866 * 4 / 10 + 67 <= a3)) && a24 == 4)) || (((a18 == 11 && a24 == 4) || ((12 == a18 && 4 == a15) && a24 == 4)) && 116 <= a3)) || ((((!(8 == a18) && 4 == a15) && a3 <= 115) && a24 == 3) && !(12 == a18))) || ((6 <= a15 && 306 < a3) && a18 == 9)) || ((4 == a15 && a18 <= 8) && a24 == 4)) || ((a18 <= 8 && !(a15 == 4)) && 116 <= a3)) || ((!(a15 == 4) && a18 == 11) && 418 <= a3)) || (((!(a24 == 3) && !(a15 == 4)) && !(6 == a15)) && a18 == 9)) || (a24 <= 0 && a18 == 11)) || ((4 == a15 && a18 == 11) && a24 == 4)) || ((10 == a18 && 6 <= a15) && !(a24 == 0))) || (a24 == 1 && a18 <= 9)) || (10 == a18 && a24 == 1)) || ((!(a24 == 3) && a18 == 11) && 336 <= a3)) || (((12 == a18 && !(a15 == 4)) && 306 < a3) && !(6 == a15))) || ((12 == a18 && a24 <= 0) && 116 <= a3)) || (a24 <= 0 && 4 == a15)) || ((10 == a18 && !(a15 == 4)) && 418 <= a3)) || (((!(a24 == 3) && 12 == a18) && 6 <= a15) && !(a24 == 0))) || (((!(a24 == 3) && !(a24 == 0)) && 116 <= a3) && a18 == 9)) || (((12 == a18 && 6 <= a15) && a3 <= 417) && 116 <= a3)) || ((6 <= a15 && !(a24 == 0)) && a18 <= 9)) || ((12 == a18 && a3 <= 115) && a24 == 4)) || ((4 == a15 && 10 == a18) && a24 == 3)) || ((4 == a15 && a18 == 11) && a24 == 1)) || ((a24 <= 0 && a18 <= 9) && !(6 == a15))) || ((10 == a18 && a3 <= 115) && a24 == 4)) || ((((12 == a18 && 4 == a15) && a24 == 3) && a3 <= 417) && 116 <= a3)) || ((10 == a18 && 6 <= a15) && 116 <= a3)) || ((12 == a18 && 4 == a15) && a24 == 1)) || (((12 == a18 && !(a15 == 4)) && a3 <= 115) && !(a24 == 0))) || (((!(a15 == 4) && a18 == 11) && (\exists v_~a3~0_1866 : int :: (0 <= 4 * v_~a3~0_1866 && 306 < v_~a3~0_1866) && v_~a3~0_1866 * 4 / 10 + 67 <= a3)) && !(6 == a15))) || (a18 <= 8 && 6 <= a15)) || ((a18 == 11 && a3 <= 115) && a24 == 1)) || ((!(a24 == 3) && a18 == 11) && 6 <= a15) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 757 locations, 1 error locations. Result: SAFE, OverallTime: 135.5s, OverallIterations: 20, TraceHistogramMax: 8, AutomataDifference: 64.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 9.2s, HoareTripleCheckerStatistics: 13196 SDtfs, 20848 SDslu, 201 SDs, 0 SdLazy, 51257 SolverSat, 10241 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 46.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 7685 GetRequests, 7603 SyntacticMatches, 24 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=100054occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 8.8s AutomataMinimizationTime, 20 MinimizatonAttempts, 31740 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 5 PreInvPairs, 660 NumberOfFragments, 2257 HoareAnnotationTreeSize, 5 FomulaSimplifications, 22748 FormulaSimplificationTreeSizeReduction, 1.6s HoareSimplificationTime, 5 FomulaSimplificationsInter, 14788 FormulaSimplificationTreeSizeReductionInter, 7.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.7s SsaConstructionTime, 2.5s SatisfiabilityAnalysisTime, 18.2s InterpolantComputationTime, 32282 NumberOfCodeBlocks, 32282 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 32255 ConstructedInterpolants, 335 QuantifiedInterpolants, 99758825 SizeOfPredicates, 2 NumberOfNonLiveVariables, 8795 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 27 InterpolantComputations, 20 PerfectInterpolantSequences, 52222/54486 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...