./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem11_label02.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_87b84a59-2667-48b8-854c-862d70a37451/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_87b84a59-2667-48b8-854c-862d70a37451/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_87b84a59-2667-48b8-854c-862d70a37451/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_87b84a59-2667-48b8-854c-862d70a37451/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem11_label02.c -s /tmp/vcloud-vcloud-master/worker/run_dir_87b84a59-2667-48b8-854c-862d70a37451/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_87b84a59-2667-48b8-854c-862d70a37451/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 65f69a82f917cd816f2caa8fef857cdeb22603b5 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 23:14:08,515 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:14:08,516 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:14:08,527 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:14:08,527 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:14:08,528 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:14:08,530 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:14:08,532 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:14:08,534 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:14:08,535 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:14:08,536 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:14:08,537 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:14:08,537 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:14:08,538 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:14:08,539 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:14:08,540 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:14:08,541 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:14:08,541 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:14:08,543 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:14:08,545 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:14:08,549 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:14:08,550 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:14:08,554 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:14:08,555 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:14:08,558 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:14:08,562 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:14:08,562 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:14:08,563 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:14:08,564 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:14:08,565 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:14:08,567 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:14:08,567 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:14:08,568 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:14:08,569 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:14:08,570 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:14:08,572 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:14:08,573 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:14:08,573 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:14:08,573 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:14:08,574 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:14:08,575 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:14:08,577 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_87b84a59-2667-48b8-854c-862d70a37451/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 23:14:08,598 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:14:08,598 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:14:08,599 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:14:08,599 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:14:08,600 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:14:08,600 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:14:08,600 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 23:14:08,600 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:14:08,600 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 23:14:08,601 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:14:08,601 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 23:14:08,601 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 23:14:08,601 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 23:14:08,601 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 23:14:08,602 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 23:14:08,602 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:14:08,602 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 23:14:08,602 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:14:08,603 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:14:08,603 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 23:14:08,603 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 23:14:08,603 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:14:08,603 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:14:08,604 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 23:14:08,604 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 23:14:08,604 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 23:14:08,604 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 23:14:08,605 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 23:14:08,605 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_87b84a59-2667-48b8-854c-862d70a37451/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 -> 65f69a82f917cd816f2caa8fef857cdeb22603b5 [2019-11-15 23:14:08,630 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:14:08,640 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:14:08,643 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:14:08,644 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:14:08,645 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:14:08,645 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_87b84a59-2667-48b8-854c-862d70a37451/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem11_label02.c [2019-11-15 23:14:08,697 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_87b84a59-2667-48b8-854c-862d70a37451/bin/uautomizer/data/77f2ede08/8f546f1b3ba940d980ce43bb8e949c38/FLAGb5d58b9ac [2019-11-15 23:14:09,259 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:14:09,261 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_87b84a59-2667-48b8-854c-862d70a37451/sv-benchmarks/c/eca-rers2012/Problem11_label02.c [2019-11-15 23:14:09,273 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_87b84a59-2667-48b8-854c-862d70a37451/bin/uautomizer/data/77f2ede08/8f546f1b3ba940d980ce43bb8e949c38/FLAGb5d58b9ac [2019-11-15 23:14:09,714 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_87b84a59-2667-48b8-854c-862d70a37451/bin/uautomizer/data/77f2ede08/8f546f1b3ba940d980ce43bb8e949c38 [2019-11-15 23:14:09,716 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:14:09,717 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 23:14:09,717 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:14:09,717 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:14:09,720 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:14:09,721 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:14:09" (1/1) ... [2019-11-15 23:14:09,724 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d45d96b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:14:09, skipping insertion in model container [2019-11-15 23:14:09,724 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:14:09" (1/1) ... [2019-11-15 23:14:09,730 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:14:09,795 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:14:10,406 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:14:10,414 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:14:10,586 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:14:10,602 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:14:10,602 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:14:10 WrapperNode [2019-11-15 23:14:10,603 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:14:10,604 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 23:14:10,604 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 23:14:10,604 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 23:14:10,612 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:14:10" (1/1) ... [2019-11-15 23:14:10,635 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:14:10" (1/1) ... [2019-11-15 23:14:10,745 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 23:14:10,745 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:14:10,746 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:14:10,746 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:14:10,754 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:14:10" (1/1) ... [2019-11-15 23:14:10,755 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:14:10" (1/1) ... [2019-11-15 23:14:10,761 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:14:10" (1/1) ... [2019-11-15 23:14:10,762 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:14:10" (1/1) ... [2019-11-15 23:14:10,789 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:14:10" (1/1) ... [2019-11-15 23:14:10,799 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:14:10" (1/1) ... [2019-11-15 23:14:10,809 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:14:10" (1/1) ... [2019-11-15 23:14:10,825 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:14:10,825 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:14:10,825 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:14:10,825 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:14:10,826 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:14:10" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_87b84a59-2667-48b8-854c-862d70a37451/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:14:10,900 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:14:10,901 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:14:12,542 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:14:12,542 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-15 23:14:12,543 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:14:12 BoogieIcfgContainer [2019-11-15 23:14:12,543 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:14:12,545 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 23:14:12,545 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 23:14:12,547 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 23:14:12,548 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 11:14:09" (1/3) ... [2019-11-15 23:14:12,548 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f7bf979 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:14:12, skipping insertion in model container [2019-11-15 23:14:12,549 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:14:10" (2/3) ... [2019-11-15 23:14:12,549 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f7bf979 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:14:12, skipping insertion in model container [2019-11-15 23:14:12,549 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:14:12" (3/3) ... [2019-11-15 23:14:12,551 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem11_label02.c [2019-11-15 23:14:12,559 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 23:14:12,566 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 23:14:12,575 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 23:14:12,607 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 23:14:12,607 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 23:14:12,607 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 23:14:12,607 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:14:12,608 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:14:12,608 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 23:14:12,608 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:14:12,609 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 23:14:12,637 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states. [2019-11-15 23:14:12,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-15 23:14:12,646 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:14:12,647 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:14:12,649 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:14:12,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:14:12,654 INFO L82 PathProgramCache]: Analyzing trace with hash 1425694346, now seen corresponding path program 1 times [2019-11-15 23:14:12,662 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:14:12,662 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302557243] [2019-11-15 23:14:12,663 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:12,663 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:12,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:14:12,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:13,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:14:13,065 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302557243] [2019-11-15 23:14:13,066 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:14:13,066 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:14:13,066 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460721364] [2019-11-15 23:14:13,070 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:14:13,071 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:14:13,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:14:13,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:14:13,086 INFO L87 Difference]: Start difference. First operand 283 states. Second operand 4 states. [2019-11-15 23:14:15,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:14:15,106 INFO L93 Difference]: Finished difference Result 966 states and 1746 transitions. [2019-11-15 23:14:15,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:14:15,110 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2019-11-15 23:14:15,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:14:15,127 INFO L225 Difference]: With dead ends: 966 [2019-11-15 23:14:15,127 INFO L226 Difference]: Without dead ends: 616 [2019-11-15 23:14:15,138 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:14:15,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2019-11-15 23:14:15,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 600. [2019-11-15 23:14:15,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2019-11-15 23:14:15,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 910 transitions. [2019-11-15 23:14:15,220 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 910 transitions. Word has length 54 [2019-11-15 23:14:15,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:14:15,220 INFO L462 AbstractCegarLoop]: Abstraction has 600 states and 910 transitions. [2019-11-15 23:14:15,221 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:14:15,221 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 910 transitions. [2019-11-15 23:14:15,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-11-15 23:14:15,228 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:14:15,228 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-15 23:14:15,229 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:14:15,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:14:15,229 INFO L82 PathProgramCache]: Analyzing trace with hash -1089723297, now seen corresponding path program 1 times [2019-11-15 23:14:15,229 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:14:15,230 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301269767] [2019-11-15 23:14:15,231 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:15,231 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:15,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:14:15,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:15,453 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:14:15,453 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301269767] [2019-11-15 23:14:15,454 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:14:15,454 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:14:15,454 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586763020] [2019-11-15 23:14:15,456 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:14:15,456 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:14:15,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:14:15,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:14:15,457 INFO L87 Difference]: Start difference. First operand 600 states and 910 transitions. Second operand 4 states. [2019-11-15 23:14:16,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:14:16,917 INFO L93 Difference]: Finished difference Result 2309 states and 3522 transitions. [2019-11-15 23:14:16,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:14:16,918 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 125 [2019-11-15 23:14:16,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:14:16,929 INFO L225 Difference]: With dead ends: 2309 [2019-11-15 23:14:16,930 INFO L226 Difference]: Without dead ends: 1711 [2019-11-15 23:14:16,932 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:14:16,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1711 states. [2019-11-15 23:14:16,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1711 to 1343. [2019-11-15 23:14:16,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1343 states. [2019-11-15 23:14:16,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1343 states to 1343 states and 1799 transitions. [2019-11-15 23:14:16,989 INFO L78 Accepts]: Start accepts. Automaton has 1343 states and 1799 transitions. Word has length 125 [2019-11-15 23:14:16,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:14:16,991 INFO L462 AbstractCegarLoop]: Abstraction has 1343 states and 1799 transitions. [2019-11-15 23:14:16,991 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:14:16,991 INFO L276 IsEmpty]: Start isEmpty. Operand 1343 states and 1799 transitions. [2019-11-15 23:14:17,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-11-15 23:14:17,006 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:14:17,006 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:14:17,007 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:14:17,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:14:17,007 INFO L82 PathProgramCache]: Analyzing trace with hash 1383649082, now seen corresponding path program 1 times [2019-11-15 23:14:17,008 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:14:17,008 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376107530] [2019-11-15 23:14:17,009 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:17,009 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:17,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:14:17,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:17,239 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:14:17,241 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376107530] [2019-11-15 23:14:17,241 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:14:17,241 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:14:17,241 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570317718] [2019-11-15 23:14:17,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:14:17,242 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:14:17,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:14:17,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:14:17,243 INFO L87 Difference]: Start difference. First operand 1343 states and 1799 transitions. Second operand 4 states. [2019-11-15 23:14:18,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:14:18,909 INFO L93 Difference]: Finished difference Result 4722 states and 6448 transitions. [2019-11-15 23:14:18,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:14:18,910 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2019-11-15 23:14:18,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:14:18,929 INFO L225 Difference]: With dead ends: 4722 [2019-11-15 23:14:18,929 INFO L226 Difference]: Without dead ends: 3381 [2019-11-15 23:14:18,932 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:14:18,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3381 states. [2019-11-15 23:14:18,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3381 to 2447. [2019-11-15 23:14:18,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2447 states. [2019-11-15 23:14:19,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2447 states to 2447 states and 3065 transitions. [2019-11-15 23:14:19,004 INFO L78 Accepts]: Start accepts. Automaton has 2447 states and 3065 transitions. Word has length 138 [2019-11-15 23:14:19,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:14:19,006 INFO L462 AbstractCegarLoop]: Abstraction has 2447 states and 3065 transitions. [2019-11-15 23:14:19,006 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:14:19,006 INFO L276 IsEmpty]: Start isEmpty. Operand 2447 states and 3065 transitions. [2019-11-15 23:14:19,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-11-15 23:14:19,008 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:14:19,008 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:14:19,009 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:14:19,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:14:19,009 INFO L82 PathProgramCache]: Analyzing trace with hash -728761857, now seen corresponding path program 1 times [2019-11-15 23:14:19,009 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:14:19,010 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402271770] [2019-11-15 23:14:19,010 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:19,010 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:19,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:14:19,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:19,213 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:14:19,214 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402271770] [2019-11-15 23:14:19,214 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:14:19,214 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:14:19,214 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766651073] [2019-11-15 23:14:19,215 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:14:19,216 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:14:19,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:14:19,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:14:19,217 INFO L87 Difference]: Start difference. First operand 2447 states and 3065 transitions. Second operand 4 states. [2019-11-15 23:14:20,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:14:20,675 INFO L93 Difference]: Finished difference Result 7122 states and 9244 transitions. [2019-11-15 23:14:20,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:14:20,677 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 181 [2019-11-15 23:14:20,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:14:20,702 INFO L225 Difference]: With dead ends: 7122 [2019-11-15 23:14:20,703 INFO L226 Difference]: Without dead ends: 4861 [2019-11-15 23:14:20,706 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:14:20,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4861 states. [2019-11-15 23:14:20,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4861 to 3364. [2019-11-15 23:14:20,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3364 states. [2019-11-15 23:14:20,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3364 states to 3364 states and 4177 transitions. [2019-11-15 23:14:20,785 INFO L78 Accepts]: Start accepts. Automaton has 3364 states and 4177 transitions. Word has length 181 [2019-11-15 23:14:20,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:14:20,785 INFO L462 AbstractCegarLoop]: Abstraction has 3364 states and 4177 transitions. [2019-11-15 23:14:20,786 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:14:20,786 INFO L276 IsEmpty]: Start isEmpty. Operand 3364 states and 4177 transitions. [2019-11-15 23:14:20,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2019-11-15 23:14:20,792 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:14:20,793 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:14:20,793 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:14:20,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:14:20,794 INFO L82 PathProgramCache]: Analyzing trace with hash 1752037152, now seen corresponding path program 1 times [2019-11-15 23:14:20,794 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:14:20,794 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320679190] [2019-11-15 23:14:20,794 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:20,794 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:20,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:14:20,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:21,093 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 202 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:14:21,093 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320679190] [2019-11-15 23:14:21,093 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:14:21,093 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:14:21,094 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567276094] [2019-11-15 23:14:21,094 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:14:21,094 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:14:21,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:14:21,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:14:21,095 INFO L87 Difference]: Start difference. First operand 3364 states and 4177 transitions. Second operand 5 states. [2019-11-15 23:14:22,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:14:22,812 INFO L93 Difference]: Finished difference Result 11534 states and 14528 transitions. [2019-11-15 23:14:22,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:14:22,821 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 281 [2019-11-15 23:14:22,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:14:22,861 INFO L225 Difference]: With dead ends: 11534 [2019-11-15 23:14:22,861 INFO L226 Difference]: Without dead ends: 8356 [2019-11-15 23:14:22,866 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:14:22,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8356 states. [2019-11-15 23:14:23,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8356 to 6503. [2019-11-15 23:14:23,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6503 states. [2019-11-15 23:14:23,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6503 states to 6503 states and 7962 transitions. [2019-11-15 23:14:23,015 INFO L78 Accepts]: Start accepts. Automaton has 6503 states and 7962 transitions. Word has length 281 [2019-11-15 23:14:23,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:14:23,016 INFO L462 AbstractCegarLoop]: Abstraction has 6503 states and 7962 transitions. [2019-11-15 23:14:23,016 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:14:23,016 INFO L276 IsEmpty]: Start isEmpty. Operand 6503 states and 7962 transitions. [2019-11-15 23:14:23,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-11-15 23:14:23,026 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:14:23,026 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:14:23,027 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:14:23,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:14:23,027 INFO L82 PathProgramCache]: Analyzing trace with hash 1357238772, now seen corresponding path program 1 times [2019-11-15 23:14:23,027 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:14:23,028 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392597499] [2019-11-15 23:14:23,028 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:23,028 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:23,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:14:23,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:23,369 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 227 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:14:23,370 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392597499] [2019-11-15 23:14:23,371 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:14:23,371 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:14:23,371 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173748742] [2019-11-15 23:14:23,372 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:14:23,372 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:14:23,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:14:23,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:14:23,373 INFO L87 Difference]: Start difference. First operand 6503 states and 7962 transitions. Second operand 4 states. [2019-11-15 23:14:24,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:14:24,638 INFO L93 Difference]: Finished difference Result 15593 states and 19175 transitions. [2019-11-15 23:14:24,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:14:24,639 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 324 [2019-11-15 23:14:24,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:14:24,683 INFO L225 Difference]: With dead ends: 15593 [2019-11-15 23:14:24,683 INFO L226 Difference]: Without dead ends: 9276 [2019-11-15 23:14:24,690 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:14:24,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9276 states. [2019-11-15 23:14:24,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9276 to 9079. [2019-11-15 23:14:24,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9079 states. [2019-11-15 23:14:24,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9079 states to 9079 states and 10766 transitions. [2019-11-15 23:14:24,874 INFO L78 Accepts]: Start accepts. Automaton has 9079 states and 10766 transitions. Word has length 324 [2019-11-15 23:14:24,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:14:24,874 INFO L462 AbstractCegarLoop]: Abstraction has 9079 states and 10766 transitions. [2019-11-15 23:14:24,874 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:14:24,875 INFO L276 IsEmpty]: Start isEmpty. Operand 9079 states and 10766 transitions. [2019-11-15 23:14:24,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2019-11-15 23:14:24,885 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:14:24,886 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:14:24,886 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:14:24,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:14:24,887 INFO L82 PathProgramCache]: Analyzing trace with hash -1634065239, now seen corresponding path program 1 times [2019-11-15 23:14:24,887 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:14:24,887 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563677279] [2019-11-15 23:14:24,887 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:24,888 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:24,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:14:24,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:25,101 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 323 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2019-11-15 23:14:25,101 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563677279] [2019-11-15 23:14:25,102 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:14:25,102 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:14:25,102 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868518826] [2019-11-15 23:14:25,103 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:14:25,103 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:14:25,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:14:25,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:14:25,104 INFO L87 Difference]: Start difference. First operand 9079 states and 10766 transitions. Second operand 3 states. [2019-11-15 23:14:26,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:14:26,057 INFO L93 Difference]: Finished difference Result 17414 states and 20745 transitions. [2019-11-15 23:14:26,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:14:26,058 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 335 [2019-11-15 23:14:26,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:14:26,087 INFO L225 Difference]: With dead ends: 17414 [2019-11-15 23:14:26,087 INFO L226 Difference]: Without dead ends: 9077 [2019-11-15 23:14:26,096 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:14:26,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9077 states. [2019-11-15 23:14:26,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9077 to 8525. [2019-11-15 23:14:26,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8525 states. [2019-11-15 23:14:26,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8525 states to 8525 states and 9767 transitions. [2019-11-15 23:14:26,213 INFO L78 Accepts]: Start accepts. Automaton has 8525 states and 9767 transitions. Word has length 335 [2019-11-15 23:14:26,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:14:26,214 INFO L462 AbstractCegarLoop]: Abstraction has 8525 states and 9767 transitions. [2019-11-15 23:14:26,214 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:14:26,214 INFO L276 IsEmpty]: Start isEmpty. Operand 8525 states and 9767 transitions. [2019-11-15 23:14:26,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2019-11-15 23:14:26,227 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:14:26,227 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:14:26,228 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:14:26,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:14:26,228 INFO L82 PathProgramCache]: Analyzing trace with hash -87231958, now seen corresponding path program 1 times [2019-11-15 23:14:26,228 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:14:26,228 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747599879] [2019-11-15 23:14:26,229 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:26,229 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:26,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:14:26,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:26,574 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 175 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:14:26,575 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747599879] [2019-11-15 23:14:26,575 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1766343166] [2019-11-15 23:14:26,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_87b84a59-2667-48b8-854c-862d70a37451/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:14:26,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:26,705 INFO L256 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 23:14:26,733 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:14:26,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:14:26,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:14:26,988 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 103 proven. 124 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:14:26,989 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:14:26,989 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 3] total 7 [2019-11-15 23:14:26,990 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262529420] [2019-11-15 23:14:26,991 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 23:14:26,991 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:14:26,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 23:14:26,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:14:26,991 INFO L87 Difference]: Start difference. First operand 8525 states and 9767 transitions. Second operand 7 states. [2019-11-15 23:14:35,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:14:35,501 INFO L93 Difference]: Finished difference Result 27370 states and 31608 transitions. [2019-11-15 23:14:35,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-15 23:14:35,501 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 356 [2019-11-15 23:14:35,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:14:35,536 INFO L225 Difference]: With dead ends: 27370 [2019-11-15 23:14:35,536 INFO L226 Difference]: Without dead ends: 19031 [2019-11-15 23:14:35,547 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 365 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2019-11-15 23:14:35,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19031 states. [2019-11-15 23:14:35,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19031 to 10727. [2019-11-15 23:14:35,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10727 states. [2019-11-15 23:14:35,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10727 states to 10727 states and 12139 transitions. [2019-11-15 23:14:35,798 INFO L78 Accepts]: Start accepts. Automaton has 10727 states and 12139 transitions. Word has length 356 [2019-11-15 23:14:35,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:14:35,798 INFO L462 AbstractCegarLoop]: Abstraction has 10727 states and 12139 transitions. [2019-11-15 23:14:35,799 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 23:14:35,799 INFO L276 IsEmpty]: Start isEmpty. Operand 10727 states and 12139 transitions. [2019-11-15 23:14:35,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2019-11-15 23:14:35,828 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:14:35,828 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:14:36,040 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:14:36,040 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:14:36,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:14:36,041 INFO L82 PathProgramCache]: Analyzing trace with hash -474601086, now seen corresponding path program 1 times [2019-11-15 23:14:36,041 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:14:36,041 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748724310] [2019-11-15 23:14:36,041 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:36,041 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:36,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:14:36,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:36,687 INFO L134 CoverageAnalysis]: Checked inductivity of 754 backedges. 628 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-11-15 23:14:36,687 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748724310] [2019-11-15 23:14:36,688 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:14:36,688 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:14:36,688 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666729357] [2019-11-15 23:14:36,689 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:14:36,689 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:14:36,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:14:36,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:14:36,690 INFO L87 Difference]: Start difference. First operand 10727 states and 12139 transitions. Second operand 4 states. [2019-11-15 23:14:38,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:14:38,015 INFO L93 Difference]: Finished difference Result 24418 states and 27727 transitions. [2019-11-15 23:14:38,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:14:38,015 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 483 [2019-11-15 23:14:38,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:14:38,031 INFO L225 Difference]: With dead ends: 24418 [2019-11-15 23:14:38,031 INFO L226 Difference]: Without dead ends: 13693 [2019-11-15 23:14:38,043 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:14:38,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13693 states. [2019-11-15 23:14:38,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13693 to 12935. [2019-11-15 23:14:38,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12935 states. [2019-11-15 23:14:38,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12935 states to 12935 states and 14483 transitions. [2019-11-15 23:14:38,217 INFO L78 Accepts]: Start accepts. Automaton has 12935 states and 14483 transitions. Word has length 483 [2019-11-15 23:14:38,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:14:38,217 INFO L462 AbstractCegarLoop]: Abstraction has 12935 states and 14483 transitions. [2019-11-15 23:14:38,218 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:14:38,218 INFO L276 IsEmpty]: Start isEmpty. Operand 12935 states and 14483 transitions. [2019-11-15 23:14:38,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 513 [2019-11-15 23:14:38,245 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:14:38,246 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:14:38,246 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:14:38,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:14:38,247 INFO L82 PathProgramCache]: Analyzing trace with hash 46233324, now seen corresponding path program 1 times [2019-11-15 23:14:38,247 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:14:38,247 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645646113] [2019-11-15 23:14:38,247 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:38,248 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:38,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:14:38,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:39,424 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 210 proven. 627 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:14:39,425 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645646113] [2019-11-15 23:14:39,425 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [913027919] [2019-11-15 23:14:39,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_87b84a59-2667-48b8-854c-862d70a37451/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:14:39,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:39,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 675 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 23:14:39,583 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:14:39,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:14:39,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:14:40,271 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 682 proven. 0 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-11-15 23:14:40,272 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 23:14:40,272 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 10 [2019-11-15 23:14:40,272 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944486028] [2019-11-15 23:14:40,273 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:14:40,273 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:14:40,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:14:40,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:14:40,273 INFO L87 Difference]: Start difference. First operand 12935 states and 14483 transitions. Second operand 3 states. [2019-11-15 23:14:41,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:14:41,264 INFO L93 Difference]: Finished difference Result 28260 states and 31722 transitions. [2019-11-15 23:14:41,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:14:41,264 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 512 [2019-11-15 23:14:41,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:14:41,278 INFO L225 Difference]: With dead ends: 28260 [2019-11-15 23:14:41,278 INFO L226 Difference]: Without dead ends: 15511 [2019-11-15 23:14:41,292 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 519 GetRequests, 511 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:14:41,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15511 states. [2019-11-15 23:14:41,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15511 to 13855. [2019-11-15 23:14:41,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13855 states. [2019-11-15 23:14:41,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13855 states to 13855 states and 15450 transitions. [2019-11-15 23:14:41,473 INFO L78 Accepts]: Start accepts. Automaton has 13855 states and 15450 transitions. Word has length 512 [2019-11-15 23:14:41,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:14:41,474 INFO L462 AbstractCegarLoop]: Abstraction has 13855 states and 15450 transitions. [2019-11-15 23:14:41,474 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:14:41,474 INFO L276 IsEmpty]: Start isEmpty. Operand 13855 states and 15450 transitions. [2019-11-15 23:14:41,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 570 [2019-11-15 23:14:41,521 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:14:41,523 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:14:41,735 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:14:41,735 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:14:41,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:14:41,735 INFO L82 PathProgramCache]: Analyzing trace with hash -191395542, now seen corresponding path program 1 times [2019-11-15 23:14:41,736 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:14:41,736 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903523659] [2019-11-15 23:14:41,736 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:41,736 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:41,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:14:41,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:42,422 INFO L134 CoverageAnalysis]: Checked inductivity of 881 backedges. 677 proven. 0 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2019-11-15 23:14:42,422 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903523659] [2019-11-15 23:14:42,422 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:14:42,423 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:14:42,423 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132874287] [2019-11-15 23:14:42,424 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:14:42,424 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:14:42,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:14:42,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:14:42,424 INFO L87 Difference]: Start difference. First operand 13855 states and 15450 transitions. Second operand 5 states. [2019-11-15 23:14:44,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:14:44,259 INFO L93 Difference]: Finished difference Result 26256 states and 29284 transitions. [2019-11-15 23:14:44,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:14:44,260 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 569 [2019-11-15 23:14:44,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:14:44,270 INFO L225 Difference]: With dead ends: 26256 [2019-11-15 23:14:44,270 INFO L226 Difference]: Without dead ends: 14431 [2019-11-15 23:14:44,278 INFO L600 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-11-15 23:14:44,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14431 states. [2019-11-15 23:14:44,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14431 to 13677. [2019-11-15 23:14:44,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13677 states. [2019-11-15 23:14:44,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13677 states to 13677 states and 15247 transitions. [2019-11-15 23:14:44,456 INFO L78 Accepts]: Start accepts. Automaton has 13677 states and 15247 transitions. Word has length 569 [2019-11-15 23:14:44,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:14:44,456 INFO L462 AbstractCegarLoop]: Abstraction has 13677 states and 15247 transitions. [2019-11-15 23:14:44,457 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:14:44,457 INFO L276 IsEmpty]: Start isEmpty. Operand 13677 states and 15247 transitions. [2019-11-15 23:14:44,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 573 [2019-11-15 23:14:44,480 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:14:44,480 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:14:44,481 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:14:44,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:14:44,481 INFO L82 PathProgramCache]: Analyzing trace with hash -965769477, now seen corresponding path program 1 times [2019-11-15 23:14:44,481 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:14:44,482 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508736058] [2019-11-15 23:14:44,482 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:44,482 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:44,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:14:44,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:44,990 INFO L134 CoverageAnalysis]: Checked inductivity of 1132 backedges. 617 proven. 0 refuted. 0 times theorem prover too weak. 515 trivial. 0 not checked. [2019-11-15 23:14:44,990 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508736058] [2019-11-15 23:14:44,991 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:14:44,991 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:14:44,991 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719739782] [2019-11-15 23:14:44,992 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:14:44,992 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:14:44,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:14:44,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:14:44,993 INFO L87 Difference]: Start difference. First operand 13677 states and 15247 transitions. Second operand 3 states. [2019-11-15 23:14:45,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:14:45,983 INFO L93 Difference]: Finished difference Result 25695 states and 28606 transitions. [2019-11-15 23:14:45,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:14:45,984 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 572 [2019-11-15 23:14:45,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:14:45,998 INFO L225 Difference]: With dead ends: 25695 [2019-11-15 23:14:45,998 INFO L226 Difference]: Without dead ends: 14048 [2019-11-15 23:14:46,005 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:14:46,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14048 states. [2019-11-15 23:14:46,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14048 to 13677. [2019-11-15 23:14:46,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13677 states. [2019-11-15 23:14:46,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13677 states to 13677 states and 15241 transitions. [2019-11-15 23:14:46,180 INFO L78 Accepts]: Start accepts. Automaton has 13677 states and 15241 transitions. Word has length 572 [2019-11-15 23:14:46,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:14:46,182 INFO L462 AbstractCegarLoop]: Abstraction has 13677 states and 15241 transitions. [2019-11-15 23:14:46,182 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:14:46,182 INFO L276 IsEmpty]: Start isEmpty. Operand 13677 states and 15241 transitions. [2019-11-15 23:14:46,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 574 [2019-11-15 23:14:46,206 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:14:46,207 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:14:46,207 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:14:46,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:14:46,208 INFO L82 PathProgramCache]: Analyzing trace with hash -1592835932, now seen corresponding path program 1 times [2019-11-15 23:14:46,208 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:14:46,208 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959773771] [2019-11-15 23:14:46,208 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:46,208 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:46,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:14:46,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:46,895 INFO L134 CoverageAnalysis]: Checked inductivity of 1132 backedges. 617 proven. 0 refuted. 0 times theorem prover too weak. 515 trivial. 0 not checked. [2019-11-15 23:14:46,896 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959773771] [2019-11-15 23:14:46,896 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:14:46,896 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:14:46,897 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810231212] [2019-11-15 23:14:46,897 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:14:46,897 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:14:46,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:14:46,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:14:46,898 INFO L87 Difference]: Start difference. First operand 13677 states and 15241 transitions. Second operand 4 states. [2019-11-15 23:14:47,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:14:47,952 INFO L93 Difference]: Finished difference Result 25692 states and 28583 transitions. [2019-11-15 23:14:47,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:14:47,952 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 573 [2019-11-15 23:14:47,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:14:47,967 INFO L225 Difference]: With dead ends: 25692 [2019-11-15 23:14:47,967 INFO L226 Difference]: Without dead ends: 14045 [2019-11-15 23:14:47,974 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:14:47,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14045 states. [2019-11-15 23:14:48,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14045 to 13677. [2019-11-15 23:14:48,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13677 states. [2019-11-15 23:14:48,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13677 states to 13677 states and 15235 transitions. [2019-11-15 23:14:48,138 INFO L78 Accepts]: Start accepts. Automaton has 13677 states and 15235 transitions. Word has length 573 [2019-11-15 23:14:48,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:14:48,139 INFO L462 AbstractCegarLoop]: Abstraction has 13677 states and 15235 transitions. [2019-11-15 23:14:48,139 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:14:48,139 INFO L276 IsEmpty]: Start isEmpty. Operand 13677 states and 15235 transitions. [2019-11-15 23:14:48,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 775 [2019-11-15 23:14:48,158 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:14:48,159 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:14:48,159 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:14:48,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:14:48,160 INFO L82 PathProgramCache]: Analyzing trace with hash -534851769, now seen corresponding path program 1 times [2019-11-15 23:14:48,160 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:14:48,160 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688226843] [2019-11-15 23:14:48,160 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:48,161 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:48,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:14:48,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:49,234 INFO L134 CoverageAnalysis]: Checked inductivity of 2242 backedges. 1357 proven. 437 refuted. 0 times theorem prover too weak. 448 trivial. 0 not checked. [2019-11-15 23:14:49,234 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688226843] [2019-11-15 23:14:49,235 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1141571476] [2019-11-15 23:14:49,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_87b84a59-2667-48b8-854c-862d70a37451/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:14:49,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:49,409 INFO L256 TraceCheckSpWp]: Trace formula consists of 1014 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 23:14:49,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:14:49,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:14:49,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:14:50,047 INFO L134 CoverageAnalysis]: Checked inductivity of 2242 backedges. 1562 proven. 0 refuted. 0 times theorem prover too weak. 680 trivial. 0 not checked. [2019-11-15 23:14:50,047 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 23:14:50,048 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 10 [2019-11-15 23:14:50,048 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019297115] [2019-11-15 23:14:50,049 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:14:50,049 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:14:50,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:14:50,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:14:50,049 INFO L87 Difference]: Start difference. First operand 13677 states and 15235 transitions. Second operand 3 states. [2019-11-15 23:14:52,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:14:52,997 INFO L93 Difference]: Finished difference Result 32138 states and 35832 transitions. [2019-11-15 23:14:52,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:14:52,998 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 774 [2019-11-15 23:14:52,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:14:53,011 INFO L225 Difference]: With dead ends: 32138 [2019-11-15 23:14:53,011 INFO L226 Difference]: Without dead ends: 18647 [2019-11-15 23:14:53,019 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 783 GetRequests, 773 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:14:53,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18647 states. [2019-11-15 23:14:53,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18647 to 17726. [2019-11-15 23:14:53,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17726 states. [2019-11-15 23:14:53,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17726 states to 17726 states and 19343 transitions. [2019-11-15 23:14:53,188 INFO L78 Accepts]: Start accepts. Automaton has 17726 states and 19343 transitions. Word has length 774 [2019-11-15 23:14:53,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:14:53,188 INFO L462 AbstractCegarLoop]: Abstraction has 17726 states and 19343 transitions. [2019-11-15 23:14:53,188 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:14:53,189 INFO L276 IsEmpty]: Start isEmpty. Operand 17726 states and 19343 transitions. [2019-11-15 23:14:53,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 786 [2019-11-15 23:14:53,214 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:14:53,215 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:14:53,418 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:14:53,418 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:14:53,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:14:53,418 INFO L82 PathProgramCache]: Analyzing trace with hash -473048623, now seen corresponding path program 1 times [2019-11-15 23:14:53,419 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:14:53,419 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721540228] [2019-11-15 23:14:53,419 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:53,419 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:53,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:14:53,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:54,264 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 1342 proven. 163 refuted. 0 times theorem prover too weak. 799 trivial. 0 not checked. [2019-11-15 23:14:54,265 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721540228] [2019-11-15 23:14:54,265 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [369289494] [2019-11-15 23:14:54,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_87b84a59-2667-48b8-854c-862d70a37451/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:14:54,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:54,426 INFO L256 TraceCheckSpWp]: Trace formula consists of 1025 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 23:14:54,446 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:14:54,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:14:54,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:14:54,797 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 1125 proven. 0 refuted. 0 times theorem prover too weak. 1179 trivial. 0 not checked. [2019-11-15 23:14:54,797 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 23:14:54,797 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 6 [2019-11-15 23:14:54,797 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212979091] [2019-11-15 23:14:54,798 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:14:54,798 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:14:54,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:14:54,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:14:54,799 INFO L87 Difference]: Start difference. First operand 17726 states and 19343 transitions. Second operand 4 states. [2019-11-15 23:14:58,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:14:58,097 INFO L93 Difference]: Finished difference Result 43562 states and 47567 transitions. [2019-11-15 23:14:58,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:14:58,097 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 785 [2019-11-15 23:14:58,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:14:58,116 INFO L225 Difference]: With dead ends: 43562 [2019-11-15 23:14:58,116 INFO L226 Difference]: Without dead ends: 26022 [2019-11-15 23:14:58,127 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 790 GetRequests, 784 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:14:58,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26022 states. [2019-11-15 23:14:58,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26022 to 19204. [2019-11-15 23:14:58,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19204 states. [2019-11-15 23:14:58,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19204 states to 19204 states and 20873 transitions. [2019-11-15 23:14:58,378 INFO L78 Accepts]: Start accepts. Automaton has 19204 states and 20873 transitions. Word has length 785 [2019-11-15 23:14:58,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:14:58,378 INFO L462 AbstractCegarLoop]: Abstraction has 19204 states and 20873 transitions. [2019-11-15 23:14:58,378 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:14:58,378 INFO L276 IsEmpty]: Start isEmpty. Operand 19204 states and 20873 transitions. [2019-11-15 23:14:58,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 820 [2019-11-15 23:14:58,399 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:14:58,400 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:14:58,603 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:14:58,603 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:14:58,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:14:58,604 INFO L82 PathProgramCache]: Analyzing trace with hash 1732636127, now seen corresponding path program 1 times [2019-11-15 23:14:58,604 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:14:58,604 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255502373] [2019-11-15 23:14:58,604 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:58,604 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:58,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:14:58,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:59,303 INFO L134 CoverageAnalysis]: Checked inductivity of 2381 backedges. 1199 proven. 3 refuted. 0 times theorem prover too weak. 1179 trivial. 0 not checked. [2019-11-15 23:14:59,303 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255502373] [2019-11-15 23:14:59,303 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [109386209] [2019-11-15 23:14:59,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_87b84a59-2667-48b8-854c-862d70a37451/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:14:59,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:59,469 INFO L256 TraceCheckSpWp]: Trace formula consists of 1052 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 23:14:59,478 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:15:00,029 INFO L134 CoverageAnalysis]: Checked inductivity of 2381 backedges. 1202 proven. 0 refuted. 0 times theorem prover too weak. 1179 trivial. 0 not checked. [2019-11-15 23:15:00,029 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 23:15:00,030 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2019-11-15 23:15:00,030 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873177093] [2019-11-15 23:15:00,030 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:15:00,031 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:15:00,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:15:00,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:15:00,031 INFO L87 Difference]: Start difference. First operand 19204 states and 20873 transitions. Second operand 4 states. [2019-11-15 23:15:01,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:15:01,131 INFO L93 Difference]: Finished difference Result 37490 states and 40692 transitions. [2019-11-15 23:15:01,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:15:01,132 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 819 [2019-11-15 23:15:01,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:15:01,145 INFO L225 Difference]: With dead ends: 37490 [2019-11-15 23:15:01,146 INFO L226 Difference]: Without dead ends: 20500 [2019-11-15 23:15:01,152 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 822 GetRequests, 817 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:15:01,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20500 states. [2019-11-15 23:15:01,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20500 to 17548. [2019-11-15 23:15:01,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17548 states. [2019-11-15 23:15:01,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17548 states to 17548 states and 19055 transitions. [2019-11-15 23:15:01,309 INFO L78 Accepts]: Start accepts. Automaton has 17548 states and 19055 transitions. Word has length 819 [2019-11-15 23:15:01,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:15:01,309 INFO L462 AbstractCegarLoop]: Abstraction has 17548 states and 19055 transitions. [2019-11-15 23:15:01,309 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:15:01,310 INFO L276 IsEmpty]: Start isEmpty. Operand 17548 states and 19055 transitions. [2019-11-15 23:15:01,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 853 [2019-11-15 23:15:01,325 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:15:01,325 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 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, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:15:01,525 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:15:01,526 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:15:01,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:15:01,526 INFO L82 PathProgramCache]: Analyzing trace with hash -972459443, now seen corresponding path program 1 times [2019-11-15 23:15:01,526 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:15:01,526 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930194225] [2019-11-15 23:15:01,526 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:15:01,527 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:15:01,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:15:01,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:15:02,258 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 1554 proven. 82 refuted. 0 times theorem prover too weak. 1280 trivial. 0 not checked. [2019-11-15 23:15:02,258 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930194225] [2019-11-15 23:15:02,258 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1876340205] [2019-11-15 23:15:02,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_87b84a59-2667-48b8-854c-862d70a37451/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:15:02,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:15:02,493 INFO L256 TraceCheckSpWp]: Trace formula consists of 1119 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 23:15:02,504 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:15:02,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:15:02,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:15:02,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:15:02,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:15:02,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:15:02,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:15:02,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:15:02,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:15:02,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:15:02,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:15:04,560 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 2218 proven. 0 refuted. 0 times theorem prover too weak. 698 trivial. 0 not checked. [2019-11-15 23:15:04,560 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 23:15:04,560 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-11-15 23:15:04,560 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955312733] [2019-11-15 23:15:04,561 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:15:04,561 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:15:04,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:15:04,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:15:04,561 INFO L87 Difference]: Start difference. First operand 17548 states and 19055 transitions. Second operand 4 states. [2019-11-15 23:15:53,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:15:53,533 INFO L93 Difference]: Finished difference Result 42295 states and 45935 transitions. [2019-11-15 23:15:53,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:15:53,534 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 852 [2019-11-15 23:15:53,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:15:53,551 INFO L225 Difference]: With dead ends: 42295 [2019-11-15 23:15:53,551 INFO L226 Difference]: Without dead ends: 26225 [2019-11-15 23:15:53,558 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 857 GetRequests, 851 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:15:53,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26225 states. [2019-11-15 23:15:53,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26225 to 24566. [2019-11-15 23:15:53,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24566 states. [2019-11-15 23:15:53,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24566 states to 24566 states and 26707 transitions. [2019-11-15 23:15:53,755 INFO L78 Accepts]: Start accepts. Automaton has 24566 states and 26707 transitions. Word has length 852 [2019-11-15 23:15:53,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:15:53,756 INFO L462 AbstractCegarLoop]: Abstraction has 24566 states and 26707 transitions. [2019-11-15 23:15:53,756 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:15:53,756 INFO L276 IsEmpty]: Start isEmpty. Operand 24566 states and 26707 transitions. [2019-11-15 23:15:53,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 869 [2019-11-15 23:15:53,772 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:15:53,773 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:15:53,973 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:15:53,973 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:15:53,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:15:53,974 INFO L82 PathProgramCache]: Analyzing trace with hash -1305893410, now seen corresponding path program 1 times [2019-11-15 23:15:53,974 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:15:53,974 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127940995] [2019-11-15 23:15:53,974 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:15:53,974 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:15:53,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:15:54,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:15:54,888 INFO L134 CoverageAnalysis]: Checked inductivity of 2973 backedges. 1715 proven. 0 refuted. 0 times theorem prover too weak. 1258 trivial. 0 not checked. [2019-11-15 23:15:54,888 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127940995] [2019-11-15 23:15:54,888 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:15:54,889 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:15:54,889 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057277578] [2019-11-15 23:15:54,891 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:15:54,891 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:15:54,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:15:54,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:15:54,891 INFO L87 Difference]: Start difference. First operand 24566 states and 26707 transitions. Second operand 4 states. [2019-11-15 23:15:56,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:15:56,079 INFO L93 Difference]: Finished difference Result 53202 states and 57757 transitions. [2019-11-15 23:15:56,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:15:56,081 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 868 [2019-11-15 23:15:56,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:15:56,101 INFO L225 Difference]: With dead ends: 53202 [2019-11-15 23:15:56,102 INFO L226 Difference]: Without dead ends: 28637 [2019-11-15 23:15:56,111 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:15:56,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28637 states. [2019-11-15 23:15:56,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28637 to 22357. [2019-11-15 23:15:56,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22357 states. [2019-11-15 23:15:56,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22357 states to 22357 states and 24165 transitions. [2019-11-15 23:15:56,311 INFO L78 Accepts]: Start accepts. Automaton has 22357 states and 24165 transitions. Word has length 868 [2019-11-15 23:15:56,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:15:56,311 INFO L462 AbstractCegarLoop]: Abstraction has 22357 states and 24165 transitions. [2019-11-15 23:15:56,311 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:15:56,311 INFO L276 IsEmpty]: Start isEmpty. Operand 22357 states and 24165 transitions. [2019-11-15 23:15:56,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 886 [2019-11-15 23:15:56,326 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:15:56,327 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 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, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:15:56,327 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:15:56,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:15:56,327 INFO L82 PathProgramCache]: Analyzing trace with hash -975481696, now seen corresponding path program 1 times [2019-11-15 23:15:56,328 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:15:56,328 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51302523] [2019-11-15 23:15:56,328 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:15:56,328 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:15:56,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:15:56,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:15:57,335 INFO L134 CoverageAnalysis]: Checked inductivity of 3076 backedges. 2021 proven. 179 refuted. 0 times theorem prover too weak. 876 trivial. 0 not checked. [2019-11-15 23:15:57,335 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51302523] [2019-11-15 23:15:57,337 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1465690088] [2019-11-15 23:15:57,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_87b84a59-2667-48b8-854c-862d70a37451/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:15:57,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:15:57,530 INFO L256 TraceCheckSpWp]: Trace formula consists of 1147 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-15 23:15:57,546 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:15:57,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:15:57,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:15:57,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:15:57,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:15:57,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:15:57,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:15:57,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:15:57,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:15:57,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:15:57,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:15:57,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:15:57,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:15:57,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:15:57,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:15:57,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:15:57,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:15:57,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:15:57,947 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 20 [2019-11-15 23:15:59,495 INFO L134 CoverageAnalysis]: Checked inductivity of 3076 backedges. 1869 proven. 312 refuted. 0 times theorem prover too weak. 895 trivial. 0 not checked. [2019-11-15 23:15:59,495 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:15:59,496 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 11 [2019-11-15 23:15:59,496 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396559007] [2019-11-15 23:15:59,497 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-15 23:15:59,497 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:15:59,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-15 23:15:59,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-11-15 23:15:59,497 INFO L87 Difference]: Start difference. First operand 22357 states and 24165 transitions. Second operand 11 states. [2019-11-15 23:16:09,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:16:09,544 INFO L93 Difference]: Finished difference Result 50047 states and 54218 transitions. [2019-11-15 23:16:09,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-11-15 23:16:09,545 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 885 [2019-11-15 23:16:09,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:16:09,563 INFO L225 Difference]: With dead ends: 50047 [2019-11-15 23:16:09,564 INFO L226 Difference]: Without dead ends: 26587 [2019-11-15 23:16:09,575 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 927 GetRequests, 897 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=275, Invalid=655, Unknown=0, NotChecked=0, Total=930 [2019-11-15 23:16:09,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26587 states. [2019-11-15 23:16:09,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26587 to 16087. [2019-11-15 23:16:09,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16087 states. [2019-11-15 23:16:09,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16087 states to 16087 states and 17133 transitions. [2019-11-15 23:16:09,775 INFO L78 Accepts]: Start accepts. Automaton has 16087 states and 17133 transitions. Word has length 885 [2019-11-15 23:16:09,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:16:09,776 INFO L462 AbstractCegarLoop]: Abstraction has 16087 states and 17133 transitions. [2019-11-15 23:16:09,776 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-15 23:16:09,776 INFO L276 IsEmpty]: Start isEmpty. Operand 16087 states and 17133 transitions. [2019-11-15 23:16:09,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 967 [2019-11-15 23:16:09,796 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:16:09,796 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 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, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:16:10,000 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:16:10,004 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:16:10,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:16:10,005 INFO L82 PathProgramCache]: Analyzing trace with hash 1017472461, now seen corresponding path program 1 times [2019-11-15 23:16:10,005 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:16:10,005 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999332810] [2019-11-15 23:16:10,006 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:16:10,006 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:16:10,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:16:10,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:16:12,400 INFO L134 CoverageAnalysis]: Checked inductivity of 3129 backedges. 1715 proven. 966 refuted. 0 times theorem prover too weak. 448 trivial. 0 not checked. [2019-11-15 23:16:12,401 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999332810] [2019-11-15 23:16:12,401 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1134259490] [2019-11-15 23:16:12,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_87b84a59-2667-48b8-854c-862d70a37451/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:16:12,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:16:12,611 INFO L256 TraceCheckSpWp]: Trace formula consists of 1229 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-15 23:16:12,621 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:16:12,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:16:12,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:16:12,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:16:12,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:16:13,875 INFO L134 CoverageAnalysis]: Checked inductivity of 3129 backedges. 1691 proven. 157 refuted. 0 times theorem prover too weak. 1281 trivial. 0 not checked. [2019-11-15 23:16:13,875 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:16:13,876 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 5] total 16 [2019-11-15 23:16:13,876 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667132009] [2019-11-15 23:16:13,877 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-15 23:16:13,878 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:16:13,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-15 23:16:13,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2019-11-15 23:16:13,878 INFO L87 Difference]: Start difference. First operand 16087 states and 17133 transitions. Second operand 17 states. [2019-11-15 23:16:24,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:16:24,223 INFO L93 Difference]: Finished difference Result 47340 states and 50311 transitions. [2019-11-15 23:16:24,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-11-15 23:16:24,223 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 966 [2019-11-15 23:16:24,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:16:24,248 INFO L225 Difference]: With dead ends: 47340 [2019-11-15 23:16:24,248 INFO L226 Difference]: Without dead ends: 31069 [2019-11-15 23:16:24,258 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 1034 GetRequests, 963 SyntacticMatches, 3 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1648 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1114, Invalid=3716, Unknown=0, NotChecked=0, Total=4830 [2019-11-15 23:16:24,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31069 states. [2019-11-15 23:16:24,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31069 to 16292. [2019-11-15 23:16:24,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16292 states. [2019-11-15 23:16:24,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16292 states to 16292 states and 17267 transitions. [2019-11-15 23:16:24,464 INFO L78 Accepts]: Start accepts. Automaton has 16292 states and 17267 transitions. Word has length 966 [2019-11-15 23:16:24,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:16:24,464 INFO L462 AbstractCegarLoop]: Abstraction has 16292 states and 17267 transitions. [2019-11-15 23:16:24,464 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-15 23:16:24,464 INFO L276 IsEmpty]: Start isEmpty. Operand 16292 states and 17267 transitions. [2019-11-15 23:16:24,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1007 [2019-11-15 23:16:24,478 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:16:24,479 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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-11-15 23:16:24,682 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:16:24,683 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:16:24,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:16:24,683 INFO L82 PathProgramCache]: Analyzing trace with hash 144812258, now seen corresponding path program 1 times [2019-11-15 23:16:24,683 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:16:24,684 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964136152] [2019-11-15 23:16:24,684 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:16:24,684 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:16:24,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:16:24,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:16:25,857 INFO L134 CoverageAnalysis]: Checked inductivity of 3381 backedges. 2245 proven. 0 refuted. 0 times theorem prover too weak. 1136 trivial. 0 not checked. [2019-11-15 23:16:25,857 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964136152] [2019-11-15 23:16:25,858 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:16:25,858 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:16:25,858 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115302065] [2019-11-15 23:16:25,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:16:25,859 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:16:25,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:16:25,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:16:25,859 INFO L87 Difference]: Start difference. First operand 16292 states and 17267 transitions. Second operand 4 states. [2019-11-15 23:16:26,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:16:26,854 INFO L93 Difference]: Finished difference Result 34061 states and 36074 transitions. [2019-11-15 23:16:26,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:16:26,855 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1006 [2019-11-15 23:16:26,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:16:26,866 INFO L225 Difference]: With dead ends: 34061 [2019-11-15 23:16:26,866 INFO L226 Difference]: Without dead ends: 17955 [2019-11-15 23:16:26,872 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:16:26,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17955 states. [2019-11-15 23:16:27,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17955 to 16292. [2019-11-15 23:16:27,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16292 states. [2019-11-15 23:16:27,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16292 states to 16292 states and 17257 transitions. [2019-11-15 23:16:27,018 INFO L78 Accepts]: Start accepts. Automaton has 16292 states and 17257 transitions. Word has length 1006 [2019-11-15 23:16:27,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:16:27,019 INFO L462 AbstractCegarLoop]: Abstraction has 16292 states and 17257 transitions. [2019-11-15 23:16:27,019 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:16:27,019 INFO L276 IsEmpty]: Start isEmpty. Operand 16292 states and 17257 transitions. [2019-11-15 23:16:27,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1031 [2019-11-15 23:16:27,033 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:16:27,034 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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-11-15 23:16:27,034 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:16:27,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:16:27,035 INFO L82 PathProgramCache]: Analyzing trace with hash 1638067216, now seen corresponding path program 1 times [2019-11-15 23:16:27,035 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:16:27,035 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123072088] [2019-11-15 23:16:27,035 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:16:27,035 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:16:27,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:16:27,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:16:29,269 INFO L134 CoverageAnalysis]: Checked inductivity of 3411 backedges. 1988 proven. 975 refuted. 0 times theorem prover too weak. 448 trivial. 0 not checked. [2019-11-15 23:16:29,269 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123072088] [2019-11-15 23:16:29,269 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1725465807] [2019-11-15 23:16:29,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_87b84a59-2667-48b8-854c-862d70a37451/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-11-15 23:16:29,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:16:29,480 INFO L256 TraceCheckSpWp]: Trace formula consists of 1295 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-15 23:16:29,489 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:16:29,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:16:29,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:16:29,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:16:30,667 INFO L134 CoverageAnalysis]: Checked inductivity of 3411 backedges. 1899 proven. 231 refuted. 0 times theorem prover too weak. 1281 trivial. 0 not checked. [2019-11-15 23:16:30,668 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:16:30,668 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6] total 14 [2019-11-15 23:16:30,668 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431186496] [2019-11-15 23:16:30,670 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-15 23:16:30,670 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:16:30,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-15 23:16:30,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2019-11-15 23:16:30,670 INFO L87 Difference]: Start difference. First operand 16292 states and 17257 transitions. Second operand 15 states. [2019-11-15 23:16:39,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:16:39,240 INFO L93 Difference]: Finished difference Result 42032 states and 44364 transitions. [2019-11-15 23:16:39,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-11-15 23:16:39,242 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 1030 [2019-11-15 23:16:39,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:16:39,262 INFO L225 Difference]: With dead ends: 42032 [2019-11-15 23:16:39,262 INFO L226 Difference]: Without dead ends: 25187 [2019-11-15 23:16:39,272 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 1092 GetRequests, 1026 SyntacticMatches, 5 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1360 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1058, Invalid=2848, Unknown=0, NotChecked=0, Total=3906 [2019-11-15 23:16:39,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25187 states. [2019-11-15 23:16:39,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25187 to 9282. [2019-11-15 23:16:39,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9282 states. [2019-11-15 23:16:39,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9282 states to 9282 states and 9786 transitions. [2019-11-15 23:16:39,431 INFO L78 Accepts]: Start accepts. Automaton has 9282 states and 9786 transitions. Word has length 1030 [2019-11-15 23:16:39,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:16:39,431 INFO L462 AbstractCegarLoop]: Abstraction has 9282 states and 9786 transitions. [2019-11-15 23:16:39,431 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-15 23:16:39,431 INFO L276 IsEmpty]: Start isEmpty. Operand 9282 states and 9786 transitions. [2019-11-15 23:16:39,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1037 [2019-11-15 23:16:39,442 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:16:39,442 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 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, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-15 23:16:39,643 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:16:39,643 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:16:39,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:16:39,643 INFO L82 PathProgramCache]: Analyzing trace with hash -896726607, now seen corresponding path program 1 times [2019-11-15 23:16:39,643 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:16:39,644 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456514438] [2019-11-15 23:16:39,644 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:16:39,644 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:16:39,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:16:39,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:16:41,277 INFO L134 CoverageAnalysis]: Checked inductivity of 3310 backedges. 2131 proven. 0 refuted. 0 times theorem prover too weak. 1179 trivial. 0 not checked. [2019-11-15 23:16:41,278 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456514438] [2019-11-15 23:16:41,278 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:16:41,278 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:16:41,278 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748560001] [2019-11-15 23:16:41,279 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 23:16:41,279 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:16:41,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 23:16:41,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:16:41,279 INFO L87 Difference]: Start difference. First operand 9282 states and 9786 transitions. Second operand 7 states. [2019-11-15 23:16:43,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:16:43,104 INFO L93 Difference]: Finished difference Result 20587 states and 21697 transitions. [2019-11-15 23:16:43,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:16:43,105 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 1036 [2019-11-15 23:16:43,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:16:43,113 INFO L225 Difference]: With dead ends: 20587 [2019-11-15 23:16:43,113 INFO L226 Difference]: Without dead ends: 11859 [2019-11-15 23:16:43,118 INFO L600 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-11-15 23:16:43,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11859 states. [2019-11-15 23:16:43,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11859 to 10570. [2019-11-15 23:16:43,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10570 states. [2019-11-15 23:16:43,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10570 states to 10570 states and 11145 transitions. [2019-11-15 23:16:43,223 INFO L78 Accepts]: Start accepts. Automaton has 10570 states and 11145 transitions. Word has length 1036 [2019-11-15 23:16:43,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:16:43,223 INFO L462 AbstractCegarLoop]: Abstraction has 10570 states and 11145 transitions. [2019-11-15 23:16:43,224 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 23:16:43,224 INFO L276 IsEmpty]: Start isEmpty. Operand 10570 states and 11145 transitions. [2019-11-15 23:16:43,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1054 [2019-11-15 23:16:43,235 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:16:43,235 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 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, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-15 23:16:43,236 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:16:43,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:16:43,236 INFO L82 PathProgramCache]: Analyzing trace with hash 1700393044, now seen corresponding path program 1 times [2019-11-15 23:16:43,236 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:16:43,236 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810356754] [2019-11-15 23:16:43,237 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:16:43,237 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:16:43,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:16:43,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:16:44,314 INFO L134 CoverageAnalysis]: Checked inductivity of 3334 backedges. 2417 proven. 0 refuted. 0 times theorem prover too weak. 917 trivial. 0 not checked. [2019-11-15 23:16:44,314 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810356754] [2019-11-15 23:16:44,314 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:16:44,314 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:16:44,315 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150869510] [2019-11-15 23:16:44,315 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:16:44,315 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:16:44,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:16:44,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:16:44,316 INFO L87 Difference]: Start difference. First operand 10570 states and 11145 transitions. Second operand 5 states. [2019-11-15 23:16:45,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:16:45,405 INFO L93 Difference]: Finished difference Result 20159 states and 21236 transitions. [2019-11-15 23:16:45,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:16:45,405 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1053 [2019-11-15 23:16:45,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:16:45,406 INFO L225 Difference]: With dead ends: 20159 [2019-11-15 23:16:45,406 INFO L226 Difference]: Without dead ends: 0 [2019-11-15 23:16:45,412 INFO L600 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-11-15 23:16:45,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-15 23:16:45,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-15 23:16:45,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-15 23:16:45,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 23:16:45,413 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1053 [2019-11-15 23:16:45,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:16:45,414 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:16:45,414 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:16:45,414 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-15 23:16:45,414 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-15 23:16:45,418 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-15 23:16:49,174 WARN L191 SmtUtils]: Spent 3.75 s on a formula simplification. DAG size of input: 1225 DAG size of output: 1033 [2019-11-15 23:16:52,098 WARN L191 SmtUtils]: Spent 2.92 s on a formula simplification. DAG size of input: 1222 DAG size of output: 1031 [2019-11-15 23:17:22,407 WARN L191 SmtUtils]: Spent 30.30 s on a formula simplification. DAG size of input: 998 DAG size of output: 225 [2019-11-15 23:17:59,373 WARN L191 SmtUtils]: Spent 36.96 s on a formula simplification. DAG size of input: 998 DAG size of output: 225 [2019-11-15 23:17:59,375 INFO L443 ceAbstractionStarter]: For program point L168(line 168) no Hoare annotation was computed. [2019-11-15 23:17:59,375 INFO L443 ceAbstractionStarter]: For program point L102(line 102) no Hoare annotation was computed. [2019-11-15 23:17:59,375 INFO L443 ceAbstractionStarter]: For program point L36(line 36) no Hoare annotation was computed. [2019-11-15 23:17:59,375 INFO L446 ceAbstractionStarter]: At program point L1028(lines 1028 1044) the Hoare annotation is: true [2019-11-15 23:17:59,375 INFO L443 ceAbstractionStarter]: For program point L566(lines 566 1024) no Hoare annotation was computed. [2019-11-15 23:17:59,375 INFO L443 ceAbstractionStarter]: For program point L500(lines 500 1024) no Hoare annotation was computed. [2019-11-15 23:17:59,375 INFO L443 ceAbstractionStarter]: For program point L170-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:17:59,376 INFO L443 ceAbstractionStarter]: For program point L104-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:17:59,376 INFO L443 ceAbstractionStarter]: For program point L38-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:17:59,376 INFO L443 ceAbstractionStarter]: For program point L963(lines 963 1024) no Hoare annotation was computed. [2019-11-15 23:17:59,376 INFO L443 ceAbstractionStarter]: For program point L831(lines 831 1024) no Hoare annotation was computed. [2019-11-15 23:17:59,376 INFO L443 ceAbstractionStarter]: For program point L171(line 171) no Hoare annotation was computed. [2019-11-15 23:17:59,376 INFO L443 ceAbstractionStarter]: For program point L105(line 105) no Hoare annotation was computed. [2019-11-15 23:17:59,376 INFO L443 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2019-11-15 23:17:59,376 INFO L443 ceAbstractionStarter]: For program point L898(lines 898 1024) no Hoare annotation was computed. [2019-11-15 23:17:59,376 INFO L443 ceAbstractionStarter]: For program point L436(lines 436 1024) no Hoare annotation was computed. [2019-11-15 23:17:59,376 INFO L443 ceAbstractionStarter]: For program point L370(lines 370 1024) no Hoare annotation was computed. [2019-11-15 23:17:59,376 INFO L443 ceAbstractionStarter]: For program point L635(lines 635 1024) no Hoare annotation was computed. [2019-11-15 23:17:59,376 INFO L443 ceAbstractionStarter]: For program point L305(lines 305 1024) no Hoare annotation was computed. [2019-11-15 23:17:59,376 INFO L443 ceAbstractionStarter]: For program point L173-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:17:59,376 INFO L443 ceAbstractionStarter]: For program point L107-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:17:59,376 INFO L443 ceAbstractionStarter]: For program point L41-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:17:59,377 INFO L443 ceAbstractionStarter]: For program point L240(lines 240 1024) no Hoare annotation was computed. [2019-11-15 23:17:59,377 INFO L443 ceAbstractionStarter]: For program point L174(line 174) no Hoare annotation was computed. [2019-11-15 23:17:59,377 INFO L443 ceAbstractionStarter]: For program point L108(line 108) no Hoare annotation was computed. [2019-11-15 23:17:59,377 INFO L443 ceAbstractionStarter]: For program point L42(line 42) no Hoare annotation was computed. [2019-11-15 23:17:59,377 INFO L443 ceAbstractionStarter]: For program point L769(lines 769 1024) no Hoare annotation was computed. [2019-11-15 23:17:59,377 INFO L439 ceAbstractionStarter]: At program point L1034-2(lines 1034 1043) the Hoare annotation is: (let ((.cse13 (= ~a4~0 1)) (.cse21 (+ ~a23~0 43))) (let ((.cse24 (= 10 ~a25~0)) (.cse15 (= 1 ~a4~0)) (.cse0 (= ~a25~0 9)) (.cse25 (<= .cse21 0)) (.cse7 (<= ~a29~0 140)) (.cse31 (not .cse13)) (.cse2 (= 12 ~a25~0)) (.cse35 (<= ~a29~0 277)) (.cse16 (< 138 ~a23~0)) (.cse37 (<= ~a29~0 274)) (.cse19 (= ~a25~0 11)) (.cse29 (<= 130 ~a29~0))) (let ((.cse26 (or (and .cse2 .cse35 .cse29 .cse16) (and (and .cse35 .cse29 .cse16) .cse19) (and .cse37 .cse19 .cse29))) (.cse9 (<= ~a29~0 245)) (.cse18 (or (and (and (and (not .cse2) .cse25) .cse15) .cse29) (and .cse0 (and .cse25 (and .cse7 .cse31))))) (.cse12 (= ~a25~0 13)) (.cse20 (<= ~a23~0 312)) (.cse33 (<= 0 (+ ~a23~0 21))) (.cse30 (and .cse24 .cse7))) (let ((.cse17 (<= ~a29~0 599998)) (.cse1 (or (and (and .cse16 .cse7) .cse20 (not .cse12) .cse15) (and .cse7 .cse20 .cse2 .cse33 .cse15) (and .cse20 .cse33 .cse30 .cse15))) (.cse32 (<= ~a29~0 161)) (.cse14 (<= ~a23~0 (+ ~a29~0 589831))) (.cse5 (<= (+ ~a23~0 55) 0)) (.cse28 (<= ~a23~0 306)) (.cse3 (<= ~a4~0 0)) (.cse8 (and .cse2 (and .cse31 .cse25) .cse37 .cse29)) (.cse27 (< 245 ~a29~0)) (.cse23 (<= ~a25~0 9)) (.cse34 (and .cse18 .cse29)) (.cse11 (<= ~a23~0 600000)) (.cse4 (= 1 ~a3~0)) (.cse6 (= 15 ~a8~0)) (.cse10 (<= 141 ~a29~0)) (.cse22 (and .cse26 .cse9 .cse15))) (or (and .cse0 .cse1) (and (not (= 4 ULTIMATE.start_calculate_output_~input)) .cse2 .cse3 (not (= 3 ULTIMATE.start_calculate_output_~input)) .cse4 .cse5 .cse6 .cse7) (and (and (and .cse4 (and .cse8 .cse9)) .cse6 .cse10) .cse5) (and .cse11 (and (and (or (and (< 140 ~a29~0) (and .cse12 .cse4 .cse9)) (and (and .cse0 (exists ((v_~a29~0_502 Int)) (and (< 140 v_~a29~0_502) (<= 0 v_~a29~0_502) (<= (+ (mod v_~a29~0_502 15) 247) ~a29~0)))) .cse4)) .cse6) .cse13)) (and (and (<= ~a23~0 599986) (and .cse4 .cse14 .cse0) .cse6 .cse10) .cse13) (and .cse12 .cse6 .cse15 .cse16 .cse11 .cse4 .cse17) (and .cse18 .cse19) (and (and (and .cse20 (< 0 .cse21)) .cse0 .cse4 .cse6) .cse13) (and .cse11 (and (<= 260 ~a29~0) .cse19) .cse4 .cse13 .cse6) (and .cse4 (and .cse14 .cse22) .cse6 .cse10) (and .cse11 (and .cse4 (and .cse23 (and (exists ((v_~a29~0_500 Int)) (and (< 140 v_~a29~0_500) (<= (+ (* 2 (div (* v_~a29~0_500 10) 5)) 569818) ~a29~0))) .cse15 .cse16)) .cse6) .cse17) (and .cse1 .cse4 .cse6) (and (and .cse24 .cse25) .cse15) (and .cse11 (and (and .cse4 (and .cse26 .cse15)) .cse6 .cse27)) (and .cse12 .cse28 (<= ~a29~0 220) .cse15 .cse29 .cse16) (and .cse20 .cse6 .cse15 .cse16 (= ~a25~0 12) .cse4) (and (and .cse6 (and (or .cse30 (and (and .cse31 .cse7) .cse19)) .cse4)) .cse5) (and .cse11 .cse32 .cse12 .cse4 .cse6 .cse15 (and .cse33 .cse29)) (and (and .cse4 (and .cse32 .cse18 .cse14) .cse6) .cse5) (and .cse12 .cse4 .cse34 .cse6 .cse9) (and (and .cse15 .cse16) .cse12 .cse4 .cse28 .cse6) (and .cse11 (and .cse4 .cse24 .cse6 .cse15)) (or (and .cse3 .cse4 (and .cse2 .cse35) .cse6 .cse27) (and (<= 256 ~a29~0) (or (and .cse4 .cse8) (and .cse0 (<= 10250 ~a29~0) .cse4)) .cse6 .cse25) (and (and .cse4 .cse6 (and .cse8 (exists ((v_~a23~0_474 Int) (v_~a23~0_473 Int)) (let ((.cse36 (mod v_~a23~0_473 299846))) (and (< 306 v_~a23~0_474) (<= v_~a23~0_474 (div (+ (* .cse36 10) 3678100) 9)) (< v_~a23~0_474 600276) (<= 0 (+ (* 10 .cse36) 3678100)) (<= ~a23~0 (+ (div (+ v_~a23~0_474 (- 600276)) 5) 1)) (= 0 .cse36) (not (= 0 (mod (+ v_~a23~0_474 4) 5))) (<= (+ v_~a23~0_473 43) 0)))))) .cse27)) (and .cse23 .cse34 .cse15) (and .cse11 .cse2 .cse4 .cse6 .cse10 .cse22)))))) [2019-11-15 23:17:59,377 INFO L443 ceAbstractionStarter]: For program point L836(lines 836 1024) no Hoare annotation was computed. [2019-11-15 23:17:59,378 INFO L443 ceAbstractionStarter]: For program point L572(lines 572 1024) no Hoare annotation was computed. [2019-11-15 23:17:59,378 INFO L443 ceAbstractionStarter]: For program point L176-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:17:59,378 INFO L443 ceAbstractionStarter]: For program point L110-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:17:59,378 INFO L443 ceAbstractionStarter]: For program point L44-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:17:59,378 INFO L443 ceAbstractionStarter]: For program point L969(lines 969 1024) no Hoare annotation was computed. [2019-11-15 23:17:59,378 INFO L443 ceAbstractionStarter]: For program point L903(lines 903 1024) no Hoare annotation was computed. [2019-11-15 23:17:59,378 INFO L443 ceAbstractionStarter]: For program point L507(lines 507 1024) no Hoare annotation was computed. [2019-11-15 23:17:59,378 INFO L443 ceAbstractionStarter]: For program point L177(line 177) no Hoare annotation was computed. [2019-11-15 23:17:59,378 INFO L443 ceAbstractionStarter]: For program point L111(line 111) no Hoare annotation was computed. [2019-11-15 23:17:59,378 INFO L443 ceAbstractionStarter]: For program point L45(line 45) no Hoare annotation was computed. [2019-11-15 23:17:59,378 INFO L443 ceAbstractionStarter]: For program point L970(lines 970 980) no Hoare annotation was computed. [2019-11-15 23:17:59,378 INFO L443 ceAbstractionStarter]: For program point L904(lines 904 914) no Hoare annotation was computed. [2019-11-15 23:17:59,378 INFO L443 ceAbstractionStarter]: For program point L970-2(lines 970 980) no Hoare annotation was computed. [2019-11-15 23:17:59,378 INFO L443 ceAbstractionStarter]: For program point L904-2(lines 904 914) no Hoare annotation was computed. [2019-11-15 23:17:59,378 INFO L443 ceAbstractionStarter]: For program point L706(lines 706 1024) no Hoare annotation was computed. [2019-11-15 23:17:59,379 INFO L443 ceAbstractionStarter]: For program point L310(lines 310 1024) no Hoare annotation was computed. [2019-11-15 23:17:59,379 INFO L443 ceAbstractionStarter]: For program point L575(lines 575 1024) no Hoare annotation was computed. [2019-11-15 23:17:59,379 INFO L443 ceAbstractionStarter]: For program point L443(lines 443 1024) no Hoare annotation was computed. [2019-11-15 23:17:59,379 INFO L443 ceAbstractionStarter]: For program point L377(lines 377 1024) no Hoare annotation was computed. [2019-11-15 23:17:59,379 INFO L443 ceAbstractionStarter]: For program point L179-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:17:59,379 INFO L443 ceAbstractionStarter]: For program point L113-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:17:59,379 INFO L443 ceAbstractionStarter]: For program point L47-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:17:59,379 INFO L443 ceAbstractionStarter]: For program point L774(lines 774 1024) no Hoare annotation was computed. [2019-11-15 23:17:59,379 INFO L443 ceAbstractionStarter]: For program point L642(lines 642 1024) no Hoare annotation was computed. [2019-11-15 23:17:59,379 INFO L443 ceAbstractionStarter]: For program point L180(line 180) no Hoare annotation was computed. [2019-11-15 23:17:59,379 INFO L443 ceAbstractionStarter]: For program point L114(line 114) no Hoare annotation was computed. [2019-11-15 23:17:59,379 INFO L443 ceAbstractionStarter]: For program point L48(line 48) no Hoare annotation was computed. [2019-11-15 23:17:59,379 INFO L443 ceAbstractionStarter]: For program point L1039(line 1039) no Hoare annotation was computed. [2019-11-15 23:17:59,379 INFO L443 ceAbstractionStarter]: For program point L841(lines 841 1024) no Hoare annotation was computed. [2019-11-15 23:17:59,379 INFO L443 ceAbstractionStarter]: For program point L247(lines 247 1024) no Hoare annotation was computed. [2019-11-15 23:17:59,379 INFO L443 ceAbstractionStarter]: For program point L182-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:17:59,380 INFO L443 ceAbstractionStarter]: For program point L116-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:17:59,380 INFO L443 ceAbstractionStarter]: For program point L50-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:17:59,380 INFO L443 ceAbstractionStarter]: For program point L183(line 183) no Hoare annotation was computed. [2019-11-15 23:17:59,380 INFO L443 ceAbstractionStarter]: For program point L117(line 117) no Hoare annotation was computed. [2019-11-15 23:17:59,380 INFO L443 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2019-11-15 23:17:59,380 INFO L443 ceAbstractionStarter]: For program point L712(lines 712 1024) no Hoare annotation was computed. [2019-11-15 23:17:59,380 INFO L443 ceAbstractionStarter]: For program point L514(lines 514 1024) no Hoare annotation was computed. [2019-11-15 23:17:59,381 INFO L443 ceAbstractionStarter]: For program point L647(lines 647 1024) no Hoare annotation was computed. [2019-11-15 23:17:59,381 INFO L443 ceAbstractionStarter]: For program point L581(lines 581 1024) no Hoare annotation was computed. [2019-11-15 23:17:59,381 INFO L443 ceAbstractionStarter]: For program point L515(lines 515 525) no Hoare annotation was computed. [2019-11-15 23:17:59,381 INFO L443 ceAbstractionStarter]: For program point L515-2(lines 515 525) no Hoare annotation was computed. [2019-11-15 23:17:59,381 INFO L443 ceAbstractionStarter]: For program point L317(lines 317 1024) no Hoare annotation was computed. [2019-11-15 23:17:59,381 INFO L443 ceAbstractionStarter]: For program point L185-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:17:59,381 INFO L443 ceAbstractionStarter]: For program point L119-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:17:59,381 INFO L443 ceAbstractionStarter]: For program point L53-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:17:59,382 INFO L443 ceAbstractionStarter]: For program point L846(lines 846 1024) no Hoare annotation was computed. [2019-11-15 23:17:59,382 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 168) no Hoare annotation was computed. [2019-11-15 23:17:59,382 INFO L443 ceAbstractionStarter]: For program point L780(lines 780 1024) no Hoare annotation was computed. [2019-11-15 23:17:59,382 INFO L443 ceAbstractionStarter]: For program point L648(lines 648 657) no Hoare annotation was computed. [2019-11-15 23:17:59,382 INFO L443 ceAbstractionStarter]: For program point L648-2(lines 648 657) no Hoare annotation was computed. [2019-11-15 23:17:59,382 INFO L443 ceAbstractionStarter]: For program point L450(lines 450 1024) no Hoare annotation was computed. [2019-11-15 23:17:59,382 INFO L443 ceAbstractionStarter]: For program point L384(lines 384 1024) no Hoare annotation was computed. [2019-11-15 23:17:59,383 INFO L443 ceAbstractionStarter]: For program point L186(line 186) no Hoare annotation was computed. [2019-11-15 23:17:59,383 INFO L443 ceAbstractionStarter]: For program point L120(line 120) no Hoare annotation was computed. [2019-11-15 23:17:59,383 INFO L443 ceAbstractionStarter]: For program point L54(line 54) no Hoare annotation was computed. [2019-11-15 23:17:59,383 INFO L443 ceAbstractionStarter]: For program point L254(lines 254 1024) no Hoare annotation was computed. [2019-11-15 23:17:59,383 INFO L443 ceAbstractionStarter]: For program point L188-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:17:59,383 INFO L443 ceAbstractionStarter]: For program point L122-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:17:59,383 INFO L443 ceAbstractionStarter]: For program point L56-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:17:59,384 INFO L443 ceAbstractionStarter]: For program point L981(lines 981 1024) no Hoare annotation was computed. [2019-11-15 23:17:59,384 INFO L443 ceAbstractionStarter]: For program point L915(lines 915 1024) no Hoare annotation was computed. [2019-11-15 23:17:59,384 INFO L443 ceAbstractionStarter]: For program point L717(lines 717 1024) no Hoare annotation was computed. [2019-11-15 23:17:59,384 INFO L443 ceAbstractionStarter]: For program point L189(line 189) no Hoare annotation was computed. [2019-11-15 23:17:59,384 INFO L443 ceAbstractionStarter]: For program point L123(line 123) no Hoare annotation was computed. [2019-11-15 23:17:59,384 INFO L443 ceAbstractionStarter]: For program point L57(line 57) no Hoare annotation was computed. [2019-11-15 23:17:59,384 INFO L443 ceAbstractionStarter]: For program point L916(lines 916 926) no Hoare annotation was computed. [2019-11-15 23:17:59,384 INFO L443 ceAbstractionStarter]: For program point L916-2(lines 916 926) no Hoare annotation was computed. [2019-11-15 23:17:59,385 INFO L443 ceAbstractionStarter]: For program point L718(lines 718 730) no Hoare annotation was computed. [2019-11-15 23:17:59,385 INFO L443 ceAbstractionStarter]: For program point L718-2(lines 718 730) no Hoare annotation was computed. [2019-11-15 23:17:59,385 INFO L443 ceAbstractionStarter]: For program point L586(lines 586 1024) no Hoare annotation was computed. [2019-11-15 23:17:59,385 INFO L443 ceAbstractionStarter]: For program point L322(lines 322 1024) no Hoare annotation was computed. [2019-11-15 23:17:59,385 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-15 23:17:59,385 INFO L443 ceAbstractionStarter]: For program point L587(lines 587 597) no Hoare annotation was computed. [2019-11-15 23:17:59,385 INFO L443 ceAbstractionStarter]: For program point L587-2(lines 587 597) no Hoare annotation was computed. [2019-11-15 23:17:59,386 INFO L443 ceAbstractionStarter]: For program point L191-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:17:59,386 INFO L443 ceAbstractionStarter]: For program point L125-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:17:59,386 INFO L443 ceAbstractionStarter]: For program point L59-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:17:59,386 INFO L443 ceAbstractionStarter]: For program point L852(lines 852 1024) no Hoare annotation was computed. [2019-11-15 23:17:59,386 INFO L443 ceAbstractionStarter]: For program point L456(lines 456 1024) no Hoare annotation was computed. [2019-11-15 23:17:59,386 INFO L443 ceAbstractionStarter]: For program point L192(line 192) no Hoare annotation was computed. [2019-11-15 23:17:59,386 INFO L443 ceAbstractionStarter]: For program point L126(line 126) no Hoare annotation was computed. [2019-11-15 23:17:59,386 INFO L443 ceAbstractionStarter]: For program point L60(line 60) no Hoare annotation was computed. [2019-11-15 23:17:59,387 INFO L443 ceAbstractionStarter]: For program point L787(lines 787 1024) no Hoare annotation was computed. [2019-11-15 23:17:59,387 INFO L443 ceAbstractionStarter]: For program point L391(lines 391 1024) no Hoare annotation was computed. [2019-11-15 23:17:59,387 INFO L443 ceAbstractionStarter]: For program point L260(lines 260 1024) no Hoare annotation was computed. [2019-11-15 23:17:59,387 INFO L443 ceAbstractionStarter]: For program point L194-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:17:59,387 INFO L443 ceAbstractionStarter]: For program point L128-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:17:59,387 INFO L443 ceAbstractionStarter]: For program point L62-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:17:59,387 INFO L443 ceAbstractionStarter]: For program point L195(line 195) no Hoare annotation was computed. [2019-11-15 23:17:59,388 INFO L443 ceAbstractionStarter]: For program point L129(line 129) no Hoare annotation was computed. [2019-11-15 23:17:59,388 INFO L443 ceAbstractionStarter]: For program point L63(line 63) no Hoare annotation was computed. [2019-11-15 23:17:59,388 INFO L443 ceAbstractionStarter]: For program point L988(lines 988 1024) no Hoare annotation was computed. [2019-11-15 23:17:59,388 INFO L443 ceAbstractionStarter]: For program point L658(lines 658 1024) no Hoare annotation was computed. [2019-11-15 23:17:59,388 INFO L443 ceAbstractionStarter]: For program point L526(lines 526 1024) no Hoare annotation was computed. [2019-11-15 23:17:59,388 INFO L443 ceAbstractionStarter]: For program point L329(lines 329 1024) no Hoare annotation was computed. [2019-11-15 23:17:59,388 INFO L443 ceAbstractionStarter]: For program point L197-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:17:59,388 INFO L443 ceAbstractionStarter]: For program point L131-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:17:59,389 INFO L443 ceAbstractionStarter]: For program point L65-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:17:59,389 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-15 23:17:59,389 INFO L443 ceAbstractionStarter]: For program point L792(lines 792 1024) no Hoare annotation was computed. [2019-11-15 23:17:59,389 INFO L443 ceAbstractionStarter]: For program point L198(line 198) no Hoare annotation was computed. [2019-11-15 23:17:59,389 INFO L443 ceAbstractionStarter]: For program point L132(line 132) no Hoare annotation was computed. [2019-11-15 23:17:59,389 INFO L443 ceAbstractionStarter]: For program point L66(line 66) no Hoare annotation was computed. [2019-11-15 23:17:59,389 INFO L443 ceAbstractionStarter]: For program point L859(lines 859 1024) no Hoare annotation was computed. [2019-11-15 23:17:59,389 INFO L443 ceAbstractionStarter]: For program point L463(lines 463 1024) no Hoare annotation was computed. [2019-11-15 23:17:59,390 INFO L443 ceAbstractionStarter]: For program point L265(lines 265 1024) no Hoare annotation was computed. [2019-11-15 23:17:59,390 INFO L443 ceAbstractionStarter]: For program point L398(lines 398 1024) no Hoare annotation was computed. [2019-11-15 23:17:59,390 INFO L443 ceAbstractionStarter]: For program point L200-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:17:59,390 INFO L443 ceAbstractionStarter]: For program point L134-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:17:59,390 INFO L443 ceAbstractionStarter]: For program point L68-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:17:59,390 INFO L443 ceAbstractionStarter]: For program point L993(lines 993 1024) no Hoare annotation was computed. [2019-11-15 23:17:59,390 INFO L443 ceAbstractionStarter]: For program point L927(lines 927 1024) no Hoare annotation was computed. [2019-11-15 23:17:59,391 INFO L443 ceAbstractionStarter]: For program point L663(lines 663 1024) no Hoare annotation was computed. [2019-11-15 23:17:59,391 INFO L443 ceAbstractionStarter]: For program point L531(lines 531 1024) no Hoare annotation was computed. [2019-11-15 23:17:59,391 INFO L443 ceAbstractionStarter]: For program point L399(lines 399 410) no Hoare annotation was computed. [2019-11-15 23:17:59,391 INFO L443 ceAbstractionStarter]: For program point L399-2(lines 399 410) no Hoare annotation was computed. [2019-11-15 23:17:59,391 INFO L443 ceAbstractionStarter]: For program point L201(line 201) no Hoare annotation was computed. [2019-11-15 23:17:59,391 INFO L443 ceAbstractionStarter]: For program point L135(line 135) no Hoare annotation was computed. [2019-11-15 23:17:59,391 INFO L443 ceAbstractionStarter]: For program point L69(line 69) no Hoare annotation was computed. [2019-11-15 23:17:59,391 INFO L443 ceAbstractionStarter]: For program point L598(lines 598 1024) no Hoare annotation was computed. [2019-11-15 23:17:59,392 INFO L443 ceAbstractionStarter]: For program point L334(lines 334 1024) no Hoare annotation was computed. [2019-11-15 23:17:59,392 INFO L443 ceAbstractionStarter]: For program point L268(lines 268 1024) no Hoare annotation was computed. [2019-11-15 23:17:59,392 INFO L443 ceAbstractionStarter]: For program point L731(lines 731 1024) no Hoare annotation was computed. [2019-11-15 23:17:59,392 INFO L443 ceAbstractionStarter]: For program point L203-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:17:59,392 INFO L443 ceAbstractionStarter]: For program point L137-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:17:59,392 INFO L443 ceAbstractionStarter]: For program point L71-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:17:59,392 INFO L443 ceAbstractionStarter]: For program point L204(line 204) no Hoare annotation was computed. [2019-11-15 23:17:59,393 INFO L443 ceAbstractionStarter]: For program point L138(line 138) no Hoare annotation was computed. [2019-11-15 23:17:59,393 INFO L443 ceAbstractionStarter]: For program point L72(line 72) no Hoare annotation was computed. [2019-11-15 23:17:59,393 INFO L443 ceAbstractionStarter]: For program point L865(lines 865 1024) no Hoare annotation was computed. [2019-11-15 23:17:59,393 INFO L443 ceAbstractionStarter]: For program point L799(lines 799 1024) no Hoare annotation was computed. [2019-11-15 23:17:59,393 INFO L443 ceAbstractionStarter]: For program point L932(lines 932 1024) no Hoare annotation was computed. [2019-11-15 23:17:59,393 INFO L443 ceAbstractionStarter]: For program point L866(lines 866 875) no Hoare annotation was computed. [2019-11-15 23:17:59,393 INFO L443 ceAbstractionStarter]: For program point L866-2(lines 866 875) no Hoare annotation was computed. [2019-11-15 23:17:59,394 INFO L443 ceAbstractionStarter]: For program point L470(lines 470 1024) no Hoare annotation was computed. [2019-11-15 23:17:59,394 INFO L443 ceAbstractionStarter]: For program point L140-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:17:59,394 INFO L443 ceAbstractionStarter]: For program point L74-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:17:59,394 INFO L443 ceAbstractionStarter]: For program point L603(lines 603 1024) no Hoare annotation was computed. [2019-11-15 23:17:59,394 INFO L443 ceAbstractionStarter]: For program point L537(lines 537 1024) no Hoare annotation was computed. [2019-11-15 23:17:59,394 INFO L443 ceAbstractionStarter]: For program point L141(line 141) no Hoare annotation was computed. [2019-11-15 23:17:59,394 INFO L443 ceAbstractionStarter]: For program point L75(line 75) no Hoare annotation was computed. [2019-11-15 23:17:59,395 INFO L443 ceAbstractionStarter]: For program point L1000(lines 1000 1024) no Hoare annotation was computed. [2019-11-15 23:17:59,395 INFO L443 ceAbstractionStarter]: For program point L670(lines 670 1024) no Hoare annotation was computed. [2019-11-15 23:17:59,395 INFO L443 ceAbstractionStarter]: For program point L604(lines 604 614) no Hoare annotation was computed. [2019-11-15 23:17:59,395 INFO L443 ceAbstractionStarter]: For program point L604-2(lines 604 614) no Hoare annotation was computed. [2019-11-15 23:17:59,395 INFO L443 ceAbstractionStarter]: For program point L340(lines 340 1024) no Hoare annotation was computed. [2019-11-15 23:17:59,395 INFO L443 ceAbstractionStarter]: For program point L275(lines 275 1024) no Hoare annotation was computed. [2019-11-15 23:17:59,395 INFO L443 ceAbstractionStarter]: For program point L143-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:17:59,395 INFO L443 ceAbstractionStarter]: For program point L77-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:17:59,395 INFO L443 ceAbstractionStarter]: For program point L804(lines 804 1024) no Hoare annotation was computed. [2019-11-15 23:17:59,395 INFO L443 ceAbstractionStarter]: For program point L738(lines 738 1024) no Hoare annotation was computed. [2019-11-15 23:17:59,395 INFO L443 ceAbstractionStarter]: For program point L144(line 144) no Hoare annotation was computed. [2019-11-15 23:17:59,395 INFO L443 ceAbstractionStarter]: For program point L78(line 78) no Hoare annotation was computed. [2019-11-15 23:17:59,396 INFO L443 ceAbstractionStarter]: For program point L805(lines 805 815) no Hoare annotation was computed. [2019-11-15 23:17:59,396 INFO L443 ceAbstractionStarter]: For program point L805-2(lines 805 815) no Hoare annotation was computed. [2019-11-15 23:17:59,396 INFO L443 ceAbstractionStarter]: For program point L542(lines 542 1024) no Hoare annotation was computed. [2019-11-15 23:17:59,396 INFO L443 ceAbstractionStarter]: For program point L146-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:17:59,396 INFO L443 ceAbstractionStarter]: For program point L80-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:17:59,396 INFO L443 ceAbstractionStarter]: For program point L1005(lines 1005 1024) no Hoare annotation was computed. [2019-11-15 23:17:59,396 INFO L443 ceAbstractionStarter]: For program point L939(lines 939 1024) no Hoare annotation was computed. [2019-11-15 23:17:59,396 INFO L443 ceAbstractionStarter]: For program point L675(lines 675 1024) no Hoare annotation was computed. [2019-11-15 23:17:59,396 INFO L443 ceAbstractionStarter]: For program point L477(lines 477 1024) no Hoare annotation was computed. [2019-11-15 23:17:59,396 INFO L443 ceAbstractionStarter]: For program point L411(lines 411 1024) no Hoare annotation was computed. [2019-11-15 23:17:59,396 INFO L443 ceAbstractionStarter]: For program point L147(line 147) no Hoare annotation was computed. [2019-11-15 23:17:59,396 INFO L443 ceAbstractionStarter]: For program point L81(line 81) no Hoare annotation was computed. [2019-11-15 23:17:59,396 INFO L443 ceAbstractionStarter]: For program point L940(lines 940 952) no Hoare annotation was computed. [2019-11-15 23:17:59,396 INFO L443 ceAbstractionStarter]: For program point L940-2(lines 940 952) no Hoare annotation was computed. [2019-11-15 23:17:59,396 INFO L443 ceAbstractionStarter]: For program point L478(lines 478 486) no Hoare annotation was computed. [2019-11-15 23:17:59,396 INFO L443 ceAbstractionStarter]: For program point L478-2(lines 478 486) no Hoare annotation was computed. [2019-11-15 23:17:59,397 INFO L443 ceAbstractionStarter]: For program point L346(lines 346 1024) no Hoare annotation was computed. [2019-11-15 23:17:59,397 INFO L443 ceAbstractionStarter]: For program point L280(lines 280 1024) no Hoare annotation was computed. [2019-11-15 23:17:59,397 INFO L443 ceAbstractionStarter]: For program point L214(lines 214 1024) no Hoare annotation was computed. [2019-11-15 23:17:59,397 INFO L443 ceAbstractionStarter]: For program point L743(lines 743 1024) no Hoare annotation was computed. [2019-11-15 23:17:59,397 INFO L443 ceAbstractionStarter]: For program point L149-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:17:59,397 INFO L443 ceAbstractionStarter]: For program point L83-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:17:59,397 INFO L443 ceAbstractionStarter]: For program point L876(lines 876 1024) no Hoare annotation was computed. [2019-11-15 23:17:59,397 INFO L443 ceAbstractionStarter]: For program point L150(line 150) no Hoare annotation was computed. [2019-11-15 23:17:59,397 INFO L443 ceAbstractionStarter]: For program point L84(line 84) no Hoare annotation was computed. [2019-11-15 23:17:59,397 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-15 23:17:59,397 INFO L443 ceAbstractionStarter]: For program point L152-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:17:59,397 INFO L443 ceAbstractionStarter]: For program point L86-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:17:59,397 INFO L443 ceAbstractionStarter]: For program point L681(lines 681 1024) no Hoare annotation was computed. [2019-11-15 23:17:59,397 INFO L443 ceAbstractionStarter]: For program point L615(lines 615 1024) no Hoare annotation was computed. [2019-11-15 23:17:59,397 INFO L443 ceAbstractionStarter]: For program point L549(lines 549 1024) no Hoare annotation was computed. [2019-11-15 23:17:59,397 INFO L443 ceAbstractionStarter]: For program point L417(lines 417 1024) no Hoare annotation was computed. [2019-11-15 23:17:59,398 INFO L443 ceAbstractionStarter]: For program point L153(line 153) no Hoare annotation was computed. [2019-11-15 23:17:59,398 INFO L443 ceAbstractionStarter]: For program point L87(line 87) no Hoare annotation was computed. [2019-11-15 23:17:59,398 INFO L443 ceAbstractionStarter]: For program point L1012(lines 1012 1024) no Hoare annotation was computed. [2019-11-15 23:17:59,398 INFO L443 ceAbstractionStarter]: For program point L881(lines 881 1024) no Hoare annotation was computed. [2019-11-15 23:17:59,398 INFO L443 ceAbstractionStarter]: For program point L353(lines 353 1024) no Hoare annotation was computed. [2019-11-15 23:17:59,398 INFO L443 ceAbstractionStarter]: For program point L287(lines 287 1024) no Hoare annotation was computed. [2019-11-15 23:17:59,398 INFO L443 ceAbstractionStarter]: For program point L221(lines 221 1024) no Hoare annotation was computed. [2019-11-15 23:17:59,398 INFO L443 ceAbstractionStarter]: For program point L155-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:17:59,398 INFO L443 ceAbstractionStarter]: For program point L89-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:17:59,398 INFO L443 ceAbstractionStarter]: For program point L23(lines 23 25) no Hoare annotation was computed. [2019-11-15 23:17:59,398 INFO L443 ceAbstractionStarter]: For program point L23-2(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:17:59,398 INFO L443 ceAbstractionStarter]: For program point L816(lines 816 1024) no Hoare annotation was computed. [2019-11-15 23:17:59,398 INFO L443 ceAbstractionStarter]: For program point L750(lines 750 1024) no Hoare annotation was computed. [2019-11-15 23:17:59,398 INFO L443 ceAbstractionStarter]: For program point L156(line 156) no Hoare annotation was computed. [2019-11-15 23:17:59,398 INFO L443 ceAbstractionStarter]: For program point L90(line 90) no Hoare annotation was computed. [2019-11-15 23:17:59,399 INFO L443 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2019-11-15 23:17:59,399 INFO L443 ceAbstractionStarter]: For program point L487(lines 487 1024) no Hoare annotation was computed. [2019-11-15 23:17:59,399 INFO L443 ceAbstractionStarter]: For program point L488(lines 488 499) no Hoare annotation was computed. [2019-11-15 23:17:59,399 INFO L443 ceAbstractionStarter]: For program point L422(lines 422 1024) no Hoare annotation was computed. [2019-11-15 23:17:59,399 INFO L443 ceAbstractionStarter]: For program point L488-2(lines 488 499) no Hoare annotation was computed. [2019-11-15 23:17:59,399 INFO L443 ceAbstractionStarter]: For program point L158-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:17:59,399 INFO L443 ceAbstractionStarter]: For program point L92-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:17:59,399 INFO L443 ceAbstractionStarter]: For program point L26-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:17:59,399 INFO L443 ceAbstractionStarter]: For program point L1017(lines 1017 1024) no Hoare annotation was computed. [2019-11-15 23:17:59,399 INFO L443 ceAbstractionStarter]: For program point L621(lines 621 1024) no Hoare annotation was computed. [2019-11-15 23:17:59,399 INFO L443 ceAbstractionStarter]: For program point L555(lines 555 1024) no Hoare annotation was computed. [2019-11-15 23:17:59,399 INFO L443 ceAbstractionStarter]: For program point L159(line 159) no Hoare annotation was computed. [2019-11-15 23:17:59,399 INFO L443 ceAbstractionStarter]: For program point L93(line 93) no Hoare annotation was computed. [2019-11-15 23:17:59,399 INFO L443 ceAbstractionStarter]: For program point L27(line 27) no Hoare annotation was computed. [2019-11-15 23:17:59,399 INFO L443 ceAbstractionStarter]: For program point L886(lines 886 1024) no Hoare annotation was computed. [2019-11-15 23:17:59,400 INFO L443 ceAbstractionStarter]: For program point L688(lines 688 1024) no Hoare annotation was computed. [2019-11-15 23:17:59,400 INFO L443 ceAbstractionStarter]: For program point L358(lines 358 1024) no Hoare annotation was computed. [2019-11-15 23:17:59,400 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-15 23:17:59,400 INFO L443 ceAbstractionStarter]: For program point L953(lines 953 1024) no Hoare annotation was computed. [2019-11-15 23:17:59,400 INFO L443 ceAbstractionStarter]: For program point L227(lines 227 1024) no Hoare annotation was computed. [2019-11-15 23:17:59,400 INFO L443 ceAbstractionStarter]: For program point L161-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:17:59,400 INFO L443 ceAbstractionStarter]: For program point L95-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:17:59,401 INFO L443 ceAbstractionStarter]: For program point L29-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:17:59,401 INFO L443 ceAbstractionStarter]: For program point L822(lines 822 1024) no Hoare annotation was computed. [2019-11-15 23:17:59,401 INFO L443 ceAbstractionStarter]: For program point L294(lines 294 1024) no Hoare annotation was computed. [2019-11-15 23:17:59,401 INFO L443 ceAbstractionStarter]: For program point L162(line 162) no Hoare annotation was computed. [2019-11-15 23:17:59,401 INFO L443 ceAbstractionStarter]: For program point L96(line 96) no Hoare annotation was computed. [2019-11-15 23:17:59,401 INFO L443 ceAbstractionStarter]: For program point L30(line 30) no Hoare annotation was computed. [2019-11-15 23:17:59,401 INFO L443 ceAbstractionStarter]: For program point L757(lines 757 1024) no Hoare annotation was computed. [2019-11-15 23:17:59,402 INFO L443 ceAbstractionStarter]: For program point L758(lines 758 768) no Hoare annotation was computed. [2019-11-15 23:17:59,402 INFO L443 ceAbstractionStarter]: For program point L758-2(lines 758 768) no Hoare annotation was computed. [2019-11-15 23:17:59,402 INFO L443 ceAbstractionStarter]: For program point L164-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:17:59,402 INFO L443 ceAbstractionStarter]: For program point L98-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:17:59,402 INFO L443 ceAbstractionStarter]: For program point L32-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:17:59,402 INFO L443 ceAbstractionStarter]: For program point L825(lines 825 1024) no Hoare annotation was computed. [2019-11-15 23:17:59,402 INFO L443 ceAbstractionStarter]: For program point L561(lines 561 1024) no Hoare annotation was computed. [2019-11-15 23:17:59,403 INFO L443 ceAbstractionStarter]: For program point L429(lines 429 1024) no Hoare annotation was computed. [2019-11-15 23:17:59,403 INFO L443 ceAbstractionStarter]: For program point L165(line 165) no Hoare annotation was computed. [2019-11-15 23:17:59,403 INFO L443 ceAbstractionStarter]: For program point L99(line 99) no Hoare annotation was computed. [2019-11-15 23:17:59,403 INFO L443 ceAbstractionStarter]: For program point L33(line 33) no Hoare annotation was computed. [2019-11-15 23:17:59,403 INFO L443 ceAbstractionStarter]: For program point L958(lines 958 1024) no Hoare annotation was computed. [2019-11-15 23:17:59,403 INFO L443 ceAbstractionStarter]: For program point L694(lines 694 1024) no Hoare annotation was computed. [2019-11-15 23:17:59,403 INFO L443 ceAbstractionStarter]: For program point L628(lines 628 1024) no Hoare annotation was computed. [2019-11-15 23:17:59,404 INFO L439 ceAbstractionStarter]: At program point L1025(lines 22 1026) the Hoare annotation is: (let ((.cse13 (= ~a4~0 1)) (.cse21 (+ ~a23~0 43))) (let ((.cse24 (= 10 ~a25~0)) (.cse15 (= 1 ~a4~0)) (.cse0 (= ~a25~0 9)) (.cse25 (<= .cse21 0)) (.cse7 (<= ~a29~0 140)) (.cse31 (not .cse13)) (.cse2 (= 12 ~a25~0)) (.cse35 (<= ~a29~0 277)) (.cse16 (< 138 ~a23~0)) (.cse37 (<= ~a29~0 274)) (.cse19 (= ~a25~0 11)) (.cse29 (<= 130 ~a29~0))) (let ((.cse26 (or (and .cse2 .cse35 .cse29 .cse16) (and (and .cse35 .cse29 .cse16) .cse19) (and .cse37 .cse19 .cse29))) (.cse9 (<= ~a29~0 245)) (.cse18 (or (and (and (and (not .cse2) .cse25) .cse15) .cse29) (and .cse0 (and .cse25 (and .cse7 .cse31))))) (.cse12 (= ~a25~0 13)) (.cse20 (<= ~a23~0 312)) (.cse33 (<= 0 (+ ~a23~0 21))) (.cse30 (and .cse24 .cse7))) (let ((.cse17 (<= ~a29~0 599998)) (.cse1 (or (and (and .cse16 .cse7) .cse20 (not .cse12) .cse15) (and .cse7 .cse20 .cse2 .cse33 .cse15) (and .cse20 .cse33 .cse30 .cse15))) (.cse32 (<= ~a29~0 161)) (.cse14 (<= ~a23~0 (+ ~a29~0 589831))) (.cse5 (<= (+ ~a23~0 55) 0)) (.cse28 (<= ~a23~0 306)) (.cse3 (<= ~a4~0 0)) (.cse8 (and .cse2 (and .cse31 .cse25) .cse37 .cse29)) (.cse27 (< 245 ~a29~0)) (.cse23 (<= ~a25~0 9)) (.cse34 (and .cse18 .cse29)) (.cse11 (<= ~a23~0 600000)) (.cse4 (= 1 ~a3~0)) (.cse6 (= 15 ~a8~0)) (.cse10 (<= 141 ~a29~0)) (.cse22 (and .cse26 .cse9 .cse15))) (or (and .cse0 .cse1) (and (not (= 4 ULTIMATE.start_calculate_output_~input)) .cse2 .cse3 (not (= 3 ULTIMATE.start_calculate_output_~input)) .cse4 .cse5 .cse6 .cse7) (and (and (and .cse4 (and .cse8 .cse9)) .cse6 .cse10) .cse5) (and .cse11 (and (and (or (and (< 140 ~a29~0) (and .cse12 .cse4 .cse9)) (and (and .cse0 (exists ((v_~a29~0_502 Int)) (and (< 140 v_~a29~0_502) (<= 0 v_~a29~0_502) (<= (+ (mod v_~a29~0_502 15) 247) ~a29~0)))) .cse4)) .cse6) .cse13)) (and (and (<= ~a23~0 599986) (and .cse4 .cse14 .cse0) .cse6 .cse10) .cse13) (and .cse12 .cse6 .cse15 .cse16 .cse11 .cse4 .cse17) (and .cse18 .cse19) (and (and (and .cse20 (< 0 .cse21)) .cse0 .cse4 .cse6) .cse13) (and .cse11 (and (<= 260 ~a29~0) .cse19) .cse4 .cse13 .cse6) (and .cse4 (and .cse14 .cse22) .cse6 .cse10) (and .cse11 (and .cse4 (and .cse23 (and (exists ((v_~a29~0_500 Int)) (and (< 140 v_~a29~0_500) (<= (+ (* 2 (div (* v_~a29~0_500 10) 5)) 569818) ~a29~0))) .cse15 .cse16)) .cse6) .cse17) (and .cse1 .cse4 .cse6) (and (and .cse24 .cse25) .cse15) (and .cse11 (and (and .cse4 (and .cse26 .cse15)) .cse6 .cse27)) (and .cse12 .cse28 (<= ~a29~0 220) .cse15 .cse29 .cse16) (and .cse20 .cse6 .cse15 .cse16 (= ~a25~0 12) .cse4) (and (and .cse6 (and (or .cse30 (and (and .cse31 .cse7) .cse19)) .cse4)) .cse5) (and .cse11 .cse32 .cse12 .cse4 .cse6 .cse15 (and .cse33 .cse29)) (and (and .cse4 (and .cse32 .cse18 .cse14) .cse6) .cse5) (and .cse12 .cse4 .cse34 .cse6 .cse9) (and (and .cse15 .cse16) .cse12 .cse4 .cse28 .cse6) (and .cse11 (and .cse4 .cse24 .cse6 .cse15)) (or (and .cse3 .cse4 (and .cse2 .cse35) .cse6 .cse27) (and (<= 256 ~a29~0) (or (and .cse4 .cse8) (and .cse0 (<= 10250 ~a29~0) .cse4)) .cse6 .cse25) (and (and .cse4 .cse6 (and .cse8 (exists ((v_~a23~0_474 Int) (v_~a23~0_473 Int)) (let ((.cse36 (mod v_~a23~0_473 299846))) (and (< 306 v_~a23~0_474) (<= v_~a23~0_474 (div (+ (* .cse36 10) 3678100) 9)) (< v_~a23~0_474 600276) (<= 0 (+ (* 10 .cse36) 3678100)) (<= ~a23~0 (+ (div (+ v_~a23~0_474 (- 600276)) 5) 1)) (= 0 .cse36) (not (= 0 (mod (+ v_~a23~0_474 4) 5))) (<= (+ v_~a23~0_473 43) 0)))))) .cse27)) (and .cse23 .cse34 .cse15) (and .cse11 .cse2 .cse4 .cse6 .cse10 .cse22)))))) [2019-11-15 23:17:59,404 INFO L443 ceAbstractionStarter]: For program point L893(lines 893 1024) no Hoare annotation was computed. [2019-11-15 23:17:59,404 INFO L443 ceAbstractionStarter]: For program point L695(lines 695 705) no Hoare annotation was computed. [2019-11-15 23:17:59,404 INFO L443 ceAbstractionStarter]: For program point L695-2(lines 695 705) no Hoare annotation was computed. [2019-11-15 23:17:59,404 INFO L443 ceAbstractionStarter]: For program point L365(lines 365 1024) no Hoare annotation was computed. [2019-11-15 23:17:59,405 INFO L443 ceAbstractionStarter]: For program point L299(lines 299 1024) no Hoare annotation was computed. [2019-11-15 23:17:59,405 INFO L443 ceAbstractionStarter]: For program point L233(lines 233 1024) no Hoare annotation was computed. [2019-11-15 23:17:59,405 INFO L443 ceAbstractionStarter]: For program point L167-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:17:59,405 INFO L443 ceAbstractionStarter]: For program point L101-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:17:59,405 INFO L443 ceAbstractionStarter]: For program point L35-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:17:59,418 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-15 23:17:59,419 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-15 23:17:59,419 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-15 23:17:59,420 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 23:17:59,421 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 23:17:59,422 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-15 23:17:59,423 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-15 23:17:59,423 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] [2019-11-15 23:17:59,423 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-15 23:17:59,424 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] [2019-11-15 23:17:59,424 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-15 23:17:59,424 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] [2019-11-15 23:17:59,425 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-15 23:17:59,425 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] [2019-11-15 23:17:59,443 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-15 23:17:59,443 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-15 23:17:59,444 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-15 23:17:59,444 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 23:17:59,445 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 23:17:59,446 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-15 23:17:59,446 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-15 23:17:59,447 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] [2019-11-15 23:17:59,447 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-15 23:17:59,447 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] [2019-11-15 23:17:59,447 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-15 23:17:59,448 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] [2019-11-15 23:17:59,448 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-15 23:17:59,448 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] [2019-11-15 23:17:59,459 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-15 23:17:59,460 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-15 23:17:59,460 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-15 23:17:59,461 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 23:17:59,461 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 23:17:59,462 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-15 23:17:59,463 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-15 23:17:59,463 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] [2019-11-15 23:17:59,463 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-15 23:17:59,464 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] [2019-11-15 23:17:59,464 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-15 23:17:59,464 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] [2019-11-15 23:17:59,465 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-15 23:17:59,465 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] [2019-11-15 23:17:59,469 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-15 23:17:59,469 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-15 23:17:59,470 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-15 23:17:59,470 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 23:17:59,471 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 23:17:59,471 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-15 23:17:59,472 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-15 23:17:59,472 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] [2019-11-15 23:17:59,472 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-15 23:17:59,473 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] [2019-11-15 23:17:59,473 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-15 23:17:59,473 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] [2019-11-15 23:17:59,473 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-15 23:17:59,474 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] [2019-11-15 23:17:59,478 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 11:17:59 BoogieIcfgContainer [2019-11-15 23:17:59,478 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 23:17:59,479 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 23:17:59,479 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 23:17:59,480 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 23:17:59,480 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:14:12" (3/4) ... [2019-11-15 23:17:59,484 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-15 23:17:59,518 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-15 23:17:59,520 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-15 23:17:59,553 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((a25 == 9 && ((((((138 < a23 && a29 <= 140) && a23 <= 312) && !(a25 == 13)) && 1 == a4) || ((((a29 <= 140 && a23 <= 312) && 12 == a25) && 0 <= a23 + 21) && 1 == a4)) || (((a23 <= 312 && 0 <= a23 + 21) && 10 == a25 && a29 <= 140) && 1 == a4))) || (((((((!(4 == input) && 12 == a25) && a4 <= 0) && !(3 == input)) && 1 == a3) && a23 + 55 <= 0) && 15 == a8) && a29 <= 140)) || ((((1 == a3 && (((12 == a25 && !(a4 == 1) && a23 + 43 <= 0) && a29 <= 274) && 130 <= a29) && a29 <= 245) && 15 == a8) && 141 <= a29) && a23 + 55 <= 0)) || (a23 <= 600000 && (((140 < a29 && (a25 == 13 && 1 == a3) && a29 <= 245) || ((a25 == 9 && (\exists v_~a29~0_502 : int :: (140 < v_~a29~0_502 && 0 <= v_~a29~0_502) && v_~a29~0_502 % 15 + 247 <= a29)) && 1 == a3)) && 15 == a8) && a4 == 1)) || ((((a23 <= 599986 && (1 == a3 && a23 <= a29 + 589831) && a25 == 9) && 15 == a8) && 141 <= a29) && a4 == 1)) || ((((((a25 == 13 && 15 == a8) && 1 == a4) && 138 < a23) && a23 <= 600000) && 1 == a3) && a29 <= 599998)) || (((((!(12 == a25) && a23 + 43 <= 0) && 1 == a4) && 130 <= a29) || (a25 == 9 && a23 + 43 <= 0 && a29 <= 140 && !(a4 == 1))) && a25 == 11)) || (((((a23 <= 312 && 0 < a23 + 43) && a25 == 9) && 1 == a3) && 15 == a8) && a4 == 1)) || ((((a23 <= 600000 && 260 <= a29 && a25 == 11) && 1 == a3) && a4 == 1) && 15 == a8)) || (((1 == a3 && a23 <= a29 + 589831 && ((((((12 == a25 && a29 <= 277) && 130 <= a29) && 138 < a23) || (((a29 <= 277 && 130 <= a29) && 138 < a23) && a25 == 11)) || ((a29 <= 274 && a25 == 11) && 130 <= a29)) && a29 <= 245) && 1 == a4) && 15 == a8) && 141 <= a29)) || ((a23 <= 600000 && (1 == a3 && a25 <= 9 && ((\exists v_~a29~0_500 : int :: 140 < v_~a29~0_500 && 2 * (v_~a29~0_500 * 10 / 5) + 569818 <= a29) && 1 == a4) && 138 < a23) && 15 == a8) && a29 <= 599998)) || ((((((((138 < a23 && a29 <= 140) && a23 <= 312) && !(a25 == 13)) && 1 == a4) || ((((a29 <= 140 && a23 <= 312) && 12 == a25) && 0 <= a23 + 21) && 1 == a4)) || (((a23 <= 312 && 0 <= a23 + 21) && 10 == a25 && a29 <= 140) && 1 == a4)) && 1 == a3) && 15 == a8)) || ((10 == a25 && a23 + 43 <= 0) && 1 == a4)) || (a23 <= 600000 && ((1 == a3 && (((((12 == a25 && a29 <= 277) && 130 <= a29) && 138 < a23) || (((a29 <= 277 && 130 <= a29) && 138 < a23) && a25 == 11)) || ((a29 <= 274 && a25 == 11) && 130 <= a29)) && 1 == a4) && 15 == a8) && 245 < a29)) || (((((a25 == 13 && a23 <= 306) && a29 <= 220) && 1 == a4) && 130 <= a29) && 138 < a23)) || (((((a23 <= 312 && 15 == a8) && 1 == a4) && 138 < a23) && a25 == 12) && 1 == a3)) || ((15 == a8 && ((10 == a25 && a29 <= 140) || ((!(a4 == 1) && a29 <= 140) && a25 == 11)) && 1 == a3) && a23 + 55 <= 0)) || ((((((a23 <= 600000 && a29 <= 161) && a25 == 13) && 1 == a3) && 15 == a8) && 1 == a4) && 0 <= a23 + 21 && 130 <= a29)) || (((1 == a3 && (a29 <= 161 && ((((!(12 == a25) && a23 + 43 <= 0) && 1 == a4) && 130 <= a29) || (a25 == 9 && a23 + 43 <= 0 && a29 <= 140 && !(a4 == 1)))) && a23 <= a29 + 589831) && 15 == a8) && a23 + 55 <= 0)) || ((((a25 == 13 && 1 == a3) && ((((!(12 == a25) && a23 + 43 <= 0) && 1 == a4) && 130 <= a29) || (a25 == 9 && a23 + 43 <= 0 && a29 <= 140 && !(a4 == 1))) && 130 <= a29) && 15 == a8) && a29 <= 245)) || (((((1 == a4 && 138 < a23) && a25 == 13) && 1 == a3) && a23 <= 306) && 15 == a8)) || (a23 <= 600000 && ((1 == a3 && 10 == a25) && 15 == a8) && 1 == a4)) || (((((a4 <= 0 && 1 == a3) && 12 == a25 && a29 <= 277) && 15 == a8) && 245 < a29) || (((256 <= a29 && ((1 == a3 && ((12 == a25 && !(a4 == 1) && a23 + 43 <= 0) && a29 <= 274) && 130 <= a29) || ((a25 == 9 && 10250 <= a29) && 1 == a3))) && 15 == a8) && a23 + 43 <= 0)) || (((1 == a3 && 15 == a8) && (((12 == a25 && !(a4 == 1) && a23 + 43 <= 0) && a29 <= 274) && 130 <= a29) && (\exists v_~a23~0_474 : int, v_~a23~0_473 : int :: ((((((306 < v_~a23~0_474 && v_~a23~0_474 <= (v_~a23~0_473 % 299846 * 10 + 3678100) / 9) && v_~a23~0_474 < 600276) && 0 <= 10 * (v_~a23~0_473 % 299846) + 3678100) && a23 <= (v_~a23~0_474 + -600276) / 5 + 1) && 0 == v_~a23~0_473 % 299846) && !(0 == (v_~a23~0_474 + 4) % 5)) && v_~a23~0_473 + 43 <= 0)) && 245 < a29)) || ((a25 <= 9 && ((((!(12 == a25) && a23 + 43 <= 0) && 1 == a4) && 130 <= a29) || (a25 == 9 && a23 + 43 <= 0 && a29 <= 140 && !(a4 == 1))) && 130 <= a29) && 1 == a4)) || (((((a23 <= 600000 && 12 == a25) && 1 == a3) && 15 == a8) && 141 <= a29) && ((((((12 == a25 && a29 <= 277) && 130 <= a29) && 138 < a23) || (((a29 <= 277 && 130 <= a29) && 138 < a23) && a25 == 11)) || ((a29 <= 274 && a25 == 11) && 130 <= a29)) && a29 <= 245) && 1 == a4) [2019-11-15 23:17:59,557 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((a25 == 9 && ((((((138 < a23 && a29 <= 140) && a23 <= 312) && !(a25 == 13)) && 1 == a4) || ((((a29 <= 140 && a23 <= 312) && 12 == a25) && 0 <= a23 + 21) && 1 == a4)) || (((a23 <= 312 && 0 <= a23 + 21) && 10 == a25 && a29 <= 140) && 1 == a4))) || (((((((!(4 == input) && 12 == a25) && a4 <= 0) && !(3 == input)) && 1 == a3) && a23 + 55 <= 0) && 15 == a8) && a29 <= 140)) || ((((1 == a3 && (((12 == a25 && !(a4 == 1) && a23 + 43 <= 0) && a29 <= 274) && 130 <= a29) && a29 <= 245) && 15 == a8) && 141 <= a29) && a23 + 55 <= 0)) || (a23 <= 600000 && (((140 < a29 && (a25 == 13 && 1 == a3) && a29 <= 245) || ((a25 == 9 && (\exists v_~a29~0_502 : int :: (140 < v_~a29~0_502 && 0 <= v_~a29~0_502) && v_~a29~0_502 % 15 + 247 <= a29)) && 1 == a3)) && 15 == a8) && a4 == 1)) || ((((a23 <= 599986 && (1 == a3 && a23 <= a29 + 589831) && a25 == 9) && 15 == a8) && 141 <= a29) && a4 == 1)) || ((((((a25 == 13 && 15 == a8) && 1 == a4) && 138 < a23) && a23 <= 600000) && 1 == a3) && a29 <= 599998)) || (((((!(12 == a25) && a23 + 43 <= 0) && 1 == a4) && 130 <= a29) || (a25 == 9 && a23 + 43 <= 0 && a29 <= 140 && !(a4 == 1))) && a25 == 11)) || (((((a23 <= 312 && 0 < a23 + 43) && a25 == 9) && 1 == a3) && 15 == a8) && a4 == 1)) || ((((a23 <= 600000 && 260 <= a29 && a25 == 11) && 1 == a3) && a4 == 1) && 15 == a8)) || (((1 == a3 && a23 <= a29 + 589831 && ((((((12 == a25 && a29 <= 277) && 130 <= a29) && 138 < a23) || (((a29 <= 277 && 130 <= a29) && 138 < a23) && a25 == 11)) || ((a29 <= 274 && a25 == 11) && 130 <= a29)) && a29 <= 245) && 1 == a4) && 15 == a8) && 141 <= a29)) || ((a23 <= 600000 && (1 == a3 && a25 <= 9 && ((\exists v_~a29~0_500 : int :: 140 < v_~a29~0_500 && 2 * (v_~a29~0_500 * 10 / 5) + 569818 <= a29) && 1 == a4) && 138 < a23) && 15 == a8) && a29 <= 599998)) || ((((((((138 < a23 && a29 <= 140) && a23 <= 312) && !(a25 == 13)) && 1 == a4) || ((((a29 <= 140 && a23 <= 312) && 12 == a25) && 0 <= a23 + 21) && 1 == a4)) || (((a23 <= 312 && 0 <= a23 + 21) && 10 == a25 && a29 <= 140) && 1 == a4)) && 1 == a3) && 15 == a8)) || ((10 == a25 && a23 + 43 <= 0) && 1 == a4)) || (a23 <= 600000 && ((1 == a3 && (((((12 == a25 && a29 <= 277) && 130 <= a29) && 138 < a23) || (((a29 <= 277 && 130 <= a29) && 138 < a23) && a25 == 11)) || ((a29 <= 274 && a25 == 11) && 130 <= a29)) && 1 == a4) && 15 == a8) && 245 < a29)) || (((((a25 == 13 && a23 <= 306) && a29 <= 220) && 1 == a4) && 130 <= a29) && 138 < a23)) || (((((a23 <= 312 && 15 == a8) && 1 == a4) && 138 < a23) && a25 == 12) && 1 == a3)) || ((15 == a8 && ((10 == a25 && a29 <= 140) || ((!(a4 == 1) && a29 <= 140) && a25 == 11)) && 1 == a3) && a23 + 55 <= 0)) || ((((((a23 <= 600000 && a29 <= 161) && a25 == 13) && 1 == a3) && 15 == a8) && 1 == a4) && 0 <= a23 + 21 && 130 <= a29)) || (((1 == a3 && (a29 <= 161 && ((((!(12 == a25) && a23 + 43 <= 0) && 1 == a4) && 130 <= a29) || (a25 == 9 && a23 + 43 <= 0 && a29 <= 140 && !(a4 == 1)))) && a23 <= a29 + 589831) && 15 == a8) && a23 + 55 <= 0)) || ((((a25 == 13 && 1 == a3) && ((((!(12 == a25) && a23 + 43 <= 0) && 1 == a4) && 130 <= a29) || (a25 == 9 && a23 + 43 <= 0 && a29 <= 140 && !(a4 == 1))) && 130 <= a29) && 15 == a8) && a29 <= 245)) || (((((1 == a4 && 138 < a23) && a25 == 13) && 1 == a3) && a23 <= 306) && 15 == a8)) || (a23 <= 600000 && ((1 == a3 && 10 == a25) && 15 == a8) && 1 == a4)) || (((((a4 <= 0 && 1 == a3) && 12 == a25 && a29 <= 277) && 15 == a8) && 245 < a29) || (((256 <= a29 && ((1 == a3 && ((12 == a25 && !(a4 == 1) && a23 + 43 <= 0) && a29 <= 274) && 130 <= a29) || ((a25 == 9 && 10250 <= a29) && 1 == a3))) && 15 == a8) && a23 + 43 <= 0)) || (((1 == a3 && 15 == a8) && (((12 == a25 && !(a4 == 1) && a23 + 43 <= 0) && a29 <= 274) && 130 <= a29) && (\exists v_~a23~0_474 : int, v_~a23~0_473 : int :: ((((((306 < v_~a23~0_474 && v_~a23~0_474 <= (v_~a23~0_473 % 299846 * 10 + 3678100) / 9) && v_~a23~0_474 < 600276) && 0 <= 10 * (v_~a23~0_473 % 299846) + 3678100) && a23 <= (v_~a23~0_474 + -600276) / 5 + 1) && 0 == v_~a23~0_473 % 299846) && !(0 == (v_~a23~0_474 + 4) % 5)) && v_~a23~0_473 + 43 <= 0)) && 245 < a29)) || ((a25 <= 9 && ((((!(12 == a25) && a23 + 43 <= 0) && 1 == a4) && 130 <= a29) || (a25 == 9 && a23 + 43 <= 0 && a29 <= 140 && !(a4 == 1))) && 130 <= a29) && 1 == a4)) || (((((a23 <= 600000 && 12 == a25) && 1 == a3) && 15 == a8) && 141 <= a29) && ((((((12 == a25 && a29 <= 277) && 130 <= a29) && 138 < a23) || (((a29 <= 277 && 130 <= a29) && 138 < a23) && a25 == 11)) || ((a29 <= 274 && a25 == 11) && 130 <= a29)) && a29 <= 245) && 1 == a4) [2019-11-15 23:17:59,694 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_87b84a59-2667-48b8-854c-862d70a37451/bin/uautomizer/witness.graphml [2019-11-15 23:17:59,695 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 23:17:59,696 INFO L168 Benchmark]: Toolchain (without parser) took 229979.37 ms. Allocated memory was 1.0 GB in the beginning and 5.1 GB in the end (delta: 4.0 GB). Free memory was 944.7 MB in the beginning and 954.7 MB in the end (delta: -10.0 MB). Peak memory consumption was 4.0 GB. Max. memory is 11.5 GB. [2019-11-15 23:17:59,696 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:17:59,697 INFO L168 Benchmark]: CACSL2BoogieTranslator took 886.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -157.1 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. [2019-11-15 23:17:59,697 INFO L168 Benchmark]: Boogie Procedure Inliner took 141.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2019-11-15 23:17:59,698 INFO L168 Benchmark]: Boogie Preprocessor took 79.29 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-15 23:17:59,698 INFO L168 Benchmark]: RCFGBuilder took 1718.62 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 895.9 MB in the end (delta: 179.1 MB). Peak memory consumption was 179.1 MB. Max. memory is 11.5 GB. [2019-11-15 23:17:59,699 INFO L168 Benchmark]: TraceAbstraction took 226934.07 ms. Allocated memory was 1.2 GB in the beginning and 5.1 GB in the end (delta: 3.9 GB). Free memory was 895.9 MB in the beginning and 981.5 MB in the end (delta: -85.6 MB). Peak memory consumption was 4.1 GB. Max. memory is 11.5 GB. [2019-11-15 23:17:59,699 INFO L168 Benchmark]: Witness Printer took 215.73 ms. Allocated memory is still 5.1 GB. Free memory was 981.5 MB in the beginning and 954.7 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2019-11-15 23:17:59,701 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 886.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -157.1 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 141.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 79.29 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1718.62 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 895.9 MB in the end (delta: 179.1 MB). Peak memory consumption was 179.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 226934.07 ms. Allocated memory was 1.2 GB in the beginning and 5.1 GB in the end (delta: 3.9 GB). Free memory was 895.9 MB in the beginning and 981.5 MB in the end (delta: -85.6 MB). Peak memory consumption was 4.1 GB. Max. memory is 11.5 GB. * Witness Printer took 215.73 ms. Allocated memory is still 5.1 GB. Free memory was 981.5 MB in the beginning and 954.7 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~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_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,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_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,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_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,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_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 168]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1028]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1034]: Loop Invariant [2019-11-15 23:17:59,714 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-15 23:17:59,715 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-15 23:17:59,715 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-15 23:17:59,715 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 23:17:59,716 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 23:17:59,716 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-15 23:17:59,717 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-15 23:17:59,717 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] [2019-11-15 23:17:59,717 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-15 23:17:59,717 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] [2019-11-15 23:17:59,718 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-15 23:17:59,718 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] [2019-11-15 23:17:59,718 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-15 23:17:59,718 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] [2019-11-15 23:17:59,721 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-15 23:17:59,722 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-15 23:17:59,722 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-15 23:17:59,723 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 23:17:59,723 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 23:17:59,723 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-15 23:17:59,724 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-15 23:17:59,724 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] [2019-11-15 23:17:59,724 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-15 23:17:59,725 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] [2019-11-15 23:17:59,725 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-15 23:17:59,725 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] [2019-11-15 23:17:59,725 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-15 23:17:59,726 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((a25 == 9 && ((((((138 < a23 && a29 <= 140) && a23 <= 312) && !(a25 == 13)) && 1 == a4) || ((((a29 <= 140 && a23 <= 312) && 12 == a25) && 0 <= a23 + 21) && 1 == a4)) || (((a23 <= 312 && 0 <= a23 + 21) && 10 == a25 && a29 <= 140) && 1 == a4))) || (((((((!(4 == input) && 12 == a25) && a4 <= 0) && !(3 == input)) && 1 == a3) && a23 + 55 <= 0) && 15 == a8) && a29 <= 140)) || ((((1 == a3 && (((12 == a25 && !(a4 == 1) && a23 + 43 <= 0) && a29 <= 274) && 130 <= a29) && a29 <= 245) && 15 == a8) && 141 <= a29) && a23 + 55 <= 0)) || (a23 <= 600000 && (((140 < a29 && (a25 == 13 && 1 == a3) && a29 <= 245) || ((a25 == 9 && (\exists v_~a29~0_502 : int :: (140 < v_~a29~0_502 && 0 <= v_~a29~0_502) && v_~a29~0_502 % 15 + 247 <= a29)) && 1 == a3)) && 15 == a8) && a4 == 1)) || ((((a23 <= 599986 && (1 == a3 && a23 <= a29 + 589831) && a25 == 9) && 15 == a8) && 141 <= a29) && a4 == 1)) || ((((((a25 == 13 && 15 == a8) && 1 == a4) && 138 < a23) && a23 <= 600000) && 1 == a3) && a29 <= 599998)) || (((((!(12 == a25) && a23 + 43 <= 0) && 1 == a4) && 130 <= a29) || (a25 == 9 && a23 + 43 <= 0 && a29 <= 140 && !(a4 == 1))) && a25 == 11)) || (((((a23 <= 312 && 0 < a23 + 43) && a25 == 9) && 1 == a3) && 15 == a8) && a4 == 1)) || ((((a23 <= 600000 && 260 <= a29 && a25 == 11) && 1 == a3) && a4 == 1) && 15 == a8)) || (((1 == a3 && a23 <= a29 + 589831 && ((((((12 == a25 && a29 <= 277) && 130 <= a29) && 138 < a23) || (((a29 <= 277 && 130 <= a29) && 138 < a23) && a25 == 11)) || ((a29 <= 274 && a25 == 11) && 130 <= a29)) && a29 <= 245) && 1 == a4) && 15 == a8) && 141 <= a29)) || ((a23 <= 600000 && (1 == a3 && a25 <= 9 && ((\exists v_~a29~0_500 : int :: 140 < v_~a29~0_500 && 2 * (v_~a29~0_500 * 10 / 5) + 569818 <= a29) && 1 == a4) && 138 < a23) && 15 == a8) && a29 <= 599998)) || ((((((((138 < a23 && a29 <= 140) && a23 <= 312) && !(a25 == 13)) && 1 == a4) || ((((a29 <= 140 && a23 <= 312) && 12 == a25) && 0 <= a23 + 21) && 1 == a4)) || (((a23 <= 312 && 0 <= a23 + 21) && 10 == a25 && a29 <= 140) && 1 == a4)) && 1 == a3) && 15 == a8)) || ((10 == a25 && a23 + 43 <= 0) && 1 == a4)) || (a23 <= 600000 && ((1 == a3 && (((((12 == a25 && a29 <= 277) && 130 <= a29) && 138 < a23) || (((a29 <= 277 && 130 <= a29) && 138 < a23) && a25 == 11)) || ((a29 <= 274 && a25 == 11) && 130 <= a29)) && 1 == a4) && 15 == a8) && 245 < a29)) || (((((a25 == 13 && a23 <= 306) && a29 <= 220) && 1 == a4) && 130 <= a29) && 138 < a23)) || (((((a23 <= 312 && 15 == a8) && 1 == a4) && 138 < a23) && a25 == 12) && 1 == a3)) || ((15 == a8 && ((10 == a25 && a29 <= 140) || ((!(a4 == 1) && a29 <= 140) && a25 == 11)) && 1 == a3) && a23 + 55 <= 0)) || ((((((a23 <= 600000 && a29 <= 161) && a25 == 13) && 1 == a3) && 15 == a8) && 1 == a4) && 0 <= a23 + 21 && 130 <= a29)) || (((1 == a3 && (a29 <= 161 && ((((!(12 == a25) && a23 + 43 <= 0) && 1 == a4) && 130 <= a29) || (a25 == 9 && a23 + 43 <= 0 && a29 <= 140 && !(a4 == 1)))) && a23 <= a29 + 589831) && 15 == a8) && a23 + 55 <= 0)) || ((((a25 == 13 && 1 == a3) && ((((!(12 == a25) && a23 + 43 <= 0) && 1 == a4) && 130 <= a29) || (a25 == 9 && a23 + 43 <= 0 && a29 <= 140 && !(a4 == 1))) && 130 <= a29) && 15 == a8) && a29 <= 245)) || (((((1 == a4 && 138 < a23) && a25 == 13) && 1 == a3) && a23 <= 306) && 15 == a8)) || (a23 <= 600000 && ((1 == a3 && 10 == a25) && 15 == a8) && 1 == a4)) || (((((a4 <= 0 && 1 == a3) && 12 == a25 && a29 <= 277) && 15 == a8) && 245 < a29) || (((256 <= a29 && ((1 == a3 && ((12 == a25 && !(a4 == 1) && a23 + 43 <= 0) && a29 <= 274) && 130 <= a29) || ((a25 == 9 && 10250 <= a29) && 1 == a3))) && 15 == a8) && a23 + 43 <= 0)) || (((1 == a3 && 15 == a8) && (((12 == a25 && !(a4 == 1) && a23 + 43 <= 0) && a29 <= 274) && 130 <= a29) && (\exists v_~a23~0_474 : int, v_~a23~0_473 : int :: ((((((306 < v_~a23~0_474 && v_~a23~0_474 <= (v_~a23~0_473 % 299846 * 10 + 3678100) / 9) && v_~a23~0_474 < 600276) && 0 <= 10 * (v_~a23~0_473 % 299846) + 3678100) && a23 <= (v_~a23~0_474 + -600276) / 5 + 1) && 0 == v_~a23~0_473 % 299846) && !(0 == (v_~a23~0_474 + 4) % 5)) && v_~a23~0_473 + 43 <= 0)) && 245 < a29)) || ((a25 <= 9 && ((((!(12 == a25) && a23 + 43 <= 0) && 1 == a4) && 130 <= a29) || (a25 == 9 && a23 + 43 <= 0 && a29 <= 140 && !(a4 == 1))) && 130 <= a29) && 1 == a4)) || (((((a23 <= 600000 && 12 == a25) && 1 == a3) && 15 == a8) && 141 <= a29) && ((((((12 == a25 && a29 <= 277) && 130 <= a29) && 138 < a23) || (((a29 <= 277 && 130 <= a29) && 138 < a23) && a25 == 11)) || ((a29 <= 274 && a25 == 11) && 130 <= a29)) && a29 <= 245) && 1 == a4) - InvariantResult [Line: 22]: Loop Invariant [2019-11-15 23:17:59,729 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-15 23:17:59,729 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-15 23:17:59,729 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-15 23:17:59,730 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 23:17:59,730 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 23:17:59,731 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-15 23:17:59,731 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-15 23:17:59,731 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] [2019-11-15 23:17:59,732 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-15 23:17:59,732 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] [2019-11-15 23:17:59,732 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-15 23:17:59,733 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] [2019-11-15 23:17:59,733 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-15 23:17:59,733 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] [2019-11-15 23:17:59,736 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-15 23:17:59,736 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-15 23:17:59,737 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-15 23:17:59,737 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 23:17:59,737 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 23:17:59,738 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-15 23:17:59,738 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-15 23:17:59,738 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] [2019-11-15 23:17:59,739 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-15 23:17:59,739 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] [2019-11-15 23:17:59,739 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-15 23:17:59,740 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] [2019-11-15 23:17:59,740 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-15 23:17:59,740 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((a25 == 9 && ((((((138 < a23 && a29 <= 140) && a23 <= 312) && !(a25 == 13)) && 1 == a4) || ((((a29 <= 140 && a23 <= 312) && 12 == a25) && 0 <= a23 + 21) && 1 == a4)) || (((a23 <= 312 && 0 <= a23 + 21) && 10 == a25 && a29 <= 140) && 1 == a4))) || (((((((!(4 == input) && 12 == a25) && a4 <= 0) && !(3 == input)) && 1 == a3) && a23 + 55 <= 0) && 15 == a8) && a29 <= 140)) || ((((1 == a3 && (((12 == a25 && !(a4 == 1) && a23 + 43 <= 0) && a29 <= 274) && 130 <= a29) && a29 <= 245) && 15 == a8) && 141 <= a29) && a23 + 55 <= 0)) || (a23 <= 600000 && (((140 < a29 && (a25 == 13 && 1 == a3) && a29 <= 245) || ((a25 == 9 && (\exists v_~a29~0_502 : int :: (140 < v_~a29~0_502 && 0 <= v_~a29~0_502) && v_~a29~0_502 % 15 + 247 <= a29)) && 1 == a3)) && 15 == a8) && a4 == 1)) || ((((a23 <= 599986 && (1 == a3 && a23 <= a29 + 589831) && a25 == 9) && 15 == a8) && 141 <= a29) && a4 == 1)) || ((((((a25 == 13 && 15 == a8) && 1 == a4) && 138 < a23) && a23 <= 600000) && 1 == a3) && a29 <= 599998)) || (((((!(12 == a25) && a23 + 43 <= 0) && 1 == a4) && 130 <= a29) || (a25 == 9 && a23 + 43 <= 0 && a29 <= 140 && !(a4 == 1))) && a25 == 11)) || (((((a23 <= 312 && 0 < a23 + 43) && a25 == 9) && 1 == a3) && 15 == a8) && a4 == 1)) || ((((a23 <= 600000 && 260 <= a29 && a25 == 11) && 1 == a3) && a4 == 1) && 15 == a8)) || (((1 == a3 && a23 <= a29 + 589831 && ((((((12 == a25 && a29 <= 277) && 130 <= a29) && 138 < a23) || (((a29 <= 277 && 130 <= a29) && 138 < a23) && a25 == 11)) || ((a29 <= 274 && a25 == 11) && 130 <= a29)) && a29 <= 245) && 1 == a4) && 15 == a8) && 141 <= a29)) || ((a23 <= 600000 && (1 == a3 && a25 <= 9 && ((\exists v_~a29~0_500 : int :: 140 < v_~a29~0_500 && 2 * (v_~a29~0_500 * 10 / 5) + 569818 <= a29) && 1 == a4) && 138 < a23) && 15 == a8) && a29 <= 599998)) || ((((((((138 < a23 && a29 <= 140) && a23 <= 312) && !(a25 == 13)) && 1 == a4) || ((((a29 <= 140 && a23 <= 312) && 12 == a25) && 0 <= a23 + 21) && 1 == a4)) || (((a23 <= 312 && 0 <= a23 + 21) && 10 == a25 && a29 <= 140) && 1 == a4)) && 1 == a3) && 15 == a8)) || ((10 == a25 && a23 + 43 <= 0) && 1 == a4)) || (a23 <= 600000 && ((1 == a3 && (((((12 == a25 && a29 <= 277) && 130 <= a29) && 138 < a23) || (((a29 <= 277 && 130 <= a29) && 138 < a23) && a25 == 11)) || ((a29 <= 274 && a25 == 11) && 130 <= a29)) && 1 == a4) && 15 == a8) && 245 < a29)) || (((((a25 == 13 && a23 <= 306) && a29 <= 220) && 1 == a4) && 130 <= a29) && 138 < a23)) || (((((a23 <= 312 && 15 == a8) && 1 == a4) && 138 < a23) && a25 == 12) && 1 == a3)) || ((15 == a8 && ((10 == a25 && a29 <= 140) || ((!(a4 == 1) && a29 <= 140) && a25 == 11)) && 1 == a3) && a23 + 55 <= 0)) || ((((((a23 <= 600000 && a29 <= 161) && a25 == 13) && 1 == a3) && 15 == a8) && 1 == a4) && 0 <= a23 + 21 && 130 <= a29)) || (((1 == a3 && (a29 <= 161 && ((((!(12 == a25) && a23 + 43 <= 0) && 1 == a4) && 130 <= a29) || (a25 == 9 && a23 + 43 <= 0 && a29 <= 140 && !(a4 == 1)))) && a23 <= a29 + 589831) && 15 == a8) && a23 + 55 <= 0)) || ((((a25 == 13 && 1 == a3) && ((((!(12 == a25) && a23 + 43 <= 0) && 1 == a4) && 130 <= a29) || (a25 == 9 && a23 + 43 <= 0 && a29 <= 140 && !(a4 == 1))) && 130 <= a29) && 15 == a8) && a29 <= 245)) || (((((1 == a4 && 138 < a23) && a25 == 13) && 1 == a3) && a23 <= 306) && 15 == a8)) || (a23 <= 600000 && ((1 == a3 && 10 == a25) && 15 == a8) && 1 == a4)) || (((((a4 <= 0 && 1 == a3) && 12 == a25 && a29 <= 277) && 15 == a8) && 245 < a29) || (((256 <= a29 && ((1 == a3 && ((12 == a25 && !(a4 == 1) && a23 + 43 <= 0) && a29 <= 274) && 130 <= a29) || ((a25 == 9 && 10250 <= a29) && 1 == a3))) && 15 == a8) && a23 + 43 <= 0)) || (((1 == a3 && 15 == a8) && (((12 == a25 && !(a4 == 1) && a23 + 43 <= 0) && a29 <= 274) && 130 <= a29) && (\exists v_~a23~0_474 : int, v_~a23~0_473 : int :: ((((((306 < v_~a23~0_474 && v_~a23~0_474 <= (v_~a23~0_473 % 299846 * 10 + 3678100) / 9) && v_~a23~0_474 < 600276) && 0 <= 10 * (v_~a23~0_473 % 299846) + 3678100) && a23 <= (v_~a23~0_474 + -600276) / 5 + 1) && 0 == v_~a23~0_473 % 299846) && !(0 == (v_~a23~0_474 + 4) % 5)) && v_~a23~0_473 + 43 <= 0)) && 245 < a29)) || ((a25 <= 9 && ((((!(12 == a25) && a23 + 43 <= 0) && 1 == a4) && 130 <= a29) || (a25 == 9 && a23 + 43 <= 0 && a29 <= 140 && !(a4 == 1))) && 130 <= a29) && 1 == a4)) || (((((a23 <= 600000 && 12 == a25) && 1 == a3) && 15 == a8) && 141 <= a29) && ((((((12 == a25 && a29 <= 277) && 130 <= a29) && 138 < a23) || (((a29 <= 277 && 130 <= a29) && 138 < a23) && a25 == 11)) || ((a29 <= 274 && a25 == 11) && 130 <= a29)) && a29 <= 245) && 1 == a4) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 283 locations, 1 error locations. Result: SAFE, OverallTime: 226.8s, OverallIterations: 24, TraceHistogramMax: 9, AutomataDifference: 116.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 73.9s, HoareTripleCheckerStatistics: 3198 SDtfs, 24033 SDslu, 1438 SDs, 0 SdLazy, 50269 SolverSat, 7712 SolverUnsat, 29 SolverUnknown, 0 SolverNotchecked, 100.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 7267 GetRequests, 7012 SyntacticMatches, 17 SemanticMatches, 238 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3337 ImplicationChecksByTransitivity, 5.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24566occurred in iteration=17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.6s AutomataMinimizationTime, 24 MinimizatonAttempts, 80392 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 160 NumberOfFragments, 2125 HoareAnnotationTreeSize, 3 FomulaSimplifications, 2283296 FormulaSimplificationTreeSizeReduction, 6.6s HoareSimplificationTime, 3 FomulaSimplificationsInter, 2074416 FormulaSimplificationTreeSizeReductionInter, 67.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.7s SsaConstructionTime, 2.5s SatisfiabilityAnalysisTime, 15.1s InterpolantComputationTime, 21556 NumberOfCodeBlocks, 21556 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 21523 ConstructedInterpolants, 619 QuantifiedInterpolants, 63447203 SizeOfPredicates, 19 NumberOfNonLiveVariables, 9012 ConjunctsInSsa, 62 ConjunctsInUnsatCore, 33 InterpolantComputations, 20 PerfectInterpolantSequences, 54608/58916 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...