./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem16_label45.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_f8e86599-d75f-4aa5-acaf-294dd855a6fb/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_f8e86599-d75f-4aa5-acaf-294dd855a6fb/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_f8e86599-d75f-4aa5-acaf-294dd855a6fb/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_f8e86599-d75f-4aa5-acaf-294dd855a6fb/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem16_label45.c -s /tmp/vcloud-vcloud-master/worker/run_dir_f8e86599-d75f-4aa5-acaf-294dd855a6fb/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_f8e86599-d75f-4aa5-acaf-294dd855a6fb/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 b47e6efaac96dd68fdf2e956514ab24129d0709d ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-20 10:48:24,023 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 10:48:24,025 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 10:48:24,041 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 10:48:24,041 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 10:48:24,042 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 10:48:24,045 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 10:48:24,054 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 10:48:24,058 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 10:48:24,063 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 10:48:24,064 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 10:48:24,065 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 10:48:24,065 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 10:48:24,067 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 10:48:24,069 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 10:48:24,070 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 10:48:24,071 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 10:48:24,072 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 10:48:24,075 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 10:48:24,079 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 10:48:24,083 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 10:48:24,085 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 10:48:24,088 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 10:48:24,088 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 10:48:24,091 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 10:48:24,091 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 10:48:24,092 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 10:48:24,093 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 10:48:24,094 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 10:48:24,095 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 10:48:24,095 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 10:48:24,095 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 10:48:24,096 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 10:48:24,097 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 10:48:24,098 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 10:48:24,098 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 10:48:24,099 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 10:48:24,099 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 10:48:24,099 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 10:48:24,100 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 10:48:24,101 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 10:48:24,102 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_f8e86599-d75f-4aa5-acaf-294dd855a6fb/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-20 10:48:24,127 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 10:48:24,138 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 10:48:24,139 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 10:48:24,140 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 10:48:24,140 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 10:48:24,140 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 10:48:24,140 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 10:48:24,141 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 10:48:24,141 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 10:48:24,141 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 10:48:24,141 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 10:48:24,141 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 10:48:24,142 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 10:48:24,142 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 10:48:24,142 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 10:48:24,142 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 10:48:24,143 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 10:48:24,143 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 10:48:24,143 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 10:48:24,143 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 10:48:24,144 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 10:48:24,144 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 10:48:24,145 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 10:48:24,145 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 10:48:24,146 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 10:48:24,146 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 10:48:24,146 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 10:48:24,146 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 10:48:24,146 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_f8e86599-d75f-4aa5-acaf-294dd855a6fb/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 -> b47e6efaac96dd68fdf2e956514ab24129d0709d [2019-11-20 10:48:24,296 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 10:48:24,308 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 10:48:24,311 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 10:48:24,312 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 10:48:24,313 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 10:48:24,313 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_f8e86599-d75f-4aa5-acaf-294dd855a6fb/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem16_label45.c [2019-11-20 10:48:24,367 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f8e86599-d75f-4aa5-acaf-294dd855a6fb/bin/uautomizer/data/a3b028855/263d4756df514ca3a5163822519c85c1/FLAG156f08a12 [2019-11-20 10:48:25,008 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 10:48:25,009 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_f8e86599-d75f-4aa5-acaf-294dd855a6fb/sv-benchmarks/c/eca-rers2012/Problem16_label45.c [2019-11-20 10:48:25,026 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f8e86599-d75f-4aa5-acaf-294dd855a6fb/bin/uautomizer/data/a3b028855/263d4756df514ca3a5163822519c85c1/FLAG156f08a12 [2019-11-20 10:48:25,339 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_f8e86599-d75f-4aa5-acaf-294dd855a6fb/bin/uautomizer/data/a3b028855/263d4756df514ca3a5163822519c85c1 [2019-11-20 10:48:25,341 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 10:48:25,342 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 10:48:25,343 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 10:48:25,343 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 10:48:25,347 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 10:48:25,347 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:48:25" (1/1) ... [2019-11-20 10:48:25,349 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e64ea90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:48:25, skipping insertion in model container [2019-11-20 10:48:25,350 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:48:25" (1/1) ... [2019-11-20 10:48:25,356 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 10:48:25,430 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 10:48:26,228 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 10:48:26,233 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 10:48:26,480 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 10:48:26,498 INFO L192 MainTranslator]: Completed translation [2019-11-20 10:48:26,499 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:48:26 WrapperNode [2019-11-20 10:48:26,499 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 10:48:26,500 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 10:48:26,500 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 10:48:26,500 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 10:48:26,509 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:48:26" (1/1) ... [2019-11-20 10:48:26,547 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:48:26" (1/1) ... [2019-11-20 10:48:26,679 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 10:48:26,679 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 10:48:26,680 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 10:48:26,680 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 10:48:26,689 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:48:26" (1/1) ... [2019-11-20 10:48:26,690 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:48:26" (1/1) ... [2019-11-20 10:48:26,699 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:48:26" (1/1) ... [2019-11-20 10:48:26,699 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:48:26" (1/1) ... [2019-11-20 10:48:26,744 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:48:26" (1/1) ... [2019-11-20 10:48:26,761 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:48:26" (1/1) ... [2019-11-20 10:48:26,774 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:48:26" (1/1) ... [2019-11-20 10:48:26,788 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 10:48:26,789 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 10:48:26,790 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 10:48:26,790 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 10:48:26,791 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:48:26" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f8e86599-d75f-4aa5-acaf-294dd855a6fb/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 10:48:26,863 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 10:48:26,864 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 10:48:29,672 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 10:48:29,673 INFO L285 CfgBuilder]: Removed 9 assume(true) statements. [2019-11-20 10:48:29,674 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:48:29 BoogieIcfgContainer [2019-11-20 10:48:29,674 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 10:48:29,675 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 10:48:29,675 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 10:48:29,678 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 10:48:29,678 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 10:48:25" (1/3) ... [2019-11-20 10:48:29,679 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35ac713f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:48:29, skipping insertion in model container [2019-11-20 10:48:29,679 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:48:26" (2/3) ... [2019-11-20 10:48:29,679 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35ac713f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:48:29, skipping insertion in model container [2019-11-20 10:48:29,680 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:48:29" (3/3) ... [2019-11-20 10:48:29,684 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem16_label45.c [2019-11-20 10:48:29,693 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 10:48:29,702 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 10:48:29,713 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 10:48:29,753 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 10:48:29,753 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 10:48:29,754 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 10:48:29,754 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 10:48:29,754 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 10:48:29,754 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 10:48:29,754 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 10:48:29,755 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 10:48:29,785 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states. [2019-11-20 10:48:29,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-20 10:48:29,795 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:48:29,796 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] [2019-11-20 10:48:29,796 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:48:29,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:48:29,802 INFO L82 PathProgramCache]: Analyzing trace with hash -92557335, now seen corresponding path program 1 times [2019-11-20 10:48:29,810 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:48:29,811 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669004233] [2019-11-20 10:48:29,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:48:29,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:48:30,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:48:30,141 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669004233] [2019-11-20 10:48:30,142 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:48:30,143 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 10:48:30,144 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375230011] [2019-11-20 10:48:30,149 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:48:30,149 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:48:30,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:48:30,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:48:30,163 INFO L87 Difference]: Start difference. First operand 396 states. Second operand 4 states. [2019-11-20 10:48:33,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:48:33,562 INFO L93 Difference]: Finished difference Result 1454 states and 2762 transitions. [2019-11-20 10:48:33,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:48:33,564 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2019-11-20 10:48:33,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:48:33,593 INFO L225 Difference]: With dead ends: 1454 [2019-11-20 10:48:33,593 INFO L226 Difference]: Without dead ends: 991 [2019-11-20 10:48:33,599 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:48:33,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 991 states. [2019-11-20 10:48:33,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 991 to 991. [2019-11-20 10:48:33,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 991 states. [2019-11-20 10:48:33,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 991 states to 991 states and 1555 transitions. [2019-11-20 10:48:33,698 INFO L78 Accepts]: Start accepts. Automaton has 991 states and 1555 transitions. Word has length 53 [2019-11-20 10:48:33,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:48:33,699 INFO L462 AbstractCegarLoop]: Abstraction has 991 states and 1555 transitions. [2019-11-20 10:48:33,699 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:48:33,700 INFO L276 IsEmpty]: Start isEmpty. Operand 991 states and 1555 transitions. [2019-11-20 10:48:33,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-20 10:48:33,705 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:48:33,705 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:48:33,706 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:48:33,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:48:33,706 INFO L82 PathProgramCache]: Analyzing trace with hash -1686833650, now seen corresponding path program 1 times [2019-11-20 10:48:33,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:48:33,707 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047797678] [2019-11-20 10:48:33,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:48:33,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:48:33,896 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:48:33,896 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047797678] [2019-11-20 10:48:33,896 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:48:33,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:48:33,897 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243231021] [2019-11-20 10:48:33,900 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 10:48:33,901 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:48:33,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 10:48:33,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:48:33,902 INFO L87 Difference]: Start difference. First operand 991 states and 1555 transitions. Second operand 5 states. [2019-11-20 10:48:35,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:48:35,758 INFO L93 Difference]: Finished difference Result 2967 states and 4660 transitions. [2019-11-20 10:48:35,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 10:48:35,759 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 121 [2019-11-20 10:48:35,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:48:35,773 INFO L225 Difference]: With dead ends: 2967 [2019-11-20 10:48:35,773 INFO L226 Difference]: Without dead ends: 1978 [2019-11-20 10:48:35,777 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:48:35,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1978 states. [2019-11-20 10:48:35,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1978 to 1978. [2019-11-20 10:48:35,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1978 states. [2019-11-20 10:48:35,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1978 states to 1978 states and 2801 transitions. [2019-11-20 10:48:35,855 INFO L78 Accepts]: Start accepts. Automaton has 1978 states and 2801 transitions. Word has length 121 [2019-11-20 10:48:35,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:48:35,857 INFO L462 AbstractCegarLoop]: Abstraction has 1978 states and 2801 transitions. [2019-11-20 10:48:35,857 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 10:48:35,857 INFO L276 IsEmpty]: Start isEmpty. Operand 1978 states and 2801 transitions. [2019-11-20 10:48:35,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2019-11-20 10:48:35,869 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:48:35,870 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:48:35,870 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:48:35,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:48:35,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1689727149, now seen corresponding path program 1 times [2019-11-20 10:48:35,871 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:48:35,871 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592202989] [2019-11-20 10:48:35,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:48:35,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:48:36,429 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-11-20 10:48:36,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592202989] [2019-11-20 10:48:36,430 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2016815540] [2019-11-20 10:48:36,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f8e86599-d75f-4aa5-acaf-294dd855a6fb/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 10:48:36,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:48:36,556 INFO L255 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 10:48:36,568 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:48:36,685 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:48:36,686 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 10:48:36,686 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2019-11-20 10:48:36,687 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16924049] [2019-11-20 10:48:36,690 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 10:48:36,692 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:48:36,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 10:48:36,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:48:36,694 INFO L87 Difference]: Start difference. First operand 1978 states and 2801 transitions. Second operand 3 states. [2019-11-20 10:48:39,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:48:39,166 INFO L93 Difference]: Finished difference Result 5928 states and 8398 transitions. [2019-11-20 10:48:39,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 10:48:39,168 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 288 [2019-11-20 10:48:39,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:48:39,195 INFO L225 Difference]: With dead ends: 5928 [2019-11-20 10:48:39,195 INFO L226 Difference]: Without dead ends: 3952 [2019-11-20 10:48:39,198 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:48:39,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3952 states. [2019-11-20 10:48:39,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3952 to 3952. [2019-11-20 10:48:39,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3952 states. [2019-11-20 10:48:39,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3952 states to 3952 states and 5369 transitions. [2019-11-20 10:48:39,305 INFO L78 Accepts]: Start accepts. Automaton has 3952 states and 5369 transitions. Word has length 288 [2019-11-20 10:48:39,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:48:39,308 INFO L462 AbstractCegarLoop]: Abstraction has 3952 states and 5369 transitions. [2019-11-20 10:48:39,308 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 10:48:39,309 INFO L276 IsEmpty]: Start isEmpty. Operand 3952 states and 5369 transitions. [2019-11-20 10:48:39,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2019-11-20 10:48:39,316 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:48:39,316 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-20 10:48:39,519 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 10:48:39,520 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:48:39,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:48:39,520 INFO L82 PathProgramCache]: Analyzing trace with hash 139861487, now seen corresponding path program 1 times [2019-11-20 10:48:39,521 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:48:39,522 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951011834] [2019-11-20 10:48:39,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:48:39,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:48:40,127 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-11-20 10:48:40,128 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951011834] [2019-11-20 10:48:40,128 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:48:40,128 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-20 10:48:40,128 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105195517] [2019-11-20 10:48:40,129 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-20 10:48:40,129 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:48:40,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-20 10:48:40,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-20 10:48:40,130 INFO L87 Difference]: Start difference. First operand 3952 states and 5369 transitions. Second operand 7 states. [2019-11-20 10:48:43,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:48:43,417 INFO L93 Difference]: Finished difference Result 8269 states and 11121 transitions. [2019-11-20 10:48:43,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 10:48:43,417 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 343 [2019-11-20 10:48:43,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:48:43,442 INFO L225 Difference]: With dead ends: 8269 [2019-11-20 10:48:43,442 INFO L226 Difference]: Without dead ends: 4319 [2019-11-20 10:48:43,447 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-11-20 10:48:43,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4319 states. [2019-11-20 10:48:43,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4319 to 4281. [2019-11-20 10:48:43,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4281 states. [2019-11-20 10:48:43,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4281 states to 4281 states and 5704 transitions. [2019-11-20 10:48:43,547 INFO L78 Accepts]: Start accepts. Automaton has 4281 states and 5704 transitions. Word has length 343 [2019-11-20 10:48:43,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:48:43,547 INFO L462 AbstractCegarLoop]: Abstraction has 4281 states and 5704 transitions. [2019-11-20 10:48:43,547 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-20 10:48:43,548 INFO L276 IsEmpty]: Start isEmpty. Operand 4281 states and 5704 transitions. [2019-11-20 10:48:43,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2019-11-20 10:48:43,557 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:48:43,557 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:48:43,557 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:48:43,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:48:43,558 INFO L82 PathProgramCache]: Analyzing trace with hash -492956799, now seen corresponding path program 1 times [2019-11-20 10:48:43,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:48:43,558 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095829638] [2019-11-20 10:48:43,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:48:43,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:48:43,811 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 404 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-11-20 10:48:43,811 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095829638] [2019-11-20 10:48:43,812 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:48:43,812 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 10:48:43,813 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443632597] [2019-11-20 10:48:43,813 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 10:48:43,814 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:48:43,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 10:48:43,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:48:43,814 INFO L87 Difference]: Start difference. First operand 4281 states and 5704 transitions. Second operand 3 states. [2019-11-20 10:48:45,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:48:45,745 INFO L93 Difference]: Finished difference Result 12179 states and 16437 transitions. [2019-11-20 10:48:45,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 10:48:45,746 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 430 [2019-11-20 10:48:45,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:48:45,780 INFO L225 Difference]: With dead ends: 12179 [2019-11-20 10:48:45,780 INFO L226 Difference]: Without dead ends: 6255 [2019-11-20 10:48:45,789 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:48:45,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6255 states. [2019-11-20 10:48:45,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6255 to 5926. [2019-11-20 10:48:45,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5926 states. [2019-11-20 10:48:45,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5926 states to 5926 states and 6485 transitions. [2019-11-20 10:48:45,922 INFO L78 Accepts]: Start accepts. Automaton has 5926 states and 6485 transitions. Word has length 430 [2019-11-20 10:48:45,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:48:45,923 INFO L462 AbstractCegarLoop]: Abstraction has 5926 states and 6485 transitions. [2019-11-20 10:48:45,923 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 10:48:45,923 INFO L276 IsEmpty]: Start isEmpty. Operand 5926 states and 6485 transitions. [2019-11-20 10:48:45,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 448 [2019-11-20 10:48:45,932 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:48:45,933 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-20 10:48:45,933 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:48:45,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:48:45,934 INFO L82 PathProgramCache]: Analyzing trace with hash -1084367381, now seen corresponding path program 1 times [2019-11-20 10:48:45,934 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:48:45,934 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822837596] [2019-11-20 10:48:45,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:48:46,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:48:46,311 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 259 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:48:46,311 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822837596] [2019-11-20 10:48:46,312 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:48:46,312 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:48:46,312 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463270431] [2019-11-20 10:48:46,313 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:48:46,313 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:48:46,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:48:46,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:48:46,314 INFO L87 Difference]: Start difference. First operand 5926 states and 6485 transitions. Second operand 4 states. [2019-11-20 10:48:48,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:48:48,084 INFO L93 Difference]: Finished difference Result 13495 states and 14822 transitions. [2019-11-20 10:48:48,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:48:48,084 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 447 [2019-11-20 10:48:48,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:48:48,123 INFO L225 Difference]: With dead ends: 13495 [2019-11-20 10:48:48,123 INFO L226 Difference]: Without dead ends: 7900 [2019-11-20 10:48:48,131 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-11-20 10:48:48,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7900 states. [2019-11-20 10:48:48,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7900 to 7242. [2019-11-20 10:48:48,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7242 states. [2019-11-20 10:48:48,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7242 states to 7242 states and 7787 transitions. [2019-11-20 10:48:48,303 INFO L78 Accepts]: Start accepts. Automaton has 7242 states and 7787 transitions. Word has length 447 [2019-11-20 10:48:48,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:48:48,304 INFO L462 AbstractCegarLoop]: Abstraction has 7242 states and 7787 transitions. [2019-11-20 10:48:48,304 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:48:48,305 INFO L276 IsEmpty]: Start isEmpty. Operand 7242 states and 7787 transitions. [2019-11-20 10:48:48,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 587 [2019-11-20 10:48:48,323 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:48:48,324 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:48:48,324 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:48:48,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:48:48,325 INFO L82 PathProgramCache]: Analyzing trace with hash -947048121, now seen corresponding path program 1 times [2019-11-20 10:48:48,325 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:48:48,326 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651580479] [2019-11-20 10:48:48,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:48:48,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:48:50,129 INFO L134 CoverageAnalysis]: Checked inductivity of 571 backedges. 456 proven. 64 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-11-20 10:48:50,129 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651580479] [2019-11-20 10:48:50,130 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1541310400] [2019-11-20 10:48:50,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f8e86599-d75f-4aa5-acaf-294dd855a6fb/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 10:48:50,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:48:50,270 INFO L255 TraceCheckSpWp]: Trace formula consists of 695 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 10:48:50,301 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:48:50,669 INFO L134 CoverageAnalysis]: Checked inductivity of 571 backedges. 390 proven. 0 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2019-11-20 10:48:50,670 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 10:48:50,670 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 9 [2019-11-20 10:48:50,671 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390802507] [2019-11-20 10:48:50,672 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 10:48:50,672 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:48:50,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 10:48:50,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-11-20 10:48:50,673 INFO L87 Difference]: Start difference. First operand 7242 states and 7787 transitions. Second operand 3 states. [2019-11-20 10:48:51,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:48:51,680 INFO L93 Difference]: Finished difference Result 16456 states and 17670 transitions. [2019-11-20 10:48:51,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 10:48:51,681 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 586 [2019-11-20 10:48:51,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:48:51,717 INFO L225 Difference]: With dead ends: 16456 [2019-11-20 10:48:51,717 INFO L226 Difference]: Without dead ends: 9545 [2019-11-20 10:48:51,725 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 593 GetRequests, 585 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-11-20 10:48:51,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9545 states. [2019-11-20 10:48:51,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9545 to 9545. [2019-11-20 10:48:51,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9545 states. [2019-11-20 10:48:51,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9545 states to 9545 states and 10064 transitions. [2019-11-20 10:48:51,876 INFO L78 Accepts]: Start accepts. Automaton has 9545 states and 10064 transitions. Word has length 586 [2019-11-20 10:48:51,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:48:51,878 INFO L462 AbstractCegarLoop]: Abstraction has 9545 states and 10064 transitions. [2019-11-20 10:48:51,878 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 10:48:51,878 INFO L276 IsEmpty]: Start isEmpty. Operand 9545 states and 10064 transitions. [2019-11-20 10:48:51,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 667 [2019-11-20 10:48:51,901 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:48:51,901 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:48:52,106 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 10:48:52,108 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:48:52,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:48:52,109 INFO L82 PathProgramCache]: Analyzing trace with hash -1463765033, now seen corresponding path program 1 times [2019-11-20 10:48:52,109 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:48:52,109 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953739134] [2019-11-20 10:48:52,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:48:52,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:48:52,906 INFO L134 CoverageAnalysis]: Checked inductivity of 687 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 535 trivial. 0 not checked. [2019-11-20 10:48:52,907 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953739134] [2019-11-20 10:48:52,908 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:48:52,908 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:48:52,908 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991634261] [2019-11-20 10:48:52,909 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:48:52,910 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:48:52,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:48:52,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:48:52,917 INFO L87 Difference]: Start difference. First operand 9545 states and 10064 transitions. Second operand 4 states. [2019-11-20 10:48:55,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:48:55,036 INFO L93 Difference]: Finished difference Result 21062 states and 22196 transitions. [2019-11-20 10:48:55,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:48:55,037 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 666 [2019-11-20 10:48:55,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:48:55,064 INFO L225 Difference]: With dead ends: 21062 [2019-11-20 10:48:55,064 INFO L226 Difference]: Without dead ends: 11848 [2019-11-20 10:48:55,075 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-11-20 10:48:55,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11848 states. [2019-11-20 10:48:55,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11848 to 9874. [2019-11-20 10:48:55,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9874 states. [2019-11-20 10:48:55,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9874 states to 9874 states and 10340 transitions. [2019-11-20 10:48:55,231 INFO L78 Accepts]: Start accepts. Automaton has 9874 states and 10340 transitions. Word has length 666 [2019-11-20 10:48:55,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:48:55,233 INFO L462 AbstractCegarLoop]: Abstraction has 9874 states and 10340 transitions. [2019-11-20 10:48:55,233 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:48:55,233 INFO L276 IsEmpty]: Start isEmpty. Operand 9874 states and 10340 transitions. [2019-11-20 10:48:55,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 946 [2019-11-20 10:48:55,272 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:48:55,273 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:48:55,274 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:48:55,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:48:55,274 INFO L82 PathProgramCache]: Analyzing trace with hash 1348188237, now seen corresponding path program 1 times [2019-11-20 10:48:55,274 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:48:55,275 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256137110] [2019-11-20 10:48:55,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:48:55,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:48:56,118 INFO L134 CoverageAnalysis]: Checked inductivity of 1998 backedges. 1427 proven. 0 refuted. 0 times theorem prover too weak. 571 trivial. 0 not checked. [2019-11-20 10:48:56,118 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256137110] [2019-11-20 10:48:56,118 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:48:56,118 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:48:56,119 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945488348] [2019-11-20 10:48:56,119 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:48:56,119 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:48:56,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:48:56,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:48:56,120 INFO L87 Difference]: Start difference. First operand 9874 states and 10340 transitions. Second operand 4 states. [2019-11-20 10:48:57,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:48:57,741 INFO L93 Difference]: Finished difference Result 21720 states and 22758 transitions. [2019-11-20 10:48:57,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:48:57,742 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 945 [2019-11-20 10:48:57,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:48:57,762 INFO L225 Difference]: With dead ends: 21720 [2019-11-20 10:48:57,762 INFO L226 Difference]: Without dead ends: 12177 [2019-11-20 10:48:57,772 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-11-20 10:48:57,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12177 states. [2019-11-20 10:48:57,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12177 to 12177. [2019-11-20 10:48:57,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12177 states. [2019-11-20 10:48:57,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12177 states to 12177 states and 12645 transitions. [2019-11-20 10:48:57,951 INFO L78 Accepts]: Start accepts. Automaton has 12177 states and 12645 transitions. Word has length 945 [2019-11-20 10:48:57,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:48:57,952 INFO L462 AbstractCegarLoop]: Abstraction has 12177 states and 12645 transitions. [2019-11-20 10:48:57,952 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:48:57,953 INFO L276 IsEmpty]: Start isEmpty. Operand 12177 states and 12645 transitions. [2019-11-20 10:48:57,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1281 [2019-11-20 10:48:57,983 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:48:57,985 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:48:57,985 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:48:57,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:48:57,986 INFO L82 PathProgramCache]: Analyzing trace with hash -1437504205, now seen corresponding path program 1 times [2019-11-20 10:48:57,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:48:57,986 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526247596] [2019-11-20 10:48:57,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:48:58,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:48:59,432 INFO L134 CoverageAnalysis]: Checked inductivity of 3078 backedges. 2131 proven. 0 refuted. 0 times theorem prover too weak. 947 trivial. 0 not checked. [2019-11-20 10:48:59,433 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526247596] [2019-11-20 10:48:59,433 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:48:59,433 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:48:59,433 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902283690] [2019-11-20 10:48:59,434 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:48:59,435 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:48:59,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:48:59,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:48:59,435 INFO L87 Difference]: Start difference. First operand 12177 states and 12645 transitions. Second operand 4 states. [2019-11-20 10:49:00,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:49:00,994 INFO L93 Difference]: Finished difference Result 24681 states and 25639 transitions. [2019-11-20 10:49:00,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:49:00,995 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1280 [2019-11-20 10:49:00,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:49:01,018 INFO L225 Difference]: With dead ends: 24681 [2019-11-20 10:49:01,019 INFO L226 Difference]: Without dead ends: 12835 [2019-11-20 10:49:01,030 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:49:01,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12835 states. [2019-11-20 10:49:01,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12835 to 12506. [2019-11-20 10:49:01,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12506 states. [2019-11-20 10:49:01,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12506 states to 12506 states and 12870 transitions. [2019-11-20 10:49:01,190 INFO L78 Accepts]: Start accepts. Automaton has 12506 states and 12870 transitions. Word has length 1280 [2019-11-20 10:49:01,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:49:01,191 INFO L462 AbstractCegarLoop]: Abstraction has 12506 states and 12870 transitions. [2019-11-20 10:49:01,191 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:49:01,192 INFO L276 IsEmpty]: Start isEmpty. Operand 12506 states and 12870 transitions. [2019-11-20 10:49:01,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1282 [2019-11-20 10:49:01,223 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:49:01,224 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:49:01,224 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:49:01,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:49:01,225 INFO L82 PathProgramCache]: Analyzing trace with hash 553184258, now seen corresponding path program 1 times [2019-11-20 10:49:01,225 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:49:01,225 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791968052] [2019-11-20 10:49:01,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:49:01,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:49:03,771 INFO L134 CoverageAnalysis]: Checked inductivity of 3084 backedges. 1594 proven. 467 refuted. 0 times theorem prover too weak. 1023 trivial. 0 not checked. [2019-11-20 10:49:03,772 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791968052] [2019-11-20 10:49:03,772 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1638182524] [2019-11-20 10:49:03,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f8e86599-d75f-4aa5-acaf-294dd855a6fb/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 10:49:04,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:49:04,066 INFO L255 TraceCheckSpWp]: Trace formula consists of 1483 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 10:49:04,082 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:49:05,512 INFO L134 CoverageAnalysis]: Checked inductivity of 3084 backedges. 1848 proven. 0 refuted. 0 times theorem prover too weak. 1236 trivial. 0 not checked. [2019-11-20 10:49:05,512 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 10:49:05,513 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2019-11-20 10:49:05,513 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876687357] [2019-11-20 10:49:05,515 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 10:49:05,515 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:49:05,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 10:49:05,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-20 10:49:05,516 INFO L87 Difference]: Start difference. First operand 12506 states and 12870 transitions. Second operand 3 states. [2019-11-20 10:49:06,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:49:06,430 INFO L93 Difference]: Finished difference Result 24681 states and 25407 transitions. [2019-11-20 10:49:06,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 10:49:06,431 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1281 [2019-11-20 10:49:06,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:49:06,453 INFO L225 Difference]: With dead ends: 24681 [2019-11-20 10:49:06,454 INFO L226 Difference]: Without dead ends: 12506 [2019-11-20 10:49:06,464 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1290 GetRequests, 1281 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-20 10:49:06,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12506 states. [2019-11-20 10:49:06,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12506 to 12506. [2019-11-20 10:49:06,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12506 states. [2019-11-20 10:49:06,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12506 states to 12506 states and 12823 transitions. [2019-11-20 10:49:06,614 INFO L78 Accepts]: Start accepts. Automaton has 12506 states and 12823 transitions. Word has length 1281 [2019-11-20 10:49:06,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:49:06,617 INFO L462 AbstractCegarLoop]: Abstraction has 12506 states and 12823 transitions. [2019-11-20 10:49:06,617 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 10:49:06,617 INFO L276 IsEmpty]: Start isEmpty. Operand 12506 states and 12823 transitions. [2019-11-20 10:49:06,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1448 [2019-11-20 10:49:06,654 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:49:06,655 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:49:06,867 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 10:49:06,868 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:49:06,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:49:06,869 INFO L82 PathProgramCache]: Analyzing trace with hash -1726997540, now seen corresponding path program 1 times [2019-11-20 10:49:06,869 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:49:06,869 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83623315] [2019-11-20 10:49:06,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:49:07,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:49:09,657 INFO L134 CoverageAnalysis]: Checked inductivity of 4081 backedges. 3177 proven. 0 refuted. 0 times theorem prover too weak. 904 trivial. 0 not checked. [2019-11-20 10:49:09,657 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83623315] [2019-11-20 10:49:09,657 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:49:09,658 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-20 10:49:09,658 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316826783] [2019-11-20 10:49:09,659 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 10:49:09,659 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:49:09,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 10:49:09,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-20 10:49:09,660 INFO L87 Difference]: Start difference. First operand 12506 states and 12823 transitions. Second operand 6 states. [2019-11-20 10:49:12,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:49:12,422 INFO L93 Difference]: Finished difference Result 29616 states and 30356 transitions. [2019-11-20 10:49:12,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 10:49:12,423 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 1447 [2019-11-20 10:49:12,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:49:12,441 INFO L225 Difference]: With dead ends: 29616 [2019-11-20 10:49:12,442 INFO L226 Difference]: Without dead ends: 17441 [2019-11-20 10:49:12,451 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-20 10:49:12,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17441 states. [2019-11-20 10:49:12,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17441 to 13822. [2019-11-20 10:49:12,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13822 states. [2019-11-20 10:49:12,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13822 states to 13822 states and 14150 transitions. [2019-11-20 10:49:12,649 INFO L78 Accepts]: Start accepts. Automaton has 13822 states and 14150 transitions. Word has length 1447 [2019-11-20 10:49:12,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:49:12,651 INFO L462 AbstractCegarLoop]: Abstraction has 13822 states and 14150 transitions. [2019-11-20 10:49:12,651 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 10:49:12,651 INFO L276 IsEmpty]: Start isEmpty. Operand 13822 states and 14150 transitions. [2019-11-20 10:49:12,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1479 [2019-11-20 10:49:12,684 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:49:12,686 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:49:12,686 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:49:12,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:49:12,687 INFO L82 PathProgramCache]: Analyzing trace with hash 739806131, now seen corresponding path program 1 times [2019-11-20 10:49:12,687 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:49:12,687 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950553947] [2019-11-20 10:49:12,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:49:12,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:49:15,061 INFO L134 CoverageAnalysis]: Checked inductivity of 4393 backedges. 2797 proven. 191 refuted. 0 times theorem prover too weak. 1405 trivial. 0 not checked. [2019-11-20 10:49:15,061 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950553947] [2019-11-20 10:49:15,061 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [576258260] [2019-11-20 10:49:15,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f8e86599-d75f-4aa5-acaf-294dd855a6fb/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 10:49:15,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:49:15,399 INFO L255 TraceCheckSpWp]: Trace formula consists of 1707 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 10:49:15,418 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:49:17,326 INFO L134 CoverageAnalysis]: Checked inductivity of 4393 backedges. 1969 proven. 0 refuted. 0 times theorem prover too weak. 2424 trivial. 0 not checked. [2019-11-20 10:49:17,326 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 10:49:17,327 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2019-11-20 10:49:17,327 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985443670] [2019-11-20 10:49:17,328 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 10:49:17,328 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:49:17,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 10:49:17,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-20 10:49:17,329 INFO L87 Difference]: Start difference. First operand 13822 states and 14150 transitions. Second operand 3 states. [2019-11-20 10:49:18,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:49:18,452 INFO L93 Difference]: Finished difference Result 27313 states and 27967 transitions. [2019-11-20 10:49:18,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 10:49:18,452 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1478 [2019-11-20 10:49:18,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:49:18,466 INFO L225 Difference]: With dead ends: 27313 [2019-11-20 10:49:18,466 INFO L226 Difference]: Without dead ends: 13822 [2019-11-20 10:49:18,471 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1482 GetRequests, 1477 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-20 10:49:18,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13822 states. [2019-11-20 10:49:18,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13822 to 13493. [2019-11-20 10:49:18,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13493 states. [2019-11-20 10:49:18,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13493 states to 13493 states and 13817 transitions. [2019-11-20 10:49:18,618 INFO L78 Accepts]: Start accepts. Automaton has 13493 states and 13817 transitions. Word has length 1478 [2019-11-20 10:49:18,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:49:18,619 INFO L462 AbstractCegarLoop]: Abstraction has 13493 states and 13817 transitions. [2019-11-20 10:49:18,619 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 10:49:18,620 INFO L276 IsEmpty]: Start isEmpty. Operand 13493 states and 13817 transitions. [2019-11-20 10:49:18,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1509 [2019-11-20 10:49:18,650 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:49:18,651 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 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] [2019-11-20 10:49:18,855 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 10:49:18,856 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:49:18,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:49:18,856 INFO L82 PathProgramCache]: Analyzing trace with hash -1962984879, now seen corresponding path program 1 times [2019-11-20 10:49:18,856 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:49:18,856 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848132613] [2019-11-20 10:49:18,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:49:18,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:49:22,010 INFO L134 CoverageAnalysis]: Checked inductivity of 5173 backedges. 2098 proven. 157 refuted. 0 times theorem prover too weak. 2918 trivial. 0 not checked. [2019-11-20 10:49:22,010 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848132613] [2019-11-20 10:49:22,011 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [51687995] [2019-11-20 10:49:22,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f8e86599-d75f-4aa5-acaf-294dd855a6fb/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 10:49:22,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:49:22,339 INFO L255 TraceCheckSpWp]: Trace formula consists of 1761 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 10:49:22,352 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:49:23,875 INFO L134 CoverageAnalysis]: Checked inductivity of 5173 backedges. 2255 proven. 0 refuted. 0 times theorem prover too weak. 2918 trivial. 0 not checked. [2019-11-20 10:49:23,876 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 10:49:23,876 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2019-11-20 10:49:23,876 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625285612] [2019-11-20 10:49:23,878 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 10:49:23,878 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:49:23,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 10:49:23,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-11-20 10:49:23,878 INFO L87 Difference]: Start difference. First operand 13493 states and 13817 transitions. Second operand 3 states. [2019-11-20 10:49:24,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:49:24,870 INFO L93 Difference]: Finished difference Result 28300 states and 28997 transitions. [2019-11-20 10:49:24,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 10:49:24,871 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1508 [2019-11-20 10:49:24,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:49:24,881 INFO L225 Difference]: With dead ends: 28300 [2019-11-20 10:49:24,881 INFO L226 Difference]: Without dead ends: 14809 [2019-11-20 10:49:24,889 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1516 GetRequests, 1507 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-11-20 10:49:24,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14809 states. [2019-11-20 10:49:25,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14809 to 14809. [2019-11-20 10:49:25,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14809 states. [2019-11-20 10:49:25,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14809 states to 14809 states and 15149 transitions. [2019-11-20 10:49:25,058 INFO L78 Accepts]: Start accepts. Automaton has 14809 states and 15149 transitions. Word has length 1508 [2019-11-20 10:49:25,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:49:25,060 INFO L462 AbstractCegarLoop]: Abstraction has 14809 states and 15149 transitions. [2019-11-20 10:49:25,060 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 10:49:25,060 INFO L276 IsEmpty]: Start isEmpty. Operand 14809 states and 15149 transitions. [2019-11-20 10:49:25,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1731 [2019-11-20 10:49:25,084 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:49:25,085 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:49:25,288 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 10:49:25,288 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:49:25,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:49:25,289 INFO L82 PathProgramCache]: Analyzing trace with hash 1358453474, now seen corresponding path program 1 times [2019-11-20 10:49:25,289 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:49:25,289 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633220925] [2019-11-20 10:49:25,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:49:25,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:49:29,025 INFO L134 CoverageAnalysis]: Checked inductivity of 5458 backedges. 3789 proven. 0 refuted. 0 times theorem prover too weak. 1669 trivial. 0 not checked. [2019-11-20 10:49:29,025 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633220925] [2019-11-20 10:49:29,025 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:49:29,026 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 10:49:29,026 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746005983] [2019-11-20 10:49:29,027 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 10:49:29,028 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:49:29,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 10:49:29,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:49:29,028 INFO L87 Difference]: Start difference. First operand 14809 states and 15149 transitions. Second operand 5 states. [2019-11-20 10:49:30,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:49:30,873 INFO L93 Difference]: Finished difference Result 29948 states and 30632 transitions. [2019-11-20 10:49:30,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 10:49:30,873 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1730 [2019-11-20 10:49:30,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:49:30,885 INFO L225 Difference]: With dead ends: 29948 [2019-11-20 10:49:30,885 INFO L226 Difference]: Without dead ends: 15141 [2019-11-20 10:49:30,893 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-11-20 10:49:30,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15141 states. [2019-11-20 10:49:31,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15141 to 14809. [2019-11-20 10:49:31,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14809 states. [2019-11-20 10:49:31,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14809 states to 14809 states and 15143 transitions. [2019-11-20 10:49:31,021 INFO L78 Accepts]: Start accepts. Automaton has 14809 states and 15143 transitions. Word has length 1730 [2019-11-20 10:49:31,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:49:31,022 INFO L462 AbstractCegarLoop]: Abstraction has 14809 states and 15143 transitions. [2019-11-20 10:49:31,022 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 10:49:31,022 INFO L276 IsEmpty]: Start isEmpty. Operand 14809 states and 15143 transitions. [2019-11-20 10:49:31,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2106 [2019-11-20 10:49:31,051 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:49:31,054 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:49:31,055 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:49:31,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:49:31,056 INFO L82 PathProgramCache]: Analyzing trace with hash 608744129, now seen corresponding path program 1 times [2019-11-20 10:49:31,056 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:49:31,056 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876706031] [2019-11-20 10:49:31,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:49:31,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:49:39,071 INFO L134 CoverageAnalysis]: Checked inductivity of 8026 backedges. 5345 proven. 1498 refuted. 0 times theorem prover too weak. 1183 trivial. 0 not checked. [2019-11-20 10:49:39,071 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876706031] [2019-11-20 10:49:39,072 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [693790978] [2019-11-20 10:49:39,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f8e86599-d75f-4aa5-acaf-294dd855a6fb/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 10:49:39,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:49:39,580 INFO L255 TraceCheckSpWp]: Trace formula consists of 2413 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 10:49:39,600 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:49:42,368 INFO L134 CoverageAnalysis]: Checked inductivity of 8026 backedges. 4649 proven. 0 refuted. 0 times theorem prover too weak. 3377 trivial. 0 not checked. [2019-11-20 10:49:42,368 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 10:49:42,369 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2019-11-20 10:49:42,369 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101506192] [2019-11-20 10:49:42,371 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:49:42,371 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:49:42,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:49:42,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-11-20 10:49:42,371 INFO L87 Difference]: Start difference. First operand 14809 states and 15143 transitions. Second operand 4 states. [2019-11-20 10:49:43,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:49:43,816 INFO L93 Difference]: Finished difference Result 31590 states and 32284 transitions. [2019-11-20 10:49:43,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:49:43,816 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 2105 [2019-11-20 10:49:43,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:49:43,828 INFO L225 Difference]: With dead ends: 31590 [2019-11-20 10:49:43,828 INFO L226 Difference]: Without dead ends: 14809 [2019-11-20 10:49:43,835 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2117 GetRequests, 2104 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-11-20 10:49:43,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14809 states. [2019-11-20 10:49:43,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14809 to 14809. [2019-11-20 10:49:43,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14809 states. [2019-11-20 10:49:43,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14809 states to 14809 states and 15125 transitions. [2019-11-20 10:49:43,956 INFO L78 Accepts]: Start accepts. Automaton has 14809 states and 15125 transitions. Word has length 2105 [2019-11-20 10:49:43,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:49:43,958 INFO L462 AbstractCegarLoop]: Abstraction has 14809 states and 15125 transitions. [2019-11-20 10:49:43,958 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:49:43,958 INFO L276 IsEmpty]: Start isEmpty. Operand 14809 states and 15125 transitions. [2019-11-20 10:49:44,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2347 [2019-11-20 10:49:44,002 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:49:44,003 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-20 10:49:44,207 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 10:49:44,208 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:49:44,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:49:44,208 INFO L82 PathProgramCache]: Analyzing trace with hash 1532383712, now seen corresponding path program 1 times [2019-11-20 10:49:44,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:49:44,209 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973712241] [2019-11-20 10:49:44,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:49:44,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:49:47,812 INFO L134 CoverageAnalysis]: Checked inductivity of 10430 backedges. 6649 proven. 0 refuted. 0 times theorem prover too weak. 3781 trivial. 0 not checked. [2019-11-20 10:49:47,812 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973712241] [2019-11-20 10:49:47,812 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:49:47,813 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:49:47,813 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654890122] [2019-11-20 10:49:47,814 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:49:47,814 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:49:47,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:49:47,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:49:47,815 INFO L87 Difference]: Start difference. First operand 14809 states and 15125 transitions. Second operand 4 states. [2019-11-20 10:49:49,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:49:49,158 INFO L93 Difference]: Finished difference Result 31919 states and 32627 transitions. [2019-11-20 10:49:49,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:49:49,158 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 2346 [2019-11-20 10:49:49,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:49:49,170 INFO L225 Difference]: With dead ends: 31919 [2019-11-20 10:49:49,170 INFO L226 Difference]: Without dead ends: 17441 [2019-11-20 10:49:49,177 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-11-20 10:49:49,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17441 states. [2019-11-20 10:49:49,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17441 to 16125. [2019-11-20 10:49:49,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16125 states. [2019-11-20 10:49:49,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16125 states to 16125 states and 16424 transitions. [2019-11-20 10:49:49,315 INFO L78 Accepts]: Start accepts. Automaton has 16125 states and 16424 transitions. Word has length 2346 [2019-11-20 10:49:49,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:49:49,316 INFO L462 AbstractCegarLoop]: Abstraction has 16125 states and 16424 transitions. [2019-11-20 10:49:49,316 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:49:49,317 INFO L276 IsEmpty]: Start isEmpty. Operand 16125 states and 16424 transitions. [2019-11-20 10:49:49,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2491 [2019-11-20 10:49:49,370 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:49:49,372 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:49:49,372 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:49:49,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:49:49,373 INFO L82 PathProgramCache]: Analyzing trace with hash 2030831558, now seen corresponding path program 1 times [2019-11-20 10:49:49,373 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:49:49,374 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266398164] [2019-11-20 10:49:49,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:49:49,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:49:55,389 INFO L134 CoverageAnalysis]: Checked inductivity of 11649 backedges. 3426 proven. 104 refuted. 0 times theorem prover too weak. 8119 trivial. 0 not checked. [2019-11-20 10:49:55,389 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266398164] [2019-11-20 10:49:55,389 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [703619873] [2019-11-20 10:49:55,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f8e86599-d75f-4aa5-acaf-294dd855a6fb/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 10:49:55,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:49:55,925 INFO L255 TraceCheckSpWp]: Trace formula consists of 2858 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 10:49:55,943 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:49:58,951 INFO L134 CoverageAnalysis]: Checked inductivity of 11649 backedges. 6136 proven. 0 refuted. 0 times theorem prover too weak. 5513 trivial. 0 not checked. [2019-11-20 10:49:58,952 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 10:49:58,953 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2019-11-20 10:49:58,954 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712856317] [2019-11-20 10:49:58,955 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 10:49:58,956 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:49:58,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 10:49:58,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-11-20 10:49:58,956 INFO L87 Difference]: Start difference. First operand 16125 states and 16424 transitions. Second operand 3 states. [2019-11-20 10:49:59,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:49:59,943 INFO L93 Difference]: Finished difference Result 32577 states and 33188 transitions. [2019-11-20 10:49:59,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 10:49:59,943 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2490 [2019-11-20 10:49:59,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:49:59,958 INFO L225 Difference]: With dead ends: 32577 [2019-11-20 10:49:59,958 INFO L226 Difference]: Without dead ends: 16783 [2019-11-20 10:49:59,965 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2496 GetRequests, 2490 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-11-20 10:49:59,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16783 states. [2019-11-20 10:50:00,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16783 to 16783. [2019-11-20 10:50:00,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16783 states. [2019-11-20 10:50:00,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16783 states to 16783 states and 17086 transitions. [2019-11-20 10:50:00,100 INFO L78 Accepts]: Start accepts. Automaton has 16783 states and 17086 transitions. Word has length 2490 [2019-11-20 10:50:00,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:50:00,102 INFO L462 AbstractCegarLoop]: Abstraction has 16783 states and 17086 transitions. [2019-11-20 10:50:00,102 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 10:50:00,102 INFO L276 IsEmpty]: Start isEmpty. Operand 16783 states and 17086 transitions. [2019-11-20 10:50:00,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2529 [2019-11-20 10:50:00,142 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:50:00,143 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:50:00,344 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 10:50:00,344 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:50:00,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:50:00,345 INFO L82 PathProgramCache]: Analyzing trace with hash -154185387, now seen corresponding path program 1 times [2019-11-20 10:50:00,345 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:50:00,345 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858092841] [2019-11-20 10:50:00,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:50:00,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:50:16,024 INFO L134 CoverageAnalysis]: Checked inductivity of 11829 backedges. 3748 proven. 5496 refuted. 0 times theorem prover too weak. 2585 trivial. 0 not checked. [2019-11-20 10:50:16,024 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858092841] [2019-11-20 10:50:16,025 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2000980717] [2019-11-20 10:50:16,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f8e86599-d75f-4aa5-acaf-294dd855a6fb/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 10:50:16,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:50:16,636 INFO L255 TraceCheckSpWp]: Trace formula consists of 2916 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-20 10:50:16,653 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:50:16,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:50:16,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:50:21,187 INFO L134 CoverageAnalysis]: Checked inductivity of 11829 backedges. 1545 proven. 51 refuted. 0 times theorem prover too weak. 10233 trivial. 0 not checked. [2019-11-20 10:50:21,188 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 10:50:21,189 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 4] total 22 [2019-11-20 10:50:21,190 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555788092] [2019-11-20 10:50:21,192 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-20 10:50:21,192 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:50:21,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-20 10:50:21,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=387, Unknown=0, NotChecked=0, Total=462 [2019-11-20 10:50:21,193 INFO L87 Difference]: Start difference. First operand 16783 states and 17086 transitions. Second operand 22 states. [2019-11-20 10:50:54,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:50:54,226 INFO L93 Difference]: Finished difference Result 43746 states and 44540 transitions. [2019-11-20 10:50:54,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-11-20 10:50:54,226 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 2528 [2019-11-20 10:50:54,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:50:54,227 INFO L225 Difference]: With dead ends: 43746 [2019-11-20 10:50:54,227 INFO L226 Difference]: Without dead ends: 0 [2019-11-20 10:50:54,236 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2604 GetRequests, 2550 SyntacticMatches, 6 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 596 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=360, Invalid=2090, Unknown=0, NotChecked=0, Total=2450 [2019-11-20 10:50:54,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-20 10:50:54,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-20 10:50:54,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-20 10:50:54,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-20 10:50:54,237 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 2528 [2019-11-20 10:50:54,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:50:54,237 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 10:50:54,237 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-20 10:50:54,237 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-20 10:50:54,237 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-20 10:50:54,438 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 10:50:54,442 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-20 10:50:54,810 WARN L191 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 332 DAG size of output: 217 [2019-11-20 10:50:55,024 WARN L191 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 288 DAG size of output: 193 [2019-11-20 10:50:55,336 WARN L191 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 335 DAG size of output: 217 [2019-11-20 10:50:56,678 WARN L191 SmtUtils]: Spent 1.34 s on a formula simplification. DAG size of input: 195 DAG size of output: 97 [2019-11-20 10:50:57,745 WARN L191 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 175 DAG size of output: 99 [2019-11-20 10:50:58,888 WARN L191 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 195 DAG size of output: 97 [2019-11-20 10:50:58,891 INFO L444 ceAbstractionStarter]: For program point L894(lines 894 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,891 INFO L444 ceAbstractionStarter]: For program point L828(lines 828 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,891 INFO L444 ceAbstractionStarter]: For program point L696(lines 696 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,891 INFO L444 ceAbstractionStarter]: For program point L1687(lines 1687 1763) no Hoare annotation was computed. [2019-11-20 10:50:58,892 INFO L444 ceAbstractionStarter]: For program point L1291(lines 1291 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,892 INFO L444 ceAbstractionStarter]: For program point L168-1(lines 23 1492) no Hoare annotation was computed. [2019-11-20 10:50:58,892 INFO L444 ceAbstractionStarter]: For program point L102-1(lines 23 1492) no Hoare annotation was computed. [2019-11-20 10:50:58,892 INFO L444 ceAbstractionStarter]: For program point L36-1(lines 23 1492) no Hoare annotation was computed. [2019-11-20 10:50:58,892 INFO L444 ceAbstractionStarter]: For program point L961(lines 961 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,892 INFO L444 ceAbstractionStarter]: For program point L763(lines 763 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,892 INFO L444 ceAbstractionStarter]: For program point L631(lines 631 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,892 INFO L444 ceAbstractionStarter]: For program point L1622(lines 1622 1763) no Hoare annotation was computed. [2019-11-20 10:50:58,892 INFO L444 ceAbstractionStarter]: For program point L367(lines 367 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,892 INFO L444 ceAbstractionStarter]: For program point L1358(lines 1358 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,892 INFO L444 ceAbstractionStarter]: For program point L235(lines 235 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,892 INFO L444 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2019-11-20 10:50:58,892 INFO L444 ceAbstractionStarter]: For program point L1160(lines 1160 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,892 INFO L444 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2019-11-20 10:50:58,893 INFO L444 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-11-20 10:50:58,893 INFO L440 ceAbstractionStarter]: At program point L1491(lines 23 1492) the Hoare annotation is: (let ((.cse18 (+ ~a18~0 79)) (.cse4 (= ~a12~0 6)) (.cse15 (= ~a12~0 8))) (let ((.cse9 (= 5 ~a12~0)) (.cse14 (<= 69094 ~a18~0)) (.cse7 (not .cse15)) (.cse12 (<= ~a18~0 513056)) (.cse1 (= ~a15~0 4)) (.cse2 (<= ~a18~0 134)) (.cse16 (= 7 ~a12~0)) (.cse13 (not .cse4)) (.cse5 (<= ~a16~0 9)) (.cse3 (<= ~a16~0 11)) (.cse6 (<= .cse18 0)) (.cse17 (< 0 (+ ~a18~0 156))) (.cse0 (= ~a16~0 8)) (.cse10 (= 3 ~a15~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 (<= 4 ~a15~0) .cse4) (and .cse1 .cse5 .cse6 .cse7) (let ((.cse8 (div (+ ~a18~0 (- 599175)) 3))) (and .cse1 .cse3 (<= (+ .cse8 79) 0) .cse9 (= 0 (mod ~a18~0 3)) (< 0 (+ .cse8 156)))) (and .cse10 (exists ((v_~a18~0_902 Int)) (let ((.cse11 (div (+ v_~a18~0_902 (- 599175)) 3))) (and (<= 0 (* 9 v_~a18~0_902)) (<= (+ ~a18~0 557770) (div (* v_~a18~0_902 9) 10)) (< 0 (+ .cse11 156)) (<= (+ .cse11 79) 0) (= 0 (mod v_~a18~0_902 3))))) .cse4) (and .cse1 .cse3 .cse9 .cse6) (and (and .cse9 .cse10) .cse12) (and .cse3 .cse13 .cse10 .cse12 (not (= 10 ~a16~0))) (and .cse14 .cse10 .cse15) (and .cse1 .cse0 (= ~a12~0 5)) (and (<= 12 ~a16~0) .cse10 .cse7) (and .cse1 .cse14 .cse5 .cse16) (and .cse1 .cse5 .cse6 .cse17) (and .cse1 .cse2 .cse5 .cse15 (< 0 .cse18)) (and .cse0 .cse1 .cse14 .cse12 .cse7) (and (and .cse10 (< 134 ~a18~0) .cse4) .cse12) (and .cse2 .cse10 .cse15) (and .cse1 .cse2 .cse5 .cse16) (and .cse13 .cse5 .cse10) (and .cse3 .cse10 .cse15) (and .cse10 .cse6 .cse17 .cse4) (and .cse0 .cse10)))) [2019-11-20 10:50:58,893 INFO L444 ceAbstractionStarter]: For program point L434(lines 434 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,893 INFO L444 ceAbstractionStarter]: For program point L1227(lines 1227 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,893 INFO L444 ceAbstractionStarter]: For program point L567(lines 567 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,893 INFO L444 ceAbstractionStarter]: For program point L501(lines 501 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,893 INFO L444 ceAbstractionStarter]: For program point L303(lines 303 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,893 INFO L444 ceAbstractionStarter]: For program point L171-1(lines 23 1492) no Hoare annotation was computed. [2019-11-20 10:50:58,894 INFO L444 ceAbstractionStarter]: For program point L105-1(lines 23 1492) no Hoare annotation was computed. [2019-11-20 10:50:58,894 INFO L444 ceAbstractionStarter]: For program point L39-1(lines 23 1492) no Hoare annotation was computed. [2019-11-20 10:50:58,894 INFO L444 ceAbstractionStarter]: For program point L1757(lines 1757 1763) no Hoare annotation was computed. [2019-11-20 10:50:58,894 INFO L444 ceAbstractionStarter]: For program point L1559(lines 1559 1763) no Hoare annotation was computed. [2019-11-20 10:50:58,894 INFO L444 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-11-20 10:50:58,894 INFO L444 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2019-11-20 10:50:58,894 INFO L444 ceAbstractionStarter]: For program point L1097(lines 1097 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,894 INFO L444 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-11-20 10:50:58,894 INFO L444 ceAbstractionStarter]: For program point L1031(lines 1031 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,894 INFO L444 ceAbstractionStarter]: For program point L899(lines 899 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,894 INFO L444 ceAbstractionStarter]: For program point L1428(lines 1428 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,894 INFO L444 ceAbstractionStarter]: For program point L834(lines 834 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,895 INFO L444 ceAbstractionStarter]: For program point L1693(lines 1693 1763) no Hoare annotation was computed. [2019-11-20 10:50:58,895 INFO L444 ceAbstractionStarter]: For program point L636(lines 636 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,895 INFO L444 ceAbstractionStarter]: For program point L1297(lines 1297 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,895 INFO L444 ceAbstractionStarter]: For program point L240(lines 240 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,895 INFO L444 ceAbstractionStarter]: For program point L174-1(lines 23 1492) no Hoare annotation was computed. [2019-11-20 10:50:58,895 INFO L444 ceAbstractionStarter]: For program point L108-1(lines 23 1492) no Hoare annotation was computed. [2019-11-20 10:50:58,895 INFO L444 ceAbstractionStarter]: For program point L42-1(lines 23 1492) no Hoare annotation was computed. [2019-11-20 10:50:58,895 INFO L444 ceAbstractionStarter]: For program point L967(lines 967 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,895 INFO L444 ceAbstractionStarter]: For program point L769(lines 769 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,895 INFO L444 ceAbstractionStarter]: For program point L703(lines 703 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,895 INFO L444 ceAbstractionStarter]: For program point L1628(lines 1628 1763) no Hoare annotation was computed. [2019-11-20 10:50:58,895 INFO L444 ceAbstractionStarter]: For program point L373(lines 373 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,895 INFO L444 ceAbstractionStarter]: For program point L1364(lines 1364 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,895 INFO L444 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-11-20 10:50:58,895 INFO L444 ceAbstractionStarter]: For program point L1166(lines 1166 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,895 INFO L444 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-11-20 10:50:58,895 INFO L444 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2019-11-20 10:50:58,895 INFO L444 ceAbstractionStarter]: For program point L1497(lines 1497 1763) no Hoare annotation was computed. [2019-11-20 10:50:58,895 INFO L444 ceAbstractionStarter]: For program point L440(lines 440 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,895 INFO L444 ceAbstractionStarter]: For program point L573(lines 573 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,896 INFO L444 ceAbstractionStarter]: For program point L309(lines 309 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,896 INFO L444 ceAbstractionStarter]: For program point L1234(lines 1234 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,896 INFO L444 ceAbstractionStarter]: For program point L177-1(lines 23 1492) no Hoare annotation was computed. [2019-11-20 10:50:58,896 INFO L444 ceAbstractionStarter]: For program point L111-1(lines 23 1492) no Hoare annotation was computed. [2019-11-20 10:50:58,896 INFO L444 ceAbstractionStarter]: For program point L45-1(lines 23 1492) no Hoare annotation was computed. [2019-11-20 10:50:58,896 INFO L444 ceAbstractionStarter]: For program point L1036(lines 1036 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,896 INFO L444 ceAbstractionStarter]: For program point L706(lines 706 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,896 INFO L444 ceAbstractionStarter]: For program point L508(lines 508 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,896 INFO L444 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2019-11-20 10:50:58,896 INFO L444 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-11-20 10:50:58,896 INFO L444 ceAbstractionStarter]: For program point L1103(lines 1103 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,896 INFO L444 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-11-20 10:50:58,896 INFO L444 ceAbstractionStarter]: For program point L905(lines 905 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,897 INFO L440 ceAbstractionStarter]: At program point L1764(lines 1494 1765) the Hoare annotation is: (let ((.cse18 (+ ~a18~0 79)) (.cse4 (= ~a12~0 6)) (.cse15 (= ~a12~0 8))) (let ((.cse9 (= 5 ~a12~0)) (.cse14 (<= 69094 ~a18~0)) (.cse13 (<= ~a18~0 513056)) (.cse7 (not .cse15)) (.cse2 (<= ~a18~0 134)) (.cse16 (= 7 ~a12~0)) (.cse12 (not .cse4)) (.cse5 (<= ~a16~0 9)) (.cse3 (<= ~a16~0 11)) (.cse6 (<= .cse18 0)) (.cse17 (< 0 (+ ~a18~0 156))) (.cse10 (= 3 ~a15~0)) (.cse1 (= ~a15~0 4)) (.cse0 (= ~a16~0 8))) (or (and .cse0 .cse1 .cse2) (and .cse3 (<= 4 ~a15~0) .cse4) (and .cse1 .cse5 .cse6 .cse7) (let ((.cse8 (div (+ ~a18~0 (- 599175)) 3))) (and .cse1 .cse3 (<= (+ .cse8 79) 0) .cse9 (= 0 (mod ~a18~0 3)) (< 0 (+ .cse8 156)))) (and .cse10 (exists ((v_~a18~0_902 Int)) (let ((.cse11 (div (+ v_~a18~0_902 (- 599175)) 3))) (and (<= 0 (* 9 v_~a18~0_902)) (<= (+ ~a18~0 557770) (div (* v_~a18~0_902 9) 10)) (< 0 (+ .cse11 156)) (<= (+ .cse11 79) 0) (= 0 (mod v_~a18~0_902 3))))) .cse4) (and .cse1 .cse3 .cse9 .cse6) (and .cse3 .cse12 .cse10 .cse13 (not (= 10 ~a16~0))) (and .cse14 .cse10 .cse15) (and (<= 12 ~a16~0) .cse10 .cse7) (and .cse1 .cse14 .cse5 .cse16) (and .cse9 .cse10 .cse13) (and .cse1 .cse5 .cse6 .cse17) (and .cse1 .cse2 .cse5 .cse15 (< 0 .cse18)) (and (and .cse10 (< 134 ~a18~0) .cse4) .cse13) (and .cse0 .cse1 .cse14 .cse13 .cse7) (and .cse2 .cse10 .cse15) (and .cse1 .cse2 .cse5 .cse16) (and .cse12 .cse5 .cse10) (and .cse3 .cse10 .cse15) (and .cse10 .cse6 .cse17 .cse4) (and .cse0 .cse10) (and .cse1 .cse0 (not (= 3 ULTIMATE.start_calculate_output_~input)) (= ~a12~0 5))))) [2019-11-20 10:50:58,897 INFO L444 ceAbstractionStarter]: For program point L641(lines 641 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,897 INFO L444 ceAbstractionStarter]: For program point L1566(lines 1566 1763) no Hoare annotation was computed. [2019-11-20 10:50:58,897 INFO L444 ceAbstractionStarter]: For program point L443(lines 443 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,897 INFO L444 ceAbstractionStarter]: For program point L1434(lines 1434 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,897 INFO L444 ceAbstractionStarter]: For program point L840(lines 840 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,897 INFO L444 ceAbstractionStarter]: For program point L1699(lines 1699 1763) no Hoare annotation was computed. [2019-11-20 10:50:58,897 INFO L444 ceAbstractionStarter]: For program point L1633(lines 1633 1763) no Hoare annotation was computed. [2019-11-20 10:50:58,897 INFO L444 ceAbstractionStarter]: For program point L1303(lines 1303 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,897 INFO L444 ceAbstractionStarter]: For program point L246(lines 246 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,898 INFO L444 ceAbstractionStarter]: For program point L180-1(lines 23 1492) no Hoare annotation was computed. [2019-11-20 10:50:58,898 INFO L444 ceAbstractionStarter]: For program point L114-1(lines 23 1492) no Hoare annotation was computed. [2019-11-20 10:50:58,898 INFO L444 ceAbstractionStarter]: For program point L48-1(lines 23 1492) no Hoare annotation was computed. [2019-11-20 10:50:58,898 INFO L444 ceAbstractionStarter]: For program point L775(lines 775 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,898 INFO L444 ceAbstractionStarter]: For program point L1370(lines 1370 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,898 INFO L444 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-11-20 10:50:58,898 INFO L444 ceAbstractionStarter]: For program point L1172(lines 1172 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,898 INFO L444 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2019-11-20 10:50:58,899 INFO L444 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2019-11-20 10:50:58,899 INFO L444 ceAbstractionStarter]: For program point L974(lines 974 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,899 INFO L447 ceAbstractionStarter]: At program point L1767(lines 1767 1783) the Hoare annotation is: true [2019-11-20 10:50:58,899 INFO L444 ceAbstractionStarter]: For program point L578(lines 578 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,899 INFO L444 ceAbstractionStarter]: For program point L1503(lines 1503 1763) no Hoare annotation was computed. [2019-11-20 10:50:58,899 INFO L444 ceAbstractionStarter]: For program point L380(lines 380 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,899 INFO L444 ceAbstractionStarter]: For program point L315(lines 315 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,899 INFO L444 ceAbstractionStarter]: For program point L183-1(lines 23 1492) no Hoare annotation was computed. [2019-11-20 10:50:58,899 INFO L444 ceAbstractionStarter]: For program point L117-1(lines 23 1492) no Hoare annotation was computed. [2019-11-20 10:50:58,899 INFO L444 ceAbstractionStarter]: For program point L51-1(lines 23 1492) no Hoare annotation was computed. [2019-11-20 10:50:58,899 INFO L444 ceAbstractionStarter]: For program point L1042(lines 1042 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,899 INFO L444 ceAbstractionStarter]: For program point L778(lines 778 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,899 INFO L444 ceAbstractionStarter]: For program point L712(lines 712 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,899 INFO L444 ceAbstractionStarter]: For program point L1241(lines 1241 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,899 INFO L444 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-11-20 10:50:58,899 INFO L444 ceAbstractionStarter]: For program point L1175(lines 1175 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,900 INFO L444 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2019-11-20 10:50:58,900 INFO L444 ceAbstractionStarter]: For program point L1109(lines 1109 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,900 INFO L444 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2019-11-20 10:50:58,900 INFO L444 ceAbstractionStarter]: For program point L1704(lines 1704 1763) no Hoare annotation was computed. [2019-11-20 10:50:58,900 INFO L444 ceAbstractionStarter]: For program point L1638(lines 1638 1763) no Hoare annotation was computed. [2019-11-20 10:50:58,900 INFO L444 ceAbstractionStarter]: For program point L515(lines 515 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,900 INFO L444 ceAbstractionStarter]: For program point L449(lines 449 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,900 INFO L444 ceAbstractionStarter]: For program point L1440(lines 1440 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,900 INFO L444 ceAbstractionStarter]: For program point L912(lines 912 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,900 INFO L444 ceAbstractionStarter]: For program point L846(lines 846 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,900 INFO L444 ceAbstractionStarter]: For program point L648(lines 648 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,900 INFO L444 ceAbstractionStarter]: For program point L1573(lines 1573 1763) no Hoare annotation was computed. [2019-11-20 10:50:58,900 INFO L444 ceAbstractionStarter]: For program point L1375(lines 1375 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,901 INFO L444 ceAbstractionStarter]: For program point L1309(lines 1309 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,901 INFO L444 ceAbstractionStarter]: For program point L252(lines 252 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,901 INFO L444 ceAbstractionStarter]: For program point L186-1(lines 23 1492) no Hoare annotation was computed. [2019-11-20 10:50:58,901 INFO L444 ceAbstractionStarter]: For program point L120-1(lines 23 1492) no Hoare annotation was computed. [2019-11-20 10:50:58,901 INFO L444 ceAbstractionStarter]: For program point L54-1(lines 23 1492) no Hoare annotation was computed. [2019-11-20 10:50:58,901 INFO L444 ceAbstractionStarter]: For program point L979(lines 979 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,901 INFO L444 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2019-11-20 10:50:58,901 INFO L444 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-11-20 10:50:58,902 INFO L444 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2019-11-20 10:50:58,902 INFO L440 ceAbstractionStarter]: At program point L1773-2(lines 1773 1782) the Hoare annotation is: (let ((.cse18 (+ ~a18~0 79)) (.cse4 (= ~a12~0 6)) (.cse15 (= ~a12~0 8))) (let ((.cse9 (= 5 ~a12~0)) (.cse14 (<= 69094 ~a18~0)) (.cse7 (not .cse15)) (.cse12 (<= ~a18~0 513056)) (.cse1 (= ~a15~0 4)) (.cse2 (<= ~a18~0 134)) (.cse16 (= 7 ~a12~0)) (.cse13 (not .cse4)) (.cse5 (<= ~a16~0 9)) (.cse3 (<= ~a16~0 11)) (.cse6 (<= .cse18 0)) (.cse17 (< 0 (+ ~a18~0 156))) (.cse0 (= ~a16~0 8)) (.cse10 (= 3 ~a15~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 (<= 4 ~a15~0) .cse4) (and .cse1 .cse5 .cse6 .cse7) (let ((.cse8 (div (+ ~a18~0 (- 599175)) 3))) (and .cse1 .cse3 (<= (+ .cse8 79) 0) .cse9 (= 0 (mod ~a18~0 3)) (< 0 (+ .cse8 156)))) (and .cse10 (exists ((v_~a18~0_902 Int)) (let ((.cse11 (div (+ v_~a18~0_902 (- 599175)) 3))) (and (<= 0 (* 9 v_~a18~0_902)) (<= (+ ~a18~0 557770) (div (* v_~a18~0_902 9) 10)) (< 0 (+ .cse11 156)) (<= (+ .cse11 79) 0) (= 0 (mod v_~a18~0_902 3))))) .cse4) (and .cse1 .cse3 .cse9 .cse6) (and (and .cse9 .cse10) .cse12) (and .cse3 .cse13 .cse10 .cse12 (not (= 10 ~a16~0))) (and .cse14 .cse10 .cse15) (and .cse1 .cse0 (= ~a12~0 5)) (and (<= 12 ~a16~0) .cse10 .cse7) (and .cse1 .cse14 .cse5 .cse16) (and .cse1 .cse5 .cse6 .cse17) (and .cse1 .cse2 .cse5 .cse15 (< 0 .cse18)) (and .cse0 .cse1 .cse14 .cse12 .cse7) (and (and .cse10 (< 134 ~a18~0) .cse4) .cse12) (and .cse2 .cse10 .cse15) (and .cse1 .cse2 .cse5 .cse16) (and .cse13 .cse5 .cse10) (and .cse3 .cse10 .cse15) (and .cse10 .cse6 .cse17 .cse4) (and .cse0 .cse10)))) [2019-11-20 10:50:58,902 INFO L444 ceAbstractionStarter]: For program point L584(lines 584 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,902 INFO L444 ceAbstractionStarter]: For program point L386(lines 386 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,902 INFO L444 ceAbstractionStarter]: For program point L717(lines 717 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,902 INFO L444 ceAbstractionStarter]: For program point L1510(lines 1510 1763) no Hoare annotation was computed. [2019-11-20 10:50:58,902 INFO L444 ceAbstractionStarter]: For program point L321(lines 321 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,902 INFO L444 ceAbstractionStarter]: For program point L189-1(lines 23 1492) no Hoare annotation was computed. [2019-11-20 10:50:58,902 INFO L444 ceAbstractionStarter]: For program point L123-1(lines 23 1492) no Hoare annotation was computed. [2019-11-20 10:50:58,902 INFO L444 ceAbstractionStarter]: For program point L1114(lines 1114 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,902 INFO L444 ceAbstractionStarter]: For program point L57-1(lines 23 1492) no Hoare annotation was computed. [2019-11-20 10:50:58,903 INFO L444 ceAbstractionStarter]: For program point L1048(lines 1048 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,903 INFO L444 ceAbstractionStarter]: For program point L784(lines 784 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,903 INFO L444 ceAbstractionStarter]: For program point L1709(lines 1709 1763) no Hoare annotation was computed. [2019-11-20 10:50:58,903 INFO L444 ceAbstractionStarter]: For program point L454(lines 454 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,903 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-20 10:50:58,903 INFO L444 ceAbstractionStarter]: For program point L1247(lines 1247 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,903 INFO L444 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-11-20 10:50:58,903 INFO L444 ceAbstractionStarter]: For program point L1181(lines 1181 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,903 INFO L444 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2019-11-20 10:50:58,903 INFO L444 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2019-11-20 10:50:58,903 INFO L444 ceAbstractionStarter]: For program point L917(lines 917 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,903 INFO L444 ceAbstractionStarter]: For program point L851(lines 851 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,903 INFO L444 ceAbstractionStarter]: For program point L521(lines 521 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,903 INFO L444 ceAbstractionStarter]: For program point L1446(lines 1446 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,903 INFO L444 ceAbstractionStarter]: For program point L1314(lines 1314 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,904 INFO L444 ceAbstractionStarter]: For program point L257(lines 257 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,904 INFO L444 ceAbstractionStarter]: For program point L1645(lines 1645 1763) no Hoare annotation was computed. [2019-11-20 10:50:58,904 INFO L444 ceAbstractionStarter]: For program point L1579(lines 1579 1763) no Hoare annotation was computed. [2019-11-20 10:50:58,904 INFO L444 ceAbstractionStarter]: For program point L1381(lines 1381 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,904 INFO L444 ceAbstractionStarter]: For program point L192-1(lines 23 1492) no Hoare annotation was computed. [2019-11-20 10:50:58,904 INFO L444 ceAbstractionStarter]: For program point L126-1(lines 23 1492) no Hoare annotation was computed. [2019-11-20 10:50:58,904 INFO L444 ceAbstractionStarter]: For program point L60-1(lines 23 1492) no Hoare annotation was computed. [2019-11-20 10:50:58,904 INFO L444 ceAbstractionStarter]: For program point L1778(line 1778) no Hoare annotation was computed. [2019-11-20 10:50:58,904 INFO L444 ceAbstractionStarter]: For program point L655(lines 655 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,904 INFO L444 ceAbstractionStarter]: For program point L589(lines 589 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,904 INFO L444 ceAbstractionStarter]: For program point L457(lines 457 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,904 INFO L444 ceAbstractionStarter]: For program point L391(lines 391 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,904 INFO L444 ceAbstractionStarter]: For program point L1250(lines 1250 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,904 INFO L444 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2019-11-20 10:50:58,904 INFO L444 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2019-11-20 10:50:58,905 INFO L444 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2019-11-20 10:50:58,905 INFO L444 ceAbstractionStarter]: For program point L986(lines 986 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,905 INFO L444 ceAbstractionStarter]: For program point L1515(lines 1515 1763) no Hoare annotation was computed. [2019-11-20 10:50:58,905 INFO L444 ceAbstractionStarter]: For program point L1449(lines 1449 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,905 INFO L444 ceAbstractionStarter]: For program point L789(lines 789 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,905 INFO L444 ceAbstractionStarter]: For program point L723(lines 723 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,905 INFO L444 ceAbstractionStarter]: For program point L327(lines 327 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,905 INFO L444 ceAbstractionStarter]: For program point L195-1(lines 23 1492) no Hoare annotation was computed. [2019-11-20 10:50:58,906 INFO L444 ceAbstractionStarter]: For program point L129-1(lines 23 1492) no Hoare annotation was computed. [2019-11-20 10:50:58,906 INFO L444 ceAbstractionStarter]: For program point L1120(lines 1120 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,906 INFO L444 ceAbstractionStarter]: For program point L63-1(lines 23 1492) no Hoare annotation was computed. [2019-11-20 10:50:58,906 INFO L444 ceAbstractionStarter]: For program point L922(lines 922 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,906 INFO L444 ceAbstractionStarter]: For program point L1715(lines 1715 1763) no Hoare annotation was computed. [2019-11-20 10:50:58,906 INFO L444 ceAbstractionStarter]: For program point L262(lines 262 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,906 INFO L444 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2019-11-20 10:50:58,906 INFO L444 ceAbstractionStarter]: For program point L1187(lines 1187 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,907 INFO L444 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-11-20 10:50:58,907 INFO L444 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2019-11-20 10:50:58,907 INFO L444 ceAbstractionStarter]: For program point L1055(lines 1055 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,907 INFO L444 ceAbstractionStarter]: For program point L857(lines 857 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,907 INFO L444 ceAbstractionStarter]: For program point L527(lines 527 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,907 INFO L444 ceAbstractionStarter]: For program point L1386(lines 1386 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,907 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-20 10:50:58,907 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 166) no Hoare annotation was computed. [2019-11-20 10:50:58,907 INFO L444 ceAbstractionStarter]: For program point L1651(lines 1651 1763) no Hoare annotation was computed. [2019-11-20 10:50:58,908 INFO L444 ceAbstractionStarter]: For program point L594(lines 594 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,908 INFO L444 ceAbstractionStarter]: For program point L1585(lines 1585 1763) no Hoare annotation was computed. [2019-11-20 10:50:58,908 INFO L444 ceAbstractionStarter]: For program point L1321(lines 1321 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,908 INFO L444 ceAbstractionStarter]: For program point L198-1(lines 23 1492) no Hoare annotation was computed. [2019-11-20 10:50:58,908 INFO L444 ceAbstractionStarter]: For program point L132-1(lines 23 1492) no Hoare annotation was computed. [2019-11-20 10:50:58,908 INFO L444 ceAbstractionStarter]: For program point L66-1(lines 23 1492) no Hoare annotation was computed. [2019-11-20 10:50:58,908 INFO L444 ceAbstractionStarter]: For program point L661(lines 661 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,908 INFO L444 ceAbstractionStarter]: For program point L463(lines 463 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,908 INFO L444 ceAbstractionStarter]: For program point L1256(lines 1256 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,908 INFO L444 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2019-11-20 10:50:58,908 INFO L444 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2019-11-20 10:50:58,908 INFO L444 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2019-11-20 10:50:58,909 INFO L444 ceAbstractionStarter]: For program point L728(lines 728 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,909 INFO L444 ceAbstractionStarter]: For program point L1521(lines 1521 1763) no Hoare annotation was computed. [2019-11-20 10:50:58,909 INFO L444 ceAbstractionStarter]: For program point L398(lines 398 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,909 INFO L444 ceAbstractionStarter]: For program point L1125(lines 1125 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,909 INFO L444 ceAbstractionStarter]: For program point L993(lines 993 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,909 INFO L444 ceAbstractionStarter]: For program point L1456(lines 1456 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,909 INFO L444 ceAbstractionStarter]: For program point L333(lines 333 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,909 INFO L444 ceAbstractionStarter]: For program point L201-1(lines 23 1492) no Hoare annotation was computed. [2019-11-20 10:50:58,909 INFO L444 ceAbstractionStarter]: For program point L135-1(lines 23 1492) no Hoare annotation was computed. [2019-11-20 10:50:58,909 INFO L444 ceAbstractionStarter]: For program point L69-1(lines 23 1492) no Hoare annotation was computed. [2019-11-20 10:50:58,909 INFO L444 ceAbstractionStarter]: For program point L796(lines 796 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,909 INFO L444 ceAbstractionStarter]: For program point L1721(lines 1721 1763) no Hoare annotation was computed. [2019-11-20 10:50:58,909 INFO L444 ceAbstractionStarter]: For program point L664(lines 664 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,909 INFO L444 ceAbstractionStarter]: For program point L268(lines 268 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,909 INFO L444 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2019-11-20 10:50:58,910 INFO L444 ceAbstractionStarter]: For program point L1193(lines 1193 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,910 INFO L444 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-11-20 10:50:58,910 INFO L444 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2019-11-20 10:50:58,910 INFO L444 ceAbstractionStarter]: For program point L1061(lines 1061 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,910 INFO L444 ceAbstractionStarter]: For program point L929(lines 929 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,910 INFO L444 ceAbstractionStarter]: For program point L863(lines 863 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,910 INFO L444 ceAbstractionStarter]: For program point L1656(lines 1656 1763) no Hoare annotation was computed. [2019-11-20 10:50:58,910 INFO L444 ceAbstractionStarter]: For program point L533(lines 533 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,910 INFO L444 ceAbstractionStarter]: For program point L1392(lines 1392 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,910 INFO L444 ceAbstractionStarter]: For program point L600(lines 600 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,910 INFO L444 ceAbstractionStarter]: For program point L1591(lines 1591 1763) no Hoare annotation was computed. [2019-11-20 10:50:58,910 INFO L444 ceAbstractionStarter]: For program point L1327(lines 1327 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,910 INFO L444 ceAbstractionStarter]: For program point L204-1(lines 23 1492) no Hoare annotation was computed. [2019-11-20 10:50:58,910 INFO L444 ceAbstractionStarter]: For program point L138-1(lines 23 1492) no Hoare annotation was computed. [2019-11-20 10:50:58,910 INFO L444 ceAbstractionStarter]: For program point L72-1(lines 23 1492) no Hoare annotation was computed. [2019-11-20 10:50:58,910 INFO L444 ceAbstractionStarter]: For program point L469(lines 469 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,911 INFO L444 ceAbstractionStarter]: For program point L1262(lines 1262 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,911 INFO L444 ceAbstractionStarter]: For program point L205(line 205) no Hoare annotation was computed. [2019-11-20 10:50:58,911 INFO L444 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2019-11-20 10:50:58,911 INFO L444 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2019-11-20 10:50:58,911 INFO L444 ceAbstractionStarter]: For program point L734(lines 734 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,911 INFO L444 ceAbstractionStarter]: For program point L1527(lines 1527 1763) no Hoare annotation was computed. [2019-11-20 10:50:58,911 INFO L444 ceAbstractionStarter]: For program point L1461(lines 1461 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,911 INFO L444 ceAbstractionStarter]: For program point L404(lines 404 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,911 INFO L444 ceAbstractionStarter]: For program point L338(lines 338 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,911 INFO L444 ceAbstractionStarter]: For program point L1131(lines 1131 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,911 INFO L444 ceAbstractionStarter]: For program point L999(lines 999 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,912 INFO L444 ceAbstractionStarter]: For program point L141-1(lines 23 1492) no Hoare annotation was computed. [2019-11-20 10:50:58,912 INFO L444 ceAbstractionStarter]: For program point L75-1(lines 23 1492) no Hoare annotation was computed. [2019-11-20 10:50:58,912 INFO L444 ceAbstractionStarter]: For program point L802(lines 802 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,912 INFO L444 ceAbstractionStarter]: For program point L1727(lines 1727 1763) no Hoare annotation was computed. [2019-11-20 10:50:58,912 INFO L444 ceAbstractionStarter]: For program point L670(lines 670 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,912 INFO L444 ceAbstractionStarter]: For program point L538(lines 538 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,912 INFO L444 ceAbstractionStarter]: For program point L1397(lines 1397 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,913 INFO L444 ceAbstractionStarter]: For program point L274(lines 274 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,913 INFO L444 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2019-11-20 10:50:58,913 INFO L444 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2019-11-20 10:50:58,913 INFO L444 ceAbstractionStarter]: For program point L1067(lines 1067 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,913 INFO L444 ceAbstractionStarter]: For program point L935(lines 935 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,913 INFO L444 ceAbstractionStarter]: For program point L869(lines 869 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,914 INFO L444 ceAbstractionStarter]: For program point L1200(lines 1200 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,914 INFO L444 ceAbstractionStarter]: For program point L1663(lines 1663 1763) no Hoare annotation was computed. [2019-11-20 10:50:58,914 INFO L444 ceAbstractionStarter]: For program point L606(lines 606 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,914 INFO L444 ceAbstractionStarter]: For program point L1597(lines 1597 1763) no Hoare annotation was computed. [2019-11-20 10:50:58,914 INFO L444 ceAbstractionStarter]: For program point L1267(lines 1267 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,914 INFO L444 ceAbstractionStarter]: For program point L144-1(lines 23 1492) no Hoare annotation was computed. [2019-11-20 10:50:58,914 INFO L444 ceAbstractionStarter]: For program point L78-1(lines 23 1492) no Hoare annotation was computed. [2019-11-20 10:50:58,915 INFO L444 ceAbstractionStarter]: For program point L1466(lines 1466 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,915 INFO L444 ceAbstractionStarter]: For program point L1334(lines 1334 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,915 INFO L444 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2019-11-20 10:50:58,915 INFO L444 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-11-20 10:50:58,915 INFO L444 ceAbstractionStarter]: For program point L476(lines 476 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,915 INFO L444 ceAbstractionStarter]: For program point L1137(lines 1137 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,915 INFO L444 ceAbstractionStarter]: For program point L1005(lines 1005 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,915 INFO L444 ceAbstractionStarter]: For program point L741(lines 741 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,915 INFO L444 ceAbstractionStarter]: For program point L543(lines 543 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,916 INFO L444 ceAbstractionStarter]: For program point L1534(lines 1534 1763) no Hoare annotation was computed. [2019-11-20 10:50:58,916 INFO L444 ceAbstractionStarter]: For program point L411(lines 411 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,916 INFO L444 ceAbstractionStarter]: For program point L345(lines 345 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,916 INFO L444 ceAbstractionStarter]: For program point L279(lines 279 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,916 INFO L444 ceAbstractionStarter]: For program point L213(lines 213 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,916 INFO L444 ceAbstractionStarter]: For program point L147-1(lines 23 1492) no Hoare annotation was computed. [2019-11-20 10:50:58,916 INFO L444 ceAbstractionStarter]: For program point L81-1(lines 23 1492) no Hoare annotation was computed. [2019-11-20 10:50:58,916 INFO L444 ceAbstractionStarter]: For program point L808(lines 808 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,916 INFO L444 ceAbstractionStarter]: For program point L1733(lines 1733 1763) no Hoare annotation was computed. [2019-11-20 10:50:58,916 INFO L444 ceAbstractionStarter]: For program point L1403(lines 1403 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,916 INFO L444 ceAbstractionStarter]: For program point L1205(lines 1205 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,916 INFO L444 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-11-20 10:50:58,916 INFO L444 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2019-11-20 10:50:58,916 INFO L444 ceAbstractionStarter]: For program point L1073(lines 1073 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,916 INFO L444 ceAbstractionStarter]: For program point L875(lines 875 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,917 INFO L444 ceAbstractionStarter]: For program point L677(lines 677 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,917 INFO L444 ceAbstractionStarter]: For program point L942(lines 942 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,917 INFO L444 ceAbstractionStarter]: For program point L1669(lines 1669 1763) no Hoare annotation was computed. [2019-11-20 10:50:58,917 INFO L444 ceAbstractionStarter]: For program point L612(lines 612 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,917 INFO L444 ceAbstractionStarter]: For program point L1603(lines 1603 1763) no Hoare annotation was computed. [2019-11-20 10:50:58,917 INFO L444 ceAbstractionStarter]: For program point L150-1(lines 23 1492) no Hoare annotation was computed. [2019-11-20 10:50:58,917 INFO L444 ceAbstractionStarter]: For program point L84-1(lines 23 1492) no Hoare annotation was computed. [2019-11-20 10:50:58,917 INFO L444 ceAbstractionStarter]: For program point L1472(lines 1472 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,917 INFO L444 ceAbstractionStarter]: For program point L1274(lines 1274 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,917 INFO L444 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2019-11-20 10:50:58,917 INFO L444 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2019-11-20 10:50:58,917 INFO L444 ceAbstractionStarter]: For program point L746(lines 746 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,917 INFO L444 ceAbstractionStarter]: For program point L680(lines 680 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,917 INFO L444 ceAbstractionStarter]: For program point L548(lines 548 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,917 INFO L444 ceAbstractionStarter]: For program point L350(lines 350 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,918 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-20 10:50:58,918 INFO L444 ceAbstractionStarter]: For program point L1341(lines 1341 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,918 INFO L444 ceAbstractionStarter]: For program point L218(lines 218 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,918 INFO L444 ceAbstractionStarter]: For program point L1143(lines 1143 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,918 INFO L444 ceAbstractionStarter]: For program point L1011(lines 1011 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,918 INFO L444 ceAbstractionStarter]: For program point L1540(lines 1540 1763) no Hoare annotation was computed. [2019-11-20 10:50:58,918 INFO L444 ceAbstractionStarter]: For program point L483(lines 483 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,918 INFO L444 ceAbstractionStarter]: For program point L417(lines 417 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,918 INFO L444 ceAbstractionStarter]: For program point L285(lines 285 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,918 INFO L444 ceAbstractionStarter]: For program point L153-1(lines 23 1492) no Hoare annotation was computed. [2019-11-20 10:50:58,918 INFO L444 ceAbstractionStarter]: For program point L87-1(lines 23 1492) no Hoare annotation was computed. [2019-11-20 10:50:58,918 INFO L444 ceAbstractionStarter]: For program point L1739(lines 1739 1763) no Hoare annotation was computed. [2019-11-20 10:50:58,918 INFO L444 ceAbstractionStarter]: For program point L1409(lines 1409 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,918 INFO L444 ceAbstractionStarter]: For program point L1211(lines 1211 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,918 INFO L444 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-11-20 10:50:58,919 INFO L444 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2019-11-20 10:50:58,919 INFO L444 ceAbstractionStarter]: For program point L1079(lines 1079 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,919 INFO L444 ceAbstractionStarter]: For program point L815(lines 815 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,919 INFO L444 ceAbstractionStarter]: For program point L948(lines 948 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,919 INFO L444 ceAbstractionStarter]: For program point L882(lines 882 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,919 INFO L444 ceAbstractionStarter]: For program point L1675(lines 1675 1763) no Hoare annotation was computed. [2019-11-20 10:50:58,919 INFO L444 ceAbstractionStarter]: For program point L618(lines 618 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,919 INFO L444 ceAbstractionStarter]: For program point L1609(lines 1609 1763) no Hoare annotation was computed. [2019-11-20 10:50:58,919 INFO L444 ceAbstractionStarter]: For program point L1477(lines 1477 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,919 INFO L444 ceAbstractionStarter]: For program point L156-1(lines 23 1492) no Hoare annotation was computed. [2019-11-20 10:50:58,919 INFO L444 ceAbstractionStarter]: For program point L90-1(lines 23 1492) no Hoare annotation was computed. [2019-11-20 10:50:58,919 INFO L444 ceAbstractionStarter]: For program point L24(lines 24 26) no Hoare annotation was computed. [2019-11-20 10:50:58,919 INFO L444 ceAbstractionStarter]: For program point L24-2(lines 23 1492) no Hoare annotation was computed. [2019-11-20 10:50:58,919 INFO L444 ceAbstractionStarter]: For program point L1280(lines 1280 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,919 INFO L444 ceAbstractionStarter]: For program point L223(lines 223 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,920 INFO L444 ceAbstractionStarter]: For program point L1214(lines 1214 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,920 INFO L444 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2019-11-20 10:50:58,920 INFO L444 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2019-11-20 10:50:58,920 INFO L444 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2019-11-20 10:50:58,920 INFO L444 ceAbstractionStarter]: For program point L752(lines 752 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,920 INFO L444 ceAbstractionStarter]: For program point L686(lines 686 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,920 INFO L444 ceAbstractionStarter]: For program point L554(lines 554 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,920 INFO L444 ceAbstractionStarter]: For program point L356(lines 356 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,920 INFO L444 ceAbstractionStarter]: For program point L1347(lines 1347 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,920 INFO L444 ceAbstractionStarter]: For program point L290(lines 290 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,920 INFO L444 ceAbstractionStarter]: For program point L1149(lines 1149 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,920 INFO L444 ceAbstractionStarter]: For program point L1546(lines 1546 1763) no Hoare annotation was computed. [2019-11-20 10:50:58,920 INFO L444 ceAbstractionStarter]: For program point L489(lines 489 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,920 INFO L444 ceAbstractionStarter]: For program point L159-1(lines 23 1492) no Hoare annotation was computed. [2019-11-20 10:50:58,920 INFO L444 ceAbstractionStarter]: For program point L93-1(lines 23 1492) no Hoare annotation was computed. [2019-11-20 10:50:58,921 INFO L444 ceAbstractionStarter]: For program point L27-1(lines 23 1492) no Hoare annotation was computed. [2019-11-20 10:50:58,921 INFO L444 ceAbstractionStarter]: For program point L1018(lines 1018 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,921 INFO L444 ceAbstractionStarter]: For program point L424(lines 424 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,921 INFO L444 ceAbstractionStarter]: For program point L1415(lines 1415 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,921 INFO L444 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2019-11-20 10:50:58,921 INFO L444 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2019-11-20 10:50:58,921 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-20 10:50:58,921 INFO L444 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-11-20 10:50:58,921 INFO L444 ceAbstractionStarter]: For program point L1746(lines 1746 1763) no Hoare annotation was computed. [2019-11-20 10:50:58,921 INFO L444 ceAbstractionStarter]: For program point L1086(lines 1086 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,921 INFO L444 ceAbstractionStarter]: For program point L954(lines 954 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,921 INFO L444 ceAbstractionStarter]: For program point L888(lines 888 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,921 INFO L444 ceAbstractionStarter]: For program point L822(lines 822 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,921 INFO L444 ceAbstractionStarter]: For program point L624(lines 624 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,921 INFO L444 ceAbstractionStarter]: For program point L162-1(lines 23 1492) no Hoare annotation was computed. [2019-11-20 10:50:58,921 INFO L444 ceAbstractionStarter]: For program point L96-1(lines 23 1492) no Hoare annotation was computed. [2019-11-20 10:50:58,922 INFO L444 ceAbstractionStarter]: For program point L30-1(lines 23 1492) no Hoare annotation was computed. [2019-11-20 10:50:58,922 INFO L444 ceAbstractionStarter]: For program point L691(lines 691 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,922 INFO L444 ceAbstractionStarter]: For program point L1682(lines 1682 1763) no Hoare annotation was computed. [2019-11-20 10:50:58,922 INFO L444 ceAbstractionStarter]: For program point L1616(lines 1616 1763) no Hoare annotation was computed. [2019-11-20 10:50:58,922 INFO L444 ceAbstractionStarter]: For program point L1484(lines 1484 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,922 INFO L444 ceAbstractionStarter]: For program point L427(lines 427 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,922 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,922 INFO L444 ceAbstractionStarter]: For program point L1286(lines 1286 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,922 INFO L444 ceAbstractionStarter]: For program point L229(lines 229 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,922 INFO L444 ceAbstractionStarter]: For program point L1220(lines 1220 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,922 INFO L444 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2019-11-20 10:50:58,922 INFO L444 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2019-11-20 10:50:58,923 INFO L444 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2019-11-20 10:50:58,923 INFO L444 ceAbstractionStarter]: For program point L758(lines 758 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,923 INFO L444 ceAbstractionStarter]: For program point L560(lines 560 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,923 INFO L444 ceAbstractionStarter]: For program point L1353(lines 1353 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,923 INFO L444 ceAbstractionStarter]: For program point L1155(lines 1155 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,923 INFO L444 ceAbstractionStarter]: For program point L495(lines 495 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,923 INFO L444 ceAbstractionStarter]: For program point L297(lines 297 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,923 INFO L444 ceAbstractionStarter]: For program point L165-1(lines 23 1492) no Hoare annotation was computed. [2019-11-20 10:50:58,923 INFO L444 ceAbstractionStarter]: For program point L99-1(lines 23 1492) no Hoare annotation was computed. [2019-11-20 10:50:58,923 INFO L444 ceAbstractionStarter]: For program point L33-1(lines 23 1492) no Hoare annotation was computed. [2019-11-20 10:50:58,923 INFO L444 ceAbstractionStarter]: For program point L1553(lines 1553 1763) no Hoare annotation was computed. [2019-11-20 10:50:58,923 INFO L444 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2019-11-20 10:50:58,923 INFO L444 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-11-20 10:50:58,923 INFO L444 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-11-20 10:50:58,923 INFO L444 ceAbstractionStarter]: For program point L1025(lines 1025 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,924 INFO L444 ceAbstractionStarter]: For program point L1752(lines 1752 1763) no Hoare annotation was computed. [2019-11-20 10:50:58,924 INFO L444 ceAbstractionStarter]: For program point L1422(lines 1422 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,924 INFO L444 ceAbstractionStarter]: For program point L1092(lines 1092 1490) no Hoare annotation was computed. [2019-11-20 10:50:58,933 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] [2019-11-20 10:50:58,934 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] [2019-11-20 10:50:58,935 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] [2019-11-20 10:50:58,935 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] [2019-11-20 10:50:58,935 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] [2019-11-20 10:50:58,947 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] [2019-11-20 10:50:58,947 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] [2019-11-20 10:50:58,947 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] [2019-11-20 10:50:58,948 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] [2019-11-20 10:50:58,948 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] [2019-11-20 10:50:58,952 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] [2019-11-20 10:50:58,952 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] [2019-11-20 10:50:58,953 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] [2019-11-20 10:50:58,953 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] [2019-11-20 10:50:58,954 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] [2019-11-20 10:50:58,956 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] [2019-11-20 10:50:58,957 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] [2019-11-20 10:50:58,957 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] [2019-11-20 10:50:58,957 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] [2019-11-20 10:50:58,958 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] [2019-11-20 10:50:58,961 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] [2019-11-20 10:50:58,961 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] [2019-11-20 10:50:58,962 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] [2019-11-20 10:50:58,962 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] [2019-11-20 10:50:58,962 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] [2019-11-20 10:50:58,965 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] [2019-11-20 10:50:58,965 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] [2019-11-20 10:50:58,966 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] [2019-11-20 10:50:58,966 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] [2019-11-20 10:50:58,967 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] [2019-11-20 10:50:58,970 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 10:50:58 BoogieIcfgContainer [2019-11-20 10:50:58,971 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 10:50:58,971 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 10:50:58,971 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 10:50:58,971 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 10:50:58,972 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:48:29" (3/4) ... [2019-11-20 10:50:58,976 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-20 10:50:59,017 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-11-20 10:50:59,020 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-20 10:50:59,053 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((a16 == 8 && a15 == 4) && a18 <= 134) || ((a16 <= 11 && 4 <= a15) && a12 == 6)) || (((a15 == 4 && a16 <= 9) && a18 + 79 <= 0) && !(a12 == 8))) || (((((a15 == 4 && a16 <= 11) && (a18 + -599175) / 3 + 79 <= 0) && 5 == a12) && 0 == a18 % 3) && 0 < (a18 + -599175) / 3 + 156)) || ((3 == a15 && (\exists v_~a18~0_902 : int :: (((0 <= 9 * v_~a18~0_902 && a18 + 557770 <= v_~a18~0_902 * 9 / 10) && 0 < (v_~a18~0_902 + -599175) / 3 + 156) && (v_~a18~0_902 + -599175) / 3 + 79 <= 0) && 0 == v_~a18~0_902 % 3)) && a12 == 6)) || (((a15 == 4 && a16 <= 11) && 5 == a12) && a18 + 79 <= 0)) || ((5 == a12 && 3 == a15) && a18 <= 513056)) || ((((a16 <= 11 && !(a12 == 6)) && 3 == a15) && a18 <= 513056) && !(10 == a16))) || ((69094 <= a18 && 3 == a15) && a12 == 8)) || ((a15 == 4 && a16 == 8) && a12 == 5)) || ((12 <= a16 && 3 == a15) && !(a12 == 8))) || (((a15 == 4 && 69094 <= a18) && a16 <= 9) && 7 == a12)) || (((a15 == 4 && a16 <= 9) && a18 + 79 <= 0) && 0 < a18 + 156)) || ((((a15 == 4 && a18 <= 134) && a16 <= 9) && a12 == 8) && 0 < a18 + 79)) || ((((a16 == 8 && a15 == 4) && 69094 <= a18) && a18 <= 513056) && !(a12 == 8))) || (((3 == a15 && 134 < a18) && a12 == 6) && a18 <= 513056)) || ((a18 <= 134 && 3 == a15) && a12 == 8)) || (((a15 == 4 && a18 <= 134) && a16 <= 9) && 7 == a12)) || ((!(a12 == 6) && a16 <= 9) && 3 == a15)) || ((a16 <= 11 && 3 == a15) && a12 == 8)) || (((3 == a15 && a18 + 79 <= 0) && 0 < a18 + 156) && a12 == 6)) || (a16 == 8 && 3 == a15) [2019-11-20 10:50:59,056 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((a16 == 8 && a15 == 4) && a18 <= 134) || ((a16 <= 11 && 4 <= a15) && a12 == 6)) || (((a15 == 4 && a16 <= 9) && a18 + 79 <= 0) && !(a12 == 8))) || (((((a15 == 4 && a16 <= 11) && (a18 + -599175) / 3 + 79 <= 0) && 5 == a12) && 0 == a18 % 3) && 0 < (a18 + -599175) / 3 + 156)) || ((3 == a15 && (\exists v_~a18~0_902 : int :: (((0 <= 9 * v_~a18~0_902 && a18 + 557770 <= v_~a18~0_902 * 9 / 10) && 0 < (v_~a18~0_902 + -599175) / 3 + 156) && (v_~a18~0_902 + -599175) / 3 + 79 <= 0) && 0 == v_~a18~0_902 % 3)) && a12 == 6)) || (((a15 == 4 && a16 <= 11) && 5 == a12) && a18 + 79 <= 0)) || ((5 == a12 && 3 == a15) && a18 <= 513056)) || ((((a16 <= 11 && !(a12 == 6)) && 3 == a15) && a18 <= 513056) && !(10 == a16))) || ((69094 <= a18 && 3 == a15) && a12 == 8)) || ((a15 == 4 && a16 == 8) && a12 == 5)) || ((12 <= a16 && 3 == a15) && !(a12 == 8))) || (((a15 == 4 && 69094 <= a18) && a16 <= 9) && 7 == a12)) || (((a15 == 4 && a16 <= 9) && a18 + 79 <= 0) && 0 < a18 + 156)) || ((((a15 == 4 && a18 <= 134) && a16 <= 9) && a12 == 8) && 0 < a18 + 79)) || ((((a16 == 8 && a15 == 4) && 69094 <= a18) && a18 <= 513056) && !(a12 == 8))) || (((3 == a15 && 134 < a18) && a12 == 6) && a18 <= 513056)) || ((a18 <= 134 && 3 == a15) && a12 == 8)) || (((a15 == 4 && a18 <= 134) && a16 <= 9) && 7 == a12)) || ((!(a12 == 6) && a16 <= 9) && 3 == a15)) || ((a16 <= 11 && 3 == a15) && a12 == 8)) || (((3 == a15 && a18 + 79 <= 0) && 0 < a18 + 156) && a12 == 6)) || (a16 == 8 && 3 == a15) [2019-11-20 10:50:59,067 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((a16 == 8 && a15 == 4) && a18 <= 134) || ((a16 <= 11 && 4 <= a15) && a12 == 6)) || (((a15 == 4 && a16 <= 9) && a18 + 79 <= 0) && !(a12 == 8))) || (((((a15 == 4 && a16 <= 11) && (a18 + -599175) / 3 + 79 <= 0) && 5 == a12) && 0 == a18 % 3) && 0 < (a18 + -599175) / 3 + 156)) || ((3 == a15 && (\exists v_~a18~0_902 : int :: (((0 <= 9 * v_~a18~0_902 && a18 + 557770 <= v_~a18~0_902 * 9 / 10) && 0 < (v_~a18~0_902 + -599175) / 3 + 156) && (v_~a18~0_902 + -599175) / 3 + 79 <= 0) && 0 == v_~a18~0_902 % 3)) && a12 == 6)) || (((a15 == 4 && a16 <= 11) && 5 == a12) && a18 + 79 <= 0)) || ((((a16 <= 11 && !(a12 == 6)) && 3 == a15) && a18 <= 513056) && !(10 == a16))) || ((69094 <= a18 && 3 == a15) && a12 == 8)) || ((12 <= a16 && 3 == a15) && !(a12 == 8))) || (((a15 == 4 && 69094 <= a18) && a16 <= 9) && 7 == a12)) || ((5 == a12 && 3 == a15) && a18 <= 513056)) || (((a15 == 4 && a16 <= 9) && a18 + 79 <= 0) && 0 < a18 + 156)) || ((((a15 == 4 && a18 <= 134) && a16 <= 9) && a12 == 8) && 0 < a18 + 79)) || (((3 == a15 && 134 < a18) && a12 == 6) && a18 <= 513056)) || ((((a16 == 8 && a15 == 4) && 69094 <= a18) && a18 <= 513056) && !(a12 == 8))) || ((a18 <= 134 && 3 == a15) && a12 == 8)) || (((a15 == 4 && a18 <= 134) && a16 <= 9) && 7 == a12)) || ((!(a12 == 6) && a16 <= 9) && 3 == a15)) || ((a16 <= 11 && 3 == a15) && a12 == 8)) || (((3 == a15 && a18 + 79 <= 0) && 0 < a18 + 156) && a12 == 6)) || (a16 == 8 && 3 == a15)) || (((a15 == 4 && a16 == 8) && !(3 == input)) && a12 == 5) [2019-11-20 10:50:59,265 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_f8e86599-d75f-4aa5-acaf-294dd855a6fb/bin/uautomizer/witness.graphml [2019-11-20 10:50:59,265 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 10:50:59,266 INFO L168 Benchmark]: Toolchain (without parser) took 153924.12 ms. Allocated memory was 1.0 GB in the beginning and 5.0 GB in the end (delta: 3.9 GB). Free memory was 943.4 MB in the beginning and 1.5 GB in the end (delta: -523.6 MB). Peak memory consumption was 3.4 GB. Max. memory is 11.5 GB. [2019-11-20 10:50:59,267 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 10:50:59,267 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1156.26 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.5 MB). Free memory was 943.4 MB in the beginning and 1.0 GB in the end (delta: -105.8 MB). Peak memory consumption was 30.6 MB. Max. memory is 11.5 GB. [2019-11-20 10:50:59,267 INFO L168 Benchmark]: Boogie Procedure Inliner took 179.43 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 21.3 MB). Peak memory consumption was 21.3 MB. Max. memory is 11.5 GB. [2019-11-20 10:50:59,268 INFO L168 Benchmark]: Boogie Preprocessor took 109.85 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 14.2 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. [2019-11-20 10:50:59,268 INFO L168 Benchmark]: RCFGBuilder took 2884.87 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 136.3 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -187.1 MB). Peak memory consumption was 276.5 MB. Max. memory is 11.5 GB. [2019-11-20 10:50:59,269 INFO L168 Benchmark]: TraceAbstraction took 149295.54 ms. Allocated memory was 1.3 GB in the beginning and 5.0 GB in the end (delta: 3.7 GB). Free memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: -374.3 MB). Peak memory consumption was 3.3 GB. Max. memory is 11.5 GB. [2019-11-20 10:50:59,269 INFO L168 Benchmark]: Witness Printer took 294.05 ms. Allocated memory is still 5.0 GB. Free memory was 1.6 GB in the beginning and 1.5 GB in the end (delta: 108.0 MB). Peak memory consumption was 108.0 MB. Max. memory is 11.5 GB. [2019-11-20 10:50:59,271 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.25 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1156.26 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.5 MB). Free memory was 943.4 MB in the beginning and 1.0 GB in the end (delta: -105.8 MB). Peak memory consumption was 30.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 179.43 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 21.3 MB). Peak memory consumption was 21.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 109.85 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 14.2 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2884.87 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 136.3 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -187.1 MB). Peak memory consumption was 276.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 149295.54 ms. Allocated memory was 1.3 GB in the beginning and 5.0 GB in the end (delta: 3.7 GB). Free memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: -374.3 MB). Peak memory consumption was 3.3 GB. Max. memory is 11.5 GB. * Witness Printer took 294.05 ms. Allocated memory is still 5.0 GB. Free memory was 1.6 GB in the beginning and 1.5 GB in the end (delta: 108.0 MB). Peak memory consumption was 108.0 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_~a18~0_902,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 166]: 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: 23]: Loop Invariant [2019-11-20 10:50:59,282 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] [2019-11-20 10:50:59,282 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] [2019-11-20 10:50:59,282 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] [2019-11-20 10:50:59,283 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] [2019-11-20 10:50:59,283 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] [2019-11-20 10:50:59,290 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] [2019-11-20 10:50:59,290 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] [2019-11-20 10:50:59,291 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] [2019-11-20 10:50:59,291 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] [2019-11-20 10:50:59,291 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((a16 == 8 && a15 == 4) && a18 <= 134) || ((a16 <= 11 && 4 <= a15) && a12 == 6)) || (((a15 == 4 && a16 <= 9) && a18 + 79 <= 0) && !(a12 == 8))) || (((((a15 == 4 && a16 <= 11) && (a18 + -599175) / 3 + 79 <= 0) && 5 == a12) && 0 == a18 % 3) && 0 < (a18 + -599175) / 3 + 156)) || ((3 == a15 && (\exists v_~a18~0_902 : int :: (((0 <= 9 * v_~a18~0_902 && a18 + 557770 <= v_~a18~0_902 * 9 / 10) && 0 < (v_~a18~0_902 + -599175) / 3 + 156) && (v_~a18~0_902 + -599175) / 3 + 79 <= 0) && 0 == v_~a18~0_902 % 3)) && a12 == 6)) || (((a15 == 4 && a16 <= 11) && 5 == a12) && a18 + 79 <= 0)) || ((5 == a12 && 3 == a15) && a18 <= 513056)) || ((((a16 <= 11 && !(a12 == 6)) && 3 == a15) && a18 <= 513056) && !(10 == a16))) || ((69094 <= a18 && 3 == a15) && a12 == 8)) || ((a15 == 4 && a16 == 8) && a12 == 5)) || ((12 <= a16 && 3 == a15) && !(a12 == 8))) || (((a15 == 4 && 69094 <= a18) && a16 <= 9) && 7 == a12)) || (((a15 == 4 && a16 <= 9) && a18 + 79 <= 0) && 0 < a18 + 156)) || ((((a15 == 4 && a18 <= 134) && a16 <= 9) && a12 == 8) && 0 < a18 + 79)) || ((((a16 == 8 && a15 == 4) && 69094 <= a18) && a18 <= 513056) && !(a12 == 8))) || (((3 == a15 && 134 < a18) && a12 == 6) && a18 <= 513056)) || ((a18 <= 134 && 3 == a15) && a12 == 8)) || (((a15 == 4 && a18 <= 134) && a16 <= 9) && 7 == a12)) || ((!(a12 == 6) && a16 <= 9) && 3 == a15)) || ((a16 <= 11 && 3 == a15) && a12 == 8)) || (((3 == a15 && a18 + 79 <= 0) && 0 < a18 + 156) && a12 == 6)) || (a16 == 8 && 3 == a15) - InvariantResult [Line: 1494]: Loop Invariant [2019-11-20 10:50:59,299 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] [2019-11-20 10:50:59,300 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] [2019-11-20 10:50:59,300 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] [2019-11-20 10:50:59,300 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] [2019-11-20 10:50:59,301 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] [2019-11-20 10:50:59,302 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] [2019-11-20 10:50:59,303 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] [2019-11-20 10:50:59,303 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] [2019-11-20 10:50:59,303 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] [2019-11-20 10:50:59,304 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((a16 == 8 && a15 == 4) && a18 <= 134) || ((a16 <= 11 && 4 <= a15) && a12 == 6)) || (((a15 == 4 && a16 <= 9) && a18 + 79 <= 0) && !(a12 == 8))) || (((((a15 == 4 && a16 <= 11) && (a18 + -599175) / 3 + 79 <= 0) && 5 == a12) && 0 == a18 % 3) && 0 < (a18 + -599175) / 3 + 156)) || ((3 == a15 && (\exists v_~a18~0_902 : int :: (((0 <= 9 * v_~a18~0_902 && a18 + 557770 <= v_~a18~0_902 * 9 / 10) && 0 < (v_~a18~0_902 + -599175) / 3 + 156) && (v_~a18~0_902 + -599175) / 3 + 79 <= 0) && 0 == v_~a18~0_902 % 3)) && a12 == 6)) || (((a15 == 4 && a16 <= 11) && 5 == a12) && a18 + 79 <= 0)) || ((((a16 <= 11 && !(a12 == 6)) && 3 == a15) && a18 <= 513056) && !(10 == a16))) || ((69094 <= a18 && 3 == a15) && a12 == 8)) || ((12 <= a16 && 3 == a15) && !(a12 == 8))) || (((a15 == 4 && 69094 <= a18) && a16 <= 9) && 7 == a12)) || ((5 == a12 && 3 == a15) && a18 <= 513056)) || (((a15 == 4 && a16 <= 9) && a18 + 79 <= 0) && 0 < a18 + 156)) || ((((a15 == 4 && a18 <= 134) && a16 <= 9) && a12 == 8) && 0 < a18 + 79)) || (((3 == a15 && 134 < a18) && a12 == 6) && a18 <= 513056)) || ((((a16 == 8 && a15 == 4) && 69094 <= a18) && a18 <= 513056) && !(a12 == 8))) || ((a18 <= 134 && 3 == a15) && a12 == 8)) || (((a15 == 4 && a18 <= 134) && a16 <= 9) && 7 == a12)) || ((!(a12 == 6) && a16 <= 9) && 3 == a15)) || ((a16 <= 11 && 3 == a15) && a12 == 8)) || (((3 == a15 && a18 + 79 <= 0) && 0 < a18 + 156) && a12 == 6)) || (a16 == 8 && 3 == a15)) || (((a15 == 4 && a16 == 8) && !(3 == input)) && a12 == 5) - InvariantResult [Line: 1767]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1773]: Loop Invariant [2019-11-20 10:50:59,305 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] [2019-11-20 10:50:59,305 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] [2019-11-20 10:50:59,306 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] [2019-11-20 10:50:59,306 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] [2019-11-20 10:50:59,306 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] [2019-11-20 10:50:59,308 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] [2019-11-20 10:50:59,308 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] [2019-11-20 10:50:59,308 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] [2019-11-20 10:50:59,309 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] [2019-11-20 10:50:59,309 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((a16 == 8 && a15 == 4) && a18 <= 134) || ((a16 <= 11 && 4 <= a15) && a12 == 6)) || (((a15 == 4 && a16 <= 9) && a18 + 79 <= 0) && !(a12 == 8))) || (((((a15 == 4 && a16 <= 11) && (a18 + -599175) / 3 + 79 <= 0) && 5 == a12) && 0 == a18 % 3) && 0 < (a18 + -599175) / 3 + 156)) || ((3 == a15 && (\exists v_~a18~0_902 : int :: (((0 <= 9 * v_~a18~0_902 && a18 + 557770 <= v_~a18~0_902 * 9 / 10) && 0 < (v_~a18~0_902 + -599175) / 3 + 156) && (v_~a18~0_902 + -599175) / 3 + 79 <= 0) && 0 == v_~a18~0_902 % 3)) && a12 == 6)) || (((a15 == 4 && a16 <= 11) && 5 == a12) && a18 + 79 <= 0)) || ((5 == a12 && 3 == a15) && a18 <= 513056)) || ((((a16 <= 11 && !(a12 == 6)) && 3 == a15) && a18 <= 513056) && !(10 == a16))) || ((69094 <= a18 && 3 == a15) && a12 == 8)) || ((a15 == 4 && a16 == 8) && a12 == 5)) || ((12 <= a16 && 3 == a15) && !(a12 == 8))) || (((a15 == 4 && 69094 <= a18) && a16 <= 9) && 7 == a12)) || (((a15 == 4 && a16 <= 9) && a18 + 79 <= 0) && 0 < a18 + 156)) || ((((a15 == 4 && a18 <= 134) && a16 <= 9) && a12 == 8) && 0 < a18 + 79)) || ((((a16 == 8 && a15 == 4) && 69094 <= a18) && a18 <= 513056) && !(a12 == 8))) || (((3 == a15 && 134 < a18) && a12 == 6) && a18 <= 513056)) || ((a18 <= 134 && 3 == a15) && a12 == 8)) || (((a15 == 4 && a18 <= 134) && a16 <= 9) && 7 == a12)) || ((!(a12 == 6) && a16 <= 9) && 3 == a15)) || ((a16 <= 11 && 3 == a15) && a12 == 8)) || (((3 == a15 && a18 + 79 <= 0) && 0 < a18 + 156) && a12 == 6)) || (a16 == 8 && 3 == a15) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 396 locations, 1 error locations. Result: SAFE, OverallTime: 149.1s, OverallIterations: 19, TraceHistogramMax: 15, AutomataDifference: 66.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 4.4s, HoareTripleCheckerStatistics: 3713 SDtfs, 14351 SDslu, 713 SDs, 0 SdLazy, 64086 SolverSat, 3749 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 52.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 12443 GetRequests, 12302 SyntacticMatches, 19 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 687 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16783occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.5s AutomataMinimizationTime, 19 MinimizatonAttempts, 8924 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 311 NumberOfFragments, 1018 HoareAnnotationTreeSize, 4 FomulaSimplifications, 22965 FormulaSimplificationTreeSizeReduction, 0.8s HoareSimplificationTime, 4 FomulaSimplificationsInter, 7492 FormulaSimplificationTreeSizeReductionInter, 3.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 1.1s SsaConstructionTime, 3.9s SatisfiabilityAnalysisTime, 26.8s InterpolantComputationTime, 34336 NumberOfCodeBlocks, 34336 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 34309 ConstructedInterpolants, 51 QuantifiedInterpolants, 197964778 SizeOfPredicates, 4 NumberOfNonLiveVariables, 14180 ConjunctsInSsa, 26 ConjunctsInUnsatCore, 27 InterpolantComputations, 18 PerfectInterpolantSequences, 108235/116277 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...