./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem15_label36.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_665bf698-fca2-4fdd-9d89-75e437c35320/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_665bf698-fca2-4fdd-9d89-75e437c35320/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_665bf698-fca2-4fdd-9d89-75e437c35320/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_665bf698-fca2-4fdd-9d89-75e437c35320/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem15_label36.c -s /tmp/vcloud-vcloud-master/worker/run_dir_665bf698-fca2-4fdd-9d89-75e437c35320/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_665bf698-fca2-4fdd-9d89-75e437c35320/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 1d96b5cec4d76d1edc3f261f7d8386bd0d5f58f5 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 17:44:44,724 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 17:44:44,726 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 17:44:44,733 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 17:44:44,733 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 17:44:44,734 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 17:44:44,735 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 17:44:44,736 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 17:44:44,737 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 17:44:44,738 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 17:44:44,738 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 17:44:44,739 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 17:44:44,739 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 17:44:44,740 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 17:44:44,741 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 17:44:44,741 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 17:44:44,742 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 17:44:44,742 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 17:44:44,744 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 17:44:44,745 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 17:44:44,747 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 17:44:44,747 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 17:44:44,748 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 17:44:44,748 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 17:44:44,750 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 17:44:44,750 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 17:44:44,750 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 17:44:44,751 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 17:44:44,751 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 17:44:44,752 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 17:44:44,752 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 17:44:44,752 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 17:44:44,753 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 17:44:44,753 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 17:44:44,754 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 17:44:44,754 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 17:44:44,754 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 17:44:44,754 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 17:44:44,754 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 17:44:44,755 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 17:44:44,755 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 17:44:44,756 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_665bf698-fca2-4fdd-9d89-75e437c35320/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 17:44:44,765 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 17:44:44,765 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 17:44:44,766 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 17:44:44,766 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 17:44:44,766 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 17:44:44,767 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 17:44:44,767 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 17:44:44,767 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 17:44:44,767 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 17:44:44,767 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 17:44:44,767 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 17:44:44,767 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 17:44:44,768 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 17:44:44,768 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 17:44:44,768 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 17:44:44,768 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 17:44:44,768 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 17:44:44,768 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 17:44:44,768 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 17:44:44,768 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 17:44:44,769 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 17:44:44,769 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 17:44:44,769 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 17:44:44,769 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 17:44:44,769 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 17:44:44,769 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 17:44:44,769 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 17:44:44,769 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 17:44:44,770 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 17:44:44,770 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_665bf698-fca2-4fdd-9d89-75e437c35320/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 -> 1d96b5cec4d76d1edc3f261f7d8386bd0d5f58f5 [2019-12-07 17:44:44,867 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 17:44:44,875 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 17:44:44,877 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 17:44:44,878 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 17:44:44,878 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 17:44:44,878 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_665bf698-fca2-4fdd-9d89-75e437c35320/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem15_label36.c [2019-12-07 17:44:44,914 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_665bf698-fca2-4fdd-9d89-75e437c35320/bin/uautomizer/data/59d3fe2be/7f3f60a53ab74a9a910b0fa500ef141d/FLAG978e76da6 [2019-12-07 17:44:45,372 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 17:44:45,372 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_665bf698-fca2-4fdd-9d89-75e437c35320/sv-benchmarks/c/eca-rers2012/Problem15_label36.c [2019-12-07 17:44:45,385 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_665bf698-fca2-4fdd-9d89-75e437c35320/bin/uautomizer/data/59d3fe2be/7f3f60a53ab74a9a910b0fa500ef141d/FLAG978e76da6 [2019-12-07 17:44:45,395 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_665bf698-fca2-4fdd-9d89-75e437c35320/bin/uautomizer/data/59d3fe2be/7f3f60a53ab74a9a910b0fa500ef141d [2019-12-07 17:44:45,397 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 17:44:45,398 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 17:44:45,398 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 17:44:45,398 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 17:44:45,401 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 17:44:45,401 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:44:45" (1/1) ... [2019-12-07 17:44:45,403 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@464f5586 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:44:45, skipping insertion in model container [2019-12-07 17:44:45,404 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:44:45" (1/1) ... [2019-12-07 17:44:45,409 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 17:44:45,461 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 17:44:45,903 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:44:45,906 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 17:44:46,060 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:44:46,071 INFO L208 MainTranslator]: Completed translation [2019-12-07 17:44:46,072 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:44:46 WrapperNode [2019-12-07 17:44:46,072 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 17:44:46,072 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 17:44:46,073 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 17:44:46,073 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 17:44:46,078 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:44:46" (1/1) ... [2019-12-07 17:44:46,098 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:44:46" (1/1) ... [2019-12-07 17:44:46,196 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 17:44:46,196 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 17:44:46,197 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 17:44:46,197 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 17:44:46,203 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:44:46" (1/1) ... [2019-12-07 17:44:46,203 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:44:46" (1/1) ... [2019-12-07 17:44:46,212 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:44:46" (1/1) ... [2019-12-07 17:44:46,212 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:44:46" (1/1) ... [2019-12-07 17:44:46,259 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:44:46" (1/1) ... [2019-12-07 17:44:46,269 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:44:46" (1/1) ... [2019-12-07 17:44:46,298 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:44:46" (1/1) ... [2019-12-07 17:44:46,334 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 17:44:46,334 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 17:44:46,334 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 17:44:46,334 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 17:44:46,335 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:44:46" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_665bf698-fca2-4fdd-9d89-75e437c35320/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 17:44:46,382 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 17:44:46,383 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 17:44:48,632 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 17:44:48,632 INFO L287 CfgBuilder]: Removed 9 assume(true) statements. [2019-12-07 17:44:48,633 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:44:48 BoogieIcfgContainer [2019-12-07 17:44:48,633 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 17:44:48,634 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 17:44:48,634 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 17:44:48,636 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 17:44:48,636 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 05:44:45" (1/3) ... [2019-12-07 17:44:48,636 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41325bb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:44:48, skipping insertion in model container [2019-12-07 17:44:48,637 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:44:46" (2/3) ... [2019-12-07 17:44:48,637 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41325bb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:44:48, skipping insertion in model container [2019-12-07 17:44:48,637 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:44:48" (3/3) ... [2019-12-07 17:44:48,638 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem15_label36.c [2019-12-07 17:44:48,645 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 17:44:48,651 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 17:44:48,661 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 17:44:48,683 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 17:44:48,683 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 17:44:48,684 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 17:44:48,684 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 17:44:48,684 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 17:44:48,684 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 17:44:48,684 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 17:44:48,684 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 17:44:48,700 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states. [2019-12-07 17:44:48,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-07 17:44:48,706 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:44:48,706 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:44:48,707 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:44:48,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:44:48,710 INFO L82 PathProgramCache]: Analyzing trace with hash 1818267785, now seen corresponding path program 1 times [2019-12-07 17:44:48,716 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:44:48,716 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354118058] [2019-12-07 17:44:48,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:44:48,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:48,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:44:48,902 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354118058] [2019-12-07 17:44:48,902 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:44:48,903 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:44:48,904 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429446237] [2019-12-07 17:44:48,908 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:44:48,909 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:44:48,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:44:48,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:44:48,923 INFO L87 Difference]: Start difference. First operand 424 states. Second operand 4 states. [2019-12-07 17:44:52,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:44:52,419 INFO L93 Difference]: Finished difference Result 1466 states and 2715 transitions. [2019-12-07 17:44:52,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:44:52,420 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2019-12-07 17:44:52,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:44:52,435 INFO L225 Difference]: With dead ends: 1466 [2019-12-07 17:44:52,435 INFO L226 Difference]: Without dead ends: 974 [2019-12-07 17:44:52,438 INFO L630 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-12-07 17:44:52,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2019-12-07 17:44:52,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 972. [2019-12-07 17:44:52,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 972 states. [2019-12-07 17:44:52,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 972 states and 1407 transitions. [2019-12-07 17:44:52,499 INFO L78 Accepts]: Start accepts. Automaton has 972 states and 1407 transitions. Word has length 61 [2019-12-07 17:44:52,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:44:52,499 INFO L462 AbstractCegarLoop]: Abstraction has 972 states and 1407 transitions. [2019-12-07 17:44:52,499 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:44:52,500 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states and 1407 transitions. [2019-12-07 17:44:52,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-12-07 17:44:52,503 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:44:52,503 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-12-07 17:44:52,504 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:44:52,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:44:52,504 INFO L82 PathProgramCache]: Analyzing trace with hash 13242671, now seen corresponding path program 1 times [2019-12-07 17:44:52,504 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:44:52,504 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044721828] [2019-12-07 17:44:52,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:44:52,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:52,629 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:44:52,629 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044721828] [2019-12-07 17:44:52,629 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:44:52,629 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:44:52,629 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927526469] [2019-12-07 17:44:52,630 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:44:52,631 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:44:52,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:44:52,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:44:52,631 INFO L87 Difference]: Start difference. First operand 972 states and 1407 transitions. Second operand 4 states. [2019-12-07 17:44:55,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:44:55,887 INFO L93 Difference]: Finished difference Result 3747 states and 5437 transitions. [2019-12-07 17:44:55,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:44:55,888 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 126 [2019-12-07 17:44:55,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:44:55,899 INFO L225 Difference]: With dead ends: 3747 [2019-12-07 17:44:55,899 INFO L226 Difference]: Without dead ends: 2777 [2019-12-07 17:44:55,902 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:44:55,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2777 states. [2019-12-07 17:44:55,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2777 to 2775. [2019-12-07 17:44:55,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2775 states. [2019-12-07 17:44:55,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2775 states to 2775 states and 3624 transitions. [2019-12-07 17:44:55,940 INFO L78 Accepts]: Start accepts. Automaton has 2775 states and 3624 transitions. Word has length 126 [2019-12-07 17:44:55,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:44:55,940 INFO L462 AbstractCegarLoop]: Abstraction has 2775 states and 3624 transitions. [2019-12-07 17:44:55,941 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:44:55,941 INFO L276 IsEmpty]: Start isEmpty. Operand 2775 states and 3624 transitions. [2019-12-07 17:44:55,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-12-07 17:44:55,947 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:44:55,947 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:44:55,947 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:44:55,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:44:55,948 INFO L82 PathProgramCache]: Analyzing trace with hash 1978174500, now seen corresponding path program 1 times [2019-12-07 17:44:55,948 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:44:55,948 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262406768] [2019-12-07 17:44:55,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:44:55,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:56,146 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 117 proven. 3 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-12-07 17:44:56,146 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262406768] [2019-12-07 17:44:56,146 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [213107921] [2019-12-07 17:44:56,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_665bf698-fca2-4fdd-9d89-75e437c35320/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:44:56,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:56,212 INFO L264 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 17:44:56,221 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:44:56,287 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 195 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:44:56,288 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 17:44:56,288 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2019-12-07 17:44:56,288 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529548487] [2019-12-07 17:44:56,289 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:44:56,289 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:44:56,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:44:56,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:44:56,290 INFO L87 Difference]: Start difference. First operand 2775 states and 3624 transitions. Second operand 3 states. [2019-12-07 17:44:58,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:44:58,102 INFO L93 Difference]: Finished difference Result 7941 states and 10408 transitions. [2019-12-07 17:44:58,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:44:58,102 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 231 [2019-12-07 17:44:58,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:44:58,119 INFO L225 Difference]: With dead ends: 7941 [2019-12-07 17:44:58,119 INFO L226 Difference]: Without dead ends: 5168 [2019-12-07 17:44:58,122 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 231 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-12-07 17:44:58,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5168 states. [2019-12-07 17:44:58,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5168 to 3073. [2019-12-07 17:44:58,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3073 states. [2019-12-07 17:44:58,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3073 states to 3073 states and 3976 transitions. [2019-12-07 17:44:58,170 INFO L78 Accepts]: Start accepts. Automaton has 3073 states and 3976 transitions. Word has length 231 [2019-12-07 17:44:58,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:44:58,171 INFO L462 AbstractCegarLoop]: Abstraction has 3073 states and 3976 transitions. [2019-12-07 17:44:58,171 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:44:58,171 INFO L276 IsEmpty]: Start isEmpty. Operand 3073 states and 3976 transitions. [2019-12-07 17:44:58,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 412 [2019-12-07 17:44:58,175 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:44:58,176 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2019-12-07 17:44:58,376 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:44:58,377 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:44:58,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:44:58,377 INFO L82 PathProgramCache]: Analyzing trace with hash 482134373, now seen corresponding path program 1 times [2019-12-07 17:44:58,377 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:44:58,377 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938396828] [2019-12-07 17:44:58,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:44:58,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:58,814 INFO L134 CoverageAnalysis]: Checked inductivity of 404 backedges. 210 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2019-12-07 17:44:58,814 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938396828] [2019-12-07 17:44:58,814 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:44:58,814 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:44:58,814 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770249156] [2019-12-07 17:44:58,815 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:44:58,815 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:44:58,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:44:58,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:44:58,816 INFO L87 Difference]: Start difference. First operand 3073 states and 3976 transitions. Second operand 5 states. [2019-12-07 17:45:01,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:45:01,836 INFO L93 Difference]: Finished difference Result 7342 states and 9252 transitions. [2019-12-07 17:45:01,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:45:01,837 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 411 [2019-12-07 17:45:01,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:45:01,851 INFO L225 Difference]: With dead ends: 7342 [2019-12-07 17:45:01,851 INFO L226 Difference]: Without dead ends: 4271 [2019-12-07 17:45:01,854 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:45:01,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4271 states. [2019-12-07 17:45:01,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4271 to 3971. [2019-12-07 17:45:01,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3971 states. [2019-12-07 17:45:01,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3971 states to 3971 states and 4928 transitions. [2019-12-07 17:45:01,912 INFO L78 Accepts]: Start accepts. Automaton has 3971 states and 4928 transitions. Word has length 411 [2019-12-07 17:45:01,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:45:01,913 INFO L462 AbstractCegarLoop]: Abstraction has 3971 states and 4928 transitions. [2019-12-07 17:45:01,913 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:45:01,913 INFO L276 IsEmpty]: Start isEmpty. Operand 3971 states and 4928 transitions. [2019-12-07 17:45:01,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 486 [2019-12-07 17:45:01,922 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:45:01,922 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2019-12-07 17:45:01,922 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:45:01,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:45:01,923 INFO L82 PathProgramCache]: Analyzing trace with hash 1884331539, now seen corresponding path program 1 times [2019-12-07 17:45:01,923 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:45:01,923 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367601247] [2019-12-07 17:45:01,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:45:01,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:45:02,231 INFO L134 CoverageAnalysis]: Checked inductivity of 404 backedges. 329 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-12-07 17:45:02,231 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367601247] [2019-12-07 17:45:02,231 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:45:02,231 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:45:02,231 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095477518] [2019-12-07 17:45:02,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:45:02,232 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:45:02,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:45:02,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:45:02,232 INFO L87 Difference]: Start difference. First operand 3971 states and 4928 transitions. Second operand 4 states. [2019-12-07 17:45:06,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:45:06,669 INFO L93 Difference]: Finished difference Result 9742 states and 12308 transitions. [2019-12-07 17:45:06,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:45:06,669 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 485 [2019-12-07 17:45:06,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:45:06,688 INFO L225 Difference]: With dead ends: 9742 [2019-12-07 17:45:06,688 INFO L226 Difference]: Without dead ends: 5773 [2019-12-07 17:45:06,691 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:45:06,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5773 states. [2019-12-07 17:45:06,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5773 to 5470. [2019-12-07 17:45:06,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5470 states. [2019-12-07 17:45:06,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5470 states to 5470 states and 6685 transitions. [2019-12-07 17:45:06,757 INFO L78 Accepts]: Start accepts. Automaton has 5470 states and 6685 transitions. Word has length 485 [2019-12-07 17:45:06,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:45:06,758 INFO L462 AbstractCegarLoop]: Abstraction has 5470 states and 6685 transitions. [2019-12-07 17:45:06,758 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:45:06,758 INFO L276 IsEmpty]: Start isEmpty. Operand 5470 states and 6685 transitions. [2019-12-07 17:45:06,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 492 [2019-12-07 17:45:06,762 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:45:06,762 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:45:06,762 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:45:06,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:45:06,763 INFO L82 PathProgramCache]: Analyzing trace with hash -1615305343, now seen corresponding path program 1 times [2019-12-07 17:45:06,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:45:06,763 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840663853] [2019-12-07 17:45:06,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:45:06,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:45:06,998 INFO L134 CoverageAnalysis]: Checked inductivity of 410 backedges. 351 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2019-12-07 17:45:06,998 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840663853] [2019-12-07 17:45:06,998 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:45:06,998 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:45:06,998 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983921299] [2019-12-07 17:45:06,999 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:45:06,999 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:45:06,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:45:06,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:45:06,999 INFO L87 Difference]: Start difference. First operand 5470 states and 6685 transitions. Second operand 4 states. [2019-12-07 17:45:09,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:45:09,473 INFO L93 Difference]: Finished difference Result 10937 states and 13389 transitions. [2019-12-07 17:45:09,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:45:09,474 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 491 [2019-12-07 17:45:09,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:45:09,490 INFO L225 Difference]: With dead ends: 10937 [2019-12-07 17:45:09,490 INFO L226 Difference]: Without dead ends: 5469 [2019-12-07 17:45:09,493 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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-12-07 17:45:09,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5469 states. [2019-12-07 17:45:09,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5469 to 5466. [2019-12-07 17:45:09,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5466 states. [2019-12-07 17:45:09,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5466 states to 5466 states and 6352 transitions. [2019-12-07 17:45:09,540 INFO L78 Accepts]: Start accepts. Automaton has 5466 states and 6352 transitions. Word has length 491 [2019-12-07 17:45:09,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:45:09,541 INFO L462 AbstractCegarLoop]: Abstraction has 5466 states and 6352 transitions. [2019-12-07 17:45:09,541 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:45:09,542 INFO L276 IsEmpty]: Start isEmpty. Operand 5466 states and 6352 transitions. [2019-12-07 17:45:09,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 515 [2019-12-07 17:45:09,547 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:45:09,548 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:45:09,548 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:45:09,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:45:09,548 INFO L82 PathProgramCache]: Analyzing trace with hash -739237505, now seen corresponding path program 1 times [2019-12-07 17:45:09,548 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:45:09,549 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973685543] [2019-12-07 17:45:09,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:45:09,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:45:10,341 INFO L134 CoverageAnalysis]: Checked inductivity of 731 backedges. 534 proven. 3 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2019-12-07 17:45:10,342 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973685543] [2019-12-07 17:45:10,342 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1426156825] [2019-12-07 17:45:10,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_665bf698-fca2-4fdd-9d89-75e437c35320/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:45:10,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:45:10,440 INFO L264 TraceCheckSpWp]: Trace formula consists of 643 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 17:45:10,449 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:45:10,579 INFO L134 CoverageAnalysis]: Checked inductivity of 731 backedges. 582 proven. 0 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2019-12-07 17:45:10,579 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 17:45:10,579 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2019-12-07 17:45:10,579 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322331357] [2019-12-07 17:45:10,580 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:45:10,580 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:45:10,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:45:10,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:45:10,580 INFO L87 Difference]: Start difference. First operand 5466 states and 6352 transitions. Second operand 3 states. [2019-12-07 17:45:12,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:45:12,073 INFO L93 Difference]: Finished difference Result 10930 states and 12702 transitions. [2019-12-07 17:45:12,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:45:12,074 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 514 [2019-12-07 17:45:12,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:45:12,090 INFO L225 Difference]: With dead ends: 10930 [2019-12-07 17:45:12,090 INFO L226 Difference]: Without dead ends: 5466 [2019-12-07 17:45:12,094 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 520 GetRequests, 513 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:45:12,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5466 states. [2019-12-07 17:45:12,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5466 to 5466. [2019-12-07 17:45:12,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5466 states. [2019-12-07 17:45:12,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5466 states to 5466 states and 6334 transitions. [2019-12-07 17:45:12,155 INFO L78 Accepts]: Start accepts. Automaton has 5466 states and 6334 transitions. Word has length 514 [2019-12-07 17:45:12,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:45:12,156 INFO L462 AbstractCegarLoop]: Abstraction has 5466 states and 6334 transitions. [2019-12-07 17:45:12,156 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:45:12,156 INFO L276 IsEmpty]: Start isEmpty. Operand 5466 states and 6334 transitions. [2019-12-07 17:45:12,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 518 [2019-12-07 17:45:12,161 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:45:12,162 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:45:12,362 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:45:12,363 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:45:12,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:45:12,364 INFO L82 PathProgramCache]: Analyzing trace with hash 1317201490, now seen corresponding path program 1 times [2019-12-07 17:45:12,364 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:45:12,364 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768044497] [2019-12-07 17:45:12,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:45:12,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:45:12,689 INFO L134 CoverageAnalysis]: Checked inductivity of 439 backedges. 333 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-12-07 17:45:12,690 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768044497] [2019-12-07 17:45:12,690 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:45:12,690 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:45:12,690 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818225119] [2019-12-07 17:45:12,691 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:45:12,691 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:45:12,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:45:12,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:45:12,691 INFO L87 Difference]: Start difference. First operand 5466 states and 6334 transitions. Second operand 4 states. [2019-12-07 17:45:15,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:45:15,191 INFO L93 Difference]: Finished difference Result 10932 states and 12672 transitions. [2019-12-07 17:45:15,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:45:15,191 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 517 [2019-12-07 17:45:15,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:45:15,197 INFO L225 Difference]: With dead ends: 10932 [2019-12-07 17:45:15,197 INFO L226 Difference]: Without dead ends: 5468 [2019-12-07 17:45:15,201 INFO L630 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-12-07 17:45:15,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5468 states. [2019-12-07 17:45:15,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5468 to 5463. [2019-12-07 17:45:15,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5463 states. [2019-12-07 17:45:15,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5463 states to 5463 states and 6173 transitions. [2019-12-07 17:45:15,240 INFO L78 Accepts]: Start accepts. Automaton has 5463 states and 6173 transitions. Word has length 517 [2019-12-07 17:45:15,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:45:15,240 INFO L462 AbstractCegarLoop]: Abstraction has 5463 states and 6173 transitions. [2019-12-07 17:45:15,240 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:45:15,240 INFO L276 IsEmpty]: Start isEmpty. Operand 5463 states and 6173 transitions. [2019-12-07 17:45:15,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 550 [2019-12-07 17:45:15,243 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:45:15,244 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:45:15,244 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:45:15,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:45:15,244 INFO L82 PathProgramCache]: Analyzing trace with hash 1882152332, now seen corresponding path program 1 times [2019-12-07 17:45:15,245 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:45:15,245 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496968640] [2019-12-07 17:45:15,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:45:15,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:45:16,086 INFO L134 CoverageAnalysis]: Checked inductivity of 771 backedges. 571 proven. 3 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked. [2019-12-07 17:45:16,086 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496968640] [2019-12-07 17:45:16,086 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [771524021] [2019-12-07 17:45:16,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_665bf698-fca2-4fdd-9d89-75e437c35320/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:45:16,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:45:16,188 INFO L264 TraceCheckSpWp]: Trace formula consists of 677 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 17:45:16,192 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:45:16,375 INFO L134 CoverageAnalysis]: Checked inductivity of 771 backedges. 471 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-12-07 17:45:16,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 17:45:16,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2019-12-07 17:45:16,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597181474] [2019-12-07 17:45:16,376 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:45:16,376 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:45:16,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:45:16,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:45:16,376 INFO L87 Difference]: Start difference. First operand 5463 states and 6173 transitions. Second operand 3 states. [2019-12-07 17:45:17,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:45:17,881 INFO L93 Difference]: Finished difference Result 14523 states and 16465 transitions. [2019-12-07 17:45:17,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:45:17,882 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 549 [2019-12-07 17:45:17,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:45:17,890 INFO L225 Difference]: With dead ends: 14523 [2019-12-07 17:45:17,890 INFO L226 Difference]: Without dead ends: 9062 [2019-12-07 17:45:17,895 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 555 GetRequests, 548 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:45:17,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9062 states. [2019-12-07 17:45:17,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9062 to 8755. [2019-12-07 17:45:17,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8755 states. [2019-12-07 17:45:17,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8755 states to 8755 states and 9759 transitions. [2019-12-07 17:45:17,956 INFO L78 Accepts]: Start accepts. Automaton has 8755 states and 9759 transitions. Word has length 549 [2019-12-07 17:45:17,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:45:17,957 INFO L462 AbstractCegarLoop]: Abstraction has 8755 states and 9759 transitions. [2019-12-07 17:45:17,957 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:45:17,957 INFO L276 IsEmpty]: Start isEmpty. Operand 8755 states and 9759 transitions. [2019-12-07 17:45:17,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 563 [2019-12-07 17:45:17,961 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:45:17,961 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2019-12-07 17:45:18,161 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:45:18,162 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:45:18,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:45:18,162 INFO L82 PathProgramCache]: Analyzing trace with hash 2096021639, now seen corresponding path program 1 times [2019-12-07 17:45:18,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:45:18,162 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512007124] [2019-12-07 17:45:18,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:45:18,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:45:18,383 INFO L134 CoverageAnalysis]: Checked inductivity of 510 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2019-12-07 17:45:18,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512007124] [2019-12-07 17:45:18,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:45:18,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:45:18,383 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353450424] [2019-12-07 17:45:18,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:45:18,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:45:18,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:45:18,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:45:18,384 INFO L87 Difference]: Start difference. First operand 8755 states and 9759 transitions. Second operand 3 states. [2019-12-07 17:45:20,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:45:20,502 INFO L93 Difference]: Finished difference Result 17805 states and 19855 transitions. [2019-12-07 17:45:20,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:45:20,503 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 562 [2019-12-07 17:45:20,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:45:20,512 INFO L225 Difference]: With dead ends: 17805 [2019-12-07 17:45:20,512 INFO L226 Difference]: Without dead ends: 9052 [2019-12-07 17:45:20,518 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:45:20,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9052 states. [2019-12-07 17:45:20,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9052 to 8753. [2019-12-07 17:45:20,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8753 states. [2019-12-07 17:45:20,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8753 states to 8753 states and 9755 transitions. [2019-12-07 17:45:20,593 INFO L78 Accepts]: Start accepts. Automaton has 8753 states and 9755 transitions. Word has length 562 [2019-12-07 17:45:20,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:45:20,593 INFO L462 AbstractCegarLoop]: Abstraction has 8753 states and 9755 transitions. [2019-12-07 17:45:20,593 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:45:20,593 INFO L276 IsEmpty]: Start isEmpty. Operand 8753 states and 9755 transitions. [2019-12-07 17:45:20,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 626 [2019-12-07 17:45:20,599 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:45:20,599 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:45:20,599 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:45:20,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:45:20,600 INFO L82 PathProgramCache]: Analyzing trace with hash 1471252033, now seen corresponding path program 1 times [2019-12-07 17:45:20,600 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:45:20,600 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674419024] [2019-12-07 17:45:20,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:45:20,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:45:21,504 INFO L134 CoverageAnalysis]: Checked inductivity of 847 backedges. 647 proven. 3 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked. [2019-12-07 17:45:21,504 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674419024] [2019-12-07 17:45:21,504 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1668241974] [2019-12-07 17:45:21,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_665bf698-fca2-4fdd-9d89-75e437c35320/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:45:21,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:45:21,629 INFO L264 TraceCheckSpWp]: Trace formula consists of 756 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 17:45:21,636 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:45:21,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:45:22,132 INFO L134 CoverageAnalysis]: Checked inductivity of 847 backedges. 611 proven. 39 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked. [2019-12-07 17:45:22,132 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:45:22,133 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2019-12-07 17:45:22,133 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301138624] [2019-12-07 17:45:22,134 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 17:45:22,134 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:45:22,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 17:45:22,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 17:45:22,135 INFO L87 Difference]: Start difference. First operand 8753 states and 9755 transitions. Second operand 9 states. [2019-12-07 17:45:29,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:45:29,953 INFO L93 Difference]: Finished difference Result 23340 states and 25838 transitions. [2019-12-07 17:45:29,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 17:45:29,953 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 625 [2019-12-07 17:45:29,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:45:29,960 INFO L225 Difference]: With dead ends: 23340 [2019-12-07 17:45:29,960 INFO L226 Difference]: Without dead ends: 9948 [2019-12-07 17:45:29,967 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 636 GetRequests, 623 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-12-07 17:45:29,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9948 states. [2019-12-07 17:45:30,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9948 to 9648. [2019-12-07 17:45:30,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9648 states. [2019-12-07 17:45:30,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9648 states to 9648 states and 10076 transitions. [2019-12-07 17:45:30,033 INFO L78 Accepts]: Start accepts. Automaton has 9648 states and 10076 transitions. Word has length 625 [2019-12-07 17:45:30,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:45:30,033 INFO L462 AbstractCegarLoop]: Abstraction has 9648 states and 10076 transitions. [2019-12-07 17:45:30,033 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 17:45:30,033 INFO L276 IsEmpty]: Start isEmpty. Operand 9648 states and 10076 transitions. [2019-12-07 17:45:30,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 663 [2019-12-07 17:45:30,038 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:45:30,039 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-12-07 17:45:30,239 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:45:30,239 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:45:30,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:45:30,240 INFO L82 PathProgramCache]: Analyzing trace with hash -2145955924, now seen corresponding path program 1 times [2019-12-07 17:45:30,240 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:45:30,240 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179191747] [2019-12-07 17:45:30,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:45:30,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:45:30,572 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 436 trivial. 0 not checked. [2019-12-07 17:45:30,572 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179191747] [2019-12-07 17:45:30,572 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:45:30,572 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:45:30,572 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300959456] [2019-12-07 17:45:30,573 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:45:30,573 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:45:30,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:45:30,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:45:30,573 INFO L87 Difference]: Start difference. First operand 9648 states and 10076 transitions. Second operand 3 states. [2019-12-07 17:45:31,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:45:31,556 INFO L93 Difference]: Finished difference Result 22283 states and 23308 transitions. [2019-12-07 17:45:31,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:45:31,556 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 662 [2019-12-07 17:45:31,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:45:31,564 INFO L225 Difference]: With dead ends: 22283 [2019-12-07 17:45:31,564 INFO L226 Difference]: Without dead ends: 12338 [2019-12-07 17:45:31,571 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:45:31,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12338 states. [2019-12-07 17:45:31,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12338 to 12039. [2019-12-07 17:45:31,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12039 states. [2019-12-07 17:45:31,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12039 states to 12039 states and 12495 transitions. [2019-12-07 17:45:31,647 INFO L78 Accepts]: Start accepts. Automaton has 12039 states and 12495 transitions. Word has length 662 [2019-12-07 17:45:31,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:45:31,648 INFO L462 AbstractCegarLoop]: Abstraction has 12039 states and 12495 transitions. [2019-12-07 17:45:31,648 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:45:31,648 INFO L276 IsEmpty]: Start isEmpty. Operand 12039 states and 12495 transitions. [2019-12-07 17:45:31,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 687 [2019-12-07 17:45:31,654 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:45:31,655 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-12-07 17:45:31,655 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:45:31,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:45:31,655 INFO L82 PathProgramCache]: Analyzing trace with hash 1492551500, now seen corresponding path program 1 times [2019-12-07 17:45:31,655 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:45:31,655 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981495204] [2019-12-07 17:45:31,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:45:31,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:45:32,159 INFO L134 CoverageAnalysis]: Checked inductivity of 634 backedges. 528 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-12-07 17:45:32,159 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981495204] [2019-12-07 17:45:32,159 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:45:32,160 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:45:32,160 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552407658] [2019-12-07 17:45:32,160 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:45:32,160 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:45:32,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:45:32,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:45:32,161 INFO L87 Difference]: Start difference. First operand 12039 states and 12495 transitions. Second operand 4 states. [2019-12-07 17:45:33,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:45:33,565 INFO L93 Difference]: Finished difference Result 23145 states and 24053 transitions. [2019-12-07 17:45:33,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:45:33,566 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 686 [2019-12-07 17:45:33,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:45:33,573 INFO L225 Difference]: With dead ends: 23145 [2019-12-07 17:45:33,573 INFO L226 Difference]: Without dead ends: 11108 [2019-12-07 17:45:33,578 INFO L630 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-12-07 17:45:33,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11108 states. [2019-12-07 17:45:33,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11108 to 9008. [2019-12-07 17:45:33,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9008 states. [2019-12-07 17:45:33,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9008 states to 9008 states and 9271 transitions. [2019-12-07 17:45:33,647 INFO L78 Accepts]: Start accepts. Automaton has 9008 states and 9271 transitions. Word has length 686 [2019-12-07 17:45:33,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:45:33,647 INFO L462 AbstractCegarLoop]: Abstraction has 9008 states and 9271 transitions. [2019-12-07 17:45:33,647 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:45:33,647 INFO L276 IsEmpty]: Start isEmpty. Operand 9008 states and 9271 transitions. [2019-12-07 17:45:33,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 692 [2019-12-07 17:45:33,653 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:45:33,653 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-12-07 17:45:33,653 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:45:33,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:45:33,654 INFO L82 PathProgramCache]: Analyzing trace with hash 940636783, now seen corresponding path program 1 times [2019-12-07 17:45:33,654 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:45:33,654 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320503752] [2019-12-07 17:45:33,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:45:33,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:45:34,013 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 463 trivial. 0 not checked. [2019-12-07 17:45:34,013 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320503752] [2019-12-07 17:45:34,013 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:45:34,013 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:45:34,014 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394243891] [2019-12-07 17:45:34,014 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:45:34,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:45:34,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:45:34,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:45:34,014 INFO L87 Difference]: Start difference. First operand 9008 states and 9271 transitions. Second operand 3 states. [2019-12-07 17:45:34,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:45:34,629 INFO L93 Difference]: Finished difference Result 18014 states and 18546 transitions. [2019-12-07 17:45:34,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:45:34,630 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 691 [2019-12-07 17:45:34,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:45:34,635 INFO L225 Difference]: With dead ends: 18014 [2019-12-07 17:45:34,635 INFO L226 Difference]: Without dead ends: 9307 [2019-12-07 17:45:34,638 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:45:34,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9307 states. [2019-12-07 17:45:34,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9307 to 9008. [2019-12-07 17:45:34,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9008 states. [2019-12-07 17:45:34,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9008 states to 9008 states and 9268 transitions. [2019-12-07 17:45:34,692 INFO L78 Accepts]: Start accepts. Automaton has 9008 states and 9268 transitions. Word has length 691 [2019-12-07 17:45:34,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:45:34,693 INFO L462 AbstractCegarLoop]: Abstraction has 9008 states and 9268 transitions. [2019-12-07 17:45:34,693 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:45:34,693 INFO L276 IsEmpty]: Start isEmpty. Operand 9008 states and 9268 transitions. [2019-12-07 17:45:34,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 847 [2019-12-07 17:45:34,703 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:45:34,704 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:45:34,704 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:45:34,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:45:34,704 INFO L82 PathProgramCache]: Analyzing trace with hash 1105372660, now seen corresponding path program 1 times [2019-12-07 17:45:34,704 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:45:34,704 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756755963] [2019-12-07 17:45:34,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:45:34,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:45:35,138 INFO L134 CoverageAnalysis]: Checked inductivity of 1114 backedges. 592 proven. 0 refuted. 0 times theorem prover too weak. 522 trivial. 0 not checked. [2019-12-07 17:45:35,138 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756755963] [2019-12-07 17:45:35,138 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:45:35,138 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:45:35,138 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286839716] [2019-12-07 17:45:35,139 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:45:35,139 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:45:35,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:45:35,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:45:35,139 INFO L87 Difference]: Start difference. First operand 9008 states and 9268 transitions. Second operand 3 states. [2019-12-07 17:45:35,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:45:35,823 INFO L93 Difference]: Finished difference Result 18609 states and 19174 transitions. [2019-12-07 17:45:35,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:45:35,823 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 846 [2019-12-07 17:45:35,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:45:35,829 INFO L225 Difference]: With dead ends: 18609 [2019-12-07 17:45:35,829 INFO L226 Difference]: Without dead ends: 9902 [2019-12-07 17:45:35,833 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:45:35,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9902 states. [2019-12-07 17:45:35,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9902 to 9005. [2019-12-07 17:45:35,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9005 states. [2019-12-07 17:45:35,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9005 states to 9005 states and 9244 transitions. [2019-12-07 17:45:35,893 INFO L78 Accepts]: Start accepts. Automaton has 9005 states and 9244 transitions. Word has length 846 [2019-12-07 17:45:35,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:45:35,893 INFO L462 AbstractCegarLoop]: Abstraction has 9005 states and 9244 transitions. [2019-12-07 17:45:35,893 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:45:35,893 INFO L276 IsEmpty]: Start isEmpty. Operand 9005 states and 9244 transitions. [2019-12-07 17:45:35,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 868 [2019-12-07 17:45:35,904 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:45:35,904 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:45:35,904 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:45:35,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:45:35,905 INFO L82 PathProgramCache]: Analyzing trace with hash -1187839850, now seen corresponding path program 1 times [2019-12-07 17:45:35,905 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:45:35,905 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118617294] [2019-12-07 17:45:35,905 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:45:35,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:45:38,124 INFO L134 CoverageAnalysis]: Checked inductivity of 1130 backedges. 520 proven. 504 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-12-07 17:45:38,124 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118617294] [2019-12-07 17:45:38,124 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1105074830] [2019-12-07 17:45:38,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_665bf698-fca2-4fdd-9d89-75e437c35320/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-12-07 17:45:38,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:45:38,273 INFO L264 TraceCheckSpWp]: Trace formula consists of 993 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 17:45:38,278 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:45:38,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:45:38,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:45:38,805 INFO L134 CoverageAnalysis]: Checked inductivity of 1130 backedges. 235 proven. 0 refuted. 0 times theorem prover too weak. 895 trivial. 0 not checked. [2019-12-07 17:45:38,806 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 17:45:38,806 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 11 [2019-12-07 17:45:38,806 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967223057] [2019-12-07 17:45:38,807 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:45:38,807 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:45:38,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:45:38,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-12-07 17:45:38,807 INFO L87 Difference]: Start difference. First operand 9005 states and 9244 transitions. Second operand 3 states. [2019-12-07 17:45:39,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:45:39,922 INFO L93 Difference]: Finished difference Result 20711 states and 21268 transitions. [2019-12-07 17:45:39,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:45:39,922 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 867 [2019-12-07 17:45:39,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:45:39,928 INFO L225 Difference]: With dead ends: 20711 [2019-12-07 17:45:39,928 INFO L226 Difference]: Without dead ends: 12007 [2019-12-07 17:45:39,932 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 876 GetRequests, 866 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-12-07 17:45:39,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12007 states. [2019-12-07 17:45:39,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12007 to 10805. [2019-12-07 17:45:39,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10805 states. [2019-12-07 17:45:40,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10805 states to 10805 states and 11090 transitions. [2019-12-07 17:45:40,005 INFO L78 Accepts]: Start accepts. Automaton has 10805 states and 11090 transitions. Word has length 867 [2019-12-07 17:45:40,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:45:40,005 INFO L462 AbstractCegarLoop]: Abstraction has 10805 states and 11090 transitions. [2019-12-07 17:45:40,005 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:45:40,005 INFO L276 IsEmpty]: Start isEmpty. Operand 10805 states and 11090 transitions. [2019-12-07 17:45:40,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 901 [2019-12-07 17:45:40,017 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:45:40,017 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:45:40,218 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:45:40,219 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:45:40,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:45:40,220 INFO L82 PathProgramCache]: Analyzing trace with hash -568589825, now seen corresponding path program 1 times [2019-12-07 17:45:40,221 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:45:40,221 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103962384] [2019-12-07 17:45:40,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:45:40,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:45:42,586 INFO L134 CoverageAnalysis]: Checked inductivity of 1501 backedges. 676 proven. 641 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2019-12-07 17:45:42,586 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103962384] [2019-12-07 17:45:42,586 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [289170460] [2019-12-07 17:45:42,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_665bf698-fca2-4fdd-9d89-75e437c35320/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-12-07 17:45:42,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:45:42,758 INFO L264 TraceCheckSpWp]: Trace formula consists of 1049 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 17:45:42,764 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:45:42,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:45:42,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:45:42,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:45:42,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:45:42,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:45:42,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:45:42,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:45:42,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:45:42,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:45:42,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:45:42,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:45:42,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:45:42,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:45:42,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:45:42,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:45:42,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:45:42,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:45:42,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:45:42,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:45:42,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:45:42,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:45:42,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:45:42,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:45:42,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:45:42,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:45:42,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:45:42,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:45:42,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:45:42,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:45:42,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:45:42,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:45:43,266 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 25 [2019-12-07 17:45:45,447 INFO L134 CoverageAnalysis]: Checked inductivity of 1501 backedges. 988 proven. 325 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2019-12-07 17:45:45,448 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:45:45,448 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 6] total 19 [2019-12-07 17:45:45,448 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129464004] [2019-12-07 17:45:45,449 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-07 17:45:45,449 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:45:45,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-07 17:45:45,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2019-12-07 17:45:45,450 INFO L87 Difference]: Start difference. First operand 10805 states and 11090 transitions. Second operand 19 states. [2019-12-07 17:47:10,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:47:10,255 INFO L93 Difference]: Finished difference Result 37619 states and 38578 transitions. [2019-12-07 17:47:10,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-12-07 17:47:10,256 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 900 [2019-12-07 17:47:10,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:47:10,272 INFO L225 Difference]: With dead ends: 37619 [2019-12-07 17:47:10,273 INFO L226 Difference]: Without dead ends: 27115 [2019-12-07 17:47:10,281 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1036 GetRequests, 952 SyntacticMatches, 2 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2209 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1200, Invalid=5772, Unknown=0, NotChecked=0, Total=6972 [2019-12-07 17:47:10,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27115 states. [2019-12-07 17:47:10,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27115 to 17375. [2019-12-07 17:47:10,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17375 states. [2019-12-07 17:47:10,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17375 states to 17375 states and 17790 transitions. [2019-12-07 17:47:10,448 INFO L78 Accepts]: Start accepts. Automaton has 17375 states and 17790 transitions. Word has length 900 [2019-12-07 17:47:10,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:47:10,448 INFO L462 AbstractCegarLoop]: Abstraction has 17375 states and 17790 transitions. [2019-12-07 17:47:10,448 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-07 17:47:10,449 INFO L276 IsEmpty]: Start isEmpty. Operand 17375 states and 17790 transitions. [2019-12-07 17:47:10,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 917 [2019-12-07 17:47:10,462 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:47:10,463 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:47:10,663 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:47:10,663 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:47:10,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:47:10,664 INFO L82 PathProgramCache]: Analyzing trace with hash -1312472755, now seen corresponding path program 1 times [2019-12-07 17:47:10,664 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:47:10,664 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192221788] [2019-12-07 17:47:10,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:47:10,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:47:11,370 INFO L134 CoverageAnalysis]: Checked inductivity of 1207 backedges. 724 proven. 0 refuted. 0 times theorem prover too weak. 483 trivial. 0 not checked. [2019-12-07 17:47:11,371 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192221788] [2019-12-07 17:47:11,371 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:47:11,371 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 17:47:11,371 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444512905] [2019-12-07 17:47:11,372 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:47:11,372 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:47:11,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:47:11,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:47:11,372 INFO L87 Difference]: Start difference. First operand 17375 states and 17790 transitions. Second operand 5 states. [2019-12-07 17:47:12,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:47:12,753 INFO L93 Difference]: Finished difference Result 23569 states and 24135 transitions. [2019-12-07 17:47:12,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:47:12,754 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 916 [2019-12-07 17:47:12,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:47:12,767 INFO L225 Difference]: With dead ends: 23569 [2019-12-07 17:47:12,767 INFO L226 Difference]: Without dead ends: 23567 [2019-12-07 17:47:12,771 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:47:12,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23567 states. [2019-12-07 17:47:12,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23567 to 17076. [2019-12-07 17:47:12,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17076 states. [2019-12-07 17:47:12,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17076 states to 17076 states and 17473 transitions. [2019-12-07 17:47:12,921 INFO L78 Accepts]: Start accepts. Automaton has 17076 states and 17473 transitions. Word has length 916 [2019-12-07 17:47:12,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:47:12,921 INFO L462 AbstractCegarLoop]: Abstraction has 17076 states and 17473 transitions. [2019-12-07 17:47:12,921 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:47:12,921 INFO L276 IsEmpty]: Start isEmpty. Operand 17076 states and 17473 transitions. [2019-12-07 17:47:12,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 925 [2019-12-07 17:47:12,931 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:47:12,932 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 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] [2019-12-07 17:47:12,932 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:47:12,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:47:12,933 INFO L82 PathProgramCache]: Analyzing trace with hash -1065104549, now seen corresponding path program 1 times [2019-12-07 17:47:12,933 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:47:12,933 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065090944] [2019-12-07 17:47:12,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:47:12,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:47:13,909 INFO L134 CoverageAnalysis]: Checked inductivity of 1588 backedges. 1147 proven. 0 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2019-12-07 17:47:13,909 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065090944] [2019-12-07 17:47:13,909 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:47:13,909 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 17:47:13,909 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079902124] [2019-12-07 17:47:13,910 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 17:47:13,910 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:47:13,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 17:47:13,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:47:13,910 INFO L87 Difference]: Start difference. First operand 17076 states and 17473 transitions. Second operand 7 states. [2019-12-07 17:47:15,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:47:15,330 INFO L93 Difference]: Finished difference Result 34282 states and 35078 transitions. [2019-12-07 17:47:15,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 17:47:15,331 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 924 [2019-12-07 17:47:15,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:47:15,342 INFO L225 Difference]: With dead ends: 34282 [2019-12-07 17:47:15,342 INFO L226 Difference]: Without dead ends: 17507 [2019-12-07 17:47:15,348 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-12-07 17:47:15,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17507 states. [2019-12-07 17:47:15,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17507 to 17076. [2019-12-07 17:47:15,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17076 states. [2019-12-07 17:47:15,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17076 states to 17076 states and 17473 transitions. [2019-12-07 17:47:15,486 INFO L78 Accepts]: Start accepts. Automaton has 17076 states and 17473 transitions. Word has length 924 [2019-12-07 17:47:15,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:47:15,486 INFO L462 AbstractCegarLoop]: Abstraction has 17076 states and 17473 transitions. [2019-12-07 17:47:15,486 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 17:47:15,486 INFO L276 IsEmpty]: Start isEmpty. Operand 17076 states and 17473 transitions. [2019-12-07 17:47:15,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 961 [2019-12-07 17:47:15,497 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:47:15,498 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 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] [2019-12-07 17:47:15,498 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:47:15,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:47:15,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1470343399, now seen corresponding path program 1 times [2019-12-07 17:47:15,498 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:47:15,498 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128646448] [2019-12-07 17:47:15,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:47:15,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:47:16,583 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 1011 proven. 629 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:47:16,584 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128646448] [2019-12-07 17:47:16,584 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2113569768] [2019-12-07 17:47:16,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_665bf698-fca2-4fdd-9d89-75e437c35320/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-12-07 17:47:16,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:47:16,766 INFO L264 TraceCheckSpWp]: Trace formula consists of 1114 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 17:47:16,771 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:47:16,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:47:16,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:47:16,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:47:16,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:47:16,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:47:16,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:47:16,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:47:18,474 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 890 proven. 0 refuted. 0 times theorem prover too weak. 750 trivial. 0 not checked. [2019-12-07 17:47:18,475 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 17:47:18,475 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 11 [2019-12-07 17:47:18,475 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077692510] [2019-12-07 17:47:18,476 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:47:18,476 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:47:18,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:47:18,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-12-07 17:47:18,477 INFO L87 Difference]: Start difference. First operand 17076 states and 17473 transitions. Second operand 4 states. [2019-12-07 17:47:21,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:47:21,137 INFO L93 Difference]: Finished difference Result 37788 states and 38663 transitions. [2019-12-07 17:47:21,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:47:21,138 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 960 [2019-12-07 17:47:21,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:47:21,151 INFO L225 Difference]: With dead ends: 37788 [2019-12-07 17:47:21,152 INFO L226 Difference]: Without dead ends: 20714 [2019-12-07 17:47:21,158 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 967 GetRequests, 958 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-12-07 17:47:21,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20714 states. [2019-12-07 17:47:21,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20714 to 15276. [2019-12-07 17:47:21,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15276 states. [2019-12-07 17:47:21,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15276 states to 15276 states and 15632 transitions. [2019-12-07 17:47:21,307 INFO L78 Accepts]: Start accepts. Automaton has 15276 states and 15632 transitions. Word has length 960 [2019-12-07 17:47:21,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:47:21,307 INFO L462 AbstractCegarLoop]: Abstraction has 15276 states and 15632 transitions. [2019-12-07 17:47:21,307 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:47:21,308 INFO L276 IsEmpty]: Start isEmpty. Operand 15276 states and 15632 transitions. [2019-12-07 17:47:21,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1072 [2019-12-07 17:47:21,321 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:47:21,321 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2019-12-07 17:47:21,522 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:47:21,523 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:47:21,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:47:21,524 INFO L82 PathProgramCache]: Analyzing trace with hash 19109534, now seen corresponding path program 1 times [2019-12-07 17:47:21,525 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:47:21,525 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708955912] [2019-12-07 17:47:21,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:47:21,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:47:22,250 INFO L134 CoverageAnalysis]: Checked inductivity of 2068 backedges. 954 proven. 0 refuted. 0 times theorem prover too weak. 1114 trivial. 0 not checked. [2019-12-07 17:47:22,250 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708955912] [2019-12-07 17:47:22,250 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:47:22,250 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:47:22,250 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546647769] [2019-12-07 17:47:22,251 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:47:22,251 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:47:22,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:47:22,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:47:22,251 INFO L87 Difference]: Start difference. First operand 15276 states and 15632 transitions. Second operand 3 states. [2019-12-07 17:47:22,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:47:22,972 INFO L93 Difference]: Finished difference Result 31150 states and 31857 transitions. [2019-12-07 17:47:22,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:47:22,972 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1071 [2019-12-07 17:47:22,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:47:22,983 INFO L225 Difference]: With dead ends: 31150 [2019-12-07 17:47:22,983 INFO L226 Difference]: Without dead ends: 16175 [2019-12-07 17:47:22,987 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:47:22,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16175 states. [2019-12-07 17:47:23,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16175 to 13270. [2019-12-07 17:47:23,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13270 states. [2019-12-07 17:47:23,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13270 states to 13270 states and 13548 transitions. [2019-12-07 17:47:23,107 INFO L78 Accepts]: Start accepts. Automaton has 13270 states and 13548 transitions. Word has length 1071 [2019-12-07 17:47:23,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:47:23,107 INFO L462 AbstractCegarLoop]: Abstraction has 13270 states and 13548 transitions. [2019-12-07 17:47:23,107 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:47:23,107 INFO L276 IsEmpty]: Start isEmpty. Operand 13270 states and 13548 transitions. [2019-12-07 17:47:23,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1086 [2019-12-07 17:47:23,119 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:47:23,120 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:47:23,120 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:47:23,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:47:23,121 INFO L82 PathProgramCache]: Analyzing trace with hash 1970281170, now seen corresponding path program 1 times [2019-12-07 17:47:23,121 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:47:23,121 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113312654] [2019-12-07 17:47:23,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:47:23,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:47:24,049 INFO L134 CoverageAnalysis]: Checked inductivity of 1929 backedges. 964 proven. 0 refuted. 0 times theorem prover too weak. 965 trivial. 0 not checked. [2019-12-07 17:47:24,049 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113312654] [2019-12-07 17:47:24,049 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:47:24,049 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 17:47:24,049 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445615640] [2019-12-07 17:47:24,050 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:47:24,050 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:47:24,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:47:24,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:47:24,050 INFO L87 Difference]: Start difference. First operand 13270 states and 13548 transitions. Second operand 5 states. [2019-12-07 17:47:25,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:47:25,554 INFO L93 Difference]: Finished difference Result 28939 states and 29532 transitions. [2019-12-07 17:47:25,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:47:25,555 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1085 [2019-12-07 17:47:25,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:47:25,556 INFO L225 Difference]: With dead ends: 28939 [2019-12-07 17:47:25,556 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 17:47:25,562 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:47:25,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 17:47:25,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 17:47:25,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 17:47:25,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 17:47:25,562 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1085 [2019-12-07 17:47:25,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:47:25,563 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 17:47:25,563 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:47:25,563 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 17:47:25,563 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 17:47:25,565 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 17:47:26,379 WARN L192 SmtUtils]: Spent 810.00 ms on a formula simplification. DAG size of input: 738 DAG size of output: 506 [2019-12-07 17:47:27,097 WARN L192 SmtUtils]: Spent 715.00 ms on a formula simplification. DAG size of input: 738 DAG size of output: 506 [2019-12-07 17:47:27,337 WARN L192 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 482 DAG size of output: 333 [2019-12-07 17:47:30,890 WARN L192 SmtUtils]: Spent 3.55 s on a formula simplification. DAG size of input: 467 DAG size of output: 132 [2019-12-07 17:47:34,041 WARN L192 SmtUtils]: Spent 3.15 s on a formula simplification. DAG size of input: 467 DAG size of output: 132 [2019-12-07 17:47:35,811 WARN L192 SmtUtils]: Spent 1.77 s on a formula simplification. DAG size of input: 305 DAG size of output: 126 [2019-12-07 17:47:35,814 INFO L246 CegarLoopResult]: For program point L234(lines 234 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,814 INFO L246 CegarLoopResult]: For program point L102-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 17:47:35,814 INFO L246 CegarLoopResult]: For program point L895(lines 895 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,814 INFO L246 CegarLoopResult]: For program point L367(lines 367 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,814 INFO L246 CegarLoopResult]: For program point L103(line 103) no Hoare annotation was computed. [2019-12-07 17:47:35,814 INFO L246 CegarLoopResult]: For program point L1162(lines 1162 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,815 INFO L246 CegarLoopResult]: For program point L105-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 17:47:35,815 INFO L246 CegarLoopResult]: For program point L1030(lines 1030 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,815 INFO L246 CegarLoopResult]: For program point L634(lines 634 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,815 INFO L246 CegarLoopResult]: For program point L1559(lines 1559 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,815 INFO L246 CegarLoopResult]: For program point L502(lines 502 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,815 INFO L246 CegarLoopResult]: For program point L106(line 106) no Hoare annotation was computed. [2019-12-07 17:47:35,815 INFO L246 CegarLoopResult]: For program point L768(lines 768 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,815 INFO L246 CegarLoopResult]: For program point L108-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 17:47:35,815 INFO L246 CegarLoopResult]: For program point L901(lines 901 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,815 INFO L246 CegarLoopResult]: For program point L1694(lines 1694 1756) no Hoare annotation was computed. [2019-12-07 17:47:35,815 INFO L246 CegarLoopResult]: For program point L373(lines 373 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,815 INFO L246 CegarLoopResult]: For program point L241(lines 241 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,815 INFO L246 CegarLoopResult]: For program point L109(line 109) no Hoare annotation was computed. [2019-12-07 17:47:35,815 INFO L246 CegarLoopResult]: For program point L1431(lines 1431 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,815 INFO L246 CegarLoopResult]: For program point L1035(lines 1035 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,815 INFO L246 CegarLoopResult]: For program point L507(lines 507 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,815 INFO L246 CegarLoopResult]: For program point L1300(lines 1300 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,815 INFO L246 CegarLoopResult]: For program point L1168(lines 1168 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,815 INFO L246 CegarLoopResult]: For program point L111-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 17:47:35,815 INFO L246 CegarLoopResult]: For program point L112(line 112) no Hoare annotation was computed. [2019-12-07 17:47:35,816 INFO L246 CegarLoopResult]: For program point L641(lines 641 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,816 INFO L246 CegarLoopResult]: For program point L1566(lines 1566 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,816 INFO L246 CegarLoopResult]: For program point L1038(lines 1038 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,816 INFO L246 CegarLoopResult]: For program point L774(lines 774 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,816 INFO L246 CegarLoopResult]: For program point L642(lines 642 651) no Hoare annotation was computed. [2019-12-07 17:47:35,816 INFO L246 CegarLoopResult]: For program point L642-2(lines 642 651) no Hoare annotation was computed. [2019-12-07 17:47:35,816 INFO L246 CegarLoopResult]: For program point L114-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 17:47:35,816 INFO L246 CegarLoopResult]: For program point L907(lines 907 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,816 INFO L246 CegarLoopResult]: For program point L247(lines 247 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,816 INFO L246 CegarLoopResult]: For program point L1172(lines 1172 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,816 INFO L246 CegarLoopResult]: For program point L115(line 115) no Hoare annotation was computed. [2019-12-07 17:47:35,816 INFO L246 CegarLoopResult]: For program point L1701(lines 1701 1756) no Hoare annotation was computed. [2019-12-07 17:47:35,816 INFO L246 CegarLoopResult]: For program point L380(lines 380 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,816 INFO L246 CegarLoopResult]: For program point L1570(lines 1570 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,816 INFO L246 CegarLoopResult]: For program point L1438(lines 1438 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,816 INFO L246 CegarLoopResult]: For program point L1306(lines 1306 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,816 INFO L246 CegarLoopResult]: For program point L117-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 17:47:35,816 INFO L246 CegarLoopResult]: For program point L1571(lines 1571 1581) no Hoare annotation was computed. [2019-12-07 17:47:35,816 INFO L246 CegarLoopResult]: For program point L514(lines 514 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,816 INFO L246 CegarLoopResult]: For program point L1571-2(lines 1571 1581) no Hoare annotation was computed. [2019-12-07 17:47:35,816 INFO L246 CegarLoopResult]: For program point L1439(lines 1439 1448) no Hoare annotation was computed. [2019-12-07 17:47:35,817 INFO L246 CegarLoopResult]: For program point L1439-2(lines 1439 1448) no Hoare annotation was computed. [2019-12-07 17:47:35,817 INFO L246 CegarLoopResult]: For program point L118(line 118) no Hoare annotation was computed. [2019-12-07 17:47:35,817 INFO L246 CegarLoopResult]: For program point L779(lines 779 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,817 INFO L246 CegarLoopResult]: For program point L1044(lines 1044 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,817 INFO L246 CegarLoopResult]: For program point L912(lines 912 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,817 INFO L246 CegarLoopResult]: For program point L384(lines 384 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,817 INFO L246 CegarLoopResult]: For program point L120-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 17:47:35,817 INFO L246 CegarLoopResult]: For program point L1706(lines 1706 1756) no Hoare annotation was computed. [2019-12-07 17:47:35,817 INFO L246 CegarLoopResult]: For program point L253(lines 253 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,817 INFO L246 CegarLoopResult]: For program point L1178(lines 1178 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,817 INFO L246 CegarLoopResult]: For program point L121(line 121) no Hoare annotation was computed. [2019-12-07 17:47:35,817 INFO L246 CegarLoopResult]: For program point L123-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 17:47:35,817 INFO L246 CegarLoopResult]: For program point L1709(lines 1709 1756) no Hoare annotation was computed. [2019-12-07 17:47:35,817 INFO L246 CegarLoopResult]: For program point L652(lines 652 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,817 INFO L246 CegarLoopResult]: For program point L520(lines 520 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,817 INFO L246 CegarLoopResult]: For program point L1313(lines 1313 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,817 INFO L246 CegarLoopResult]: For program point L124(line 124) no Hoare annotation was computed. [2019-12-07 17:47:35,817 INFO L246 CegarLoopResult]: For program point L1049(lines 1049 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,817 INFO L246 CegarLoopResult]: For program point L1710(lines 1710 1721) no Hoare annotation was computed. [2019-12-07 17:47:35,817 INFO L246 CegarLoopResult]: For program point L1710-2(lines 1710 1721) no Hoare annotation was computed. [2019-12-07 17:47:35,817 INFO L246 CegarLoopResult]: For program point L521(lines 521 528) no Hoare annotation was computed. [2019-12-07 17:47:35,818 INFO L246 CegarLoopResult]: For program point L521-2(lines 521 528) no Hoare annotation was computed. [2019-12-07 17:47:35,818 INFO L246 CegarLoopResult]: For program point L1050(lines 1050 1061) no Hoare annotation was computed. [2019-12-07 17:47:35,818 INFO L246 CegarLoopResult]: For program point L1050-2(lines 1050 1061) no Hoare annotation was computed. [2019-12-07 17:47:35,818 INFO L246 CegarLoopResult]: For program point L786(lines 786 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,818 INFO L246 CegarLoopResult]: For program point L390(lines 390 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,818 INFO L246 CegarLoopResult]: For program point L126-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 17:47:35,818 INFO L246 CegarLoopResult]: For program point L919(lines 919 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,818 INFO L246 CegarLoopResult]: For program point L391(lines 391 402) no Hoare annotation was computed. [2019-12-07 17:47:35,818 INFO L246 CegarLoopResult]: For program point L391-2(lines 391 402) no Hoare annotation was computed. [2019-12-07 17:47:35,818 INFO L246 CegarLoopResult]: For program point L1184(lines 1184 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,818 INFO L246 CegarLoopResult]: For program point L127(line 127) no Hoare annotation was computed. [2019-12-07 17:47:35,818 INFO L246 CegarLoopResult]: For program point L1449(lines 1449 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,818 INFO L246 CegarLoopResult]: For program point L1317(lines 1317 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,818 INFO L246 CegarLoopResult]: For program point L260(lines 260 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,818 INFO L246 CegarLoopResult]: For program point L657(lines 657 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,818 INFO L246 CegarLoopResult]: For program point L1582(lines 1582 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,818 INFO L246 CegarLoopResult]: For program point L129-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 17:47:35,818 INFO L246 CegarLoopResult]: For program point L130(line 130) no Hoare annotation was computed. [2019-12-07 17:47:35,818 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-12-07 17:47:35,818 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 190) no Hoare annotation was computed. [2019-12-07 17:47:35,819 INFO L246 CegarLoopResult]: For program point L1321(lines 1321 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,819 INFO L246 CegarLoopResult]: For program point L132-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 17:47:35,819 INFO L246 CegarLoopResult]: For program point L925(lines 925 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,819 INFO L246 CegarLoopResult]: For program point L793(lines 793 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,819 INFO L246 CegarLoopResult]: For program point L529(lines 529 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,819 INFO L246 CegarLoopResult]: For program point L1322(lines 1322 1332) no Hoare annotation was computed. [2019-12-07 17:47:35,819 INFO L246 CegarLoopResult]: For program point L1322-2(lines 1322 1332) no Hoare annotation was computed. [2019-12-07 17:47:35,819 INFO L246 CegarLoopResult]: For program point L1190(lines 1190 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,819 INFO L246 CegarLoopResult]: For program point L133(line 133) no Hoare annotation was computed. [2019-12-07 17:47:35,819 INFO L246 CegarLoopResult]: For program point L794(lines 794 803) no Hoare annotation was computed. [2019-12-07 17:47:35,819 INFO L246 CegarLoopResult]: For program point L794-2(lines 794 803) no Hoare annotation was computed. [2019-12-07 17:47:35,819 INFO L246 CegarLoopResult]: For program point L662(lines 662 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,819 INFO L246 CegarLoopResult]: For program point L530(lines 530 541) no Hoare annotation was computed. [2019-12-07 17:47:35,819 INFO L246 CegarLoopResult]: For program point L530-2(lines 530 541) no Hoare annotation was computed. [2019-12-07 17:47:35,819 INFO L246 CegarLoopResult]: For program point L266(lines 266 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,819 INFO L246 CegarLoopResult]: For program point L1456(lines 1456 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,819 INFO L246 CegarLoopResult]: For program point L135-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 17:47:35,819 INFO L246 CegarLoopResult]: For program point L1589(lines 1589 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,819 INFO L246 CegarLoopResult]: For program point L136(line 136) no Hoare annotation was computed. [2019-12-07 17:47:35,819 INFO L246 CegarLoopResult]: For program point L1722(lines 1722 1756) no Hoare annotation was computed. [2019-12-07 17:47:35,820 INFO L246 CegarLoopResult]: For program point L1062(lines 1062 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,820 INFO L246 CegarLoopResult]: For program point L930(lines 930 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,820 INFO L246 CegarLoopResult]: For program point L138-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 17:47:35,820 INFO L246 CegarLoopResult]: For program point L1063(lines 1063 1073) no Hoare annotation was computed. [2019-12-07 17:47:35,820 INFO L246 CegarLoopResult]: For program point L1063-2(lines 1063 1073) no Hoare annotation was computed. [2019-12-07 17:47:35,820 INFO L246 CegarLoopResult]: For program point L403(lines 403 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,820 INFO L246 CegarLoopResult]: For program point L139(line 139) no Hoare annotation was computed. [2019-12-07 17:47:35,820 INFO L246 CegarLoopResult]: For program point L668(lines 668 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,820 INFO L246 CegarLoopResult]: For program point L1461(lines 1461 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,820 INFO L246 CegarLoopResult]: For program point L1197(lines 1197 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,820 INFO L246 CegarLoopResult]: For program point L273(lines 273 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,820 INFO L246 CegarLoopResult]: For program point L141-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 17:47:35,820 INFO L246 CegarLoopResult]: For program point L1595(lines 1595 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,820 INFO L246 CegarLoopResult]: For program point L142(line 142) no Hoare annotation was computed. [2019-12-07 17:47:35,820 INFO L246 CegarLoopResult]: For program point L935(lines 935 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,820 INFO L246 CegarLoopResult]: For program point L804(lines 804 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,820 INFO L246 CegarLoopResult]: For program point L1729(lines 1729 1756) no Hoare annotation was computed. [2019-12-07 17:47:35,820 INFO L246 CegarLoopResult]: For program point L408(lines 408 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,820 INFO L246 CegarLoopResult]: For program point L1333(lines 1333 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,820 INFO L246 CegarLoopResult]: For program point L144-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 17:47:35,820 INFO L246 CegarLoopResult]: For program point L1466(lines 1466 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,821 INFO L246 CegarLoopResult]: For program point L145(line 145) no Hoare annotation was computed. [2019-12-07 17:47:35,821 INFO L246 CegarLoopResult]: For program point L542(lines 542 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,821 INFO L246 CegarLoopResult]: For program point L278(lines 278 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,821 INFO L246 CegarLoopResult]: For program point L1203(lines 1203 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,821 INFO L246 CegarLoopResult]: For program point L675(lines 675 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,821 INFO L246 CegarLoopResult]: For program point L147-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 17:47:35,821 INFO L246 CegarLoopResult]: For program point L148(line 148) no Hoare annotation was computed. [2019-12-07 17:47:35,821 INFO L246 CegarLoopResult]: For program point L1602(lines 1602 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,821 INFO L246 CegarLoopResult]: For program point L1338(lines 1338 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,821 INFO L246 CegarLoopResult]: For program point L1074(lines 1074 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,821 INFO L246 CegarLoopResult]: For program point L942(lines 942 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,821 INFO L246 CegarLoopResult]: For program point L1735(lines 1735 1756) no Hoare annotation was computed. [2019-12-07 17:47:35,821 INFO L246 CegarLoopResult]: For program point L546(lines 546 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,821 INFO L246 CegarLoopResult]: For program point L150-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 17:47:35,821 INFO L246 CegarLoopResult]: For program point L811(lines 811 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,821 INFO L246 CegarLoopResult]: For program point L547(lines 547 556) no Hoare annotation was computed. [2019-12-07 17:47:35,821 INFO L246 CegarLoopResult]: For program point L547-2(lines 547 556) no Hoare annotation was computed. [2019-12-07 17:47:35,821 INFO L246 CegarLoopResult]: For program point L415(lines 415 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,821 INFO L246 CegarLoopResult]: For program point L1208(lines 1208 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,821 INFO L246 CegarLoopResult]: For program point L151(line 151) no Hoare annotation was computed. [2019-12-07 17:47:35,821 INFO L246 CegarLoopResult]: For program point L1473(lines 1473 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,822 INFO L246 CegarLoopResult]: For program point L681(lines 681 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,822 INFO L246 CegarLoopResult]: For program point L1606(lines 1606 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,822 INFO L246 CegarLoopResult]: For program point L285(lines 285 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,822 INFO L246 CegarLoopResult]: For program point L153-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 17:47:35,822 INFO L246 CegarLoopResult]: For program point L154(line 154) no Hoare annotation was computed. [2019-12-07 17:47:35,822 INFO L246 CegarLoopResult]: For program point L1344(lines 1344 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,822 INFO L246 CegarLoopResult]: For program point L1212(lines 1212 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,822 INFO L246 CegarLoopResult]: For program point L948(lines 948 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,822 INFO L246 CegarLoopResult]: For program point L156-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 17:47:35,822 INFO L246 CegarLoopResult]: For program point L1081(lines 1081 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,822 INFO L246 CegarLoopResult]: For program point L24(lines 24 26) no Hoare annotation was computed. [2019-12-07 17:47:35,822 INFO L246 CegarLoopResult]: For program point L24-2(lines 23 1656) no Hoare annotation was computed. [2019-12-07 17:47:35,822 INFO L246 CegarLoopResult]: For program point L817(lines 817 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,822 INFO L246 CegarLoopResult]: For program point L1742(lines 1742 1756) no Hoare annotation was computed. [2019-12-07 17:47:35,822 INFO L246 CegarLoopResult]: For program point L1478(lines 1478 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,822 INFO L246 CegarLoopResult]: For program point L157(line 157) no Hoare annotation was computed. [2019-12-07 17:47:35,822 INFO L246 CegarLoopResult]: For program point L25(line 25) no Hoare annotation was computed. [2019-12-07 17:47:35,822 INFO L246 CegarLoopResult]: For program point L422(lines 422 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,822 INFO L246 CegarLoopResult]: For program point L687(lines 687 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,822 INFO L246 CegarLoopResult]: For program point L1612(lines 1612 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,822 INFO L246 CegarLoopResult]: For program point L159-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 17:47:35,823 INFO L246 CegarLoopResult]: For program point L27-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 17:47:35,823 INFO L246 CegarLoopResult]: For program point L1613(lines 1613 1622) no Hoare annotation was computed. [2019-12-07 17:47:35,823 INFO L246 CegarLoopResult]: For program point L1613-2(lines 1613 1622) no Hoare annotation was computed. [2019-12-07 17:47:35,823 INFO L246 CegarLoopResult]: For program point L292(lines 292 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,823 INFO L246 CegarLoopResult]: For program point L160(line 160) no Hoare annotation was computed. [2019-12-07 17:47:35,823 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-12-07 17:47:35,823 INFO L246 CegarLoopResult]: For program point L28(line 28) no Hoare annotation was computed. [2019-12-07 17:47:35,823 INFO L246 CegarLoopResult]: For program point L557(lines 557 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,823 INFO L246 CegarLoopResult]: For program point L1482(lines 1482 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,823 INFO L246 CegarLoopResult]: For program point L1350(lines 1350 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,823 INFO L246 CegarLoopResult]: For program point L1218(lines 1218 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,823 INFO L246 CegarLoopResult]: For program point L1086(lines 1086 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,823 INFO L246 CegarLoopResult]: For program point L558(lines 558 568) no Hoare annotation was computed. [2019-12-07 17:47:35,823 INFO L246 CegarLoopResult]: For program point L558-2(lines 558 568) no Hoare annotation was computed. [2019-12-07 17:47:35,823 INFO L246 CegarLoopResult]: For program point L1351(lines 1351 1358) no Hoare annotation was computed. [2019-12-07 17:47:35,823 INFO L246 CegarLoopResult]: For program point L1351-2(lines 1351 1358) no Hoare annotation was computed. [2019-12-07 17:47:35,823 INFO L246 CegarLoopResult]: For program point L162-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 17:47:35,823 INFO L246 CegarLoopResult]: For program point L30-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 17:47:35,823 INFO L246 CegarLoopResult]: For program point L955(lines 955 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,823 INFO L246 CegarLoopResult]: For program point L163(line 163) no Hoare annotation was computed. [2019-12-07 17:47:35,823 INFO L246 CegarLoopResult]: For program point L31(line 31) no Hoare annotation was computed. [2019-12-07 17:47:35,824 INFO L246 CegarLoopResult]: For program point L824(lines 824 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,824 INFO L246 CegarLoopResult]: For program point L1749(lines 1749 1756) no Hoare annotation was computed. [2019-12-07 17:47:35,824 INFO L246 CegarLoopResult]: For program point L428(lines 428 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,824 INFO L246 CegarLoopResult]: For program point L693(lines 693 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,824 INFO L246 CegarLoopResult]: For program point L165-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 17:47:35,824 INFO L246 CegarLoopResult]: For program point L33-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 17:47:35,824 INFO L246 CegarLoopResult]: For program point L694(lines 694 706) no Hoare annotation was computed. [2019-12-07 17:47:35,824 INFO L246 CegarLoopResult]: For program point L694-2(lines 694 706) no Hoare annotation was computed. [2019-12-07 17:47:35,824 INFO L246 CegarLoopResult]: For program point L166(line 166) no Hoare annotation was computed. [2019-12-07 17:47:35,824 INFO L246 CegarLoopResult]: For program point L1091(lines 1091 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,824 INFO L246 CegarLoopResult]: For program point L34(line 34) no Hoare annotation was computed. [2019-12-07 17:47:35,824 INFO L246 CegarLoopResult]: For program point L959(lines 959 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,824 INFO L246 CegarLoopResult]: For program point L1488(lines 1488 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,824 INFO L246 CegarLoopResult]: For program point L299(lines 299 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,824 INFO L246 CegarLoopResult]: For program point L1224(lines 1224 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,824 INFO L246 CegarLoopResult]: For program point L168-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 17:47:35,824 INFO L246 CegarLoopResult]: For program point L36-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 17:47:35,824 INFO L246 CegarLoopResult]: For program point L829(lines 829 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,824 INFO L246 CegarLoopResult]: For program point L433(lines 433 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,824 INFO L246 CegarLoopResult]: For program point L169(line 169) no Hoare annotation was computed. [2019-12-07 17:47:35,824 INFO L246 CegarLoopResult]: For program point L37(line 37) no Hoare annotation was computed. [2019-12-07 17:47:35,825 INFO L246 CegarLoopResult]: For program point L830(lines 830 839) no Hoare annotation was computed. [2019-12-07 17:47:35,825 INFO L246 CegarLoopResult]: For program point L830-2(lines 830 839) no Hoare annotation was computed. [2019-12-07 17:47:35,825 INFO L246 CegarLoopResult]: For program point L1623(lines 1623 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,825 INFO L246 CegarLoopResult]: For program point L1359(lines 1359 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,825 INFO L246 CegarLoopResult]: For program point L171-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 17:47:35,825 INFO L246 CegarLoopResult]: For program point L39-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 17:47:35,825 INFO L242 CegarLoopResult]: At program point L1757(lines 1658 1758) the Hoare annotation is: (let ((.cse28 (+ ~a4~0 86))) (let ((.cse22 (+ ~a0~0 147)) (.cse17 (= 4 ~a2~0)) (.cse24 (+ ~a0~0 98)) (.cse6 (<= .cse28 0)) (.cse19 (<= 0 (+ ~a0~0 44))) (.cse1 (= 1 ~a2~0)) (.cse26 (+ ~a29~0 144))) (let ((.cse2 (<= ~a29~0 43)) (.cse20 (< 0 .cse28)) (.cse21 (<= 0 .cse26)) (.cse11 (< 0 (+ ~a29~0 16))) (.cse7 (not .cse1)) (.cse15 (let ((.cse27 (not (= 5 ~a2~0)))) (or (and .cse6 .cse27) (and .cse27 .cse19)))) (.cse5 (< 0 .cse24)) (.cse4 (<= (+ ~a0~0 61) 0)) (.cse3 (< 0 .cse26)) (.cse8 (not .cse17)) (.cse18 (= 3 ~a2~0)) (.cse23 (<= (+ ~a0~0 99) 0)) (.cse0 (<= (+ ~a4~0 42) 0)) (.cse14 (<= .cse22 0)) (.cse9 (exists ((v_prenex_3 Int)) (let ((.cse25 (mod v_prenex_3 29))) (and (< .cse25 15) (<= (+ (div (+ .cse25 (- 15)) 5) 1) ~a29~0) (not (= .cse25 0)) (< v_prenex_3 0) (not (= (mod .cse25 5) 0)))))) (.cse10 (<= .cse24 0)) (.cse13 (= 2 ~a2~0)) (.cse12 (<= 0 (+ ~a0~0 600000))) (.cse16 (< 43 ~a29~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse7 .cse8 .cse9) (and .cse10 .cse0 .cse11 .cse12 .cse13) (and .cse6 .cse14) (and .cse15 .cse4 .cse16) (and .cse15 .cse13 .cse4) (and (not (= 5 ULTIMATE.start_calculate_output_~input)) .cse0 (<= (+ ~a29~0 17) 0) .cse14 .cse12 .cse17) (and .cse0 .cse15 .cse2 .cse18) (and .cse0 .cse15 .cse2 .cse17) (and (<= (+ ~a4~0 89) 0) .cse1 .cse2 .cse19 (<= 0 (+ ~a29~0 127))) (and .cse0 .cse11 .cse20 .cse1 .cse2 .cse12) (and .cse0 .cse15 .cse13 .cse21) (and .cse0 .cse10 (not .cse13) .cse20 .cse7 .cse12 .cse8 .cse21) (and .cse6 .cse11 .cse7 .cse5 .cse8) (and .cse6 (not (= 3 ULTIMATE.start_calculate_output_~input)) .cse0 .cse15 (not (= 4 ULTIMATE.start_calculate_output_~input)) .cse13) (and .cse6 .cse5 .cse4) (and .cse0 .cse14 .cse3 .cse12 .cse8) (and .cse10 .cse0 .cse1 (< 0 .cse22)) (and .cse0 .cse23 .cse18) (and .cse0 .cse23 .cse12 .cse16) (and .cse0 .cse14 .cse13 .cse12) (and .cse0 .cse14 .cse12 .cse17 .cse9) (and .cse10 .cse13 .cse12 .cse16))))) [2019-12-07 17:47:35,825 INFO L246 CegarLoopResult]: For program point L172(line 172) no Hoare annotation was computed. [2019-12-07 17:47:35,825 INFO L246 CegarLoopResult]: For program point L40(line 40) no Hoare annotation was computed. [2019-12-07 17:47:35,825 INFO L246 CegarLoopResult]: For program point L569(lines 569 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,825 INFO L246 CegarLoopResult]: For program point L1494(lines 1494 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,825 INFO L246 CegarLoopResult]: For program point L1098(lines 1098 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,826 INFO L246 CegarLoopResult]: For program point L966(lines 966 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,826 INFO L246 CegarLoopResult]: For program point L306(lines 306 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,826 INFO L246 CegarLoopResult]: For program point L1231(lines 1231 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,826 INFO L246 CegarLoopResult]: For program point L174-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 17:47:35,826 INFO L246 CegarLoopResult]: For program point L1099(lines 1099 1107) no Hoare annotation was computed. [2019-12-07 17:47:35,826 INFO L246 CegarLoopResult]: For program point L42-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 17:47:35,826 INFO L246 CegarLoopResult]: For program point L1099-2(lines 1099 1107) no Hoare annotation was computed. [2019-12-07 17:47:35,826 INFO L249 CegarLoopResult]: At program point L1760(lines 1760 1776) the Hoare annotation is: true [2019-12-07 17:47:35,826 INFO L246 CegarLoopResult]: For program point L439(lines 439 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,826 INFO L246 CegarLoopResult]: For program point L307(lines 307 319) no Hoare annotation was computed. [2019-12-07 17:47:35,826 INFO L246 CegarLoopResult]: For program point L307-2(lines 307 319) no Hoare annotation was computed. [2019-12-07 17:47:35,826 INFO L246 CegarLoopResult]: For program point L175(line 175) no Hoare annotation was computed. [2019-12-07 17:47:35,826 INFO L246 CegarLoopResult]: For program point L43(line 43) no Hoare annotation was computed. [2019-12-07 17:47:35,826 INFO L246 CegarLoopResult]: For program point L1629(lines 1629 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,826 INFO L246 CegarLoopResult]: For program point L1365(lines 1365 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,826 INFO L246 CegarLoopResult]: For program point L177-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 17:47:35,826 INFO L246 CegarLoopResult]: For program point L45-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 17:47:35,826 INFO L246 CegarLoopResult]: For program point L574(lines 574 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,826 INFO L246 CegarLoopResult]: For program point L178(line 178) no Hoare annotation was computed. [2019-12-07 17:47:35,826 INFO L246 CegarLoopResult]: For program point L46(line 46) no Hoare annotation was computed. [2019-12-07 17:47:35,827 INFO L246 CegarLoopResult]: For program point L707(lines 707 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,827 INFO L246 CegarLoopResult]: For program point L575(lines 575 586) no Hoare annotation was computed. [2019-12-07 17:47:35,827 INFO L246 CegarLoopResult]: For program point L575-2(lines 575 586) no Hoare annotation was computed. [2019-12-07 17:47:35,827 INFO L246 CegarLoopResult]: For program point L840(lines 840 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,827 INFO L246 CegarLoopResult]: For program point L1501(lines 1501 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,827 INFO L246 CegarLoopResult]: For program point L1237(lines 1237 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,827 INFO L246 CegarLoopResult]: For program point L180-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 17:47:35,827 INFO L246 CegarLoopResult]: For program point L48-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 17:47:35,827 INFO L246 CegarLoopResult]: For program point L973(lines 973 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,827 INFO L242 CegarLoopResult]: At program point L1766-2(lines 1766 1775) the Hoare annotation is: (let ((.cse29 (+ ~a4~0 86))) (let ((.cse22 (+ ~a0~0 147)) (.cse26 (+ ~a0~0 98)) (.cse10 (<= .cse29 0)) (.cse21 (<= 0 (+ ~a0~0 44))) (.cse13 (= 4 ~a2~0)) (.cse1 (= 1 ~a2~0)) (.cse15 (+ ~a29~0 144))) (let ((.cse17 (< 0 .cse29)) (.cse18 (<= 0 .cse15)) (.cse7 (< 0 (+ ~a29~0 16))) (.cse19 (not .cse1)) (.cse20 (not .cse13)) (.cse12 (let ((.cse28 (not (= 5 ~a2~0)))) (or (and .cse10 .cse28) (and .cse28 .cse21)))) (.cse14 (or (and .cse1 .cse21) (and .cse10 .cse1))) (.cse2 (<= ~a29~0 43)) (.cse5 (< 0 .cse26)) (.cse4 (<= (+ ~a0~0 61) 0)) (.cse16 (= 3 ~a2~0)) (.cse24 (exists ((v_prenex_3 Int)) (let ((.cse27 (mod v_prenex_3 29))) (and (< .cse27 15) (<= (+ (div (+ .cse27 (- 15)) 5) 1) ~a29~0) (not (= .cse27 0)) (< v_prenex_3 0) (not (= (mod .cse27 5) 0)))))) (.cse23 (<= (+ ~a0~0 99) 0)) (.cse3 (< 0 .cse15)) (.cse0 (<= (+ ~a4~0 42) 0)) (.cse11 (<= .cse22 0)) (.cse6 (<= .cse26 0)) (.cse8 (= 2 ~a2~0)) (.cse9 (<= 0 (+ ~a0~0 600000))) (.cse25 (< 43 ~a29~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse0 .cse7 .cse8 .cse9) (and .cse10 .cse11) (and .cse12 .cse8 .cse4) (and (not (= 5 ULTIMATE.start_calculate_output_~input)) .cse0 (<= (+ ~a29~0 17) 0) .cse11 .cse9 .cse13) (and .cse10 .cse14 (<= .cse15 0)) (and .cse0 .cse12 .cse2 .cse16) (and .cse0 .cse12 .cse2 .cse13) (and .cse0 .cse7 .cse17 .cse1 .cse2 .cse9) (and .cse0 .cse12 .cse8 .cse18) (and .cse0 .cse6 (not .cse8) .cse17 .cse19 .cse9 .cse20 .cse18) (and .cse10 .cse7 .cse19 .cse5 .cse20) (and .cse10 (not (= 3 ULTIMATE.start_calculate_output_~input)) .cse0 .cse12 (not (= 4 ULTIMATE.start_calculate_output_~input)) .cse8) (and (<= (+ ~a4~0 89) 0) .cse14 .cse2 .cse21 (<= 0 (+ ~a29~0 127))) (and .cse10 .cse5 .cse4) (and .cse6 .cse0 .cse1 (< 0 .cse22)) (and .cse0 .cse23 .cse16) (and .cse10 .cse6 .cse24) (and .cse0 .cse23 .cse9 .cse25) (and .cse0 .cse11 .cse9 .cse13 .cse24) (and .cse0 .cse1 .cse23 .cse3 .cse9) (and .cse0 .cse11 .cse8 .cse9) (and .cse6 .cse8 .cse9 .cse25))))) [2019-12-07 17:47:35,827 INFO L246 CegarLoopResult]: For program point L445(lines 445 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,827 INFO L246 CegarLoopResult]: For program point L181(line 181) no Hoare annotation was computed. [2019-12-07 17:47:35,827 INFO L246 CegarLoopResult]: For program point L49(line 49) no Hoare annotation was computed. [2019-12-07 17:47:35,827 INFO L246 CegarLoopResult]: For program point L1635(lines 1635 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,828 INFO L246 CegarLoopResult]: For program point L1371(lines 1371 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,828 INFO L246 CegarLoopResult]: For program point L183-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 17:47:35,828 INFO L246 CegarLoopResult]: For program point L1108(lines 1108 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,828 INFO L246 CegarLoopResult]: For program point L51-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 17:47:35,828 INFO L246 CegarLoopResult]: For program point L712(lines 712 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,828 INFO L246 CegarLoopResult]: For program point L184(line 184) no Hoare annotation was computed. [2019-12-07 17:47:35,828 INFO L246 CegarLoopResult]: For program point L52(line 52) no Hoare annotation was computed. [2019-12-07 17:47:35,828 INFO L246 CegarLoopResult]: For program point L845(lines 845 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,828 INFO L246 CegarLoopResult]: For program point L449(lines 449 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,828 INFO L246 CegarLoopResult]: For program point L1771(line 1771) no Hoare annotation was computed. [2019-12-07 17:47:35,828 INFO L246 CegarLoopResult]: For program point L1243(lines 1243 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,828 INFO L246 CegarLoopResult]: For program point L186-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 17:47:35,828 INFO L246 CegarLoopResult]: For program point L54-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 17:47:35,828 INFO L246 CegarLoopResult]: For program point L979(lines 979 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,828 INFO L246 CegarLoopResult]: For program point L1640(lines 1640 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,828 INFO L246 CegarLoopResult]: For program point L1508(lines 1508 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,828 INFO L246 CegarLoopResult]: For program point L187(line 187) no Hoare annotation was computed. [2019-12-07 17:47:35,828 INFO L246 CegarLoopResult]: For program point L55(line 55) no Hoare annotation was computed. [2019-12-07 17:47:35,828 INFO L246 CegarLoopResult]: For program point L320(lines 320 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,828 INFO L246 CegarLoopResult]: For program point L1378(lines 1378 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,828 INFO L246 CegarLoopResult]: For program point L189-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 17:47:35,829 INFO L246 CegarLoopResult]: For program point L57-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 17:47:35,829 INFO L246 CegarLoopResult]: For program point L718(lines 718 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,829 INFO L246 CegarLoopResult]: For program point L1511(lines 1511 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,829 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 17:47:35,829 INFO L246 CegarLoopResult]: For program point L190(line 190) no Hoare annotation was computed. [2019-12-07 17:47:35,829 INFO L246 CegarLoopResult]: For program point L1115(lines 1115 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,829 INFO L246 CegarLoopResult]: For program point L58(line 58) no Hoare annotation was computed. [2019-12-07 17:47:35,829 INFO L246 CegarLoopResult]: For program point L851(lines 851 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,829 INFO L246 CegarLoopResult]: For program point L587(lines 587 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,829 INFO L246 CegarLoopResult]: For program point L456(lines 456 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,829 INFO L246 CegarLoopResult]: For program point L1249(lines 1249 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,829 INFO L246 CegarLoopResult]: For program point L192-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 17:47:35,829 INFO L246 CegarLoopResult]: For program point L60-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 17:47:35,829 INFO L246 CegarLoopResult]: For program point L985(lines 985 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,829 INFO L246 CegarLoopResult]: For program point L193(line 193) no Hoare annotation was computed. [2019-12-07 17:47:35,829 INFO L246 CegarLoopResult]: For program point L61(line 61) no Hoare annotation was computed. [2019-12-07 17:47:35,829 INFO L246 CegarLoopResult]: For program point L1647(lines 1647 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,829 INFO L246 CegarLoopResult]: For program point L855(lines 855 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,829 INFO L246 CegarLoopResult]: For program point L1516(lines 1516 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,829 INFO L246 CegarLoopResult]: For program point L327(lines 327 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,829 INFO L246 CegarLoopResult]: For program point L195-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 17:47:35,830 INFO L246 CegarLoopResult]: For program point L63-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 17:47:35,830 INFO L246 CegarLoopResult]: For program point L1385(lines 1385 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,830 INFO L246 CegarLoopResult]: For program point L196(line 196) no Hoare annotation was computed. [2019-12-07 17:47:35,830 INFO L246 CegarLoopResult]: For program point L64(line 64) no Hoare annotation was computed. [2019-12-07 17:47:35,830 INFO L246 CegarLoopResult]: For program point L725(lines 725 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,830 INFO L246 CegarLoopResult]: For program point L1122(lines 1122 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,830 INFO L246 CegarLoopResult]: For program point L594(lines 594 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,830 INFO L246 CegarLoopResult]: For program point L462(lines 462 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,830 INFO L246 CegarLoopResult]: For program point L1255(lines 1255 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,830 INFO L246 CegarLoopResult]: For program point L198-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 17:47:35,830 INFO L246 CegarLoopResult]: For program point L66-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 17:47:35,830 INFO L246 CegarLoopResult]: For program point L595(lines 595 605) no Hoare annotation was computed. [2019-12-07 17:47:35,830 INFO L246 CegarLoopResult]: For program point L595-2(lines 595 605) no Hoare annotation was computed. [2019-12-07 17:47:35,830 INFO L246 CegarLoopResult]: For program point L1388(lines 1388 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,830 INFO L246 CegarLoopResult]: For program point L199(line 199) no Hoare annotation was computed. [2019-12-07 17:47:35,830 INFO L246 CegarLoopResult]: For program point L67(line 67) no Hoare annotation was computed. [2019-12-07 17:47:35,830 INFO L246 CegarLoopResult]: For program point L992(lines 992 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,830 INFO L246 CegarLoopResult]: For program point L1522(lines 1522 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,830 INFO L246 CegarLoopResult]: For program point L333(lines 333 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,830 INFO L246 CegarLoopResult]: For program point L201-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 17:47:35,830 INFO L246 CegarLoopResult]: For program point L69-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 17:47:35,830 INFO L246 CegarLoopResult]: For program point L862(lines 862 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,831 INFO L242 CegarLoopResult]: At program point L1655(lines 23 1656) the Hoare annotation is: (let ((.cse29 (+ ~a4~0 86))) (let ((.cse22 (+ ~a0~0 147)) (.cse26 (+ ~a0~0 98)) (.cse10 (<= .cse29 0)) (.cse21 (<= 0 (+ ~a0~0 44))) (.cse13 (= 4 ~a2~0)) (.cse1 (= 1 ~a2~0)) (.cse15 (+ ~a29~0 144))) (let ((.cse17 (< 0 .cse29)) (.cse18 (<= 0 .cse15)) (.cse7 (< 0 (+ ~a29~0 16))) (.cse19 (not .cse1)) (.cse20 (not .cse13)) (.cse12 (let ((.cse28 (not (= 5 ~a2~0)))) (or (and .cse10 .cse28) (and .cse28 .cse21)))) (.cse14 (or (and .cse1 .cse21) (and .cse10 .cse1))) (.cse2 (<= ~a29~0 43)) (.cse5 (< 0 .cse26)) (.cse4 (<= (+ ~a0~0 61) 0)) (.cse16 (= 3 ~a2~0)) (.cse24 (exists ((v_prenex_3 Int)) (let ((.cse27 (mod v_prenex_3 29))) (and (< .cse27 15) (<= (+ (div (+ .cse27 (- 15)) 5) 1) ~a29~0) (not (= .cse27 0)) (< v_prenex_3 0) (not (= (mod .cse27 5) 0)))))) (.cse23 (<= (+ ~a0~0 99) 0)) (.cse3 (< 0 .cse15)) (.cse0 (<= (+ ~a4~0 42) 0)) (.cse11 (<= .cse22 0)) (.cse6 (<= .cse26 0)) (.cse8 (= 2 ~a2~0)) (.cse9 (<= 0 (+ ~a0~0 600000))) (.cse25 (< 43 ~a29~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse0 .cse7 .cse8 .cse9) (and .cse10 .cse11) (and .cse12 .cse8 .cse4) (and (not (= 5 ULTIMATE.start_calculate_output_~input)) .cse0 (<= (+ ~a29~0 17) 0) .cse11 .cse9 .cse13) (and .cse10 .cse14 (<= .cse15 0)) (and .cse0 .cse12 .cse2 .cse16) (and .cse0 .cse12 .cse2 .cse13) (and .cse0 .cse7 .cse17 .cse1 .cse2 .cse9) (and .cse0 .cse12 .cse8 .cse18) (and .cse0 .cse6 (not .cse8) .cse17 .cse19 .cse9 .cse20 .cse18) (and .cse10 .cse7 .cse19 .cse5 .cse20) (and .cse10 (not (= 3 ULTIMATE.start_calculate_output_~input)) .cse0 .cse12 (not (= 4 ULTIMATE.start_calculate_output_~input)) .cse8) (and (<= (+ ~a4~0 89) 0) .cse14 .cse2 .cse21 (<= 0 (+ ~a29~0 127))) (and .cse10 .cse5 .cse4) (and .cse6 .cse0 .cse1 (< 0 .cse22)) (and .cse0 .cse23 .cse16) (and .cse10 .cse6 .cse24) (and .cse0 .cse23 .cse9 .cse25) (and .cse0 .cse11 .cse9 .cse13 .cse24) (and .cse0 .cse1 .cse23 .cse3 .cse9) (and .cse0 .cse11 .cse8 .cse9) (and .cse6 .cse8 .cse9 .cse25))))) [2019-12-07 17:47:35,831 INFO L246 CegarLoopResult]: For program point L202(line 202) no Hoare annotation was computed. [2019-12-07 17:47:35,831 INFO L246 CegarLoopResult]: For program point L70(line 70) no Hoare annotation was computed. [2019-12-07 17:47:35,831 INFO L246 CegarLoopResult]: For program point L1128(lines 1128 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,831 INFO L246 CegarLoopResult]: For program point L732(lines 732 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,831 INFO L246 CegarLoopResult]: For program point L468(lines 468 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,831 INFO L246 CegarLoopResult]: For program point L336(lines 336 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,831 INFO L246 CegarLoopResult]: For program point L1261(lines 1261 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,831 INFO L246 CegarLoopResult]: For program point L204-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 17:47:35,831 INFO L246 CegarLoopResult]: For program point L72-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 17:47:35,831 INFO L246 CegarLoopResult]: For program point L1394(lines 1394 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,831 INFO L246 CegarLoopResult]: For program point L205(line 205) no Hoare annotation was computed. [2019-12-07 17:47:35,831 INFO L246 CegarLoopResult]: For program point L73(line 73) no Hoare annotation was computed. [2019-12-07 17:47:35,831 INFO L246 CegarLoopResult]: For program point L998(lines 998 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,831 INFO L246 CegarLoopResult]: For program point L1395(lines 1395 1407) no Hoare annotation was computed. [2019-12-07 17:47:35,832 INFO L246 CegarLoopResult]: For program point L1395-2(lines 1395 1407) no Hoare annotation was computed. [2019-12-07 17:47:35,832 INFO L246 CegarLoopResult]: For program point L735(lines 735 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,832 INFO L246 CegarLoopResult]: For program point L1528(lines 1528 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,832 INFO L246 CegarLoopResult]: For program point L1264(lines 1264 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,832 INFO L246 CegarLoopResult]: For program point L75-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 17:47:35,832 INFO L246 CegarLoopResult]: For program point L868(lines 868 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,832 INFO L246 CegarLoopResult]: For program point L1661(lines 1661 1756) no Hoare annotation was computed. [2019-12-07 17:47:35,832 INFO L246 CegarLoopResult]: For program point L76(line 76) no Hoare annotation was computed. [2019-12-07 17:47:35,832 INFO L246 CegarLoopResult]: For program point L341(lines 341 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,832 INFO L246 CegarLoopResult]: For program point L1134(lines 1134 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,832 INFO L246 CegarLoopResult]: For program point L606(lines 606 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,832 INFO L246 CegarLoopResult]: For program point L474(lines 474 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,832 INFO L246 CegarLoopResult]: For program point L342(lines 342 349) no Hoare annotation was computed. [2019-12-07 17:47:35,832 INFO L246 CegarLoopResult]: For program point L342-2(lines 342 349) no Hoare annotation was computed. [2019-12-07 17:47:35,832 INFO L246 CegarLoopResult]: For program point L1135(lines 1135 1144) no Hoare annotation was computed. [2019-12-07 17:47:35,832 INFO L246 CegarLoopResult]: For program point L78-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 17:47:35,832 INFO L246 CegarLoopResult]: For program point L1135-2(lines 1135 1144) no Hoare annotation was computed. [2019-12-07 17:47:35,832 INFO L246 CegarLoopResult]: For program point L79(line 79) no Hoare annotation was computed. [2019-12-07 17:47:35,832 INFO L246 CegarLoopResult]: For program point L1004(lines 1004 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,832 INFO L246 CegarLoopResult]: For program point L1533(lines 1533 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,832 INFO L246 CegarLoopResult]: For program point L81-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 17:47:35,832 INFO L246 CegarLoopResult]: For program point L874(lines 874 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,832 INFO L246 CegarLoopResult]: For program point L742(lines 742 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,833 INFO L246 CegarLoopResult]: For program point L1271(lines 1271 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,833 INFO L246 CegarLoopResult]: For program point L214(lines 214 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,833 INFO L246 CegarLoopResult]: For program point L82(line 82) no Hoare annotation was computed. [2019-12-07 17:47:35,833 INFO L246 CegarLoopResult]: For program point L1668(lines 1668 1756) no Hoare annotation was computed. [2019-12-07 17:47:35,833 INFO L246 CegarLoopResult]: For program point L479(lines 479 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,833 INFO L246 CegarLoopResult]: For program point L84-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 17:47:35,833 INFO L246 CegarLoopResult]: For program point L613(lines 613 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,833 INFO L246 CegarLoopResult]: For program point L85(line 85) no Hoare annotation was computed. [2019-12-07 17:47:35,833 INFO L246 CegarLoopResult]: For program point L350(lines 350 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,833 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 17:47:35,833 INFO L246 CegarLoopResult]: For program point L1011(lines 1011 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,833 INFO L246 CegarLoopResult]: For program point L1672(lines 1672 1756) no Hoare annotation was computed. [2019-12-07 17:47:35,833 INFO L246 CegarLoopResult]: For program point L1540(lines 1540 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,833 INFO L246 CegarLoopResult]: For program point L1408(lines 1408 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,833 INFO L246 CegarLoopResult]: For program point L219(lines 219 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,833 INFO L246 CegarLoopResult]: For program point L87-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 17:47:35,833 INFO L246 CegarLoopResult]: For program point L880(lines 880 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,833 INFO L246 CegarLoopResult]: For program point L748(lines 748 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,833 INFO L246 CegarLoopResult]: For program point L1277(lines 1277 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,833 INFO L246 CegarLoopResult]: For program point L220(lines 220 228) no Hoare annotation was computed. [2019-12-07 17:47:35,833 INFO L246 CegarLoopResult]: For program point L220-2(lines 220 228) no Hoare annotation was computed. [2019-12-07 17:47:35,833 INFO L246 CegarLoopResult]: For program point L1145(lines 1145 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,834 INFO L246 CegarLoopResult]: For program point L88(line 88) no Hoare annotation was computed. [2019-12-07 17:47:35,834 INFO L246 CegarLoopResult]: For program point L486(lines 486 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,834 INFO L246 CegarLoopResult]: For program point L90-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 17:47:35,834 INFO L246 CegarLoopResult]: For program point L355(lines 355 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,834 INFO L246 CegarLoopResult]: For program point L91(line 91) no Hoare annotation was computed. [2019-12-07 17:47:35,834 INFO L246 CegarLoopResult]: For program point L1016(lines 1016 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,834 INFO L246 CegarLoopResult]: For program point L620(lines 620 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,834 INFO L246 CegarLoopResult]: For program point L1413(lines 1413 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,834 INFO L246 CegarLoopResult]: For program point L885(lines 885 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,834 INFO L246 CegarLoopResult]: For program point L1678(lines 1678 1756) no Hoare annotation was computed. [2019-12-07 17:47:35,834 INFO L246 CegarLoopResult]: For program point L1150(lines 1150 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,834 INFO L246 CegarLoopResult]: For program point L93-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 17:47:35,834 INFO L246 CegarLoopResult]: For program point L886(lines 886 894) no Hoare annotation was computed. [2019-12-07 17:47:35,834 INFO L246 CegarLoopResult]: For program point L886-2(lines 886 894) no Hoare annotation was computed. [2019-12-07 17:47:35,834 INFO L246 CegarLoopResult]: For program point L754(lines 754 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,834 INFO L246 CegarLoopResult]: For program point L1547(lines 1547 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,834 INFO L246 CegarLoopResult]: For program point L1283(lines 1283 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,834 INFO L246 CegarLoopResult]: For program point L94(line 94) no Hoare annotation was computed. [2019-12-07 17:47:35,834 INFO L246 CegarLoopResult]: For program point L1019(lines 1019 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,834 INFO L246 CegarLoopResult]: For program point L491(lines 491 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,834 INFO L246 CegarLoopResult]: For program point L96-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 17:47:35,834 INFO L246 CegarLoopResult]: For program point L361(lines 361 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,835 INFO L246 CegarLoopResult]: For program point L229(lines 229 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,835 INFO L246 CegarLoopResult]: For program point L97(line 97) no Hoare annotation was computed. [2019-12-07 17:47:35,835 INFO L246 CegarLoopResult]: For program point L1419(lines 1419 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,835 INFO L246 CegarLoopResult]: For program point L627(lines 627 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,835 INFO L246 CegarLoopResult]: For program point L1420(lines 1420 1430) no Hoare annotation was computed. [2019-12-07 17:47:35,835 INFO L246 CegarLoopResult]: For program point L1420-2(lines 1420 1430) no Hoare annotation was computed. [2019-12-07 17:47:35,835 INFO L246 CegarLoopResult]: For program point L1156(lines 1156 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,835 INFO L246 CegarLoopResult]: For program point L99-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 17:47:35,835 INFO L246 CegarLoopResult]: For program point L1685(lines 1685 1756) no Hoare annotation was computed. [2019-12-07 17:47:35,835 INFO L246 CegarLoopResult]: For program point L1289(lines 1289 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,835 INFO L246 CegarLoopResult]: For program point L100(line 100) no Hoare annotation was computed. [2019-12-07 17:47:35,835 INFO L246 CegarLoopResult]: For program point L761(lines 761 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,835 INFO L246 CegarLoopResult]: For program point L1686(lines 1686 1693) no Hoare annotation was computed. [2019-12-07 17:47:35,835 INFO L246 CegarLoopResult]: For program point L1686-2(lines 1686 1693) no Hoare annotation was computed. [2019-12-07 17:47:35,835 INFO L246 CegarLoopResult]: For program point L1554(lines 1554 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,835 INFO L246 CegarLoopResult]: For program point L497(lines 497 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,835 INFO L246 CegarLoopResult]: For program point L1290(lines 1290 1299) no Hoare annotation was computed. [2019-12-07 17:47:35,835 INFO L246 CegarLoopResult]: For program point L1290-2(lines 1290 1299) no Hoare annotation was computed. [2019-12-07 17:47:35,835 INFO L246 CegarLoopResult]: For program point L1026(lines 1026 1654) no Hoare annotation was computed. [2019-12-07 17:47:35,844 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-12-07 17:47:35,844 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-12-07 17:47:35,844 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-12-07 17:47:35,844 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-12-07 17:47:35,845 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-12-07 17:47:35,845 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-12-07 17:47:35,845 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-12-07 17:47:35,845 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-12-07 17:47:35,845 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-12-07 17:47:35,845 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-12-07 17:47:35,855 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-12-07 17:47:35,856 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-12-07 17:47:35,856 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-12-07 17:47:35,856 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-12-07 17:47:35,856 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-12-07 17:47:35,856 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-12-07 17:47:35,856 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-12-07 17:47:35,856 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-12-07 17:47:35,856 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-12-07 17:47:35,857 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-12-07 17:47:35,862 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-12-07 17:47:35,862 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-12-07 17:47:35,862 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-12-07 17:47:35,862 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-12-07 17:47:35,862 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-12-07 17:47:35,862 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-12-07 17:47:35,863 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-12-07 17:47:35,863 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-12-07 17:47:35,863 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-12-07 17:47:35,863 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-12-07 17:47:35,865 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-12-07 17:47:35,866 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-12-07 17:47:35,866 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-12-07 17:47:35,866 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-12-07 17:47:35,866 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-12-07 17:47:35,866 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-12-07 17:47:35,866 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-12-07 17:47:35,866 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-12-07 17:47:35,866 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-12-07 17:47:35,866 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-12-07 17:47:35,869 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-12-07 17:47:35,869 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-12-07 17:47:35,869 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-12-07 17:47:35,869 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-12-07 17:47:35,869 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-12-07 17:47:35,870 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-12-07 17:47:35,870 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-12-07 17:47:35,870 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-12-07 17:47:35,870 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-12-07 17:47:35,870 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-12-07 17:47:35,872 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-12-07 17:47:35,872 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-12-07 17:47:35,872 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-12-07 17:47:35,872 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-12-07 17:47:35,873 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-12-07 17:47:35,873 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-12-07 17:47:35,873 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-12-07 17:47:35,873 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-12-07 17:47:35,873 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-12-07 17:47:35,874 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-12-07 17:47:35,876 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 05:47:35 BoogieIcfgContainer [2019-12-07 17:47:35,876 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 17:47:35,877 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 17:47:35,877 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 17:47:35,877 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 17:47:35,877 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:44:48" (3/4) ... [2019-12-07 17:47:35,880 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 17:47:35,905 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-12-07 17:47:35,908 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-12-07 17:47:35,928 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((a4 + 42 <= 0 && 1 == a2) && a29 <= 43) && 0 < a29 + 144) && a0 + 61 <= 0) && 0 < a0 + 98) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 < a29 + 16) && 2 == a2) && 0 <= a0 + 600000)) || (a4 + 86 <= 0 && a0 + 147 <= 0)) || ((((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44)) && 2 == a2) && a0 + 61 <= 0)) || (((((!(5 == input) && a4 + 42 <= 0) && a29 + 17 <= 0) && a0 + 147 <= 0) && 0 <= a0 + 600000) && 4 == a2)) || ((a4 + 86 <= 0 && ((1 == a2 && 0 <= a0 + 44) || (a4 + 86 <= 0 && 1 == a2))) && a29 + 144 <= 0)) || (((a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && a29 <= 43) && 3 == a2)) || (((a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && a29 <= 43) && 4 == a2)) || (((((a4 + 42 <= 0 && 0 < a29 + 16) && 0 < a4 + 86) && 1 == a2) && a29 <= 43) && 0 <= a0 + 600000)) || (((a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 2 == a2) && 0 <= a29 + 144)) || (((((((a4 + 42 <= 0 && a0 + 98 <= 0) && !(2 == a2)) && 0 < a4 + 86) && !(1 == a2)) && 0 <= a0 + 600000) && !(4 == a2)) && 0 <= a29 + 144)) || ((((a4 + 86 <= 0 && 0 < a29 + 16) && !(1 == a2)) && 0 < a0 + 98) && !(4 == a2))) || (((((a4 + 86 <= 0 && !(3 == input)) && a4 + 42 <= 0) && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && !(4 == input)) && 2 == a2)) || ((((a4 + 89 <= 0 && ((1 == a2 && 0 <= a0 + 44) || (a4 + 86 <= 0 && 1 == a2))) && a29 <= 43) && 0 <= a0 + 44) && 0 <= a29 + 127)) || ((a4 + 86 <= 0 && 0 < a0 + 98) && a0 + 61 <= 0)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && 1 == a2) && 0 < a0 + 147)) || ((a4 + 42 <= 0 && a0 + 99 <= 0) && 3 == a2)) || ((a4 + 86 <= 0 && a0 + 98 <= 0) && (\exists v_prenex_3 : int :: (((v_prenex_3 % 29 < 15 && (v_prenex_3 % 29 + -15) / 5 + 1 <= a29) && !(v_prenex_3 % 29 == 0)) && v_prenex_3 < 0) && !(v_prenex_3 % 29 % 5 == 0)))) || (((a4 + 42 <= 0 && a0 + 99 <= 0) && 0 <= a0 + 600000) && 43 < a29)) || ((((a4 + 42 <= 0 && a0 + 147 <= 0) && 0 <= a0 + 600000) && 4 == a2) && (\exists v_prenex_3 : int :: (((v_prenex_3 % 29 < 15 && (v_prenex_3 % 29 + -15) / 5 + 1 <= a29) && !(v_prenex_3 % 29 == 0)) && v_prenex_3 < 0) && !(v_prenex_3 % 29 % 5 == 0)))) || ((((a4 + 42 <= 0 && 1 == a2) && a0 + 99 <= 0) && 0 < a29 + 144) && 0 <= a0 + 600000)) || (((a4 + 42 <= 0 && a0 + 147 <= 0) && 2 == a2) && 0 <= a0 + 600000)) || (((a0 + 98 <= 0 && 2 == a2) && 0 <= a0 + 600000) && 43 < a29) [2019-12-07 17:47:35,931 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((a4 + 42 <= 0 && 1 == a2) && a29 <= 43) && 0 < a29 + 144) && a0 + 61 <= 0) && 0 < a0 + 98) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 < a29 + 16) && 2 == a2) && 0 <= a0 + 600000)) || (a4 + 86 <= 0 && a0 + 147 <= 0)) || ((((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44)) && 2 == a2) && a0 + 61 <= 0)) || (((((!(5 == input) && a4 + 42 <= 0) && a29 + 17 <= 0) && a0 + 147 <= 0) && 0 <= a0 + 600000) && 4 == a2)) || ((a4 + 86 <= 0 && ((1 == a2 && 0 <= a0 + 44) || (a4 + 86 <= 0 && 1 == a2))) && a29 + 144 <= 0)) || (((a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && a29 <= 43) && 3 == a2)) || (((a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && a29 <= 43) && 4 == a2)) || (((((a4 + 42 <= 0 && 0 < a29 + 16) && 0 < a4 + 86) && 1 == a2) && a29 <= 43) && 0 <= a0 + 600000)) || (((a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 2 == a2) && 0 <= a29 + 144)) || (((((((a4 + 42 <= 0 && a0 + 98 <= 0) && !(2 == a2)) && 0 < a4 + 86) && !(1 == a2)) && 0 <= a0 + 600000) && !(4 == a2)) && 0 <= a29 + 144)) || ((((a4 + 86 <= 0 && 0 < a29 + 16) && !(1 == a2)) && 0 < a0 + 98) && !(4 == a2))) || (((((a4 + 86 <= 0 && !(3 == input)) && a4 + 42 <= 0) && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && !(4 == input)) && 2 == a2)) || ((((a4 + 89 <= 0 && ((1 == a2 && 0 <= a0 + 44) || (a4 + 86 <= 0 && 1 == a2))) && a29 <= 43) && 0 <= a0 + 44) && 0 <= a29 + 127)) || ((a4 + 86 <= 0 && 0 < a0 + 98) && a0 + 61 <= 0)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && 1 == a2) && 0 < a0 + 147)) || ((a4 + 42 <= 0 && a0 + 99 <= 0) && 3 == a2)) || ((a4 + 86 <= 0 && a0 + 98 <= 0) && (\exists v_prenex_3 : int :: (((v_prenex_3 % 29 < 15 && (v_prenex_3 % 29 + -15) / 5 + 1 <= a29) && !(v_prenex_3 % 29 == 0)) && v_prenex_3 < 0) && !(v_prenex_3 % 29 % 5 == 0)))) || (((a4 + 42 <= 0 && a0 + 99 <= 0) && 0 <= a0 + 600000) && 43 < a29)) || ((((a4 + 42 <= 0 && a0 + 147 <= 0) && 0 <= a0 + 600000) && 4 == a2) && (\exists v_prenex_3 : int :: (((v_prenex_3 % 29 < 15 && (v_prenex_3 % 29 + -15) / 5 + 1 <= a29) && !(v_prenex_3 % 29 == 0)) && v_prenex_3 < 0) && !(v_prenex_3 % 29 % 5 == 0)))) || ((((a4 + 42 <= 0 && 1 == a2) && a0 + 99 <= 0) && 0 < a29 + 144) && 0 <= a0 + 600000)) || (((a4 + 42 <= 0 && a0 + 147 <= 0) && 2 == a2) && 0 <= a0 + 600000)) || (((a0 + 98 <= 0 && 2 == a2) && 0 <= a0 + 600000) && 43 < a29) [2019-12-07 17:47:35,938 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((a4 + 42 <= 0 && 1 == a2) && a29 <= 43) && 0 < a29 + 144) && a0 + 61 <= 0) && 0 < a0 + 98) || (((a4 + 86 <= 0 && !(1 == a2)) && !(4 == a2)) && (\exists v_prenex_3 : int :: (((v_prenex_3 % 29 < 15 && (v_prenex_3 % 29 + -15) / 5 + 1 <= a29) && !(v_prenex_3 % 29 == 0)) && v_prenex_3 < 0) && !(v_prenex_3 % 29 % 5 == 0)))) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 < a29 + 16) && 0 <= a0 + 600000) && 2 == a2)) || (a4 + 86 <= 0 && a0 + 147 <= 0)) || ((((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44)) && a0 + 61 <= 0) && 43 < a29)) || ((((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44)) && 2 == a2) && a0 + 61 <= 0)) || (((((!(5 == input) && a4 + 42 <= 0) && a29 + 17 <= 0) && a0 + 147 <= 0) && 0 <= a0 + 600000) && 4 == a2)) || (((a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && a29 <= 43) && 3 == a2)) || (((a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && a29 <= 43) && 4 == a2)) || ((((a4 + 89 <= 0 && 1 == a2) && a29 <= 43) && 0 <= a0 + 44) && 0 <= a29 + 127)) || (((((a4 + 42 <= 0 && 0 < a29 + 16) && 0 < a4 + 86) && 1 == a2) && a29 <= 43) && 0 <= a0 + 600000)) || (((a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 2 == a2) && 0 <= a29 + 144)) || (((((((a4 + 42 <= 0 && a0 + 98 <= 0) && !(2 == a2)) && 0 < a4 + 86) && !(1 == a2)) && 0 <= a0 + 600000) && !(4 == a2)) && 0 <= a29 + 144)) || ((((a4 + 86 <= 0 && 0 < a29 + 16) && !(1 == a2)) && 0 < a0 + 98) && !(4 == a2))) || (((((a4 + 86 <= 0 && !(3 == input)) && a4 + 42 <= 0) && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && !(4 == input)) && 2 == a2)) || ((a4 + 86 <= 0 && 0 < a0 + 98) && a0 + 61 <= 0)) || ((((a4 + 42 <= 0 && a0 + 147 <= 0) && 0 < a29 + 144) && 0 <= a0 + 600000) && !(4 == a2))) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && 1 == a2) && 0 < a0 + 147)) || ((a4 + 42 <= 0 && a0 + 99 <= 0) && 3 == a2)) || (((a4 + 42 <= 0 && a0 + 99 <= 0) && 0 <= a0 + 600000) && 43 < a29)) || (((a4 + 42 <= 0 && a0 + 147 <= 0) && 2 == a2) && 0 <= a0 + 600000)) || ((((a4 + 42 <= 0 && a0 + 147 <= 0) && 0 <= a0 + 600000) && 4 == a2) && (\exists v_prenex_3 : int :: (((v_prenex_3 % 29 < 15 && (v_prenex_3 % 29 + -15) / 5 + 1 <= a29) && !(v_prenex_3 % 29 == 0)) && v_prenex_3 < 0) && !(v_prenex_3 % 29 % 5 == 0)))) || (((a0 + 98 <= 0 && 2 == a2) && 0 <= a0 + 600000) && 43 < a29) [2019-12-07 17:47:36,080 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_665bf698-fca2-4fdd-9d89-75e437c35320/bin/uautomizer/witness.graphml [2019-12-07 17:47:36,080 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 17:47:36,080 INFO L168 Benchmark]: Toolchain (without parser) took 170683.18 ms. Allocated memory was 1.0 GB in the beginning and 2.3 GB in the end (delta: 1.3 GB). Free memory was 939.2 MB in the beginning and 2.0 GB in the end (delta: -1.1 GB). Peak memory consumption was 221.4 MB. Max. memory is 11.5 GB. [2019-12-07 17:47:36,081 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:47:36,081 INFO L168 Benchmark]: CACSL2BoogieTranslator took 673.86 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 69.7 MB). Free memory was 939.2 MB in the beginning and 986.6 MB in the end (delta: -47.4 MB). Peak memory consumption was 36.1 MB. Max. memory is 11.5 GB. [2019-12-07 17:47:36,081 INFO L168 Benchmark]: Boogie Procedure Inliner took 123.88 ms. Allocated memory is still 1.1 GB. Free memory was 986.6 MB in the beginning and 948.5 MB in the end (delta: 38.1 MB). Peak memory consumption was 38.1 MB. Max. memory is 11.5 GB. [2019-12-07 17:47:36,081 INFO L168 Benchmark]: Boogie Preprocessor took 137.34 ms. Allocated memory is still 1.1 GB. Free memory was 948.5 MB in the beginning and 925.9 MB in the end (delta: 22.5 MB). Peak memory consumption was 22.5 MB. Max. memory is 11.5 GB. [2019-12-07 17:47:36,081 INFO L168 Benchmark]: RCFGBuilder took 2299.33 ms. Allocated memory is still 1.1 GB. Free memory was 925.9 MB in the beginning and 865.1 MB in the end (delta: 60.9 MB). Peak memory consumption was 159.2 MB. Max. memory is 11.5 GB. [2019-12-07 17:47:36,082 INFO L168 Benchmark]: TraceAbstraction took 167242.64 ms. Allocated memory was 1.1 GB in the beginning and 2.3 GB in the end (delta: 1.2 GB). Free memory was 865.1 MB in the beginning and 2.1 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. [2019-12-07 17:47:36,082 INFO L168 Benchmark]: Witness Printer took 203.01 ms. Allocated memory is still 2.3 GB. Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 69.9 MB). Peak memory consumption was 69.9 MB. Max. memory is 11.5 GB. [2019-12-07 17:47:36,083 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 673.86 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 69.7 MB). Free memory was 939.2 MB in the beginning and 986.6 MB in the end (delta: -47.4 MB). Peak memory consumption was 36.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 123.88 ms. Allocated memory is still 1.1 GB. Free memory was 986.6 MB in the beginning and 948.5 MB in the end (delta: 38.1 MB). Peak memory consumption was 38.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 137.34 ms. Allocated memory is still 1.1 GB. Free memory was 948.5 MB in the beginning and 925.9 MB in the end (delta: 22.5 MB). Peak memory consumption was 22.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2299.33 ms. Allocated memory is still 1.1 GB. Free memory was 925.9 MB in the beginning and 865.1 MB in the end (delta: 60.9 MB). Peak memory consumption was 159.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 167242.64 ms. Allocated memory was 1.1 GB in the beginning and 2.3 GB in the end (delta: 1.2 GB). Free memory was 865.1 MB in the beginning and 2.1 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. * Witness Printer took 203.01 ms. Allocated memory is still 2.3 GB. Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 69.9 MB). Peak memory consumption was 69.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 190]: 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: 1766]: Loop Invariant [2019-12-07 17:47:36,087 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-12-07 17:47:36,087 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-12-07 17:47:36,087 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-12-07 17:47:36,087 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-12-07 17:47:36,087 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-12-07 17:47:36,087 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-12-07 17:47:36,087 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-12-07 17:47:36,087 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-12-07 17:47:36,088 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-12-07 17:47:36,088 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-12-07 17:47:36,089 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-12-07 17:47:36,089 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-12-07 17:47:36,089 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-12-07 17:47:36,089 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-12-07 17:47:36,090 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-12-07 17:47:36,090 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-12-07 17:47:36,090 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-12-07 17:47:36,090 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-12-07 17:47:36,090 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-12-07 17:47:36,090 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((((a4 + 42 <= 0 && 1 == a2) && a29 <= 43) && 0 < a29 + 144) && a0 + 61 <= 0) && 0 < a0 + 98) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 < a29 + 16) && 2 == a2) && 0 <= a0 + 600000)) || (a4 + 86 <= 0 && a0 + 147 <= 0)) || ((((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44)) && 2 == a2) && a0 + 61 <= 0)) || (((((!(5 == input) && a4 + 42 <= 0) && a29 + 17 <= 0) && a0 + 147 <= 0) && 0 <= a0 + 600000) && 4 == a2)) || ((a4 + 86 <= 0 && ((1 == a2 && 0 <= a0 + 44) || (a4 + 86 <= 0 && 1 == a2))) && a29 + 144 <= 0)) || (((a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && a29 <= 43) && 3 == a2)) || (((a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && a29 <= 43) && 4 == a2)) || (((((a4 + 42 <= 0 && 0 < a29 + 16) && 0 < a4 + 86) && 1 == a2) && a29 <= 43) && 0 <= a0 + 600000)) || (((a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 2 == a2) && 0 <= a29 + 144)) || (((((((a4 + 42 <= 0 && a0 + 98 <= 0) && !(2 == a2)) && 0 < a4 + 86) && !(1 == a2)) && 0 <= a0 + 600000) && !(4 == a2)) && 0 <= a29 + 144)) || ((((a4 + 86 <= 0 && 0 < a29 + 16) && !(1 == a2)) && 0 < a0 + 98) && !(4 == a2))) || (((((a4 + 86 <= 0 && !(3 == input)) && a4 + 42 <= 0) && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && !(4 == input)) && 2 == a2)) || ((((a4 + 89 <= 0 && ((1 == a2 && 0 <= a0 + 44) || (a4 + 86 <= 0 && 1 == a2))) && a29 <= 43) && 0 <= a0 + 44) && 0 <= a29 + 127)) || ((a4 + 86 <= 0 && 0 < a0 + 98) && a0 + 61 <= 0)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && 1 == a2) && 0 < a0 + 147)) || ((a4 + 42 <= 0 && a0 + 99 <= 0) && 3 == a2)) || ((a4 + 86 <= 0 && a0 + 98 <= 0) && (\exists v_prenex_3 : int :: (((v_prenex_3 % 29 < 15 && (v_prenex_3 % 29 + -15) / 5 + 1 <= a29) && !(v_prenex_3 % 29 == 0)) && v_prenex_3 < 0) && !(v_prenex_3 % 29 % 5 == 0)))) || (((a4 + 42 <= 0 && a0 + 99 <= 0) && 0 <= a0 + 600000) && 43 < a29)) || ((((a4 + 42 <= 0 && a0 + 147 <= 0) && 0 <= a0 + 600000) && 4 == a2) && (\exists v_prenex_3 : int :: (((v_prenex_3 % 29 < 15 && (v_prenex_3 % 29 + -15) / 5 + 1 <= a29) && !(v_prenex_3 % 29 == 0)) && v_prenex_3 < 0) && !(v_prenex_3 % 29 % 5 == 0)))) || ((((a4 + 42 <= 0 && 1 == a2) && a0 + 99 <= 0) && 0 < a29 + 144) && 0 <= a0 + 600000)) || (((a4 + 42 <= 0 && a0 + 147 <= 0) && 2 == a2) && 0 <= a0 + 600000)) || (((a0 + 98 <= 0 && 2 == a2) && 0 <= a0 + 600000) && 43 < a29) - InvariantResult [Line: 23]: Loop Invariant [2019-12-07 17:47:36,092 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-12-07 17:47:36,092 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-12-07 17:47:36,092 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-12-07 17:47:36,092 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-12-07 17:47:36,092 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-12-07 17:47:36,092 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-12-07 17:47:36,092 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-12-07 17:47:36,092 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-12-07 17:47:36,092 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-12-07 17:47:36,093 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-12-07 17:47:36,093 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-12-07 17:47:36,094 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-12-07 17:47:36,094 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-12-07 17:47:36,094 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-12-07 17:47:36,094 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-12-07 17:47:36,094 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-12-07 17:47:36,094 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-12-07 17:47:36,094 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-12-07 17:47:36,094 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-12-07 17:47:36,094 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((((a4 + 42 <= 0 && 1 == a2) && a29 <= 43) && 0 < a29 + 144) && a0 + 61 <= 0) && 0 < a0 + 98) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 < a29 + 16) && 2 == a2) && 0 <= a0 + 600000)) || (a4 + 86 <= 0 && a0 + 147 <= 0)) || ((((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44)) && 2 == a2) && a0 + 61 <= 0)) || (((((!(5 == input) && a4 + 42 <= 0) && a29 + 17 <= 0) && a0 + 147 <= 0) && 0 <= a0 + 600000) && 4 == a2)) || ((a4 + 86 <= 0 && ((1 == a2 && 0 <= a0 + 44) || (a4 + 86 <= 0 && 1 == a2))) && a29 + 144 <= 0)) || (((a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && a29 <= 43) && 3 == a2)) || (((a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && a29 <= 43) && 4 == a2)) || (((((a4 + 42 <= 0 && 0 < a29 + 16) && 0 < a4 + 86) && 1 == a2) && a29 <= 43) && 0 <= a0 + 600000)) || (((a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 2 == a2) && 0 <= a29 + 144)) || (((((((a4 + 42 <= 0 && a0 + 98 <= 0) && !(2 == a2)) && 0 < a4 + 86) && !(1 == a2)) && 0 <= a0 + 600000) && !(4 == a2)) && 0 <= a29 + 144)) || ((((a4 + 86 <= 0 && 0 < a29 + 16) && !(1 == a2)) && 0 < a0 + 98) && !(4 == a2))) || (((((a4 + 86 <= 0 && !(3 == input)) && a4 + 42 <= 0) && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && !(4 == input)) && 2 == a2)) || ((((a4 + 89 <= 0 && ((1 == a2 && 0 <= a0 + 44) || (a4 + 86 <= 0 && 1 == a2))) && a29 <= 43) && 0 <= a0 + 44) && 0 <= a29 + 127)) || ((a4 + 86 <= 0 && 0 < a0 + 98) && a0 + 61 <= 0)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && 1 == a2) && 0 < a0 + 147)) || ((a4 + 42 <= 0 && a0 + 99 <= 0) && 3 == a2)) || ((a4 + 86 <= 0 && a0 + 98 <= 0) && (\exists v_prenex_3 : int :: (((v_prenex_3 % 29 < 15 && (v_prenex_3 % 29 + -15) / 5 + 1 <= a29) && !(v_prenex_3 % 29 == 0)) && v_prenex_3 < 0) && !(v_prenex_3 % 29 % 5 == 0)))) || (((a4 + 42 <= 0 && a0 + 99 <= 0) && 0 <= a0 + 600000) && 43 < a29)) || ((((a4 + 42 <= 0 && a0 + 147 <= 0) && 0 <= a0 + 600000) && 4 == a2) && (\exists v_prenex_3 : int :: (((v_prenex_3 % 29 < 15 && (v_prenex_3 % 29 + -15) / 5 + 1 <= a29) && !(v_prenex_3 % 29 == 0)) && v_prenex_3 < 0) && !(v_prenex_3 % 29 % 5 == 0)))) || ((((a4 + 42 <= 0 && 1 == a2) && a0 + 99 <= 0) && 0 < a29 + 144) && 0 <= a0 + 600000)) || (((a4 + 42 <= 0 && a0 + 147 <= 0) && 2 == a2) && 0 <= a0 + 600000)) || (((a0 + 98 <= 0 && 2 == a2) && 0 <= a0 + 600000) && 43 < a29) - InvariantResult [Line: 1658]: Loop Invariant [2019-12-07 17:47:36,095 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-12-07 17:47:36,095 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-12-07 17:47:36,095 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-12-07 17:47:36,095 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-12-07 17:47:36,096 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-12-07 17:47:36,096 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-12-07 17:47:36,096 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-12-07 17:47:36,096 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-12-07 17:47:36,096 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-12-07 17:47:36,096 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-12-07 17:47:36,097 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-12-07 17:47:36,097 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-12-07 17:47:36,097 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-12-07 17:47:36,097 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-12-07 17:47:36,097 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-12-07 17:47:36,098 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-12-07 17:47:36,098 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-12-07 17:47:36,098 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-12-07 17:47:36,098 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-12-07 17:47:36,098 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((((a4 + 42 <= 0 && 1 == a2) && a29 <= 43) && 0 < a29 + 144) && a0 + 61 <= 0) && 0 < a0 + 98) || (((a4 + 86 <= 0 && !(1 == a2)) && !(4 == a2)) && (\exists v_prenex_3 : int :: (((v_prenex_3 % 29 < 15 && (v_prenex_3 % 29 + -15) / 5 + 1 <= a29) && !(v_prenex_3 % 29 == 0)) && v_prenex_3 < 0) && !(v_prenex_3 % 29 % 5 == 0)))) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 < a29 + 16) && 0 <= a0 + 600000) && 2 == a2)) || (a4 + 86 <= 0 && a0 + 147 <= 0)) || ((((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44)) && a0 + 61 <= 0) && 43 < a29)) || ((((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44)) && 2 == a2) && a0 + 61 <= 0)) || (((((!(5 == input) && a4 + 42 <= 0) && a29 + 17 <= 0) && a0 + 147 <= 0) && 0 <= a0 + 600000) && 4 == a2)) || (((a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && a29 <= 43) && 3 == a2)) || (((a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && a29 <= 43) && 4 == a2)) || ((((a4 + 89 <= 0 && 1 == a2) && a29 <= 43) && 0 <= a0 + 44) && 0 <= a29 + 127)) || (((((a4 + 42 <= 0 && 0 < a29 + 16) && 0 < a4 + 86) && 1 == a2) && a29 <= 43) && 0 <= a0 + 600000)) || (((a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 2 == a2) && 0 <= a29 + 144)) || (((((((a4 + 42 <= 0 && a0 + 98 <= 0) && !(2 == a2)) && 0 < a4 + 86) && !(1 == a2)) && 0 <= a0 + 600000) && !(4 == a2)) && 0 <= a29 + 144)) || ((((a4 + 86 <= 0 && 0 < a29 + 16) && !(1 == a2)) && 0 < a0 + 98) && !(4 == a2))) || (((((a4 + 86 <= 0 && !(3 == input)) && a4 + 42 <= 0) && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && !(4 == input)) && 2 == a2)) || ((a4 + 86 <= 0 && 0 < a0 + 98) && a0 + 61 <= 0)) || ((((a4 + 42 <= 0 && a0 + 147 <= 0) && 0 < a29 + 144) && 0 <= a0 + 600000) && !(4 == a2))) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && 1 == a2) && 0 < a0 + 147)) || ((a4 + 42 <= 0 && a0 + 99 <= 0) && 3 == a2)) || (((a4 + 42 <= 0 && a0 + 99 <= 0) && 0 <= a0 + 600000) && 43 < a29)) || (((a4 + 42 <= 0 && a0 + 147 <= 0) && 2 == a2) && 0 <= a0 + 600000)) || ((((a4 + 42 <= 0 && a0 + 147 <= 0) && 0 <= a0 + 600000) && 4 == a2) && (\exists v_prenex_3 : int :: (((v_prenex_3 % 29 < 15 && (v_prenex_3 % 29 + -15) / 5 + 1 <= a29) && !(v_prenex_3 % 29 == 0)) && v_prenex_3 < 0) && !(v_prenex_3 % 29 % 5 == 0)))) || (((a0 + 98 <= 0 && 2 == a2) && 0 <= a0 + 600000) && 43 < a29) - InvariantResult [Line: 1760]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 424 locations, 1 error locations. Result: SAFE, OverallTime: 156.8s, OverallIterations: 22, TraceHistogramMax: 6, AutomataDifference: 131.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 10.2s, HoareTripleCheckerStatistics: 6094 SDtfs, 22508 SDslu, 1511 SDs, 0 SdLazy, 53358 SolverSat, 5214 SolverUnsat, 28 SolverUnknown, 0 SolverNotchecked, 118.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4898 GetRequests, 4722 SyntacticMatches, 17 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2305 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17375occurred in iteration=17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.6s AutomataMinimizationTime, 22 MinimizatonAttempts, 33418 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 225 NumberOfFragments, 1939 HoareAnnotationTreeSize, 4 FomulaSimplifications, 214367 FormulaSimplificationTreeSizeReduction, 1.7s HoareSimplificationTime, 4 FomulaSimplificationsInter, 87965 FormulaSimplificationTreeSizeReductionInter, 8.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 9.4s InterpolantComputationTime, 18826 NumberOfCodeBlocks, 18826 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 18797 ConstructedInterpolants, 670 QuantifiedInterpolants, 68752818 SizeOfPredicates, 7 NumberOfNonLiveVariables, 5548 ConjunctsInSsa, 25 ConjunctsInUnsatCore, 29 InterpolantComputations, 20 PerfectInterpolantSequences, 23496/25646 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...