./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem11_label48.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_a2095aae-0f0e-4dd7-821c-2b25dccb5857/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_a2095aae-0f0e-4dd7-821c-2b25dccb5857/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_a2095aae-0f0e-4dd7-821c-2b25dccb5857/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_a2095aae-0f0e-4dd7-821c-2b25dccb5857/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem11_label48.c -s /tmp/vcloud-vcloud-master/worker/run_dir_a2095aae-0f0e-4dd7-821c-2b25dccb5857/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_a2095aae-0f0e-4dd7-821c-2b25dccb5857/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 8a1a825ec98775a2851ce5a0e999a3f43690bf7c ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 14:15:45,351 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 14:15:45,352 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 14:15:45,360 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 14:15:45,360 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 14:15:45,361 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 14:15:45,362 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 14:15:45,363 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 14:15:45,364 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 14:15:45,365 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 14:15:45,365 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 14:15:45,366 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 14:15:45,366 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 14:15:45,367 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 14:15:45,368 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 14:15:45,369 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 14:15:45,369 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 14:15:45,370 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 14:15:45,371 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 14:15:45,373 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 14:15:45,374 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 14:15:45,374 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 14:15:45,375 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 14:15:45,375 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 14:15:45,377 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 14:15:45,377 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 14:15:45,378 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 14:15:45,378 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 14:15:45,378 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 14:15:45,379 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 14:15:45,379 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 14:15:45,379 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 14:15:45,380 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 14:15:45,380 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 14:15:45,381 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 14:15:45,381 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 14:15:45,381 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 14:15:45,381 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 14:15:45,382 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 14:15:45,382 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 14:15:45,382 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 14:15:45,383 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_a2095aae-0f0e-4dd7-821c-2b25dccb5857/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 14:15:45,392 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 14:15:45,392 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 14:15:45,393 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 14:15:45,393 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 14:15:45,393 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 14:15:45,393 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 14:15:45,393 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 14:15:45,393 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 14:15:45,393 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 14:15:45,394 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 14:15:45,394 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 14:15:45,394 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 14:15:45,394 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 14:15:45,394 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 14:15:45,394 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 14:15:45,394 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 14:15:45,394 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 14:15:45,394 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 14:15:45,395 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 14:15:45,395 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 14:15:45,395 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 14:15:45,395 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 14:15:45,395 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 14:15:45,395 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 14:15:45,395 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 14:15:45,395 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 14:15:45,395 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 14:15:45,395 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 14:15:45,396 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 14:15:45,396 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_a2095aae-0f0e-4dd7-821c-2b25dccb5857/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 -> 8a1a825ec98775a2851ce5a0e999a3f43690bf7c [2019-12-07 14:15:45,494 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 14:15:45,503 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 14:15:45,506 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 14:15:45,507 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 14:15:45,507 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 14:15:45,507 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_a2095aae-0f0e-4dd7-821c-2b25dccb5857/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem11_label48.c [2019-12-07 14:15:45,548 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a2095aae-0f0e-4dd7-821c-2b25dccb5857/bin/uautomizer/data/6e774ebdb/7b4eda5140d340abb9eecc8b273225bd/FLAG22fdc642d [2019-12-07 14:15:46,040 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 14:15:46,041 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_a2095aae-0f0e-4dd7-821c-2b25dccb5857/sv-benchmarks/c/eca-rers2012/Problem11_label48.c [2019-12-07 14:15:46,051 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a2095aae-0f0e-4dd7-821c-2b25dccb5857/bin/uautomizer/data/6e774ebdb/7b4eda5140d340abb9eecc8b273225bd/FLAG22fdc642d [2019-12-07 14:15:46,060 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_a2095aae-0f0e-4dd7-821c-2b25dccb5857/bin/uautomizer/data/6e774ebdb/7b4eda5140d340abb9eecc8b273225bd [2019-12-07 14:15:46,062 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 14:15:46,063 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 14:15:46,064 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 14:15:46,064 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 14:15:46,066 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 14:15:46,067 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:15:46" (1/1) ... [2019-12-07 14:15:46,068 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31149b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:15:46, skipping insertion in model container [2019-12-07 14:15:46,069 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:15:46" (1/1) ... [2019-12-07 14:15:46,074 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 14:15:46,115 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 14:15:46,407 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:15:46,410 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 14:15:46,500 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:15:46,511 INFO L208 MainTranslator]: Completed translation [2019-12-07 14:15:46,511 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:15:46 WrapperNode [2019-12-07 14:15:46,512 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 14:15:46,512 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 14:15:46,512 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 14:15:46,512 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 14:15:46,518 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:15:46" (1/1) ... [2019-12-07 14:15:46,534 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:15:46" (1/1) ... [2019-12-07 14:15:46,588 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 14:15:46,588 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 14:15:46,588 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 14:15:46,588 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 14:15:46,595 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:15:46" (1/1) ... [2019-12-07 14:15:46,595 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:15:46" (1/1) ... [2019-12-07 14:15:46,601 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:15:46" (1/1) ... [2019-12-07 14:15:46,601 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:15:46" (1/1) ... [2019-12-07 14:15:46,627 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:15:46" (1/1) ... [2019-12-07 14:15:46,634 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:15:46" (1/1) ... [2019-12-07 14:15:46,647 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:15:46" (1/1) ... [2019-12-07 14:15:46,658 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 14:15:46,658 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 14:15:46,658 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 14:15:46,658 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 14:15:46,659 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:15:46" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a2095aae-0f0e-4dd7-821c-2b25dccb5857/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 14:15:46,699 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 14:15:46,699 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 14:15:47,732 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 14:15:47,733 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 14:15:47,734 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:15:47 BoogieIcfgContainer [2019-12-07 14:15:47,734 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 14:15:47,735 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 14:15:47,735 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 14:15:47,737 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 14:15:47,738 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 02:15:46" (1/3) ... [2019-12-07 14:15:47,738 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5edee613 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 02:15:47, skipping insertion in model container [2019-12-07 14:15:47,738 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:15:46" (2/3) ... [2019-12-07 14:15:47,739 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5edee613 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 02:15:47, skipping insertion in model container [2019-12-07 14:15:47,739 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:15:47" (3/3) ... [2019-12-07 14:15:47,740 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem11_label48.c [2019-12-07 14:15:47,747 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 14:15:47,754 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 14:15:47,765 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 14:15:47,787 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 14:15:47,787 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 14:15:47,788 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 14:15:47,788 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 14:15:47,788 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 14:15:47,788 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 14:15:47,788 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 14:15:47,788 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 14:15:47,804 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states. [2019-12-07 14:15:47,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-07 14:15:47,810 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:15:47,810 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] [2019-12-07 14:15:47,811 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:15:47,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:15:47,814 INFO L82 PathProgramCache]: Analyzing trace with hash 761214138, now seen corresponding path program 1 times [2019-12-07 14:15:47,820 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:15:47,821 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983430015] [2019-12-07 14:15:47,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:15:47,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:15:48,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:15:48,020 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983430015] [2019-12-07 14:15:48,020 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:15:48,021 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:15:48,022 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201547589] [2019-12-07 14:15:48,025 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:15:48,026 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:15:48,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:15:48,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:15:48,037 INFO L87 Difference]: Start difference. First operand 283 states. Second operand 4 states. [2019-12-07 14:15:49,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:15:49,240 INFO L93 Difference]: Finished difference Result 951 states and 1718 transitions. [2019-12-07 14:15:49,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:15:49,241 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2019-12-07 14:15:49,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:15:49,257 INFO L225 Difference]: With dead ends: 951 [2019-12-07 14:15:49,257 INFO L226 Difference]: Without dead ends: 600 [2019-12-07 14:15:49,260 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:15:49,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2019-12-07 14:15:49,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 410. [2019-12-07 14:15:49,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-12-07 14:15:49,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 593 transitions. [2019-12-07 14:15:49,314 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 593 transitions. Word has length 50 [2019-12-07 14:15:49,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:15:49,314 INFO L462 AbstractCegarLoop]: Abstraction has 410 states and 593 transitions. [2019-12-07 14:15:49,314 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:15:49,315 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 593 transitions. [2019-12-07 14:15:49,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-12-07 14:15:49,319 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:15:49,319 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:15:49,319 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:15:49,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:15:49,320 INFO L82 PathProgramCache]: Analyzing trace with hash 2108563154, now seen corresponding path program 1 times [2019-12-07 14:15:49,320 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:15:49,320 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130471559] [2019-12-07 14:15:49,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:15:49,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:15:49,411 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:15:49,411 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130471559] [2019-12-07 14:15:49,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:15:49,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:15:49,412 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101813026] [2019-12-07 14:15:49,413 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:15:49,413 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:15:49,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:15:49,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:15:49,414 INFO L87 Difference]: Start difference. First operand 410 states and 593 transitions. Second operand 4 states. [2019-12-07 14:15:50,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:15:50,523 INFO L93 Difference]: Finished difference Result 1572 states and 2289 transitions. [2019-12-07 14:15:50,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:15:50,524 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 118 [2019-12-07 14:15:50,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:15:50,529 INFO L225 Difference]: With dead ends: 1572 [2019-12-07 14:15:50,529 INFO L226 Difference]: Without dead ends: 1164 [2019-12-07 14:15:50,531 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:15:50,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1164 states. [2019-12-07 14:15:50,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1164 to 1150. [2019-12-07 14:15:50,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1150 states. [2019-12-07 14:15:50,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1150 states to 1150 states and 1567 transitions. [2019-12-07 14:15:50,558 INFO L78 Accepts]: Start accepts. Automaton has 1150 states and 1567 transitions. Word has length 118 [2019-12-07 14:15:50,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:15:50,558 INFO L462 AbstractCegarLoop]: Abstraction has 1150 states and 1567 transitions. [2019-12-07 14:15:50,559 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:15:50,559 INFO L276 IsEmpty]: Start isEmpty. Operand 1150 states and 1567 transitions. [2019-12-07 14:15:50,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-12-07 14:15:50,561 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:15:50,561 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:15:50,561 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:15:50,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:15:50,561 INFO L82 PathProgramCache]: Analyzing trace with hash -209624514, now seen corresponding path program 1 times [2019-12-07 14:15:50,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:15:50,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810534801] [2019-12-07 14:15:50,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:15:50,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:15:50,656 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:15:50,657 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810534801] [2019-12-07 14:15:50,657 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:15:50,657 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:15:50,657 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777659578] [2019-12-07 14:15:50,658 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:15:50,658 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:15:50,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:15:50,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:15:50,658 INFO L87 Difference]: Start difference. First operand 1150 states and 1567 transitions. Second operand 4 states. [2019-12-07 14:15:51,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:15:51,839 INFO L93 Difference]: Finished difference Result 3966 states and 5427 transitions. [2019-12-07 14:15:51,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:15:51,839 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 126 [2019-12-07 14:15:51,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:15:51,851 INFO L225 Difference]: With dead ends: 3966 [2019-12-07 14:15:51,851 INFO L226 Difference]: Without dead ends: 2818 [2019-12-07 14:15:51,853 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-12-07 14:15:51,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2818 states. [2019-12-07 14:15:51,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2818 to 2255. [2019-12-07 14:15:51,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2255 states. [2019-12-07 14:15:51,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2255 states to 2255 states and 2821 transitions. [2019-12-07 14:15:51,889 INFO L78 Accepts]: Start accepts. Automaton has 2255 states and 2821 transitions. Word has length 126 [2019-12-07 14:15:51,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:15:51,890 INFO L462 AbstractCegarLoop]: Abstraction has 2255 states and 2821 transitions. [2019-12-07 14:15:51,890 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:15:51,890 INFO L276 IsEmpty]: Start isEmpty. Operand 2255 states and 2821 transitions. [2019-12-07 14:15:51,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-12-07 14:15:51,892 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:15:51,893 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, 2, 2, 2, 2, 2, 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-12-07 14:15:51,893 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:15:51,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:15:51,893 INFO L82 PathProgramCache]: Analyzing trace with hash 2124204058, now seen corresponding path program 1 times [2019-12-07 14:15:51,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:15:51,894 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574598569] [2019-12-07 14:15:51,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:15:51,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:15:52,087 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 170 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:15:52,087 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574598569] [2019-12-07 14:15:52,087 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:15:52,088 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:15:52,088 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107000408] [2019-12-07 14:15:52,088 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:15:52,089 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:15:52,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:15:52,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:15:52,089 INFO L87 Difference]: Start difference. First operand 2255 states and 2821 transitions. Second operand 4 states. [2019-12-07 14:15:53,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:15:53,539 INFO L93 Difference]: Finished difference Result 5629 states and 7168 transitions. [2019-12-07 14:15:53,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:15:53,540 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 238 [2019-12-07 14:15:53,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:15:53,567 INFO L225 Difference]: With dead ends: 5629 [2019-12-07 14:15:53,567 INFO L226 Difference]: Without dead ends: 3560 [2019-12-07 14:15:53,570 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:15:53,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3560 states. [2019-12-07 14:15:53,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3560 to 3359. [2019-12-07 14:15:53,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3359 states. [2019-12-07 14:15:53,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3359 states to 3359 states and 4170 transitions. [2019-12-07 14:15:53,617 INFO L78 Accepts]: Start accepts. Automaton has 3359 states and 4170 transitions. Word has length 238 [2019-12-07 14:15:53,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:15:53,618 INFO L462 AbstractCegarLoop]: Abstraction has 3359 states and 4170 transitions. [2019-12-07 14:15:53,618 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:15:53,618 INFO L276 IsEmpty]: Start isEmpty. Operand 3359 states and 4170 transitions. [2019-12-07 14:15:53,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2019-12-07 14:15:53,621 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:15:53,622 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, 2, 2, 2, 2, 2, 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] [2019-12-07 14:15:53,622 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:15:53,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:15:53,622 INFO L82 PathProgramCache]: Analyzing trace with hash 2110216437, now seen corresponding path program 1 times [2019-12-07 14:15:53,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:15:53,622 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811534903] [2019-12-07 14:15:53,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:15:53,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:15:53,730 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-12-07 14:15:53,730 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811534903] [2019-12-07 14:15:53,730 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:15:53,730 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:15:53,731 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126552907] [2019-12-07 14:15:53,731 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:15:53,731 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:15:53,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:15:53,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:15:53,732 INFO L87 Difference]: Start difference. First operand 3359 states and 4170 transitions. Second operand 3 states. [2019-12-07 14:15:54,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:15:54,331 INFO L93 Difference]: Finished difference Result 8004 states and 10137 transitions. [2019-12-07 14:15:54,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:15:54,331 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 253 [2019-12-07 14:15:54,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:15:54,347 INFO L225 Difference]: With dead ends: 8004 [2019-12-07 14:15:54,347 INFO L226 Difference]: Without dead ends: 4831 [2019-12-07 14:15:54,350 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:15:54,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4831 states. [2019-12-07 14:15:54,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4831 to 4279. [2019-12-07 14:15:54,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4279 states. [2019-12-07 14:15:54,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4279 states to 4279 states and 5222 transitions. [2019-12-07 14:15:54,399 INFO L78 Accepts]: Start accepts. Automaton has 4279 states and 5222 transitions. Word has length 253 [2019-12-07 14:15:54,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:15:54,400 INFO L462 AbstractCegarLoop]: Abstraction has 4279 states and 5222 transitions. [2019-12-07 14:15:54,400 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:15:54,400 INFO L276 IsEmpty]: Start isEmpty. Operand 4279 states and 5222 transitions. [2019-12-07 14:15:54,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2019-12-07 14:15:54,403 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:15:54,403 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:15:54,403 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:15:54,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:15:54,404 INFO L82 PathProgramCache]: Analyzing trace with hash 697992722, now seen corresponding path program 1 times [2019-12-07 14:15:54,404 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:15:54,404 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418809748] [2019-12-07 14:15:54,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:15:54,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:15:54,545 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 143 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:15:54,545 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418809748] [2019-12-07 14:15:54,546 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [249932895] [2019-12-07 14:15:54,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a2095aae-0f0e-4dd7-821c-2b25dccb5857/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:15:54,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:15:54,628 INFO L264 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 14:15:54,640 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:15:54,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:15:54,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:15:54,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:15:54,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:15:54,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:15:54,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:15:54,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:15:54,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:15:54,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:15:54,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:15:54,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:15:54,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:15:54,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:15:54,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:15:54,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:15:54,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:15:54,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:15:54,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:15:54,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:15:54,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:15:54,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:15:54,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:15:54,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:15:54,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:15:54,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:15:54,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:15:55,109 WARN L192 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 23 [2019-12-07 14:15:55,261 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-12-07 14:15:55,261 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 14:15:55,261 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-12-07 14:15:55,262 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144032939] [2019-12-07 14:15:55,262 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:15:55,262 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:15:55,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:15:55,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 14:15:55,262 INFO L87 Difference]: Start difference. First operand 4279 states and 5222 transitions. Second operand 3 states. [2019-12-07 14:15:56,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:15:56,502 INFO L93 Difference]: Finished difference Result 9849 states and 12070 transitions. [2019-12-07 14:15:56,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:15:56,502 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 259 [2019-12-07 14:15:56,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:15:56,520 INFO L225 Difference]: With dead ends: 9849 [2019-12-07 14:15:56,520 INFO L226 Difference]: Without dead ends: 5572 [2019-12-07 14:15:56,523 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 259 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 14:15:56,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5572 states. [2019-12-07 14:15:56,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5572 to 5018. [2019-12-07 14:15:56,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5018 states. [2019-12-07 14:15:56,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5018 states to 5018 states and 6016 transitions. [2019-12-07 14:15:56,589 INFO L78 Accepts]: Start accepts. Automaton has 5018 states and 6016 transitions. Word has length 259 [2019-12-07 14:15:56,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:15:56,589 INFO L462 AbstractCegarLoop]: Abstraction has 5018 states and 6016 transitions. [2019-12-07 14:15:56,589 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:15:56,589 INFO L276 IsEmpty]: Start isEmpty. Operand 5018 states and 6016 transitions. [2019-12-07 14:15:56,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2019-12-07 14:15:56,593 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:15:56,593 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, 2, 2, 2, 2, 2, 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] [2019-12-07 14:15:56,794 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:15:56,794 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:15:56,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:15:56,795 INFO L82 PathProgramCache]: Analyzing trace with hash 384725077, now seen corresponding path program 1 times [2019-12-07 14:15:56,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:15:56,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711778944] [2019-12-07 14:15:56,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:15:56,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:15:57,139 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 0 proven. 170 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:15:57,139 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711778944] [2019-12-07 14:15:57,139 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [545891307] [2019-12-07 14:15:57,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a2095aae-0f0e-4dd7-821c-2b25dccb5857/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:15:57,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:15:57,211 INFO L264 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 14:15:57,218 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:15:57,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:15:57,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:15:57,466 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 170 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:15:57,467 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 14:15:57,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2019-12-07 14:15:57,467 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747941964] [2019-12-07 14:15:57,467 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:15:57,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:15:57,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:15:57,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-07 14:15:57,468 INFO L87 Difference]: Start difference. First operand 5018 states and 6016 transitions. Second operand 4 states. [2019-12-07 14:15:59,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:15:59,080 INFO L93 Difference]: Finished difference Result 14279 states and 17154 transitions. [2019-12-07 14:15:59,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:15:59,081 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 269 [2019-12-07 14:15:59,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:15:59,109 INFO L225 Difference]: With dead ends: 14279 [2019-12-07 14:15:59,109 INFO L226 Difference]: Without dead ends: 9263 [2019-12-07 14:15:59,113 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-07 14:15:59,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9263 states. [2019-12-07 14:15:59,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9263 to 8336. [2019-12-07 14:15:59,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8336 states. [2019-12-07 14:15:59,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8336 states to 8336 states and 9955 transitions. [2019-12-07 14:15:59,205 INFO L78 Accepts]: Start accepts. Automaton has 8336 states and 9955 transitions. Word has length 269 [2019-12-07 14:15:59,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:15:59,205 INFO L462 AbstractCegarLoop]: Abstraction has 8336 states and 9955 transitions. [2019-12-07 14:15:59,205 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:15:59,205 INFO L276 IsEmpty]: Start isEmpty. Operand 8336 states and 9955 transitions. [2019-12-07 14:15:59,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2019-12-07 14:15:59,209 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:15:59,210 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-12-07 14:15:59,410 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:15:59,411 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:15:59,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:15:59,411 INFO L82 PathProgramCache]: Analyzing trace with hash 510762410, now seen corresponding path program 1 times [2019-12-07 14:15:59,411 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:15:59,412 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918746829] [2019-12-07 14:15:59,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:15:59,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:15:59,572 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 149 proven. 4 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-12-07 14:15:59,572 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918746829] [2019-12-07 14:15:59,572 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2043148218] [2019-12-07 14:15:59,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a2095aae-0f0e-4dd7-821c-2b25dccb5857/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:15:59,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:15:59,648 INFO L264 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 14:15:59,652 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:15:59,708 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-12-07 14:15:59,709 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 14:15:59,709 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2019-12-07 14:15:59,709 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226048415] [2019-12-07 14:15:59,710 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:15:59,710 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:15:59,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:15:59,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:15:59,710 INFO L87 Difference]: Start difference. First operand 8336 states and 9955 transitions. Second operand 3 states. [2019-12-07 14:16:00,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:16:00,333 INFO L93 Difference]: Finished difference Result 16483 states and 19697 transitions. [2019-12-07 14:16:00,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:16:00,333 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 280 [2019-12-07 14:16:00,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:16:00,344 INFO L225 Difference]: With dead ends: 16483 [2019-12-07 14:16:00,344 INFO L226 Difference]: Without dead ends: 8149 [2019-12-07 14:16:00,349 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 281 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:16:00,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8149 states. [2019-12-07 14:16:00,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8149 to 8148. [2019-12-07 14:16:00,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8148 states. [2019-12-07 14:16:00,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8148 states to 8148 states and 9455 transitions. [2019-12-07 14:16:00,414 INFO L78 Accepts]: Start accepts. Automaton has 8148 states and 9455 transitions. Word has length 280 [2019-12-07 14:16:00,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:16:00,414 INFO L462 AbstractCegarLoop]: Abstraction has 8148 states and 9455 transitions. [2019-12-07 14:16:00,414 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:16:00,414 INFO L276 IsEmpty]: Start isEmpty. Operand 8148 states and 9455 transitions. [2019-12-07 14:16:00,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2019-12-07 14:16:00,417 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:16:00,417 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-12-07 14:16:00,618 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:16:00,618 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:16:00,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:16:00,619 INFO L82 PathProgramCache]: Analyzing trace with hash 577294273, now seen corresponding path program 1 times [2019-12-07 14:16:00,619 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:16:00,619 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722225540] [2019-12-07 14:16:00,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:16:00,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:16:00,830 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 200 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:16:00,831 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722225540] [2019-12-07 14:16:00,831 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:16:00,831 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:16:00,831 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313250961] [2019-12-07 14:16:00,831 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:16:00,831 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:16:00,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:16:00,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:16:00,832 INFO L87 Difference]: Start difference. First operand 8148 states and 9455 transitions. Second operand 4 states. [2019-12-07 14:16:01,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:16:01,618 INFO L93 Difference]: Finished difference Result 17050 states and 19801 transitions. [2019-12-07 14:16:01,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:16:01,618 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 283 [2019-12-07 14:16:01,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:16:01,632 INFO L225 Difference]: With dead ends: 17050 [2019-12-07 14:16:01,632 INFO L226 Difference]: Without dead ends: 8904 [2019-12-07 14:16:01,638 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:16:01,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8904 states. [2019-12-07 14:16:01,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8904 to 8518. [2019-12-07 14:16:01,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8518 states. [2019-12-07 14:16:01,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8518 states to 8518 states and 9862 transitions. [2019-12-07 14:16:01,713 INFO L78 Accepts]: Start accepts. Automaton has 8518 states and 9862 transitions. Word has length 283 [2019-12-07 14:16:01,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:16:01,714 INFO L462 AbstractCegarLoop]: Abstraction has 8518 states and 9862 transitions. [2019-12-07 14:16:01,714 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:16:01,714 INFO L276 IsEmpty]: Start isEmpty. Operand 8518 states and 9862 transitions. [2019-12-07 14:16:01,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2019-12-07 14:16:01,717 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:16:01,717 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:16:01,717 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:16:01,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:16:01,718 INFO L82 PathProgramCache]: Analyzing trace with hash 934196540, now seen corresponding path program 1 times [2019-12-07 14:16:01,718 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:16:01,718 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871574576] [2019-12-07 14:16:01,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:16:01,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:16:02,051 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 110 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:16:02,052 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871574576] [2019-12-07 14:16:02,052 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [733153024] [2019-12-07 14:16:02,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a2095aae-0f0e-4dd7-821c-2b25dccb5857/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:16:02,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:16:02,117 INFO L264 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 14:16:02,119 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:16:02,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:16:02,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:16:04,303 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2019-12-07 14:16:04,303 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 14:16:04,303 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 13 [2019-12-07 14:16:04,303 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509478778] [2019-12-07 14:16:04,304 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:16:04,304 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:16:04,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:16:04,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=114, Unknown=1, NotChecked=0, Total=156 [2019-12-07 14:16:04,304 INFO L87 Difference]: Start difference. First operand 8518 states and 9862 transitions. Second operand 3 states. [2019-12-07 14:16:32,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:16:32,440 INFO L93 Difference]: Finished difference Result 20362 states and 23682 transitions. [2019-12-07 14:16:32,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:16:32,441 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 307 [2019-12-07 14:16:32,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:16:32,455 INFO L225 Difference]: With dead ends: 20362 [2019-12-07 14:16:32,455 INFO L226 Difference]: Without dead ends: 11110 [2019-12-07 14:16:32,463 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 306 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=41, Invalid=114, Unknown=1, NotChecked=0, Total=156 [2019-12-07 14:16:32,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11110 states. [2019-12-07 14:16:32,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11110 to 10922. [2019-12-07 14:16:32,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10922 states. [2019-12-07 14:16:32,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10922 states to 10922 states and 12643 transitions. [2019-12-07 14:16:32,554 INFO L78 Accepts]: Start accepts. Automaton has 10922 states and 12643 transitions. Word has length 307 [2019-12-07 14:16:32,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:16:32,554 INFO L462 AbstractCegarLoop]: Abstraction has 10922 states and 12643 transitions. [2019-12-07 14:16:32,554 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:16:32,554 INFO L276 IsEmpty]: Start isEmpty. Operand 10922 states and 12643 transitions. [2019-12-07 14:16:32,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-12-07 14:16:32,557 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:16:32,558 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:16:32,758 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:16:32,759 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:16:32,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:16:32,760 INFO L82 PathProgramCache]: Analyzing trace with hash 100748151, now seen corresponding path program 1 times [2019-12-07 14:16:32,760 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:16:32,760 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483378121] [2019-12-07 14:16:32,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:16:32,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:16:32,889 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2019-12-07 14:16:32,889 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483378121] [2019-12-07 14:16:32,889 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:16:32,889 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:16:32,889 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590891907] [2019-12-07 14:16:32,890 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:16:32,890 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:16:32,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:16:32,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:16:32,890 INFO L87 Difference]: Start difference. First operand 10922 states and 12643 transitions. Second operand 3 states. [2019-12-07 14:16:33,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:16:33,532 INFO L93 Difference]: Finished difference Result 24050 states and 27739 transitions. [2019-12-07 14:16:33,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:16:33,532 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 312 [2019-12-07 14:16:33,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:16:33,541 INFO L225 Difference]: With dead ends: 24050 [2019-12-07 14:16:33,541 INFO L226 Difference]: Without dead ends: 12394 [2019-12-07 14:16:33,548 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:16:33,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12394 states. [2019-12-07 14:16:33,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12394 to 10002. [2019-12-07 14:16:33,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10002 states. [2019-12-07 14:16:33,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10002 states to 10002 states and 11589 transitions. [2019-12-07 14:16:33,623 INFO L78 Accepts]: Start accepts. Automaton has 10002 states and 11589 transitions. Word has length 312 [2019-12-07 14:16:33,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:16:33,624 INFO L462 AbstractCegarLoop]: Abstraction has 10002 states and 11589 transitions. [2019-12-07 14:16:33,624 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:16:33,624 INFO L276 IsEmpty]: Start isEmpty. Operand 10002 states and 11589 transitions. [2019-12-07 14:16:33,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2019-12-07 14:16:33,627 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:16:33,628 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:16:33,628 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:16:33,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:16:33,628 INFO L82 PathProgramCache]: Analyzing trace with hash 1462001354, now seen corresponding path program 1 times [2019-12-07 14:16:33,628 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:16:33,628 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736366442] [2019-12-07 14:16:33,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:16:33,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:16:33,791 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 317 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2019-12-07 14:16:33,791 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736366442] [2019-12-07 14:16:33,792 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:16:33,792 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:16:33,792 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272244149] [2019-12-07 14:16:33,792 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:16:33,793 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:16:33,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:16:33,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:16:33,793 INFO L87 Difference]: Start difference. First operand 10002 states and 11589 transitions. Second operand 3 states. [2019-12-07 14:16:34,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:16:34,370 INFO L93 Difference]: Finished difference Result 20741 states and 23985 transitions. [2019-12-07 14:16:34,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:16:34,370 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 337 [2019-12-07 14:16:34,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:16:34,377 INFO L225 Difference]: With dead ends: 20741 [2019-12-07 14:16:34,377 INFO L226 Difference]: Without dead ends: 10189 [2019-12-07 14:16:34,383 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:16:34,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10189 states. [2019-12-07 14:16:34,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10189 to 9452. [2019-12-07 14:16:34,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9452 states. [2019-12-07 14:16:34,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9452 states to 9452 states and 10850 transitions. [2019-12-07 14:16:34,446 INFO L78 Accepts]: Start accepts. Automaton has 9452 states and 10850 transitions. Word has length 337 [2019-12-07 14:16:34,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:16:34,446 INFO L462 AbstractCegarLoop]: Abstraction has 9452 states and 10850 transitions. [2019-12-07 14:16:34,446 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:16:34,446 INFO L276 IsEmpty]: Start isEmpty. Operand 9452 states and 10850 transitions. [2019-12-07 14:16:34,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2019-12-07 14:16:34,450 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:16:34,450 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:16:34,450 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:16:34,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:16:34,451 INFO L82 PathProgramCache]: Analyzing trace with hash 364338523, now seen corresponding path program 1 times [2019-12-07 14:16:34,451 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:16:34,451 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704421284] [2019-12-07 14:16:34,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:16:34,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:16:34,598 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 318 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-12-07 14:16:34,598 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704421284] [2019-12-07 14:16:34,598 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:16:34,598 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:16:34,598 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036133368] [2019-12-07 14:16:34,599 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:16:34,599 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:16:34,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:16:34,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:16:34,599 INFO L87 Difference]: Start difference. First operand 9452 states and 10850 transitions. Second operand 4 states. [2019-12-07 14:16:35,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:16:35,483 INFO L93 Difference]: Finished difference Result 19843 states and 22705 transitions. [2019-12-07 14:16:35,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:16:35,484 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 338 [2019-12-07 14:16:35,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:16:35,490 INFO L225 Difference]: With dead ends: 19843 [2019-12-07 14:16:35,490 INFO L226 Difference]: Without dead ends: 10390 [2019-12-07 14:16:35,494 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:16:35,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10390 states. [2019-12-07 14:16:35,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10390 to 9450. [2019-12-07 14:16:35,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9450 states. [2019-12-07 14:16:35,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9450 states to 9450 states and 10624 transitions. [2019-12-07 14:16:35,559 INFO L78 Accepts]: Start accepts. Automaton has 9450 states and 10624 transitions. Word has length 338 [2019-12-07 14:16:35,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:16:35,559 INFO L462 AbstractCegarLoop]: Abstraction has 9450 states and 10624 transitions. [2019-12-07 14:16:35,559 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:16:35,559 INFO L276 IsEmpty]: Start isEmpty. Operand 9450 states and 10624 transitions. [2019-12-07 14:16:35,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2019-12-07 14:16:35,563 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:16:35,564 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:16:35,564 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:16:35,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:16:35,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1557741476, now seen corresponding path program 1 times [2019-12-07 14:16:35,564 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:16:35,564 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663207214] [2019-12-07 14:16:35,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:16:35,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:16:35,827 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 248 proven. 193 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:16:35,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663207214] [2019-12-07 14:16:35,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2095059289] [2019-12-07 14:16:35,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a2095aae-0f0e-4dd7-821c-2b25dccb5857/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:16:35,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:16:35,901 INFO L264 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-07 14:16:35,905 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:16:35,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:16:35,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:16:35,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:16:35,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:16:35,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:16:36,363 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 63 proven. 282 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-12-07 14:16:36,363 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 14:16:36,363 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 12 [2019-12-07 14:16:36,363 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76408987] [2019-12-07 14:16:36,364 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 14:16:36,364 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:16:36,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 14:16:36,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-12-07 14:16:36,364 INFO L87 Difference]: Start difference. First operand 9450 states and 10624 transitions. Second operand 12 states. [2019-12-07 14:16:48,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:16:48,307 INFO L93 Difference]: Finished difference Result 28861 states and 32597 transitions. [2019-12-07 14:16:48,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-07 14:16:48,307 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 365 [2019-12-07 14:16:48,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:16:48,318 INFO L225 Difference]: With dead ends: 28861 [2019-12-07 14:16:48,318 INFO L226 Difference]: Without dead ends: 18677 [2019-12-07 14:16:48,323 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 436 GetRequests, 393 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 538 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=425, Invalid=1555, Unknown=0, NotChecked=0, Total=1980 [2019-12-07 14:16:48,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18677 states. [2019-12-07 14:16:48,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18677 to 10371. [2019-12-07 14:16:48,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10371 states. [2019-12-07 14:16:48,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10371 states to 10371 states and 11396 transitions. [2019-12-07 14:16:48,424 INFO L78 Accepts]: Start accepts. Automaton has 10371 states and 11396 transitions. Word has length 365 [2019-12-07 14:16:48,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:16:48,424 INFO L462 AbstractCegarLoop]: Abstraction has 10371 states and 11396 transitions. [2019-12-07 14:16:48,424 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 14:16:48,424 INFO L276 IsEmpty]: Start isEmpty. Operand 10371 states and 11396 transitions. [2019-12-07 14:16:48,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2019-12-07 14:16:48,429 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:16:48,430 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-12-07 14:16:48,630 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:16:48,631 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:16:48,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:16:48,631 INFO L82 PathProgramCache]: Analyzing trace with hash -1257108569, now seen corresponding path program 1 times [2019-12-07 14:16:48,631 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:16:48,631 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217909918] [2019-12-07 14:16:48,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:16:48,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:16:49,009 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 48 proven. 395 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:16:49,010 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217909918] [2019-12-07 14:16:49,010 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1178518812] [2019-12-07 14:16:49,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a2095aae-0f0e-4dd7-821c-2b25dccb5857/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:16:49,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:16:49,094 INFO L264 TraceCheckSpWp]: Trace formula consists of 508 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 14:16:49,096 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:16:49,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:16:49,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:16:49,327 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 395 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-12-07 14:16:49,327 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 14:16:49,328 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2019-12-07 14:16:49,328 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877598198] [2019-12-07 14:16:49,328 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:16:49,328 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:16:49,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:16:49,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-12-07 14:16:49,329 INFO L87 Difference]: Start difference. First operand 10371 states and 11396 transitions. Second operand 4 states. [2019-12-07 14:16:50,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:16:50,808 INFO L93 Difference]: Finished difference Result 22405 states and 24669 transitions. [2019-12-07 14:16:50,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:16:50,808 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 381 [2019-12-07 14:16:50,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:16:50,815 INFO L225 Difference]: With dead ends: 22405 [2019-12-07 14:16:50,815 INFO L226 Difference]: Without dead ends: 12220 [2019-12-07 14:16:50,819 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 379 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-12-07 14:16:50,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12220 states. [2019-12-07 14:16:50,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12220 to 12027. [2019-12-07 14:16:50,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12027 states. [2019-12-07 14:16:50,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12027 states to 12027 states and 13119 transitions. [2019-12-07 14:16:50,902 INFO L78 Accepts]: Start accepts. Automaton has 12027 states and 13119 transitions. Word has length 381 [2019-12-07 14:16:50,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:16:50,902 INFO L462 AbstractCegarLoop]: Abstraction has 12027 states and 13119 transitions. [2019-12-07 14:16:50,902 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:16:50,902 INFO L276 IsEmpty]: Start isEmpty. Operand 12027 states and 13119 transitions. [2019-12-07 14:16:50,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2019-12-07 14:16:50,907 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:16:50,908 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:16:51,108 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:16:51,108 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:16:51,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:16:51,109 INFO L82 PathProgramCache]: Analyzing trace with hash -1760358101, now seen corresponding path program 1 times [2019-12-07 14:16:51,109 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:16:51,109 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640521919] [2019-12-07 14:16:51,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:16:51,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:16:51,287 INFO L134 CoverageAnalysis]: Checked inductivity of 470 backedges. 422 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-12-07 14:16:51,287 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640521919] [2019-12-07 14:16:51,288 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:16:51,288 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:16:51,288 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808711139] [2019-12-07 14:16:51,288 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:16:51,288 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:16:51,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:16:51,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:16:51,289 INFO L87 Difference]: Start difference. First operand 12027 states and 13119 transitions. Second operand 4 states. [2019-12-07 14:16:52,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:16:52,094 INFO L93 Difference]: Finished difference Result 25163 states and 27429 transitions. [2019-12-07 14:16:52,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:16:52,095 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 405 [2019-12-07 14:16:52,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:16:52,103 INFO L225 Difference]: With dead ends: 25163 [2019-12-07 14:16:52,103 INFO L226 Difference]: Without dead ends: 13322 [2019-12-07 14:16:52,108 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:16:52,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13322 states. [2019-12-07 14:16:52,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13322 to 11471. [2019-12-07 14:16:52,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11471 states. [2019-12-07 14:16:52,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11471 states to 11471 states and 12388 transitions. [2019-12-07 14:16:52,203 INFO L78 Accepts]: Start accepts. Automaton has 11471 states and 12388 transitions. Word has length 405 [2019-12-07 14:16:52,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:16:52,204 INFO L462 AbstractCegarLoop]: Abstraction has 11471 states and 12388 transitions. [2019-12-07 14:16:52,204 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:16:52,204 INFO L276 IsEmpty]: Start isEmpty. Operand 11471 states and 12388 transitions. [2019-12-07 14:16:52,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2019-12-07 14:16:52,208 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:16:52,209 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:16:52,209 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:16:52,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:16:52,209 INFO L82 PathProgramCache]: Analyzing trace with hash -2014347638, now seen corresponding path program 1 times [2019-12-07 14:16:52,209 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:16:52,209 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316011477] [2019-12-07 14:16:52,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:16:52,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:16:52,376 INFO L134 CoverageAnalysis]: Checked inductivity of 468 backedges. 344 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2019-12-07 14:16:52,376 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316011477] [2019-12-07 14:16:52,376 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:16:52,377 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:16:52,377 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750784007] [2019-12-07 14:16:52,377 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:16:52,377 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:16:52,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:16:52,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:16:52,377 INFO L87 Difference]: Start difference. First operand 11471 states and 12388 transitions. Second operand 4 states. [2019-12-07 14:16:53,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:16:53,292 INFO L93 Difference]: Finished difference Result 23324 states and 25175 transitions. [2019-12-07 14:16:53,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:16:53,293 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 412 [2019-12-07 14:16:53,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:16:53,299 INFO L225 Difference]: With dead ends: 23324 [2019-12-07 14:16:53,299 INFO L226 Difference]: Without dead ends: 12039 [2019-12-07 14:16:53,304 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-12-07 14:16:53,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12039 states. [2019-12-07 14:16:53,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12039 to 10919. [2019-12-07 14:16:53,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10919 states. [2019-12-07 14:16:53,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10919 states to 10919 states and 11724 transitions. [2019-12-07 14:16:53,382 INFO L78 Accepts]: Start accepts. Automaton has 10919 states and 11724 transitions. Word has length 412 [2019-12-07 14:16:53,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:16:53,383 INFO L462 AbstractCegarLoop]: Abstraction has 10919 states and 11724 transitions. [2019-12-07 14:16:53,383 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:16:53,383 INFO L276 IsEmpty]: Start isEmpty. Operand 10919 states and 11724 transitions. [2019-12-07 14:16:53,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 415 [2019-12-07 14:16:53,388 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:16:53,388 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:16:53,388 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:16:53,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:16:53,389 INFO L82 PathProgramCache]: Analyzing trace with hash 1465243018, now seen corresponding path program 1 times [2019-12-07 14:16:53,389 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:16:53,389 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568455897] [2019-12-07 14:16:53,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:16:53,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:16:53,637 INFO L134 CoverageAnalysis]: Checked inductivity of 488 backedges. 377 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2019-12-07 14:16:53,637 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568455897] [2019-12-07 14:16:53,638 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:16:53,638 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:16:53,638 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955368283] [2019-12-07 14:16:53,638 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:16:53,638 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:16:53,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:16:53,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:16:53,639 INFO L87 Difference]: Start difference. First operand 10919 states and 11724 transitions. Second operand 5 states. [2019-12-07 14:16:54,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:16:54,700 INFO L93 Difference]: Finished difference Result 27546 states and 29547 transitions. [2019-12-07 14:16:54,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:16:54,700 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 414 [2019-12-07 14:16:54,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:16:54,709 INFO L225 Difference]: With dead ends: 27546 [2019-12-07 14:16:54,709 INFO L226 Difference]: Without dead ends: 16077 [2019-12-07 14:16:54,715 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-12-07 14:16:54,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16077 states. [2019-12-07 14:16:54,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16077 to 13304. [2019-12-07 14:16:54,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13304 states. [2019-12-07 14:16:54,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13304 states to 13304 states and 14196 transitions. [2019-12-07 14:16:54,822 INFO L78 Accepts]: Start accepts. Automaton has 13304 states and 14196 transitions. Word has length 414 [2019-12-07 14:16:54,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:16:54,822 INFO L462 AbstractCegarLoop]: Abstraction has 13304 states and 14196 transitions. [2019-12-07 14:16:54,822 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:16:54,822 INFO L276 IsEmpty]: Start isEmpty. Operand 13304 states and 14196 transitions. [2019-12-07 14:16:54,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 418 [2019-12-07 14:16:54,828 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:16:54,828 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:16:54,828 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:16:54,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:16:54,828 INFO L82 PathProgramCache]: Analyzing trace with hash -1627853402, now seen corresponding path program 1 times [2019-12-07 14:16:54,829 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:16:54,829 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294825782] [2019-12-07 14:16:54,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:16:54,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:16:55,827 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 44 proven. 434 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:16:55,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294825782] [2019-12-07 14:16:55,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [639080317] [2019-12-07 14:16:55,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a2095aae-0f0e-4dd7-821c-2b25dccb5857/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:16:55,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:16:55,908 INFO L264 TraceCheckSpWp]: Trace formula consists of 541 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-07 14:16:55,911 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:16:55,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:16:55,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:16:55,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:16:55,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:16:56,473 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 248 proven. 230 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:16:56,474 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 14:16:56,474 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5] total 16 [2019-12-07 14:16:56,474 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819812671] [2019-12-07 14:16:56,475 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-07 14:16:56,475 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:16:56,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-07 14:16:56,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2019-12-07 14:16:56,475 INFO L87 Difference]: Start difference. First operand 13304 states and 14196 transitions. Second operand 17 states. [2019-12-07 14:17:11,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:17:11,665 INFO L93 Difference]: Finished difference Result 41425 states and 44108 transitions. [2019-12-07 14:17:11,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-07 14:17:11,666 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 417 [2019-12-07 14:17:11,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:17:11,683 INFO L225 Difference]: With dead ends: 41425 [2019-12-07 14:17:11,683 INFO L226 Difference]: Without dead ends: 28307 [2019-12-07 14:17:11,689 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 454 GetRequests, 413 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 437 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=416, Invalid=1306, Unknown=0, NotChecked=0, Total=1722 [2019-12-07 14:17:11,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28307 states. [2019-12-07 14:17:11,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28307 to 12745. [2019-12-07 14:17:11,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12745 states. [2019-12-07 14:17:11,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12745 states to 12745 states and 13553 transitions. [2019-12-07 14:17:11,837 INFO L78 Accepts]: Start accepts. Automaton has 12745 states and 13553 transitions. Word has length 417 [2019-12-07 14:17:11,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:17:11,837 INFO L462 AbstractCegarLoop]: Abstraction has 12745 states and 13553 transitions. [2019-12-07 14:17:11,837 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-07 14:17:11,837 INFO L276 IsEmpty]: Start isEmpty. Operand 12745 states and 13553 transitions. [2019-12-07 14:17:11,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 537 [2019-12-07 14:17:11,847 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:17:11,848 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:17:12,048 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:17:12,049 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:17:12,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:17:12,050 INFO L82 PathProgramCache]: Analyzing trace with hash 1574106967, now seen corresponding path program 1 times [2019-12-07 14:17:12,050 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:17:12,050 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104865125] [2019-12-07 14:17:12,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:17:12,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:17:13,254 INFO L134 CoverageAnalysis]: Checked inductivity of 819 backedges. 92 proven. 727 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:17:13,254 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104865125] [2019-12-07 14:17:13,254 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [819083006] [2019-12-07 14:17:13,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a2095aae-0f0e-4dd7-821c-2b25dccb5857/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-12-07 14:17:13,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:17:13,352 INFO L264 TraceCheckSpWp]: Trace formula consists of 687 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-07 14:17:13,356 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:17:13,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:17:13,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:17:13,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:17:13,967 INFO L134 CoverageAnalysis]: Checked inductivity of 819 backedges. 549 proven. 222 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-12-07 14:17:13,967 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 14:17:13,968 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6] total 17 [2019-12-07 14:17:13,968 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746397173] [2019-12-07 14:17:13,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-07 14:17:13,969 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:17:13,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-07 14:17:13,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2019-12-07 14:17:13,969 INFO L87 Difference]: Start difference. First operand 12745 states and 13553 transitions. Second operand 18 states. [2019-12-07 14:17:32,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:17:32,573 INFO L93 Difference]: Finished difference Result 41777 states and 44444 transitions. [2019-12-07 14:17:32,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-12-07 14:17:32,573 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 536 [2019-12-07 14:17:32,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:17:32,589 INFO L225 Difference]: With dead ends: 41777 [2019-12-07 14:17:32,590 INFO L226 Difference]: Without dead ends: 29218 [2019-12-07 14:17:32,596 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 598 GetRequests, 531 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1509 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1220, Invalid=3336, Unknown=0, NotChecked=0, Total=4556 [2019-12-07 14:17:32,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29218 states. [2019-12-07 14:17:32,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29218 to 12737. [2019-12-07 14:17:32,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12737 states. [2019-12-07 14:17:32,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12737 states to 12737 states and 13463 transitions. [2019-12-07 14:17:32,756 INFO L78 Accepts]: Start accepts. Automaton has 12737 states and 13463 transitions. Word has length 536 [2019-12-07 14:17:32,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:17:32,757 INFO L462 AbstractCegarLoop]: Abstraction has 12737 states and 13463 transitions. [2019-12-07 14:17:32,757 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-07 14:17:32,757 INFO L276 IsEmpty]: Start isEmpty. Operand 12737 states and 13463 transitions. [2019-12-07 14:17:32,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 573 [2019-12-07 14:17:32,765 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:17:32,765 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:17:32,966 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:17:32,966 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:17:32,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:17:32,967 INFO L82 PathProgramCache]: Analyzing trace with hash 27903080, now seen corresponding path program 1 times [2019-12-07 14:17:32,967 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:17:32,967 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833318991] [2019-12-07 14:17:32,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:17:33,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:17:33,414 INFO L134 CoverageAnalysis]: Checked inductivity of 845 backedges. 111 proven. 486 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2019-12-07 14:17:33,414 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833318991] [2019-12-07 14:17:33,414 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1160249468] [2019-12-07 14:17:33,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a2095aae-0f0e-4dd7-821c-2b25dccb5857/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:17:33,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:17:33,517 INFO L264 TraceCheckSpWp]: Trace formula consists of 724 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 14:17:33,522 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:17:33,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:17:33,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:17:34,032 INFO L134 CoverageAnalysis]: Checked inductivity of 845 backedges. 241 proven. 454 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2019-12-07 14:17:34,032 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 14:17:34,033 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2019-12-07 14:17:34,033 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298277873] [2019-12-07 14:17:34,033 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 14:17:34,033 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:17:34,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 14:17:34,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-12-07 14:17:34,034 INFO L87 Difference]: Start difference. First operand 12737 states and 13463 transitions. Second operand 8 states. [2019-12-07 14:17:36,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:17:36,096 INFO L93 Difference]: Finished difference Result 21035 states and 22144 transitions. [2019-12-07 14:17:36,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 14:17:36,097 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 572 [2019-12-07 14:17:36,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:17:36,108 INFO L225 Difference]: With dead ends: 21035 [2019-12-07 14:17:36,108 INFO L226 Difference]: Without dead ends: 21033 [2019-12-07 14:17:36,111 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 576 GetRequests, 570 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-12-07 14:17:36,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21033 states. [2019-12-07 14:17:36,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21033 to 13475. [2019-12-07 14:17:36,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13475 states. [2019-12-07 14:17:36,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13475 states to 13475 states and 14259 transitions. [2019-12-07 14:17:36,246 INFO L78 Accepts]: Start accepts. Automaton has 13475 states and 14259 transitions. Word has length 572 [2019-12-07 14:17:36,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:17:36,247 INFO L462 AbstractCegarLoop]: Abstraction has 13475 states and 14259 transitions. [2019-12-07 14:17:36,247 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 14:17:36,247 INFO L276 IsEmpty]: Start isEmpty. Operand 13475 states and 14259 transitions. [2019-12-07 14:17:36,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 673 [2019-12-07 14:17:36,254 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:17:36,254 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:17:36,455 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:17:36,455 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:17:36,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:17:36,456 INFO L82 PathProgramCache]: Analyzing trace with hash -406675492, now seen corresponding path program 1 times [2019-12-07 14:17:36,456 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:17:36,456 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844294303] [2019-12-07 14:17:36,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:17:36,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:17:36,885 INFO L134 CoverageAnalysis]: Checked inductivity of 1307 backedges. 688 proven. 0 refuted. 0 times theorem prover too weak. 619 trivial. 0 not checked. [2019-12-07 14:17:36,886 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844294303] [2019-12-07 14:17:36,886 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:17:36,886 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:17:36,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926290481] [2019-12-07 14:17:36,886 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:17:36,887 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:17:36,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:17:36,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:17:36,887 INFO L87 Difference]: Start difference. First operand 13475 states and 14259 transitions. Second operand 3 states. [2019-12-07 14:17:37,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:17:37,408 INFO L93 Difference]: Finished difference Result 26580 states and 28129 transitions. [2019-12-07 14:17:37,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:17:37,409 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 672 [2019-12-07 14:17:37,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:17:37,419 INFO L225 Difference]: With dead ends: 26580 [2019-12-07 14:17:37,419 INFO L226 Difference]: Without dead ends: 13661 [2019-12-07 14:17:37,426 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:17:37,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13661 states. [2019-12-07 14:17:37,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13661 to 13475. [2019-12-07 14:17:37,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13475 states. [2019-12-07 14:17:37,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13475 states to 13475 states and 14247 transitions. [2019-12-07 14:17:37,537 INFO L78 Accepts]: Start accepts. Automaton has 13475 states and 14247 transitions. Word has length 672 [2019-12-07 14:17:37,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:17:37,538 INFO L462 AbstractCegarLoop]: Abstraction has 13475 states and 14247 transitions. [2019-12-07 14:17:37,538 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:17:37,538 INFO L276 IsEmpty]: Start isEmpty. Operand 13475 states and 14247 transitions. [2019-12-07 14:17:37,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 674 [2019-12-07 14:17:37,545 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:17:37,545 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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] [2019-12-07 14:17:37,545 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:17:37,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:17:37,546 INFO L82 PathProgramCache]: Analyzing trace with hash 1738464977, now seen corresponding path program 1 times [2019-12-07 14:17:37,546 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:17:37,546 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823199504] [2019-12-07 14:17:37,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:17:37,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:17:39,118 INFO L134 CoverageAnalysis]: Checked inductivity of 1306 backedges. 509 proven. 513 refuted. 0 times theorem prover too weak. 284 trivial. 0 not checked. [2019-12-07 14:17:39,118 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823199504] [2019-12-07 14:17:39,118 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1835645121] [2019-12-07 14:17:39,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a2095aae-0f0e-4dd7-821c-2b25dccb5857/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:17:39,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:17:39,253 INFO L264 TraceCheckSpWp]: Trace formula consists of 853 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-07 14:17:39,258 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:17:39,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:17:40,197 INFO L134 CoverageAnalysis]: Checked inductivity of 1306 backedges. 683 proven. 5 refuted. 0 times theorem prover too weak. 618 trivial. 0 not checked. [2019-12-07 14:17:40,198 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 14:17:40,198 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5] total 9 [2019-12-07 14:17:40,198 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300461972] [2019-12-07 14:17:40,199 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 14:17:40,199 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:17:40,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 14:17:40,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-12-07 14:17:40,199 INFO L87 Difference]: Start difference. First operand 13475 states and 14247 transitions. Second operand 10 states. [2019-12-07 14:17:43,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:17:43,385 INFO L93 Difference]: Finished difference Result 27354 states and 28927 transitions. [2019-12-07 14:17:43,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-07 14:17:43,385 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 673 [2019-12-07 14:17:43,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:17:43,396 INFO L225 Difference]: With dead ends: 27354 [2019-12-07 14:17:43,396 INFO L226 Difference]: Without dead ends: 14435 [2019-12-07 14:17:43,402 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 695 GetRequests, 674 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=175, Invalid=331, Unknown=0, NotChecked=0, Total=506 [2019-12-07 14:17:43,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14435 states. [2019-12-07 14:17:43,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14435 to 13290. [2019-12-07 14:17:43,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13290 states. [2019-12-07 14:17:43,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13290 states to 13290 states and 14043 transitions. [2019-12-07 14:17:43,524 INFO L78 Accepts]: Start accepts. Automaton has 13290 states and 14043 transitions. Word has length 673 [2019-12-07 14:17:43,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:17:43,524 INFO L462 AbstractCegarLoop]: Abstraction has 13290 states and 14043 transitions. [2019-12-07 14:17:43,524 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 14:17:43,525 INFO L276 IsEmpty]: Start isEmpty. Operand 13290 states and 14043 transitions. [2019-12-07 14:17:43,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 748 [2019-12-07 14:17:43,531 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:17:43,532 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:17:43,732 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:17:43,733 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:17:43,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:17:43,733 INFO L82 PathProgramCache]: Analyzing trace with hash -2108246262, now seen corresponding path program 1 times [2019-12-07 14:17:43,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:17:43,734 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466316745] [2019-12-07 14:17:43,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:17:43,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:17:45,483 INFO L134 CoverageAnalysis]: Checked inductivity of 1754 backedges. 560 proven. 1104 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-12-07 14:17:45,483 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466316745] [2019-12-07 14:17:45,484 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1195428874] [2019-12-07 14:17:45,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a2095aae-0f0e-4dd7-821c-2b25dccb5857/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:17:45,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:17:45,619 INFO L264 TraceCheckSpWp]: Trace formula consists of 957 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 14:17:45,623 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:17:45,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:17:45,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:17:46,521 INFO L134 CoverageAnalysis]: Checked inductivity of 1754 backedges. 902 proven. 121 refuted. 0 times theorem prover too weak. 731 trivial. 0 not checked. [2019-12-07 14:17:46,521 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 14:17:46,521 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 3] total 17 [2019-12-07 14:17:46,521 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607539917] [2019-12-07 14:17:46,522 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-07 14:17:46,522 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:17:46,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-07 14:17:46,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2019-12-07 14:17:46,523 INFO L87 Difference]: Start difference. First operand 13290 states and 14043 transitions. Second operand 18 states. [2019-12-07 14:18:03,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:18:03,199 INFO L93 Difference]: Finished difference Result 42011 states and 44222 transitions. [2019-12-07 14:18:03,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-12-07 14:18:03,199 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 747 [2019-12-07 14:18:03,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:18:03,215 INFO L225 Difference]: With dead ends: 42011 [2019-12-07 14:18:03,215 INFO L226 Difference]: Without dead ends: 29087 [2019-12-07 14:18:03,223 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 825 GetRequests, 745 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2112 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1424, Invalid=5056, Unknown=0, NotChecked=0, Total=6480 [2019-12-07 14:18:03,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29087 states. [2019-12-07 14:18:03,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29087 to 12740. [2019-12-07 14:18:03,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12740 states. [2019-12-07 14:18:03,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12740 states to 12740 states and 13431 transitions. [2019-12-07 14:18:03,394 INFO L78 Accepts]: Start accepts. Automaton has 12740 states and 13431 transitions. Word has length 747 [2019-12-07 14:18:03,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:18:03,394 INFO L462 AbstractCegarLoop]: Abstraction has 12740 states and 13431 transitions. [2019-12-07 14:18:03,394 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-07 14:18:03,394 INFO L276 IsEmpty]: Start isEmpty. Operand 12740 states and 13431 transitions. [2019-12-07 14:18:03,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 878 [2019-12-07 14:18:03,402 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:18:03,403 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:18:03,603 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:18:03,604 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:18:03,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:18:03,604 INFO L82 PathProgramCache]: Analyzing trace with hash -39729776, now seen corresponding path program 1 times [2019-12-07 14:18:03,605 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:18:03,605 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033269578] [2019-12-07 14:18:03,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:18:03,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:18:04,315 INFO L134 CoverageAnalysis]: Checked inductivity of 2089 backedges. 1301 proven. 204 refuted. 0 times theorem prover too weak. 584 trivial. 0 not checked. [2019-12-07 14:18:04,315 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033269578] [2019-12-07 14:18:04,315 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1058886469] [2019-12-07 14:18:04,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a2095aae-0f0e-4dd7-821c-2b25dccb5857/bin/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:18:04,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:18:04,468 INFO L264 TraceCheckSpWp]: Trace formula consists of 1083 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-07 14:18:04,473 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:18:04,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:18:04,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:18:04,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:18:06,045 INFO L134 CoverageAnalysis]: Checked inductivity of 2089 backedges. 396 proven. 1551 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2019-12-07 14:18:06,046 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 14:18:06,046 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8] total 12 [2019-12-07 14:18:06,046 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831442820] [2019-12-07 14:18:06,047 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 14:18:06,047 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:18:06,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 14:18:06,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-12-07 14:18:06,048 INFO L87 Difference]: Start difference. First operand 12740 states and 13431 transitions. Second operand 12 states. [2019-12-07 14:18:12,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:18:12,922 INFO L93 Difference]: Finished difference Result 29527 states and 31031 transitions. [2019-12-07 14:18:12,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-07 14:18:12,924 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 877 [2019-12-07 14:18:12,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:18:12,941 INFO L225 Difference]: With dead ends: 29527 [2019-12-07 14:18:12,941 INFO L226 Difference]: Without dead ends: 17343 [2019-12-07 14:18:12,948 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 905 GetRequests, 882 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=160, Invalid=346, Unknown=0, NotChecked=0, Total=506 [2019-12-07 14:18:12,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17343 states. [2019-12-07 14:18:13,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17343 to 9414. [2019-12-07 14:18:13,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9414 states. [2019-12-07 14:18:13,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9414 states to 9414 states and 9873 transitions. [2019-12-07 14:18:13,066 INFO L78 Accepts]: Start accepts. Automaton has 9414 states and 9873 transitions. Word has length 877 [2019-12-07 14:18:13,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:18:13,066 INFO L462 AbstractCegarLoop]: Abstraction has 9414 states and 9873 transitions. [2019-12-07 14:18:13,066 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 14:18:13,066 INFO L276 IsEmpty]: Start isEmpty. Operand 9414 states and 9873 transitions. [2019-12-07 14:18:13,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1043 [2019-12-07 14:18:13,075 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:18:13,075 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, 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, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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-12-07 14:18:13,276 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:18:13,276 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:18:13,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:18:13,277 INFO L82 PathProgramCache]: Analyzing trace with hash 462171579, now seen corresponding path program 1 times [2019-12-07 14:18:13,277 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:18:13,277 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005981375] [2019-12-07 14:18:13,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:18:13,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:18:13,965 INFO L134 CoverageAnalysis]: Checked inductivity of 4003 backedges. 2573 proven. 0 refuted. 0 times theorem prover too weak. 1430 trivial. 0 not checked. [2019-12-07 14:18:13,965 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005981375] [2019-12-07 14:18:13,965 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:18:13,965 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:18:13,965 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773988643] [2019-12-07 14:18:13,966 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:18:13,966 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:18:13,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:18:13,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:18:13,966 INFO L87 Difference]: Start difference. First operand 9414 states and 9873 transitions. Second operand 3 states. [2019-12-07 14:18:14,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:18:14,403 INFO L93 Difference]: Finished difference Result 19011 states and 19935 transitions. [2019-12-07 14:18:14,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:18:14,403 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1042 [2019-12-07 14:18:14,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:18:14,409 INFO L225 Difference]: With dead ends: 19011 [2019-12-07 14:18:14,409 INFO L226 Difference]: Without dead ends: 10153 [2019-12-07 14:18:14,412 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:18:14,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10153 states. [2019-12-07 14:18:14,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10153 to 9046. [2019-12-07 14:18:14,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9046 states. [2019-12-07 14:18:14,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9046 states to 9046 states and 9478 transitions. [2019-12-07 14:18:14,490 INFO L78 Accepts]: Start accepts. Automaton has 9046 states and 9478 transitions. Word has length 1042 [2019-12-07 14:18:14,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:18:14,491 INFO L462 AbstractCegarLoop]: Abstraction has 9046 states and 9478 transitions. [2019-12-07 14:18:14,491 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:18:14,491 INFO L276 IsEmpty]: Start isEmpty. Operand 9046 states and 9478 transitions. [2019-12-07 14:18:14,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1058 [2019-12-07 14:18:14,499 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:18:14,500 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, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:18:14,500 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:18:14,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:18:14,500 INFO L82 PathProgramCache]: Analyzing trace with hash 1858188437, now seen corresponding path program 1 times [2019-12-07 14:18:14,500 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:18:14,501 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817325220] [2019-12-07 14:18:14,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:18:14,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:18:15,818 INFO L134 CoverageAnalysis]: Checked inductivity of 3373 backedges. 2188 proven. 0 refuted. 0 times theorem prover too weak. 1185 trivial. 0 not checked. [2019-12-07 14:18:15,819 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817325220] [2019-12-07 14:18:15,819 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:18:15,819 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 14:18:15,819 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110937653] [2019-12-07 14:18:15,820 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 14:18:15,820 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:18:15,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 14:18:15,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-12-07 14:18:15,820 INFO L87 Difference]: Start difference. First operand 9046 states and 9478 transitions. Second operand 7 states. [2019-12-07 14:18:17,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:18:17,201 INFO L93 Difference]: Finished difference Result 19193 states and 20119 transitions. [2019-12-07 14:18:17,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 14:18:17,201 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 1057 [2019-12-07 14:18:17,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:18:17,207 INFO L225 Difference]: With dead ends: 19193 [2019-12-07 14:18:17,207 INFO L226 Difference]: Without dead ends: 10703 [2019-12-07 14:18:17,211 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-12-07 14:18:17,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10703 states. [2019-12-07 14:18:17,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10703 to 9598. [2019-12-07 14:18:17,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9598 states. [2019-12-07 14:18:17,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9598 states to 9598 states and 10058 transitions. [2019-12-07 14:18:17,295 INFO L78 Accepts]: Start accepts. Automaton has 9598 states and 10058 transitions. Word has length 1057 [2019-12-07 14:18:17,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:18:17,296 INFO L462 AbstractCegarLoop]: Abstraction has 9598 states and 10058 transitions. [2019-12-07 14:18:17,296 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 14:18:17,296 INFO L276 IsEmpty]: Start isEmpty. Operand 9598 states and 10058 transitions. [2019-12-07 14:18:17,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1068 [2019-12-07 14:18:17,305 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:18:17,305 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, 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 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-12-07 14:18:17,305 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:18:17,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:18:17,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1236626021, now seen corresponding path program 1 times [2019-12-07 14:18:17,306 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:18:17,306 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581581571] [2019-12-07 14:18:17,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:18:17,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:18:18,140 INFO L134 CoverageAnalysis]: Checked inductivity of 4128 backedges. 2832 proven. 0 refuted. 0 times theorem prover too weak. 1296 trivial. 0 not checked. [2019-12-07 14:18:18,141 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581581571] [2019-12-07 14:18:18,141 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:18:18,141 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 14:18:18,141 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767593931] [2019-12-07 14:18:18,142 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:18:18,142 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:18:18,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:18:18,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:18:18,142 INFO L87 Difference]: Start difference. First operand 9598 states and 10058 transitions. Second operand 5 states. [2019-12-07 14:18:19,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:18:19,211 INFO L93 Difference]: Finished difference Result 20301 states and 21296 transitions. [2019-12-07 14:18:19,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:18:19,211 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1067 [2019-12-07 14:18:19,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:18:19,217 INFO L225 Difference]: With dead ends: 20301 [2019-12-07 14:18:19,218 INFO L226 Difference]: Without dead ends: 11259 [2019-12-07 14:18:19,221 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:18:19,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11259 states. [2019-12-07 14:18:19,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11259 to 10522. [2019-12-07 14:18:19,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10522 states. [2019-12-07 14:18:19,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10522 states to 10522 states and 11025 transitions. [2019-12-07 14:18:19,306 INFO L78 Accepts]: Start accepts. Automaton has 10522 states and 11025 transitions. Word has length 1067 [2019-12-07 14:18:19,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:18:19,307 INFO L462 AbstractCegarLoop]: Abstraction has 10522 states and 11025 transitions. [2019-12-07 14:18:19,307 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:18:19,307 INFO L276 IsEmpty]: Start isEmpty. Operand 10522 states and 11025 transitions. [2019-12-07 14:18:19,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1075 [2019-12-07 14:18:19,316 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:18:19,316 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, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:18:19,316 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:18:19,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:18:19,316 INFO L82 PathProgramCache]: Analyzing trace with hash -89935406, now seen corresponding path program 1 times [2019-12-07 14:18:19,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:18:19,317 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836870992] [2019-12-07 14:18:19,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:18:19,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:18:20,184 INFO L134 CoverageAnalysis]: Checked inductivity of 3397 backedges. 2489 proven. 0 refuted. 0 times theorem prover too weak. 908 trivial. 0 not checked. [2019-12-07 14:18:20,185 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836870992] [2019-12-07 14:18:20,185 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:18:20,185 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 14:18:20,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340462250] [2019-12-07 14:18:20,186 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:18:20,186 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:18:20,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:18:20,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:18:20,186 INFO L87 Difference]: Start difference. First operand 10522 states and 11025 transitions. Second operand 5 states. [2019-12-07 14:18:21,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:18:21,041 INFO L93 Difference]: Finished difference Result 16980 states and 17788 transitions. [2019-12-07 14:18:21,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:18:21,041 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1074 [2019-12-07 14:18:21,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:18:21,042 INFO L225 Difference]: With dead ends: 16980 [2019-12-07 14:18:21,042 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 14:18:21,046 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:18:21,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 14:18:21,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 14:18:21,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 14:18:21,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 14:18:21,046 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1074 [2019-12-07 14:18:21,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:18:21,046 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 14:18:21,046 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:18:21,046 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 14:18:21,047 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 14:18:21,048 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 14:18:24,077 WARN L192 SmtUtils]: Spent 3.02 s on a formula simplification. DAG size of input: 1482 DAG size of output: 1302 [2019-12-07 14:18:26,950 WARN L192 SmtUtils]: Spent 2.87 s on a formula simplification. DAG size of input: 1482 DAG size of output: 1302 [2019-12-07 14:18:42,247 WARN L192 SmtUtils]: Spent 15.29 s on a formula simplification. DAG size of input: 1260 DAG size of output: 214 [2019-12-07 14:18:57,508 WARN L192 SmtUtils]: Spent 15.25 s on a formula simplification. DAG size of input: 1260 DAG size of output: 214 [2019-12-07 14:18:57,511 INFO L246 CegarLoopResult]: For program point L168(line 168) no Hoare annotation was computed. [2019-12-07 14:18:57,511 INFO L246 CegarLoopResult]: For program point L102(line 102) no Hoare annotation was computed. [2019-12-07 14:18:57,511 INFO L246 CegarLoopResult]: For program point L36(line 36) no Hoare annotation was computed. [2019-12-07 14:18:57,511 INFO L249 CegarLoopResult]: At program point L1028(lines 1028 1044) the Hoare annotation is: true [2019-12-07 14:18:57,511 INFO L246 CegarLoopResult]: For program point L566(lines 566 1024) no Hoare annotation was computed. [2019-12-07 14:18:57,511 INFO L246 CegarLoopResult]: For program point L500(lines 500 1024) no Hoare annotation was computed. [2019-12-07 14:18:57,512 INFO L246 CegarLoopResult]: For program point L170-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 14:18:57,512 INFO L246 CegarLoopResult]: For program point L104-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 14:18:57,512 INFO L246 CegarLoopResult]: For program point L38-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 14:18:57,512 INFO L246 CegarLoopResult]: For program point L963(lines 963 1024) no Hoare annotation was computed. [2019-12-07 14:18:57,512 INFO L246 CegarLoopResult]: For program point L831(lines 831 1024) no Hoare annotation was computed. [2019-12-07 14:18:57,512 INFO L246 CegarLoopResult]: For program point L171(line 171) no Hoare annotation was computed. [2019-12-07 14:18:57,512 INFO L246 CegarLoopResult]: For program point L105(line 105) no Hoare annotation was computed. [2019-12-07 14:18:57,512 INFO L246 CegarLoopResult]: For program point L39(line 39) no Hoare annotation was computed. [2019-12-07 14:18:57,512 INFO L246 CegarLoopResult]: For program point L898(lines 898 1024) no Hoare annotation was computed. [2019-12-07 14:18:57,512 INFO L246 CegarLoopResult]: For program point L436(lines 436 1024) no Hoare annotation was computed. [2019-12-07 14:18:57,512 INFO L246 CegarLoopResult]: For program point L370(lines 370 1024) no Hoare annotation was computed. [2019-12-07 14:18:57,512 INFO L246 CegarLoopResult]: For program point L635(lines 635 1024) no Hoare annotation was computed. [2019-12-07 14:18:57,512 INFO L246 CegarLoopResult]: For program point L305(lines 305 1024) no Hoare annotation was computed. [2019-12-07 14:18:57,512 INFO L246 CegarLoopResult]: For program point L173-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 14:18:57,512 INFO L246 CegarLoopResult]: For program point L107-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 14:18:57,513 INFO L246 CegarLoopResult]: For program point L41-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 14:18:57,513 INFO L246 CegarLoopResult]: For program point L240(lines 240 1024) no Hoare annotation was computed. [2019-12-07 14:18:57,513 INFO L246 CegarLoopResult]: For program point L174(line 174) no Hoare annotation was computed. [2019-12-07 14:18:57,513 INFO L246 CegarLoopResult]: For program point L108(line 108) no Hoare annotation was computed. [2019-12-07 14:18:57,513 INFO L246 CegarLoopResult]: For program point L42(line 42) no Hoare annotation was computed. [2019-12-07 14:18:57,513 INFO L246 CegarLoopResult]: For program point L769(lines 769 1024) no Hoare annotation was computed. [2019-12-07 14:18:57,513 INFO L242 CegarLoopResult]: At program point L1034-2(lines 1034 1043) the Hoare annotation is: (let ((.cse0 (= ~a25~0 13))) (let ((.cse4 (<= ~a29~0 245)) (.cse16 (< 306 ~a23~0)) (.cse15 (<= ~a29~0 277)) (.cse21 (<= 0 (+ ~a23~0 599913))) (.cse14 (+ ~a23~0 43)) (.cse18 (<= ~a23~0 306)) (.cse2 (<= ~a23~0 138)) (.cse22 (not .cse0)) (.cse9 (<= ~a23~0 600000)) (.cse11 (= ~a25~0 9)) (.cse23 (<= 0 (+ ~a29~0 28553))) (.cse24 (<= 0 (+ ~a23~0 600262))) (.cse10 (= ~a25~0 10)) (.cse26 (<= ~a29~0 140)) (.cse7 (= ~a25~0 12)) (.cse12 (<= ~a4~0 0)) (.cse19 (< 140 ~a29~0)) (.cse28 (<= ~a29~0 274)) (.cse20 (<= (+ ~a23~0 55) 0)) (.cse6 (<= 130 ~a29~0)) (.cse8 (<= ~a23~0 312)) (.cse1 (= 1 ~a3~0)) (.cse17 (<= 141 ~a29~0)) (.cse3 (= 15 ~a8~0)) (.cse5 (= 1 ~a4~0)) (.cse25 (= ~a25~0 11))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse1 .cse3 .cse5 (<= 0 (+ ~a23~0 39))) (and .cse9 .cse1 .cse3 .cse5 .cse10) (and .cse1 (or (and .cse11 .cse12 (exists ((v_~a29~0_504 Int)) (let ((.cse13 (mod v_~a29~0_504 299861))) (and (<= (+ .cse13 10250) ~a29~0) (= 0 .cse13) (< 140 v_~a29~0_504)))) (<= .cse14 0)) (and .cse7 (exists ((v_~a29~0_502 Int)) (and (<= 0 v_~a29~0_502) (<= (+ (mod v_~a29~0_502 15) 260) ~a29~0) (<= 130 v_~a29~0_502))) .cse12 .cse15 .cse6)) .cse3) (and .cse1 .cse2 .cse3 .cse5 (<= ~a29~0 220)) (and .cse2 .cse5 .cse10) (and .cse9 .cse0 .cse1 .cse16 (<= ~a29~0 599998) .cse3 .cse5) (and .cse9 .cse7 .cse16 .cse1 .cse4 .cse17 .cse3 .cse5) (and .cse0 .cse1 .cse18 (<= ~a29~0 130) .cse3 .cse5) (and .cse7 .cse12 .cse1 .cse19 .cse20 .cse21 .cse4 .cse3 .cse6) (and .cse12 .cse1 .cse22 .cse23 .cse20 .cse24 .cse3 .cse25 .cse26) (and .cse11 .cse22 .cse5 .cse26) (and .cse9 (or (and .cse7 (not (= 1 ULTIMATE.start_calculate_output_~input))) .cse25) .cse16 .cse1 .cse19 .cse3 .cse15 .cse5) (and .cse7 .cse12 .cse1 (exists ((v_~a29~0_506 Int)) (let ((.cse27 (mod v_~a29~0_506 15))) (and (= 0 .cse27) (<= (+ .cse27 256) ~a29~0) (< 140 v_~a29~0_506)))) .cse28 .cse3 .cse6) (and .cse11 .cse12 .cse1 .cse22 .cse20 .cse21 .cse3 .cse26) (and .cse0 .cse1 (< 0 .cse14) (exists ((v_~a29~0_499 Int)) (let ((.cse29 (div (* v_~a29~0_499 12) 10))) (and (<= 0 (* 12 v_~a29~0_499)) (= 0 (mod .cse29 5)) (< 245 v_~a29~0_499) (<= (+ (div .cse29 5) 99853) ~a29~0) (<= 0 (+ .cse29 1))))) .cse18 .cse3 .cse5) (and .cse11 .cse2 .cse5 .cse6) (and .cse2 .cse5 .cse6 .cse25) (and .cse9 .cse1 .cse3 .cse5 .cse25 (< 277 ~a29~0)) (and (not (= 3 ULTIMATE.start_calculate_output_~input)) (<= 0 (+ ~a23~0 577827)) .cse7 .cse12 .cse1 .cse22 .cse20 (not (= 4 ULTIMATE.start_calculate_output_~input)) .cse3 .cse26) (and .cse9 .cse11 .cse1 .cse3 .cse5) (and .cse12 .cse1 .cse23 .cse20 .cse24 .cse3 .cse10 .cse26) (and .cse7 .cse12 .cse1 .cse19 .cse28 .cse20 (<= 0 (+ ~a23~0 599908)) .cse3 .cse6) (and .cse8 .cse1 .cse17 .cse3 .cse5 .cse25 (exists ((v_~a29~0_508 Int)) (and (<= 0 v_~a29~0_508) (<= 130 v_~a29~0_508) (<= ~a29~0 (+ (mod v_~a29~0_508 15) 261)))))))) [2019-12-07 14:18:57,513 INFO L246 CegarLoopResult]: For program point L836(lines 836 1024) no Hoare annotation was computed. [2019-12-07 14:18:57,514 INFO L246 CegarLoopResult]: For program point L572(lines 572 1024) no Hoare annotation was computed. [2019-12-07 14:18:57,514 INFO L246 CegarLoopResult]: For program point L176-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 14:18:57,514 INFO L246 CegarLoopResult]: For program point L110-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 14:18:57,514 INFO L246 CegarLoopResult]: For program point L44-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 14:18:57,514 INFO L246 CegarLoopResult]: For program point L969(lines 969 1024) no Hoare annotation was computed. [2019-12-07 14:18:57,514 INFO L246 CegarLoopResult]: For program point L903(lines 903 1024) no Hoare annotation was computed. [2019-12-07 14:18:57,514 INFO L246 CegarLoopResult]: For program point L507(lines 507 1024) no Hoare annotation was computed. [2019-12-07 14:18:57,514 INFO L246 CegarLoopResult]: For program point L177(line 177) no Hoare annotation was computed. [2019-12-07 14:18:57,514 INFO L246 CegarLoopResult]: For program point L111(line 111) no Hoare annotation was computed. [2019-12-07 14:18:57,514 INFO L246 CegarLoopResult]: For program point L45(line 45) no Hoare annotation was computed. [2019-12-07 14:18:57,514 INFO L246 CegarLoopResult]: For program point L970(lines 970 980) no Hoare annotation was computed. [2019-12-07 14:18:57,514 INFO L246 CegarLoopResult]: For program point L904(lines 904 914) no Hoare annotation was computed. [2019-12-07 14:18:57,514 INFO L246 CegarLoopResult]: For program point L970-2(lines 970 980) no Hoare annotation was computed. [2019-12-07 14:18:57,514 INFO L246 CegarLoopResult]: For program point L904-2(lines 904 914) no Hoare annotation was computed. [2019-12-07 14:18:57,514 INFO L246 CegarLoopResult]: For program point L706(lines 706 1024) no Hoare annotation was computed. [2019-12-07 14:18:57,514 INFO L246 CegarLoopResult]: For program point L310(lines 310 1024) no Hoare annotation was computed. [2019-12-07 14:18:57,514 INFO L246 CegarLoopResult]: For program point L575(lines 575 1024) no Hoare annotation was computed. [2019-12-07 14:18:57,515 INFO L246 CegarLoopResult]: For program point L443(lines 443 1024) no Hoare annotation was computed. [2019-12-07 14:18:57,515 INFO L246 CegarLoopResult]: For program point L377(lines 377 1024) no Hoare annotation was computed. [2019-12-07 14:18:57,515 INFO L246 CegarLoopResult]: For program point L179-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 14:18:57,515 INFO L246 CegarLoopResult]: For program point L113-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 14:18:57,515 INFO L246 CegarLoopResult]: For program point L47-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 14:18:57,515 INFO L246 CegarLoopResult]: For program point L774(lines 774 1024) no Hoare annotation was computed. [2019-12-07 14:18:57,515 INFO L246 CegarLoopResult]: For program point L642(lines 642 1024) no Hoare annotation was computed. [2019-12-07 14:18:57,515 INFO L246 CegarLoopResult]: For program point L180(line 180) no Hoare annotation was computed. [2019-12-07 14:18:57,515 INFO L246 CegarLoopResult]: For program point L114(line 114) no Hoare annotation was computed. [2019-12-07 14:18:57,515 INFO L246 CegarLoopResult]: For program point L48(line 48) no Hoare annotation was computed. [2019-12-07 14:18:57,515 INFO L246 CegarLoopResult]: For program point L1039(line 1039) no Hoare annotation was computed. [2019-12-07 14:18:57,515 INFO L246 CegarLoopResult]: For program point L841(lines 841 1024) no Hoare annotation was computed. [2019-12-07 14:18:57,515 INFO L246 CegarLoopResult]: For program point L247(lines 247 1024) no Hoare annotation was computed. [2019-12-07 14:18:57,515 INFO L246 CegarLoopResult]: For program point L182-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 14:18:57,515 INFO L246 CegarLoopResult]: For program point L116-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 14:18:57,515 INFO L246 CegarLoopResult]: For program point L50-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 14:18:57,515 INFO L246 CegarLoopResult]: For program point L183(line 183) no Hoare annotation was computed. [2019-12-07 14:18:57,516 INFO L246 CegarLoopResult]: For program point L117(line 117) no Hoare annotation was computed. [2019-12-07 14:18:57,516 INFO L246 CegarLoopResult]: For program point L51(line 51) no Hoare annotation was computed. [2019-12-07 14:18:57,516 INFO L246 CegarLoopResult]: For program point L712(lines 712 1024) no Hoare annotation was computed. [2019-12-07 14:18:57,516 INFO L246 CegarLoopResult]: For program point L514(lines 514 1024) no Hoare annotation was computed. [2019-12-07 14:18:57,516 INFO L246 CegarLoopResult]: For program point L647(lines 647 1024) no Hoare annotation was computed. [2019-12-07 14:18:57,516 INFO L246 CegarLoopResult]: For program point L581(lines 581 1024) no Hoare annotation was computed. [2019-12-07 14:18:57,516 INFO L246 CegarLoopResult]: For program point L515(lines 515 525) no Hoare annotation was computed. [2019-12-07 14:18:57,516 INFO L246 CegarLoopResult]: For program point L515-2(lines 515 525) no Hoare annotation was computed. [2019-12-07 14:18:57,516 INFO L246 CegarLoopResult]: For program point L317(lines 317 1024) no Hoare annotation was computed. [2019-12-07 14:18:57,516 INFO L246 CegarLoopResult]: For program point L185-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 14:18:57,516 INFO L246 CegarLoopResult]: For program point L119-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 14:18:57,516 INFO L246 CegarLoopResult]: For program point L53-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 14:18:57,516 INFO L246 CegarLoopResult]: For program point L846(lines 846 1024) no Hoare annotation was computed. [2019-12-07 14:18:57,516 INFO L246 CegarLoopResult]: For program point L780(lines 780 1024) no Hoare annotation was computed. [2019-12-07 14:18:57,516 INFO L246 CegarLoopResult]: For program point L648(lines 648 657) no Hoare annotation was computed. [2019-12-07 14:18:57,516 INFO L246 CegarLoopResult]: For program point L648-2(lines 648 657) no Hoare annotation was computed. [2019-12-07 14:18:57,516 INFO L246 CegarLoopResult]: For program point L450(lines 450 1024) no Hoare annotation was computed. [2019-12-07 14:18:57,517 INFO L246 CegarLoopResult]: For program point L384(lines 384 1024) no Hoare annotation was computed. [2019-12-07 14:18:57,517 INFO L246 CegarLoopResult]: For program point L186(line 186) no Hoare annotation was computed. [2019-12-07 14:18:57,517 INFO L246 CegarLoopResult]: For program point L120(line 120) no Hoare annotation was computed. [2019-12-07 14:18:57,517 INFO L246 CegarLoopResult]: For program point L54(line 54) no Hoare annotation was computed. [2019-12-07 14:18:57,517 INFO L246 CegarLoopResult]: For program point L254(lines 254 1024) no Hoare annotation was computed. [2019-12-07 14:18:57,517 INFO L246 CegarLoopResult]: For program point L188-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 14:18:57,517 INFO L246 CegarLoopResult]: For program point L122-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 14:18:57,517 INFO L246 CegarLoopResult]: For program point L56-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 14:18:57,517 INFO L246 CegarLoopResult]: For program point L981(lines 981 1024) no Hoare annotation was computed. [2019-12-07 14:18:57,517 INFO L246 CegarLoopResult]: For program point L915(lines 915 1024) no Hoare annotation was computed. [2019-12-07 14:18:57,517 INFO L246 CegarLoopResult]: For program point L717(lines 717 1024) no Hoare annotation was computed. [2019-12-07 14:18:57,517 INFO L246 CegarLoopResult]: For program point L189(line 189) no Hoare annotation was computed. [2019-12-07 14:18:57,517 INFO L246 CegarLoopResult]: For program point L123(line 123) no Hoare annotation was computed. [2019-12-07 14:18:57,517 INFO L246 CegarLoopResult]: For program point L57(line 57) no Hoare annotation was computed. [2019-12-07 14:18:57,517 INFO L246 CegarLoopResult]: For program point L916(lines 916 926) no Hoare annotation was computed. [2019-12-07 14:18:57,517 INFO L246 CegarLoopResult]: For program point L916-2(lines 916 926) no Hoare annotation was computed. [2019-12-07 14:18:57,517 INFO L246 CegarLoopResult]: For program point L718(lines 718 730) no Hoare annotation was computed. [2019-12-07 14:18:57,518 INFO L246 CegarLoopResult]: For program point L718-2(lines 718 730) no Hoare annotation was computed. [2019-12-07 14:18:57,518 INFO L246 CegarLoopResult]: For program point L586(lines 586 1024) no Hoare annotation was computed. [2019-12-07 14:18:57,518 INFO L246 CegarLoopResult]: For program point L322(lines 322 1024) no Hoare annotation was computed. [2019-12-07 14:18:57,518 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 14:18:57,518 INFO L246 CegarLoopResult]: For program point L587(lines 587 597) no Hoare annotation was computed. [2019-12-07 14:18:57,518 INFO L246 CegarLoopResult]: For program point L587-2(lines 587 597) no Hoare annotation was computed. [2019-12-07 14:18:57,518 INFO L246 CegarLoopResult]: For program point L191-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 14:18:57,518 INFO L246 CegarLoopResult]: For program point L125-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 14:18:57,518 INFO L246 CegarLoopResult]: For program point L59-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 14:18:57,518 INFO L246 CegarLoopResult]: For program point L852(lines 852 1024) no Hoare annotation was computed. [2019-12-07 14:18:57,518 INFO L246 CegarLoopResult]: For program point L456(lines 456 1024) no Hoare annotation was computed. [2019-12-07 14:18:57,518 INFO L246 CegarLoopResult]: For program point L192(line 192) no Hoare annotation was computed. [2019-12-07 14:18:57,518 INFO L246 CegarLoopResult]: For program point L126(line 126) no Hoare annotation was computed. [2019-12-07 14:18:57,518 INFO L246 CegarLoopResult]: For program point L60(line 60) no Hoare annotation was computed. [2019-12-07 14:18:57,518 INFO L246 CegarLoopResult]: For program point L787(lines 787 1024) no Hoare annotation was computed. [2019-12-07 14:18:57,518 INFO L246 CegarLoopResult]: For program point L391(lines 391 1024) no Hoare annotation was computed. [2019-12-07 14:18:57,518 INFO L246 CegarLoopResult]: For program point L260(lines 260 1024) no Hoare annotation was computed. [2019-12-07 14:18:57,518 INFO L246 CegarLoopResult]: For program point L194-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 14:18:57,519 INFO L246 CegarLoopResult]: For program point L128-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 14:18:57,519 INFO L246 CegarLoopResult]: For program point L62-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 14:18:57,519 INFO L246 CegarLoopResult]: For program point L195(line 195) no Hoare annotation was computed. [2019-12-07 14:18:57,519 INFO L246 CegarLoopResult]: For program point L129(line 129) no Hoare annotation was computed. [2019-12-07 14:18:57,519 INFO L246 CegarLoopResult]: For program point L63(line 63) no Hoare annotation was computed. [2019-12-07 14:18:57,519 INFO L246 CegarLoopResult]: For program point L988(lines 988 1024) no Hoare annotation was computed. [2019-12-07 14:18:57,519 INFO L246 CegarLoopResult]: For program point L658(lines 658 1024) no Hoare annotation was computed. [2019-12-07 14:18:57,519 INFO L246 CegarLoopResult]: For program point L526(lines 526 1024) no Hoare annotation was computed. [2019-12-07 14:18:57,519 INFO L246 CegarLoopResult]: For program point L329(lines 329 1024) no Hoare annotation was computed. [2019-12-07 14:18:57,519 INFO L246 CegarLoopResult]: For program point L197-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 14:18:57,519 INFO L246 CegarLoopResult]: For program point L131-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 14:18:57,519 INFO L246 CegarLoopResult]: For program point L65-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 14:18:57,519 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-12-07 14:18:57,519 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 156) no Hoare annotation was computed. [2019-12-07 14:18:57,519 INFO L246 CegarLoopResult]: For program point L792(lines 792 1024) no Hoare annotation was computed. [2019-12-07 14:18:57,519 INFO L246 CegarLoopResult]: For program point L198(line 198) no Hoare annotation was computed. [2019-12-07 14:18:57,520 INFO L246 CegarLoopResult]: For program point L132(line 132) no Hoare annotation was computed. [2019-12-07 14:18:57,520 INFO L246 CegarLoopResult]: For program point L66(line 66) no Hoare annotation was computed. [2019-12-07 14:18:57,520 INFO L246 CegarLoopResult]: For program point L859(lines 859 1024) no Hoare annotation was computed. [2019-12-07 14:18:57,520 INFO L246 CegarLoopResult]: For program point L463(lines 463 1024) no Hoare annotation was computed. [2019-12-07 14:18:57,520 INFO L246 CegarLoopResult]: For program point L265(lines 265 1024) no Hoare annotation was computed. [2019-12-07 14:18:57,520 INFO L246 CegarLoopResult]: For program point L398(lines 398 1024) no Hoare annotation was computed. [2019-12-07 14:18:57,520 INFO L246 CegarLoopResult]: For program point L200-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 14:18:57,520 INFO L246 CegarLoopResult]: For program point L134-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 14:18:57,520 INFO L246 CegarLoopResult]: For program point L68-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 14:18:57,520 INFO L246 CegarLoopResult]: For program point L993(lines 993 1024) no Hoare annotation was computed. [2019-12-07 14:18:57,520 INFO L246 CegarLoopResult]: For program point L927(lines 927 1024) no Hoare annotation was computed. [2019-12-07 14:18:57,520 INFO L246 CegarLoopResult]: For program point L663(lines 663 1024) no Hoare annotation was computed. [2019-12-07 14:18:57,520 INFO L246 CegarLoopResult]: For program point L531(lines 531 1024) no Hoare annotation was computed. [2019-12-07 14:18:57,520 INFO L246 CegarLoopResult]: For program point L399(lines 399 410) no Hoare annotation was computed. [2019-12-07 14:18:57,520 INFO L246 CegarLoopResult]: For program point L399-2(lines 399 410) no Hoare annotation was computed. [2019-12-07 14:18:57,520 INFO L246 CegarLoopResult]: For program point L201(line 201) no Hoare annotation was computed. [2019-12-07 14:18:57,520 INFO L246 CegarLoopResult]: For program point L135(line 135) no Hoare annotation was computed. [2019-12-07 14:18:57,521 INFO L246 CegarLoopResult]: For program point L69(line 69) no Hoare annotation was computed. [2019-12-07 14:18:57,521 INFO L246 CegarLoopResult]: For program point L598(lines 598 1024) no Hoare annotation was computed. [2019-12-07 14:18:57,521 INFO L246 CegarLoopResult]: For program point L334(lines 334 1024) no Hoare annotation was computed. [2019-12-07 14:18:57,521 INFO L246 CegarLoopResult]: For program point L268(lines 268 1024) no Hoare annotation was computed. [2019-12-07 14:18:57,521 INFO L246 CegarLoopResult]: For program point L731(lines 731 1024) no Hoare annotation was computed. [2019-12-07 14:18:57,521 INFO L246 CegarLoopResult]: For program point L203-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 14:18:57,521 INFO L246 CegarLoopResult]: For program point L137-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 14:18:57,521 INFO L246 CegarLoopResult]: For program point L71-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 14:18:57,521 INFO L246 CegarLoopResult]: For program point L204(line 204) no Hoare annotation was computed. [2019-12-07 14:18:57,521 INFO L246 CegarLoopResult]: For program point L138(line 138) no Hoare annotation was computed. [2019-12-07 14:18:57,521 INFO L246 CegarLoopResult]: For program point L72(line 72) no Hoare annotation was computed. [2019-12-07 14:18:57,521 INFO L246 CegarLoopResult]: For program point L865(lines 865 1024) no Hoare annotation was computed. [2019-12-07 14:18:57,521 INFO L246 CegarLoopResult]: For program point L799(lines 799 1024) no Hoare annotation was computed. [2019-12-07 14:18:57,521 INFO L246 CegarLoopResult]: For program point L932(lines 932 1024) no Hoare annotation was computed. [2019-12-07 14:18:57,521 INFO L246 CegarLoopResult]: For program point L866(lines 866 875) no Hoare annotation was computed. [2019-12-07 14:18:57,521 INFO L246 CegarLoopResult]: For program point L866-2(lines 866 875) no Hoare annotation was computed. [2019-12-07 14:18:57,521 INFO L246 CegarLoopResult]: For program point L470(lines 470 1024) no Hoare annotation was computed. [2019-12-07 14:18:57,521 INFO L246 CegarLoopResult]: For program point L140-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 14:18:57,522 INFO L246 CegarLoopResult]: For program point L74-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 14:18:57,522 INFO L246 CegarLoopResult]: For program point L603(lines 603 1024) no Hoare annotation was computed. [2019-12-07 14:18:57,522 INFO L246 CegarLoopResult]: For program point L537(lines 537 1024) no Hoare annotation was computed. [2019-12-07 14:18:57,522 INFO L246 CegarLoopResult]: For program point L141(line 141) no Hoare annotation was computed. [2019-12-07 14:18:57,522 INFO L246 CegarLoopResult]: For program point L75(line 75) no Hoare annotation was computed. [2019-12-07 14:18:57,522 INFO L246 CegarLoopResult]: For program point L1000(lines 1000 1024) no Hoare annotation was computed. [2019-12-07 14:18:57,522 INFO L246 CegarLoopResult]: For program point L670(lines 670 1024) no Hoare annotation was computed. [2019-12-07 14:18:57,522 INFO L246 CegarLoopResult]: For program point L604(lines 604 614) no Hoare annotation was computed. [2019-12-07 14:18:57,522 INFO L246 CegarLoopResult]: For program point L604-2(lines 604 614) no Hoare annotation was computed. [2019-12-07 14:18:57,522 INFO L246 CegarLoopResult]: For program point L340(lines 340 1024) no Hoare annotation was computed. [2019-12-07 14:18:57,522 INFO L246 CegarLoopResult]: For program point L275(lines 275 1024) no Hoare annotation was computed. [2019-12-07 14:18:57,522 INFO L246 CegarLoopResult]: For program point L143-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 14:18:57,522 INFO L246 CegarLoopResult]: For program point L77-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 14:18:57,522 INFO L246 CegarLoopResult]: For program point L804(lines 804 1024) no Hoare annotation was computed. [2019-12-07 14:18:57,522 INFO L246 CegarLoopResult]: For program point L738(lines 738 1024) no Hoare annotation was computed. [2019-12-07 14:18:57,522 INFO L246 CegarLoopResult]: For program point L144(line 144) no Hoare annotation was computed. [2019-12-07 14:18:57,522 INFO L246 CegarLoopResult]: For program point L78(line 78) no Hoare annotation was computed. [2019-12-07 14:18:57,523 INFO L246 CegarLoopResult]: For program point L805(lines 805 815) no Hoare annotation was computed. [2019-12-07 14:18:57,523 INFO L246 CegarLoopResult]: For program point L805-2(lines 805 815) no Hoare annotation was computed. [2019-12-07 14:18:57,523 INFO L246 CegarLoopResult]: For program point L542(lines 542 1024) no Hoare annotation was computed. [2019-12-07 14:18:57,523 INFO L246 CegarLoopResult]: For program point L146-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 14:18:57,523 INFO L246 CegarLoopResult]: For program point L80-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 14:18:57,523 INFO L246 CegarLoopResult]: For program point L1005(lines 1005 1024) no Hoare annotation was computed. [2019-12-07 14:18:57,523 INFO L246 CegarLoopResult]: For program point L939(lines 939 1024) no Hoare annotation was computed. [2019-12-07 14:18:57,523 INFO L246 CegarLoopResult]: For program point L675(lines 675 1024) no Hoare annotation was computed. [2019-12-07 14:18:57,523 INFO L246 CegarLoopResult]: For program point L477(lines 477 1024) no Hoare annotation was computed. [2019-12-07 14:18:57,523 INFO L246 CegarLoopResult]: For program point L411(lines 411 1024) no Hoare annotation was computed. [2019-12-07 14:18:57,523 INFO L246 CegarLoopResult]: For program point L147(line 147) no Hoare annotation was computed. [2019-12-07 14:18:57,523 INFO L246 CegarLoopResult]: For program point L81(line 81) no Hoare annotation was computed. [2019-12-07 14:18:57,523 INFO L246 CegarLoopResult]: For program point L940(lines 940 952) no Hoare annotation was computed. [2019-12-07 14:18:57,523 INFO L246 CegarLoopResult]: For program point L940-2(lines 940 952) no Hoare annotation was computed. [2019-12-07 14:18:57,523 INFO L246 CegarLoopResult]: For program point L478(lines 478 486) no Hoare annotation was computed. [2019-12-07 14:18:57,523 INFO L246 CegarLoopResult]: For program point L478-2(lines 478 486) no Hoare annotation was computed. [2019-12-07 14:18:57,523 INFO L246 CegarLoopResult]: For program point L346(lines 346 1024) no Hoare annotation was computed. [2019-12-07 14:18:57,524 INFO L246 CegarLoopResult]: For program point L280(lines 280 1024) no Hoare annotation was computed. [2019-12-07 14:18:57,524 INFO L246 CegarLoopResult]: For program point L214(lines 214 1024) no Hoare annotation was computed. [2019-12-07 14:18:57,524 INFO L246 CegarLoopResult]: For program point L743(lines 743 1024) no Hoare annotation was computed. [2019-12-07 14:18:57,524 INFO L246 CegarLoopResult]: For program point L149-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 14:18:57,524 INFO L246 CegarLoopResult]: For program point L83-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 14:18:57,524 INFO L246 CegarLoopResult]: For program point L876(lines 876 1024) no Hoare annotation was computed. [2019-12-07 14:18:57,524 INFO L246 CegarLoopResult]: For program point L150(line 150) no Hoare annotation was computed. [2019-12-07 14:18:57,524 INFO L246 CegarLoopResult]: For program point L84(line 84) no Hoare annotation was computed. [2019-12-07 14:18:57,524 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 14:18:57,524 INFO L246 CegarLoopResult]: For program point L152-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 14:18:57,524 INFO L246 CegarLoopResult]: For program point L86-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 14:18:57,524 INFO L246 CegarLoopResult]: For program point L681(lines 681 1024) no Hoare annotation was computed. [2019-12-07 14:18:57,524 INFO L246 CegarLoopResult]: For program point L615(lines 615 1024) no Hoare annotation was computed. [2019-12-07 14:18:57,524 INFO L246 CegarLoopResult]: For program point L549(lines 549 1024) no Hoare annotation was computed. [2019-12-07 14:18:57,524 INFO L246 CegarLoopResult]: For program point L417(lines 417 1024) no Hoare annotation was computed. [2019-12-07 14:18:57,524 INFO L246 CegarLoopResult]: For program point L153(line 153) no Hoare annotation was computed. [2019-12-07 14:18:57,524 INFO L246 CegarLoopResult]: For program point L87(line 87) no Hoare annotation was computed. [2019-12-07 14:18:57,524 INFO L246 CegarLoopResult]: For program point L1012(lines 1012 1024) no Hoare annotation was computed. [2019-12-07 14:18:57,525 INFO L246 CegarLoopResult]: For program point L881(lines 881 1024) no Hoare annotation was computed. [2019-12-07 14:18:57,525 INFO L246 CegarLoopResult]: For program point L353(lines 353 1024) no Hoare annotation was computed. [2019-12-07 14:18:57,525 INFO L246 CegarLoopResult]: For program point L287(lines 287 1024) no Hoare annotation was computed. [2019-12-07 14:18:57,525 INFO L246 CegarLoopResult]: For program point L221(lines 221 1024) no Hoare annotation was computed. [2019-12-07 14:18:57,525 INFO L246 CegarLoopResult]: For program point L155-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 14:18:57,525 INFO L246 CegarLoopResult]: For program point L89-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 14:18:57,525 INFO L246 CegarLoopResult]: For program point L23(lines 23 25) no Hoare annotation was computed. [2019-12-07 14:18:57,525 INFO L246 CegarLoopResult]: For program point L23-2(lines 22 1026) no Hoare annotation was computed. [2019-12-07 14:18:57,525 INFO L246 CegarLoopResult]: For program point L816(lines 816 1024) no Hoare annotation was computed. [2019-12-07 14:18:57,525 INFO L246 CegarLoopResult]: For program point L750(lines 750 1024) no Hoare annotation was computed. [2019-12-07 14:18:57,525 INFO L246 CegarLoopResult]: For program point L156(line 156) no Hoare annotation was computed. [2019-12-07 14:18:57,525 INFO L246 CegarLoopResult]: For program point L90(line 90) no Hoare annotation was computed. [2019-12-07 14:18:57,525 INFO L246 CegarLoopResult]: For program point L24(line 24) no Hoare annotation was computed. [2019-12-07 14:18:57,525 INFO L246 CegarLoopResult]: For program point L487(lines 487 1024) no Hoare annotation was computed. [2019-12-07 14:18:57,525 INFO L246 CegarLoopResult]: For program point L488(lines 488 499) no Hoare annotation was computed. [2019-12-07 14:18:57,525 INFO L246 CegarLoopResult]: For program point L422(lines 422 1024) no Hoare annotation was computed. [2019-12-07 14:18:57,526 INFO L246 CegarLoopResult]: For program point L488-2(lines 488 499) no Hoare annotation was computed. [2019-12-07 14:18:57,526 INFO L246 CegarLoopResult]: For program point L158-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 14:18:57,526 INFO L246 CegarLoopResult]: For program point L92-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 14:18:57,526 INFO L246 CegarLoopResult]: For program point L26-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 14:18:57,526 INFO L246 CegarLoopResult]: For program point L1017(lines 1017 1024) no Hoare annotation was computed. [2019-12-07 14:18:57,526 INFO L246 CegarLoopResult]: For program point L621(lines 621 1024) no Hoare annotation was computed. [2019-12-07 14:18:57,526 INFO L246 CegarLoopResult]: For program point L555(lines 555 1024) no Hoare annotation was computed. [2019-12-07 14:18:57,526 INFO L246 CegarLoopResult]: For program point L159(line 159) no Hoare annotation was computed. [2019-12-07 14:18:57,526 INFO L246 CegarLoopResult]: For program point L93(line 93) no Hoare annotation was computed. [2019-12-07 14:18:57,526 INFO L246 CegarLoopResult]: For program point L27(line 27) no Hoare annotation was computed. [2019-12-07 14:18:57,526 INFO L246 CegarLoopResult]: For program point L886(lines 886 1024) no Hoare annotation was computed. [2019-12-07 14:18:57,526 INFO L246 CegarLoopResult]: For program point L688(lines 688 1024) no Hoare annotation was computed. [2019-12-07 14:18:57,526 INFO L246 CegarLoopResult]: For program point L358(lines 358 1024) no Hoare annotation was computed. [2019-12-07 14:18:57,526 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-12-07 14:18:57,526 INFO L246 CegarLoopResult]: For program point L953(lines 953 1024) no Hoare annotation was computed. [2019-12-07 14:18:57,526 INFO L246 CegarLoopResult]: For program point L227(lines 227 1024) no Hoare annotation was computed. [2019-12-07 14:18:57,526 INFO L246 CegarLoopResult]: For program point L161-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 14:18:57,526 INFO L246 CegarLoopResult]: For program point L95-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 14:18:57,527 INFO L246 CegarLoopResult]: For program point L29-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 14:18:57,527 INFO L246 CegarLoopResult]: For program point L822(lines 822 1024) no Hoare annotation was computed. [2019-12-07 14:18:57,527 INFO L246 CegarLoopResult]: For program point L294(lines 294 1024) no Hoare annotation was computed. [2019-12-07 14:18:57,527 INFO L246 CegarLoopResult]: For program point L162(line 162) no Hoare annotation was computed. [2019-12-07 14:18:57,527 INFO L246 CegarLoopResult]: For program point L96(line 96) no Hoare annotation was computed. [2019-12-07 14:18:57,527 INFO L246 CegarLoopResult]: For program point L30(line 30) no Hoare annotation was computed. [2019-12-07 14:18:57,527 INFO L246 CegarLoopResult]: For program point L757(lines 757 1024) no Hoare annotation was computed. [2019-12-07 14:18:57,527 INFO L246 CegarLoopResult]: For program point L758(lines 758 768) no Hoare annotation was computed. [2019-12-07 14:18:57,527 INFO L246 CegarLoopResult]: For program point L758-2(lines 758 768) no Hoare annotation was computed. [2019-12-07 14:18:57,527 INFO L246 CegarLoopResult]: For program point L164-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 14:18:57,527 INFO L246 CegarLoopResult]: For program point L98-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 14:18:57,527 INFO L246 CegarLoopResult]: For program point L32-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 14:18:57,527 INFO L246 CegarLoopResult]: For program point L825(lines 825 1024) no Hoare annotation was computed. [2019-12-07 14:18:57,527 INFO L246 CegarLoopResult]: For program point L561(lines 561 1024) no Hoare annotation was computed. [2019-12-07 14:18:57,527 INFO L246 CegarLoopResult]: For program point L429(lines 429 1024) no Hoare annotation was computed. [2019-12-07 14:18:57,527 INFO L246 CegarLoopResult]: For program point L165(line 165) no Hoare annotation was computed. [2019-12-07 14:18:57,527 INFO L246 CegarLoopResult]: For program point L99(line 99) no Hoare annotation was computed. [2019-12-07 14:18:57,528 INFO L246 CegarLoopResult]: For program point L33(line 33) no Hoare annotation was computed. [2019-12-07 14:18:57,528 INFO L246 CegarLoopResult]: For program point L958(lines 958 1024) no Hoare annotation was computed. [2019-12-07 14:18:57,528 INFO L246 CegarLoopResult]: For program point L694(lines 694 1024) no Hoare annotation was computed. [2019-12-07 14:18:57,528 INFO L246 CegarLoopResult]: For program point L628(lines 628 1024) no Hoare annotation was computed. [2019-12-07 14:18:57,528 INFO L242 CegarLoopResult]: At program point L1025(lines 22 1026) the Hoare annotation is: (let ((.cse0 (= ~a25~0 13))) (let ((.cse4 (<= ~a29~0 245)) (.cse16 (< 306 ~a23~0)) (.cse15 (<= ~a29~0 277)) (.cse21 (<= 0 (+ ~a23~0 599913))) (.cse14 (+ ~a23~0 43)) (.cse18 (<= ~a23~0 306)) (.cse2 (<= ~a23~0 138)) (.cse22 (not .cse0)) (.cse9 (<= ~a23~0 600000)) (.cse11 (= ~a25~0 9)) (.cse23 (<= 0 (+ ~a29~0 28553))) (.cse24 (<= 0 (+ ~a23~0 600262))) (.cse10 (= ~a25~0 10)) (.cse26 (<= ~a29~0 140)) (.cse7 (= ~a25~0 12)) (.cse12 (<= ~a4~0 0)) (.cse19 (< 140 ~a29~0)) (.cse28 (<= ~a29~0 274)) (.cse20 (<= (+ ~a23~0 55) 0)) (.cse6 (<= 130 ~a29~0)) (.cse8 (<= ~a23~0 312)) (.cse1 (= 1 ~a3~0)) (.cse17 (<= 141 ~a29~0)) (.cse3 (= 15 ~a8~0)) (.cse5 (= 1 ~a4~0)) (.cse25 (= ~a25~0 11))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse1 .cse3 .cse5 (<= 0 (+ ~a23~0 39))) (and .cse9 .cse1 .cse3 .cse5 .cse10) (and .cse1 (or (and .cse11 .cse12 (exists ((v_~a29~0_504 Int)) (let ((.cse13 (mod v_~a29~0_504 299861))) (and (<= (+ .cse13 10250) ~a29~0) (= 0 .cse13) (< 140 v_~a29~0_504)))) (<= .cse14 0)) (and .cse7 (exists ((v_~a29~0_502 Int)) (and (<= 0 v_~a29~0_502) (<= (+ (mod v_~a29~0_502 15) 260) ~a29~0) (<= 130 v_~a29~0_502))) .cse12 .cse15 .cse6)) .cse3) (and .cse1 .cse2 .cse3 .cse5 (<= ~a29~0 220)) (and .cse2 .cse5 .cse10) (and .cse9 .cse0 .cse1 .cse16 (<= ~a29~0 599998) .cse3 .cse5) (and .cse9 .cse7 .cse16 .cse1 .cse4 .cse17 .cse3 .cse5) (and .cse0 .cse1 .cse18 (<= ~a29~0 130) .cse3 .cse5) (and .cse7 .cse12 .cse1 .cse19 .cse20 .cse21 .cse4 .cse3 .cse6) (and .cse12 .cse1 .cse22 .cse23 .cse20 .cse24 .cse3 .cse25 .cse26) (and .cse11 .cse22 .cse5 .cse26) (and .cse9 (or (and .cse7 (not (= 1 ULTIMATE.start_calculate_output_~input))) .cse25) .cse16 .cse1 .cse19 .cse3 .cse15 .cse5) (and .cse7 .cse12 .cse1 (exists ((v_~a29~0_506 Int)) (let ((.cse27 (mod v_~a29~0_506 15))) (and (= 0 .cse27) (<= (+ .cse27 256) ~a29~0) (< 140 v_~a29~0_506)))) .cse28 .cse3 .cse6) (and .cse11 .cse12 .cse1 .cse22 .cse20 .cse21 .cse3 .cse26) (and .cse0 .cse1 (< 0 .cse14) (exists ((v_~a29~0_499 Int)) (let ((.cse29 (div (* v_~a29~0_499 12) 10))) (and (<= 0 (* 12 v_~a29~0_499)) (= 0 (mod .cse29 5)) (< 245 v_~a29~0_499) (<= (+ (div .cse29 5) 99853) ~a29~0) (<= 0 (+ .cse29 1))))) .cse18 .cse3 .cse5) (and .cse11 .cse2 .cse5 .cse6) (and .cse2 .cse5 .cse6 .cse25) (and .cse9 .cse1 .cse3 .cse5 .cse25 (< 277 ~a29~0)) (and (not (= 3 ULTIMATE.start_calculate_output_~input)) (<= 0 (+ ~a23~0 577827)) .cse7 .cse12 .cse1 .cse22 .cse20 (not (= 4 ULTIMATE.start_calculate_output_~input)) .cse3 .cse26) (and .cse9 .cse11 .cse1 .cse3 .cse5) (and .cse12 .cse1 .cse23 .cse20 .cse24 .cse3 .cse10 .cse26) (and .cse7 .cse12 .cse1 .cse19 .cse28 .cse20 (<= 0 (+ ~a23~0 599908)) .cse3 .cse6) (and .cse8 .cse1 .cse17 .cse3 .cse5 .cse25 (exists ((v_~a29~0_508 Int)) (and (<= 0 v_~a29~0_508) (<= 130 v_~a29~0_508) (<= ~a29~0 (+ (mod v_~a29~0_508 15) 261)))))))) [2019-12-07 14:18:57,528 INFO L246 CegarLoopResult]: For program point L893(lines 893 1024) no Hoare annotation was computed. [2019-12-07 14:18:57,528 INFO L246 CegarLoopResult]: For program point L695(lines 695 705) no Hoare annotation was computed. [2019-12-07 14:18:57,528 INFO L246 CegarLoopResult]: For program point L695-2(lines 695 705) no Hoare annotation was computed. [2019-12-07 14:18:57,528 INFO L246 CegarLoopResult]: For program point L365(lines 365 1024) no Hoare annotation was computed. [2019-12-07 14:18:57,528 INFO L246 CegarLoopResult]: For program point L299(lines 299 1024) no Hoare annotation was computed. [2019-12-07 14:18:57,528 INFO L246 CegarLoopResult]: For program point L233(lines 233 1024) no Hoare annotation was computed. [2019-12-07 14:18:57,528 INFO L246 CegarLoopResult]: For program point L167-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 14:18:57,529 INFO L246 CegarLoopResult]: For program point L101-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 14:18:57,529 INFO L246 CegarLoopResult]: For program point L35-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 14:18:57,538 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-12-07 14:18:57,539 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-12-07 14:18:57,539 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-12-07 14:18:57,539 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-12-07 14:18:57,539 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-12-07 14:18:57,539 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-12-07 14:18:57,540 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] [2019-12-07 14:18:57,540 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] [2019-12-07 14:18:57,540 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] [2019-12-07 14:18:57,540 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 14:18:57,541 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 14:18:57,541 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 14:18:57,541 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 14:18:57,541 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 14:18:57,541 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] [2019-12-07 14:18:57,541 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] [2019-12-07 14:18:57,542 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] [2019-12-07 14:18:57,550 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-12-07 14:18:57,551 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-12-07 14:18:57,551 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-12-07 14:18:57,551 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-12-07 14:18:57,551 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-12-07 14:18:57,551 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-12-07 14:18:57,552 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] [2019-12-07 14:18:57,552 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] [2019-12-07 14:18:57,552 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] [2019-12-07 14:18:57,552 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 14:18:57,552 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 14:18:57,553 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 14:18:57,553 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 14:18:57,553 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 14:18:57,553 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] [2019-12-07 14:18:57,553 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] [2019-12-07 14:18:57,553 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] [2019-12-07 14:18:57,556 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-12-07 14:18:57,556 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-12-07 14:18:57,556 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-12-07 14:18:57,556 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-12-07 14:18:57,556 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-12-07 14:18:57,557 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-12-07 14:18:57,557 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] [2019-12-07 14:18:57,557 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] [2019-12-07 14:18:57,557 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] [2019-12-07 14:18:57,558 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 14:18:57,558 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 14:18:57,558 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 14:18:57,558 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 14:18:57,558 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 14:18:57,558 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] [2019-12-07 14:18:57,559 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] [2019-12-07 14:18:57,559 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] [2019-12-07 14:18:57,560 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-12-07 14:18:57,561 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-12-07 14:18:57,561 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-12-07 14:18:57,561 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-12-07 14:18:57,561 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-12-07 14:18:57,561 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-12-07 14:18:57,562 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] [2019-12-07 14:18:57,562 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] [2019-12-07 14:18:57,562 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] [2019-12-07 14:18:57,562 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 14:18:57,562 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 14:18:57,562 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 14:18:57,563 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 14:18:57,563 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 14:18:57,563 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] [2019-12-07 14:18:57,563 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] [2019-12-07 14:18:57,563 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] [2019-12-07 14:18:57,566 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 02:18:57 BoogieIcfgContainer [2019-12-07 14:18:57,566 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 14:18:57,566 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 14:18:57,566 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 14:18:57,566 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 14:18:57,567 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:15:47" (3/4) ... [2019-12-07 14:18:57,569 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 14:18:57,586 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-12-07 14:18:57,588 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-12-07 14:18:57,608 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((a25 == 13 && 1 == a3) && a23 <= 138) && 15 == a8) && a29 <= 245) && 1 == a4) && 130 <= a29) || (((((a25 == 12 && a23 <= 312) && 1 == a3) && 15 == a8) && 1 == a4) && 0 <= a23 + 39)) || ((((a23 <= 600000 && 1 == a3) && 15 == a8) && 1 == a4) && a25 == 10)) || ((1 == a3 && ((((a25 == 9 && a4 <= 0) && (\exists v_~a29~0_504 : int :: (v_~a29~0_504 % 299861 + 10250 <= a29 && 0 == v_~a29~0_504 % 299861) && 140 < v_~a29~0_504)) && a23 + 43 <= 0) || ((((a25 == 12 && (\exists v_~a29~0_502 : int :: (0 <= v_~a29~0_502 && v_~a29~0_502 % 15 + 260 <= a29) && 130 <= v_~a29~0_502)) && a4 <= 0) && a29 <= 277) && 130 <= a29))) && 15 == a8)) || ((((1 == a3 && a23 <= 138) && 15 == a8) && 1 == a4) && a29 <= 220)) || ((a23 <= 138 && 1 == a4) && a25 == 10)) || ((((((a23 <= 600000 && a25 == 13) && 1 == a3) && 306 < a23) && a29 <= 599998) && 15 == a8) && 1 == a4)) || (((((((a23 <= 600000 && a25 == 12) && 306 < a23) && 1 == a3) && a29 <= 245) && 141 <= a29) && 15 == a8) && 1 == a4)) || (((((a25 == 13 && 1 == a3) && a23 <= 306) && a29 <= 130) && 15 == a8) && 1 == a4)) || ((((((((a25 == 12 && a4 <= 0) && 1 == a3) && 140 < a29) && a23 + 55 <= 0) && 0 <= a23 + 599913) && a29 <= 245) && 15 == a8) && 130 <= a29)) || ((((((((a4 <= 0 && 1 == a3) && !(a25 == 13)) && 0 <= a29 + 28553) && a23 + 55 <= 0) && 0 <= a23 + 600262) && 15 == a8) && a25 == 11) && a29 <= 140)) || (((a25 == 9 && !(a25 == 13)) && 1 == a4) && a29 <= 140)) || (((((((a23 <= 600000 && ((a25 == 12 && !(1 == input)) || a25 == 11)) && 306 < a23) && 1 == a3) && 140 < a29) && 15 == a8) && a29 <= 277) && 1 == a4)) || ((((((a25 == 12 && a4 <= 0) && 1 == a3) && (\exists v_~a29~0_506 : int :: (0 == v_~a29~0_506 % 15 && v_~a29~0_506 % 15 + 256 <= a29) && 140 < v_~a29~0_506)) && a29 <= 274) && 15 == a8) && 130 <= a29)) || (((((((a25 == 9 && a4 <= 0) && 1 == a3) && !(a25 == 13)) && a23 + 55 <= 0) && 0 <= a23 + 599913) && 15 == a8) && a29 <= 140)) || ((((((a25 == 13 && 1 == a3) && 0 < a23 + 43) && (\exists v_~a29~0_499 : int :: (((0 <= 12 * v_~a29~0_499 && 0 == v_~a29~0_499 * 12 / 10 % 5) && 245 < v_~a29~0_499) && v_~a29~0_499 * 12 / 10 / 5 + 99853 <= a29) && 0 <= v_~a29~0_499 * 12 / 10 + 1)) && a23 <= 306) && 15 == a8) && 1 == a4)) || (((a25 == 9 && a23 <= 138) && 1 == a4) && 130 <= a29)) || (((a23 <= 138 && 1 == a4) && 130 <= a29) && a25 == 11)) || (((((a23 <= 600000 && 1 == a3) && 15 == a8) && 1 == a4) && a25 == 11) && 277 < a29)) || (((((((((!(3 == input) && 0 <= a23 + 577827) && a25 == 12) && a4 <= 0) && 1 == a3) && !(a25 == 13)) && a23 + 55 <= 0) && !(4 == input)) && 15 == a8) && a29 <= 140)) || ((((a23 <= 600000 && a25 == 9) && 1 == a3) && 15 == a8) && 1 == a4)) || (((((((a4 <= 0 && 1 == a3) && 0 <= a29 + 28553) && a23 + 55 <= 0) && 0 <= a23 + 600262) && 15 == a8) && a25 == 10) && a29 <= 140)) || ((((((((a25 == 12 && a4 <= 0) && 1 == a3) && 140 < a29) && a29 <= 274) && a23 + 55 <= 0) && 0 <= a23 + 599908) && 15 == a8) && 130 <= a29)) || ((((((a23 <= 312 && 1 == a3) && 141 <= a29) && 15 == a8) && 1 == a4) && a25 == 11) && (\exists v_~a29~0_508 : int :: (0 <= v_~a29~0_508 && 130 <= v_~a29~0_508) && a29 <= v_~a29~0_508 % 15 + 261)) [2019-12-07 14:18:57,610 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((a25 == 13 && 1 == a3) && a23 <= 138) && 15 == a8) && a29 <= 245) && 1 == a4) && 130 <= a29) || (((((a25 == 12 && a23 <= 312) && 1 == a3) && 15 == a8) && 1 == a4) && 0 <= a23 + 39)) || ((((a23 <= 600000 && 1 == a3) && 15 == a8) && 1 == a4) && a25 == 10)) || ((1 == a3 && ((((a25 == 9 && a4 <= 0) && (\exists v_~a29~0_504 : int :: (v_~a29~0_504 % 299861 + 10250 <= a29 && 0 == v_~a29~0_504 % 299861) && 140 < v_~a29~0_504)) && a23 + 43 <= 0) || ((((a25 == 12 && (\exists v_~a29~0_502 : int :: (0 <= v_~a29~0_502 && v_~a29~0_502 % 15 + 260 <= a29) && 130 <= v_~a29~0_502)) && a4 <= 0) && a29 <= 277) && 130 <= a29))) && 15 == a8)) || ((((1 == a3 && a23 <= 138) && 15 == a8) && 1 == a4) && a29 <= 220)) || ((a23 <= 138 && 1 == a4) && a25 == 10)) || ((((((a23 <= 600000 && a25 == 13) && 1 == a3) && 306 < a23) && a29 <= 599998) && 15 == a8) && 1 == a4)) || (((((((a23 <= 600000 && a25 == 12) && 306 < a23) && 1 == a3) && a29 <= 245) && 141 <= a29) && 15 == a8) && 1 == a4)) || (((((a25 == 13 && 1 == a3) && a23 <= 306) && a29 <= 130) && 15 == a8) && 1 == a4)) || ((((((((a25 == 12 && a4 <= 0) && 1 == a3) && 140 < a29) && a23 + 55 <= 0) && 0 <= a23 + 599913) && a29 <= 245) && 15 == a8) && 130 <= a29)) || ((((((((a4 <= 0 && 1 == a3) && !(a25 == 13)) && 0 <= a29 + 28553) && a23 + 55 <= 0) && 0 <= a23 + 600262) && 15 == a8) && a25 == 11) && a29 <= 140)) || (((a25 == 9 && !(a25 == 13)) && 1 == a4) && a29 <= 140)) || (((((((a23 <= 600000 && ((a25 == 12 && !(1 == input)) || a25 == 11)) && 306 < a23) && 1 == a3) && 140 < a29) && 15 == a8) && a29 <= 277) && 1 == a4)) || ((((((a25 == 12 && a4 <= 0) && 1 == a3) && (\exists v_~a29~0_506 : int :: (0 == v_~a29~0_506 % 15 && v_~a29~0_506 % 15 + 256 <= a29) && 140 < v_~a29~0_506)) && a29 <= 274) && 15 == a8) && 130 <= a29)) || (((((((a25 == 9 && a4 <= 0) && 1 == a3) && !(a25 == 13)) && a23 + 55 <= 0) && 0 <= a23 + 599913) && 15 == a8) && a29 <= 140)) || ((((((a25 == 13 && 1 == a3) && 0 < a23 + 43) && (\exists v_~a29~0_499 : int :: (((0 <= 12 * v_~a29~0_499 && 0 == v_~a29~0_499 * 12 / 10 % 5) && 245 < v_~a29~0_499) && v_~a29~0_499 * 12 / 10 / 5 + 99853 <= a29) && 0 <= v_~a29~0_499 * 12 / 10 + 1)) && a23 <= 306) && 15 == a8) && 1 == a4)) || (((a25 == 9 && a23 <= 138) && 1 == a4) && 130 <= a29)) || (((a23 <= 138 && 1 == a4) && 130 <= a29) && a25 == 11)) || (((((a23 <= 600000 && 1 == a3) && 15 == a8) && 1 == a4) && a25 == 11) && 277 < a29)) || (((((((((!(3 == input) && 0 <= a23 + 577827) && a25 == 12) && a4 <= 0) && 1 == a3) && !(a25 == 13)) && a23 + 55 <= 0) && !(4 == input)) && 15 == a8) && a29 <= 140)) || ((((a23 <= 600000 && a25 == 9) && 1 == a3) && 15 == a8) && 1 == a4)) || (((((((a4 <= 0 && 1 == a3) && 0 <= a29 + 28553) && a23 + 55 <= 0) && 0 <= a23 + 600262) && 15 == a8) && a25 == 10) && a29 <= 140)) || ((((((((a25 == 12 && a4 <= 0) && 1 == a3) && 140 < a29) && a29 <= 274) && a23 + 55 <= 0) && 0 <= a23 + 599908) && 15 == a8) && 130 <= a29)) || ((((((a23 <= 312 && 1 == a3) && 141 <= a29) && 15 == a8) && 1 == a4) && a25 == 11) && (\exists v_~a29~0_508 : int :: (0 <= v_~a29~0_508 && 130 <= v_~a29~0_508) && a29 <= v_~a29~0_508 % 15 + 261)) [2019-12-07 14:18:57,698 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_a2095aae-0f0e-4dd7-821c-2b25dccb5857/bin/uautomizer/witness.graphml [2019-12-07 14:18:57,699 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 14:18:57,699 INFO L168 Benchmark]: Toolchain (without parser) took 191636.70 ms. Allocated memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: 762.8 MB). Free memory was 932.7 MB in the beginning and 869.8 MB in the end (delta: 62.9 MB). Peak memory consumption was 825.8 MB. Max. memory is 11.5 GB. [2019-12-07 14:18:57,700 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 955.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 14:18:57,700 INFO L168 Benchmark]: CACSL2BoogieTranslator took 448.14 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 106.4 MB). Free memory was 932.7 MB in the beginning and 1.1 GB in the end (delta: -127.4 MB). Peak memory consumption was 25.0 MB. Max. memory is 11.5 GB. [2019-12-07 14:18:57,700 INFO L168 Benchmark]: Boogie Procedure Inliner took 76.12 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 11.5 GB. [2019-12-07 14:18:57,700 INFO L168 Benchmark]: Boogie Preprocessor took 69.75 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: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-12-07 14:18:57,700 INFO L168 Benchmark]: RCFGBuilder took 1075.48 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 858.0 MB in the end (delta: 174.1 MB). Peak memory consumption was 174.1 MB. Max. memory is 11.5 GB. [2019-12-07 14:18:57,701 INFO L168 Benchmark]: TraceAbstraction took 189831.31 ms. Allocated memory was 1.1 GB in the beginning and 1.8 GB in the end (delta: 656.4 MB). Free memory was 858.0 MB in the beginning and 913.8 MB in the end (delta: -55.8 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2019-12-07 14:18:57,701 INFO L168 Benchmark]: Witness Printer took 132.52 ms. Allocated memory is still 1.8 GB. Free memory was 913.8 MB in the beginning and 869.8 MB in the end (delta: 44.0 MB). Peak memory consumption was 44.0 MB. Max. memory is 11.5 GB. [2019-12-07 14:18:57,702 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 955.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 448.14 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 106.4 MB). Free memory was 932.7 MB in the beginning and 1.1 GB in the end (delta: -127.4 MB). Peak memory consumption was 25.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 76.12 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 69.75 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: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1075.48 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 858.0 MB in the end (delta: 174.1 MB). Peak memory consumption was 174.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 189831.31 ms. Allocated memory was 1.1 GB in the beginning and 1.8 GB in the end (delta: 656.4 MB). Free memory was 858.0 MB in the beginning and 913.8 MB in the end (delta: -55.8 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. * Witness Printer took 132.52 ms. Allocated memory is still 1.8 GB. Free memory was 913.8 MB in the beginning and 869.8 MB in the end (delta: 44.0 MB). Peak memory consumption was 44.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_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 156]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1028]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1034]: Loop Invariant [2019-12-07 14:18:57,706 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-12-07 14:18:57,706 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-12-07 14:18:57,706 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-12-07 14:18:57,706 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-12-07 14:18:57,707 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-12-07 14:18:57,707 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-12-07 14:18:57,707 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] [2019-12-07 14:18:57,707 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] [2019-12-07 14:18:57,707 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] [2019-12-07 14:18:57,707 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 14:18:57,708 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 14:18:57,708 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 14:18:57,708 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 14:18:57,708 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 14:18:57,708 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] [2019-12-07 14:18:57,708 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] [2019-12-07 14:18:57,708 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] [2019-12-07 14:18:57,710 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-12-07 14:18:57,710 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-12-07 14:18:57,710 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-12-07 14:18:57,710 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-12-07 14:18:57,710 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-12-07 14:18:57,710 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-12-07 14:18:57,711 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] [2019-12-07 14:18:57,711 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] [2019-12-07 14:18:57,711 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] [2019-12-07 14:18:57,711 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 14:18:57,711 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 14:18:57,711 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 14:18:57,711 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 14:18:57,712 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 14:18:57,712 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] [2019-12-07 14:18:57,712 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] [2019-12-07 14:18:57,712 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((((((a25 == 13 && 1 == a3) && a23 <= 138) && 15 == a8) && a29 <= 245) && 1 == a4) && 130 <= a29) || (((((a25 == 12 && a23 <= 312) && 1 == a3) && 15 == a8) && 1 == a4) && 0 <= a23 + 39)) || ((((a23 <= 600000 && 1 == a3) && 15 == a8) && 1 == a4) && a25 == 10)) || ((1 == a3 && ((((a25 == 9 && a4 <= 0) && (\exists v_~a29~0_504 : int :: (v_~a29~0_504 % 299861 + 10250 <= a29 && 0 == v_~a29~0_504 % 299861) && 140 < v_~a29~0_504)) && a23 + 43 <= 0) || ((((a25 == 12 && (\exists v_~a29~0_502 : int :: (0 <= v_~a29~0_502 && v_~a29~0_502 % 15 + 260 <= a29) && 130 <= v_~a29~0_502)) && a4 <= 0) && a29 <= 277) && 130 <= a29))) && 15 == a8)) || ((((1 == a3 && a23 <= 138) && 15 == a8) && 1 == a4) && a29 <= 220)) || ((a23 <= 138 && 1 == a4) && a25 == 10)) || ((((((a23 <= 600000 && a25 == 13) && 1 == a3) && 306 < a23) && a29 <= 599998) && 15 == a8) && 1 == a4)) || (((((((a23 <= 600000 && a25 == 12) && 306 < a23) && 1 == a3) && a29 <= 245) && 141 <= a29) && 15 == a8) && 1 == a4)) || (((((a25 == 13 && 1 == a3) && a23 <= 306) && a29 <= 130) && 15 == a8) && 1 == a4)) || ((((((((a25 == 12 && a4 <= 0) && 1 == a3) && 140 < a29) && a23 + 55 <= 0) && 0 <= a23 + 599913) && a29 <= 245) && 15 == a8) && 130 <= a29)) || ((((((((a4 <= 0 && 1 == a3) && !(a25 == 13)) && 0 <= a29 + 28553) && a23 + 55 <= 0) && 0 <= a23 + 600262) && 15 == a8) && a25 == 11) && a29 <= 140)) || (((a25 == 9 && !(a25 == 13)) && 1 == a4) && a29 <= 140)) || (((((((a23 <= 600000 && ((a25 == 12 && !(1 == input)) || a25 == 11)) && 306 < a23) && 1 == a3) && 140 < a29) && 15 == a8) && a29 <= 277) && 1 == a4)) || ((((((a25 == 12 && a4 <= 0) && 1 == a3) && (\exists v_~a29~0_506 : int :: (0 == v_~a29~0_506 % 15 && v_~a29~0_506 % 15 + 256 <= a29) && 140 < v_~a29~0_506)) && a29 <= 274) && 15 == a8) && 130 <= a29)) || (((((((a25 == 9 && a4 <= 0) && 1 == a3) && !(a25 == 13)) && a23 + 55 <= 0) && 0 <= a23 + 599913) && 15 == a8) && a29 <= 140)) || ((((((a25 == 13 && 1 == a3) && 0 < a23 + 43) && (\exists v_~a29~0_499 : int :: (((0 <= 12 * v_~a29~0_499 && 0 == v_~a29~0_499 * 12 / 10 % 5) && 245 < v_~a29~0_499) && v_~a29~0_499 * 12 / 10 / 5 + 99853 <= a29) && 0 <= v_~a29~0_499 * 12 / 10 + 1)) && a23 <= 306) && 15 == a8) && 1 == a4)) || (((a25 == 9 && a23 <= 138) && 1 == a4) && 130 <= a29)) || (((a23 <= 138 && 1 == a4) && 130 <= a29) && a25 == 11)) || (((((a23 <= 600000 && 1 == a3) && 15 == a8) && 1 == a4) && a25 == 11) && 277 < a29)) || (((((((((!(3 == input) && 0 <= a23 + 577827) && a25 == 12) && a4 <= 0) && 1 == a3) && !(a25 == 13)) && a23 + 55 <= 0) && !(4 == input)) && 15 == a8) && a29 <= 140)) || ((((a23 <= 600000 && a25 == 9) && 1 == a3) && 15 == a8) && 1 == a4)) || (((((((a4 <= 0 && 1 == a3) && 0 <= a29 + 28553) && a23 + 55 <= 0) && 0 <= a23 + 600262) && 15 == a8) && a25 == 10) && a29 <= 140)) || ((((((((a25 == 12 && a4 <= 0) && 1 == a3) && 140 < a29) && a29 <= 274) && a23 + 55 <= 0) && 0 <= a23 + 599908) && 15 == a8) && 130 <= a29)) || ((((((a23 <= 312 && 1 == a3) && 141 <= a29) && 15 == a8) && 1 == a4) && a25 == 11) && (\exists v_~a29~0_508 : int :: (0 <= v_~a29~0_508 && 130 <= v_~a29~0_508) && a29 <= v_~a29~0_508 % 15 + 261)) - InvariantResult [Line: 22]: Loop Invariant [2019-12-07 14:18:57,713 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-12-07 14:18:57,714 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-12-07 14:18:57,714 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-12-07 14:18:57,714 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-12-07 14:18:57,714 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-12-07 14:18:57,714 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-12-07 14:18:57,714 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] [2019-12-07 14:18:57,715 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] [2019-12-07 14:18:57,715 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] [2019-12-07 14:18:57,715 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 14:18:57,715 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 14:18:57,715 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 14:18:57,715 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 14:18:57,715 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 14:18:57,715 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] [2019-12-07 14:18:57,716 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] [2019-12-07 14:18:57,716 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] [2019-12-07 14:18:57,717 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-12-07 14:18:57,717 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-12-07 14:18:57,717 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-12-07 14:18:57,717 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-12-07 14:18:57,718 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-12-07 14:18:57,718 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-12-07 14:18:57,718 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] [2019-12-07 14:18:57,718 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] [2019-12-07 14:18:57,718 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] [2019-12-07 14:18:57,718 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 14:18:57,719 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 14:18:57,719 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 14:18:57,719 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 14:18:57,719 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 14:18:57,719 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] [2019-12-07 14:18:57,719 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] [2019-12-07 14:18:57,719 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((((((a25 == 13 && 1 == a3) && a23 <= 138) && 15 == a8) && a29 <= 245) && 1 == a4) && 130 <= a29) || (((((a25 == 12 && a23 <= 312) && 1 == a3) && 15 == a8) && 1 == a4) && 0 <= a23 + 39)) || ((((a23 <= 600000 && 1 == a3) && 15 == a8) && 1 == a4) && a25 == 10)) || ((1 == a3 && ((((a25 == 9 && a4 <= 0) && (\exists v_~a29~0_504 : int :: (v_~a29~0_504 % 299861 + 10250 <= a29 && 0 == v_~a29~0_504 % 299861) && 140 < v_~a29~0_504)) && a23 + 43 <= 0) || ((((a25 == 12 && (\exists v_~a29~0_502 : int :: (0 <= v_~a29~0_502 && v_~a29~0_502 % 15 + 260 <= a29) && 130 <= v_~a29~0_502)) && a4 <= 0) && a29 <= 277) && 130 <= a29))) && 15 == a8)) || ((((1 == a3 && a23 <= 138) && 15 == a8) && 1 == a4) && a29 <= 220)) || ((a23 <= 138 && 1 == a4) && a25 == 10)) || ((((((a23 <= 600000 && a25 == 13) && 1 == a3) && 306 < a23) && a29 <= 599998) && 15 == a8) && 1 == a4)) || (((((((a23 <= 600000 && a25 == 12) && 306 < a23) && 1 == a3) && a29 <= 245) && 141 <= a29) && 15 == a8) && 1 == a4)) || (((((a25 == 13 && 1 == a3) && a23 <= 306) && a29 <= 130) && 15 == a8) && 1 == a4)) || ((((((((a25 == 12 && a4 <= 0) && 1 == a3) && 140 < a29) && a23 + 55 <= 0) && 0 <= a23 + 599913) && a29 <= 245) && 15 == a8) && 130 <= a29)) || ((((((((a4 <= 0 && 1 == a3) && !(a25 == 13)) && 0 <= a29 + 28553) && a23 + 55 <= 0) && 0 <= a23 + 600262) && 15 == a8) && a25 == 11) && a29 <= 140)) || (((a25 == 9 && !(a25 == 13)) && 1 == a4) && a29 <= 140)) || (((((((a23 <= 600000 && ((a25 == 12 && !(1 == input)) || a25 == 11)) && 306 < a23) && 1 == a3) && 140 < a29) && 15 == a8) && a29 <= 277) && 1 == a4)) || ((((((a25 == 12 && a4 <= 0) && 1 == a3) && (\exists v_~a29~0_506 : int :: (0 == v_~a29~0_506 % 15 && v_~a29~0_506 % 15 + 256 <= a29) && 140 < v_~a29~0_506)) && a29 <= 274) && 15 == a8) && 130 <= a29)) || (((((((a25 == 9 && a4 <= 0) && 1 == a3) && !(a25 == 13)) && a23 + 55 <= 0) && 0 <= a23 + 599913) && 15 == a8) && a29 <= 140)) || ((((((a25 == 13 && 1 == a3) && 0 < a23 + 43) && (\exists v_~a29~0_499 : int :: (((0 <= 12 * v_~a29~0_499 && 0 == v_~a29~0_499 * 12 / 10 % 5) && 245 < v_~a29~0_499) && v_~a29~0_499 * 12 / 10 / 5 + 99853 <= a29) && 0 <= v_~a29~0_499 * 12 / 10 + 1)) && a23 <= 306) && 15 == a8) && 1 == a4)) || (((a25 == 9 && a23 <= 138) && 1 == a4) && 130 <= a29)) || (((a23 <= 138 && 1 == a4) && 130 <= a29) && a25 == 11)) || (((((a23 <= 600000 && 1 == a3) && 15 == a8) && 1 == a4) && a25 == 11) && 277 < a29)) || (((((((((!(3 == input) && 0 <= a23 + 577827) && a25 == 12) && a4 <= 0) && 1 == a3) && !(a25 == 13)) && a23 + 55 <= 0) && !(4 == input)) && 15 == a8) && a29 <= 140)) || ((((a23 <= 600000 && a25 == 9) && 1 == a3) && 15 == a8) && 1 == a4)) || (((((((a4 <= 0 && 1 == a3) && 0 <= a29 + 28553) && a23 + 55 <= 0) && 0 <= a23 + 600262) && 15 == a8) && a25 == 10) && a29 <= 140)) || ((((((((a25 == 12 && a4 <= 0) && 1 == a3) && 140 < a29) && a29 <= 274) && a23 + 55 <= 0) && 0 <= a23 + 599908) && 15 == a8) && 130 <= a29)) || ((((((a23 <= 312 && 1 == a3) && 141 <= a29) && 15 == a8) && 1 == a4) && a25 == 11) && (\exists v_~a29~0_508 : int :: (0 <= v_~a29~0_508 && 130 <= v_~a29~0_508) && a29 <= v_~a29~0_508 % 15 + 261)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 283 locations, 1 error locations. Result: SAFE, OverallTime: 153.2s, OverallIterations: 29, TraceHistogramMax: 10, AutomataDifference: 123.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 36.4s, HoareTripleCheckerStatistics: 4303 SDtfs, 32786 SDslu, 2208 SDs, 0 SdLazy, 87324 SolverSat, 8869 SolverUnsat, 12 SolverUnknown, 0 SolverNotchecked, 98.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6083 GetRequests, 5729 SyntacticMatches, 9 SemanticMatches, 345 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4892 ImplicationChecksByTransitivity, 9.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13475occurred in iteration=21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.4s AutomataMinimizationTime, 29 MinimizatonAttempts, 90045 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 130 NumberOfFragments, 1309 HoareAnnotationTreeSize, 3 FomulaSimplifications, 3276805286 FormulaSimplificationTreeSizeReduction, 5.9s HoareSimplificationTime, 3 FomulaSimplificationsInter, 1645150612 FormulaSimplificationTreeSizeReductionInter, 30.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 12.8s InterpolantComputationTime, 19564 NumberOfCodeBlocks, 19564 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 19523 ConstructedInterpolants, 781 QuantifiedInterpolants, 65356632 SizeOfPredicates, 30 NumberOfNonLiveVariables, 7378 ConjunctsInSsa, 90 ConjunctsInUnsatCore, 41 InterpolantComputations, 22 PerfectInterpolantSequences, 30047/37435 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...