./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem14_label45.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_62d470ff-10fb-4b4c-ae29-ec78864f1e76/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_62d470ff-10fb-4b4c-ae29-ec78864f1e76/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_62d470ff-10fb-4b4c-ae29-ec78864f1e76/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_62d470ff-10fb-4b4c-ae29-ec78864f1e76/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem14_label45.c -s /tmp/vcloud-vcloud-master/worker/run_dir_62d470ff-10fb-4b4c-ae29-ec78864f1e76/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_62d470ff-10fb-4b4c-ae29-ec78864f1e76/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 3a5c86310b0cee0c3fda3eee1e81be72e3f86b95 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 21:43:20,649 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 21:43:20,650 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 21:43:20,663 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 21:43:20,664 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 21:43:20,665 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 21:43:20,667 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 21:43:20,675 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 21:43:20,679 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 21:43:20,683 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 21:43:20,684 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 21:43:20,686 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 21:43:20,686 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 21:43:20,688 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 21:43:20,688 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 21:43:20,689 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 21:43:20,690 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 21:43:20,691 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 21:43:20,693 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 21:43:20,696 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 21:43:20,699 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 21:43:20,700 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 21:43:20,703 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 21:43:20,704 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 21:43:20,706 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 21:43:20,706 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 21:43:20,706 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 21:43:20,708 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 21:43:20,709 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 21:43:20,709 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 21:43:20,709 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 21:43:20,710 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 21:43:20,711 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 21:43:20,712 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 21:43:20,713 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 21:43:20,713 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 21:43:20,714 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 21:43:20,714 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 21:43:20,714 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 21:43:20,715 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 21:43:20,715 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 21:43:20,716 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_62d470ff-10fb-4b4c-ae29-ec78864f1e76/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 21:43:20,740 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 21:43:20,740 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 21:43:20,741 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 21:43:20,741 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 21:43:20,741 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 21:43:20,742 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 21:43:20,742 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 21:43:20,742 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 21:43:20,742 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 21:43:20,742 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 21:43:20,743 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 21:43:20,743 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 21:43:20,743 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 21:43:20,743 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 21:43:20,743 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 21:43:20,744 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 21:43:20,744 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 21:43:20,744 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 21:43:20,744 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 21:43:20,744 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 21:43:20,745 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 21:43:20,745 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 21:43:20,745 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 21:43:20,745 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 21:43:20,745 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 21:43:20,746 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 21:43:20,746 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 21:43:20,746 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 21:43:20,746 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_62d470ff-10fb-4b4c-ae29-ec78864f1e76/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 -> 3a5c86310b0cee0c3fda3eee1e81be72e3f86b95 [2019-11-15 21:43:20,794 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 21:43:20,806 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 21:43:20,810 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 21:43:20,811 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 21:43:20,811 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 21:43:20,813 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_62d470ff-10fb-4b4c-ae29-ec78864f1e76/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem14_label45.c [2019-11-15 21:43:20,862 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_62d470ff-10fb-4b4c-ae29-ec78864f1e76/bin/uautomizer/data/a76270d49/cfe68032b4b546cfa2c5d4fdf83aee5b/FLAGf6af4a44e [2019-11-15 21:43:21,419 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 21:43:21,419 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_62d470ff-10fb-4b4c-ae29-ec78864f1e76/sv-benchmarks/c/eca-rers2012/Problem14_label45.c [2019-11-15 21:43:21,431 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_62d470ff-10fb-4b4c-ae29-ec78864f1e76/bin/uautomizer/data/a76270d49/cfe68032b4b546cfa2c5d4fdf83aee5b/FLAGf6af4a44e [2019-11-15 21:43:21,832 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_62d470ff-10fb-4b4c-ae29-ec78864f1e76/bin/uautomizer/data/a76270d49/cfe68032b4b546cfa2c5d4fdf83aee5b [2019-11-15 21:43:21,834 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 21:43:21,835 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 21:43:21,836 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 21:43:21,836 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 21:43:21,839 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 21:43:21,840 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:43:21" (1/1) ... [2019-11-15 21:43:21,841 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5390f377 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:43:21, skipping insertion in model container [2019-11-15 21:43:21,841 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:43:21" (1/1) ... [2019-11-15 21:43:21,847 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 21:43:21,901 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 21:43:22,347 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:43:22,351 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 21:43:22,462 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:43:22,481 INFO L192 MainTranslator]: Completed translation [2019-11-15 21:43:22,481 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:43:22 WrapperNode [2019-11-15 21:43:22,481 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 21:43:22,482 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 21:43:22,482 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 21:43:22,482 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 21:43:22,490 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:43:22" (1/1) ... [2019-11-15 21:43:22,511 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:43:22" (1/1) ... [2019-11-15 21:43:22,589 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 21:43:22,590 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 21:43:22,591 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 21:43:22,591 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 21:43:22,599 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:43:22" (1/1) ... [2019-11-15 21:43:22,600 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:43:22" (1/1) ... [2019-11-15 21:43:22,608 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:43:22" (1/1) ... [2019-11-15 21:43:22,609 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:43:22" (1/1) ... [2019-11-15 21:43:22,646 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:43:22" (1/1) ... [2019-11-15 21:43:22,668 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:43:22" (1/1) ... [2019-11-15 21:43:22,679 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:43:22" (1/1) ... [2019-11-15 21:43:22,692 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 21:43:22,693 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 21:43:22,693 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 21:43:22,693 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 21:43:22,694 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:43:22" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_62d470ff-10fb-4b4c-ae29-ec78864f1e76/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 21:43:22,766 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 21:43:22,766 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 21:43:24,264 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 21:43:24,264 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-15 21:43:24,265 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:43:24 BoogieIcfgContainer [2019-11-15 21:43:24,265 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 21:43:24,266 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 21:43:24,267 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 21:43:24,269 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 21:43:24,271 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 09:43:21" (1/3) ... [2019-11-15 21:43:24,272 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e2ff753 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:43:24, skipping insertion in model container [2019-11-15 21:43:24,273 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:43:22" (2/3) ... [2019-11-15 21:43:24,273 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e2ff753 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:43:24, skipping insertion in model container [2019-11-15 21:43:24,274 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:43:24" (3/3) ... [2019-11-15 21:43:24,276 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem14_label45.c [2019-11-15 21:43:24,286 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 21:43:24,294 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 21:43:24,304 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 21:43:24,340 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 21:43:24,340 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 21:43:24,341 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 21:43:24,341 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 21:43:24,341 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 21:43:24,341 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 21:43:24,341 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 21:43:24,342 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 21:43:24,366 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states. [2019-11-15 21:43:24,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-15 21:43:24,376 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:43:24,377 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] [2019-11-15 21:43:24,379 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:43:24,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:43:24,385 INFO L82 PathProgramCache]: Analyzing trace with hash -1318097310, now seen corresponding path program 1 times [2019-11-15 21:43:24,392 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:43:24,393 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896474619] [2019-11-15 21:43:24,393 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:43:24,393 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:43:24,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:43:24,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:43:24,590 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 21:43:24,591 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896474619] [2019-11-15 21:43:24,592 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:43:24,592 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:43:24,593 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379739924] [2019-11-15 21:43:24,597 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:43:24,597 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:43:24,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:43:24,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:43:24,612 INFO L87 Difference]: Start difference. First operand 245 states. Second operand 4 states. [2019-11-15 21:43:26,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:43:26,578 INFO L93 Difference]: Finished difference Result 866 states and 1574 transitions. [2019-11-15 21:43:26,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:43:26,580 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2019-11-15 21:43:26,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:43:26,604 INFO L225 Difference]: With dead ends: 866 [2019-11-15 21:43:26,605 INFO L226 Difference]: Without dead ends: 538 [2019-11-15 21:43:26,612 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 21:43:26,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2019-11-15 21:43:26,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 360. [2019-11-15 21:43:26,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2019-11-15 21:43:26,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 510 transitions. [2019-11-15 21:43:26,708 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 510 transitions. Word has length 36 [2019-11-15 21:43:26,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:43:26,708 INFO L462 AbstractCegarLoop]: Abstraction has 360 states and 510 transitions. [2019-11-15 21:43:26,708 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:43:26,708 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 510 transitions. [2019-11-15 21:43:26,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-11-15 21:43:26,713 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:43:26,713 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:43:26,715 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:43:26,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:43:26,715 INFO L82 PathProgramCache]: Analyzing trace with hash 598559029, now seen corresponding path program 1 times [2019-11-15 21:43:26,716 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:43:26,716 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235629253] [2019-11-15 21:43:26,716 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:43:26,716 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:43:26,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:43:26,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:43:26,955 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:43:26,956 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235629253] [2019-11-15 21:43:26,956 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:43:26,956 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:43:26,957 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310584183] [2019-11-15 21:43:26,959 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:43:26,959 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:43:26,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:43:26,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:43:26,959 INFO L87 Difference]: Start difference. First operand 360 states and 510 transitions. Second operand 4 states. [2019-11-15 21:43:28,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:43:28,325 INFO L93 Difference]: Finished difference Result 1430 states and 2032 transitions. [2019-11-15 21:43:28,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:43:28,329 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2019-11-15 21:43:28,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:43:28,334 INFO L225 Difference]: With dead ends: 1430 [2019-11-15 21:43:28,334 INFO L226 Difference]: Without dead ends: 716 [2019-11-15 21:43:28,336 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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 21:43:28,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2019-11-15 21:43:28,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 538. [2019-11-15 21:43:28,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 538 states. [2019-11-15 21:43:28,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 787 transitions. [2019-11-15 21:43:28,359 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 787 transitions. Word has length 115 [2019-11-15 21:43:28,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:43:28,360 INFO L462 AbstractCegarLoop]: Abstraction has 538 states and 787 transitions. [2019-11-15 21:43:28,360 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:43:28,360 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 787 transitions. [2019-11-15 21:43:28,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-11-15 21:43:28,366 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:43:28,366 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:43:28,367 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:43:28,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:43:28,367 INFO L82 PathProgramCache]: Analyzing trace with hash -597275881, now seen corresponding path program 1 times [2019-11-15 21:43:28,367 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:43:28,367 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495718995] [2019-11-15 21:43:28,368 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:43:28,368 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:43:28,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:43:28,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:43:28,448 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:43:28,449 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495718995] [2019-11-15 21:43:28,449 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:43:28,449 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:43:28,449 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786144283] [2019-11-15 21:43:28,450 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:43:28,450 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:43:28,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:43:28,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:43:28,451 INFO L87 Difference]: Start difference. First operand 538 states and 787 transitions. Second operand 4 states. [2019-11-15 21:43:29,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:43:29,537 INFO L93 Difference]: Finished difference Result 2142 states and 3140 transitions. [2019-11-15 21:43:29,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:43:29,538 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 127 [2019-11-15 21:43:29,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:43:29,547 INFO L225 Difference]: With dead ends: 2142 [2019-11-15 21:43:29,547 INFO L226 Difference]: Without dead ends: 1606 [2019-11-15 21:43:29,548 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 21:43:29,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1606 states. [2019-11-15 21:43:29,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1606 to 1250. [2019-11-15 21:43:29,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1250 states. [2019-11-15 21:43:29,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1250 states to 1250 states and 1690 transitions. [2019-11-15 21:43:29,583 INFO L78 Accepts]: Start accepts. Automaton has 1250 states and 1690 transitions. Word has length 127 [2019-11-15 21:43:29,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:43:29,583 INFO L462 AbstractCegarLoop]: Abstraction has 1250 states and 1690 transitions. [2019-11-15 21:43:29,584 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:43:29,584 INFO L276 IsEmpty]: Start isEmpty. Operand 1250 states and 1690 transitions. [2019-11-15 21:43:29,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2019-11-15 21:43:29,591 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:43:29,592 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:43:29,592 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:43:29,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:43:29,592 INFO L82 PathProgramCache]: Analyzing trace with hash 1779789830, now seen corresponding path program 1 times [2019-11-15 21:43:29,593 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:43:29,593 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176711273] [2019-11-15 21:43:29,593 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:43:29,593 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:43:29,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:43:29,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:43:29,936 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-11-15 21:43:29,936 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176711273] [2019-11-15 21:43:29,936 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:43:29,936 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:43:29,937 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83878298] [2019-11-15 21:43:29,937 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:43:29,937 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:43:29,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:43:29,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:43:29,938 INFO L87 Difference]: Start difference. First operand 1250 states and 1690 transitions. Second operand 6 states. [2019-11-15 21:43:31,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:43:31,132 INFO L93 Difference]: Finished difference Result 2340 states and 3185 transitions. [2019-11-15 21:43:31,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 21:43:31,132 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 242 [2019-11-15 21:43:31,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:43:31,139 INFO L225 Difference]: With dead ends: 2340 [2019-11-15 21:43:31,140 INFO L226 Difference]: Without dead ends: 1270 [2019-11-15 21:43:31,142 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:43:31,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1270 states. [2019-11-15 21:43:31,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1270 to 1250. [2019-11-15 21:43:31,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1250 states. [2019-11-15 21:43:31,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1250 states to 1250 states and 1661 transitions. [2019-11-15 21:43:31,176 INFO L78 Accepts]: Start accepts. Automaton has 1250 states and 1661 transitions. Word has length 242 [2019-11-15 21:43:31,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:43:31,178 INFO L462 AbstractCegarLoop]: Abstraction has 1250 states and 1661 transitions. [2019-11-15 21:43:31,178 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:43:31,178 INFO L276 IsEmpty]: Start isEmpty. Operand 1250 states and 1661 transitions. [2019-11-15 21:43:31,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2019-11-15 21:43:31,183 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:43:31,184 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:43:31,184 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:43:31,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:43:31,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1462057874, now seen corresponding path program 1 times [2019-11-15 21:43:31,185 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:43:31,185 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795542343] [2019-11-15 21:43:31,186 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:43:31,186 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:43:31,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:43:31,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:43:31,505 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 245 proven. 4 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-11-15 21:43:31,505 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795542343] [2019-11-15 21:43:31,506 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1177028303] [2019-11-15 21:43:31,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_62d470ff-10fb-4b4c-ae29-ec78864f1e76/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 21:43:31,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:43:31,603 INFO L256 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:43:31,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:43:31,790 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 271 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-11-15 21:43:31,791 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 21:43:31,791 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2019-11-15 21:43:31,791 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390424806] [2019-11-15 21:43:31,792 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:43:31,792 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:43:31,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:43:31,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:43:31,793 INFO L87 Difference]: Start difference. First operand 1250 states and 1661 transitions. Second operand 3 states. [2019-11-15 21:43:32,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:43:32,496 INFO L93 Difference]: Finished difference Result 3032 states and 4129 transitions. [2019-11-15 21:43:32,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:43:32,496 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 322 [2019-11-15 21:43:32,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:43:32,507 INFO L225 Difference]: With dead ends: 3032 [2019-11-15 21:43:32,507 INFO L226 Difference]: Without dead ends: 1962 [2019-11-15 21:43:32,509 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 321 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:43:32,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1962 states. [2019-11-15 21:43:32,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1962 to 1250. [2019-11-15 21:43:32,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1250 states. [2019-11-15 21:43:32,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1250 states to 1250 states and 1547 transitions. [2019-11-15 21:43:32,540 INFO L78 Accepts]: Start accepts. Automaton has 1250 states and 1547 transitions. Word has length 322 [2019-11-15 21:43:32,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:43:32,541 INFO L462 AbstractCegarLoop]: Abstraction has 1250 states and 1547 transitions. [2019-11-15 21:43:32,541 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:43:32,541 INFO L276 IsEmpty]: Start isEmpty. Operand 1250 states and 1547 transitions. [2019-11-15 21:43:32,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2019-11-15 21:43:32,547 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:43:32,547 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:43:32,750 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:43:32,751 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:43:32,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:43:32,751 INFO L82 PathProgramCache]: Analyzing trace with hash -1521243895, now seen corresponding path program 1 times [2019-11-15 21:43:32,751 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:43:32,751 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864667731] [2019-11-15 21:43:32,751 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:43:32,752 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:43:32,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:43:32,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:43:33,124 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 245 proven. 4 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2019-11-15 21:43:33,126 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864667731] [2019-11-15 21:43:33,126 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1433111202] [2019-11-15 21:43:33,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_62d470ff-10fb-4b4c-ae29-ec78864f1e76/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 21:43:33,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:43:33,237 INFO L256 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 21:43:33,250 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:43:33,392 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 249 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2019-11-15 21:43:33,393 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 21:43:33,393 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-15 21:43:33,393 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185521233] [2019-11-15 21:43:33,394 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:43:33,394 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:43:33,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:43:33,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:43:33,396 INFO L87 Difference]: Start difference. First operand 1250 states and 1547 transitions. Second operand 4 states. [2019-11-15 21:43:34,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:43:34,124 INFO L93 Difference]: Finished difference Result 2527 states and 3120 transitions. [2019-11-15 21:43:34,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:43:34,125 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 339 [2019-11-15 21:43:34,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:43:34,132 INFO L225 Difference]: With dead ends: 2527 [2019-11-15 21:43:34,132 INFO L226 Difference]: Without dead ends: 1428 [2019-11-15 21:43:34,134 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 338 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:43:34,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states. [2019-11-15 21:43:34,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 1250. [2019-11-15 21:43:34,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1250 states. [2019-11-15 21:43:34,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1250 states to 1250 states and 1394 transitions. [2019-11-15 21:43:34,162 INFO L78 Accepts]: Start accepts. Automaton has 1250 states and 1394 transitions. Word has length 339 [2019-11-15 21:43:34,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:43:34,163 INFO L462 AbstractCegarLoop]: Abstraction has 1250 states and 1394 transitions. [2019-11-15 21:43:34,163 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:43:34,163 INFO L276 IsEmpty]: Start isEmpty. Operand 1250 states and 1394 transitions. [2019-11-15 21:43:34,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2019-11-15 21:43:34,170 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:43:34,170 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:43:34,373 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:43:34,373 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:43:34,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:43:34,373 INFO L82 PathProgramCache]: Analyzing trace with hash 1098217332, now seen corresponding path program 1 times [2019-11-15 21:43:34,374 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:43:34,374 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103040825] [2019-11-15 21:43:34,374 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:43:34,374 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:43:34,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:43:34,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:43:34,979 INFO L134 CoverageAnalysis]: Checked inductivity of 415 backedges. 180 proven. 130 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-11-15 21:43:34,979 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103040825] [2019-11-15 21:43:34,979 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [695901913] [2019-11-15 21:43:34,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_62d470ff-10fb-4b4c-ae29-ec78864f1e76/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 21:43:35,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:43:35,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:43:35,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:43:35,234 INFO L134 CoverageAnalysis]: Checked inductivity of 415 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2019-11-15 21:43:35,234 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 21:43:35,235 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2019-11-15 21:43:35,235 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370907514] [2019-11-15 21:43:35,237 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:43:35,237 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:43:35,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:43:35,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:43:35,238 INFO L87 Difference]: Start difference. First operand 1250 states and 1394 transitions. Second operand 3 states. [2019-11-15 21:43:35,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:43:35,728 INFO L93 Difference]: Finished difference Result 3032 states and 3452 transitions. [2019-11-15 21:43:35,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:43:35,729 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 362 [2019-11-15 21:43:35,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:43:35,738 INFO L225 Difference]: With dead ends: 3032 [2019-11-15 21:43:35,738 INFO L226 Difference]: Without dead ends: 1962 [2019-11-15 21:43:35,740 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 362 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:43:35,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1962 states. [2019-11-15 21:43:35,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1962 to 1962. [2019-11-15 21:43:35,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1962 states. [2019-11-15 21:43:35,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1962 states to 1962 states and 2173 transitions. [2019-11-15 21:43:35,780 INFO L78 Accepts]: Start accepts. Automaton has 1962 states and 2173 transitions. Word has length 362 [2019-11-15 21:43:35,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:43:35,780 INFO L462 AbstractCegarLoop]: Abstraction has 1962 states and 2173 transitions. [2019-11-15 21:43:35,781 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:43:35,781 INFO L276 IsEmpty]: Start isEmpty. Operand 1962 states and 2173 transitions. [2019-11-15 21:43:35,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2019-11-15 21:43:35,787 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:43:35,788 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-15 21:43:35,991 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:43:35,992 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:43:35,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:43:35,992 INFO L82 PathProgramCache]: Analyzing trace with hash -600587830, now seen corresponding path program 1 times [2019-11-15 21:43:35,992 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:43:35,993 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189171499] [2019-11-15 21:43:35,994 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:43:35,994 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:43:35,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:43:36,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:43:36,542 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 342 proven. 43 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-11-15 21:43:36,542 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189171499] [2019-11-15 21:43:36,542 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1426673540] [2019-11-15 21:43:36,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_62d470ff-10fb-4b4c-ae29-ec78864f1e76/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 21:43:36,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:43:36,633 INFO L256 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-15 21:43:36,638 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:43:36,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:43:36,970 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 381 proven. 4 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-11-15 21:43:36,971 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:43:36,971 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 7 [2019-11-15 21:43:36,971 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685238549] [2019-11-15 21:43:36,972 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 21:43:36,972 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:43:36,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 21:43:36,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:43:36,978 INFO L87 Difference]: Start difference. First operand 1962 states and 2173 transitions. Second operand 8 states. [2019-11-15 21:43:38,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:43:38,695 INFO L93 Difference]: Finished difference Result 3946 states and 4377 transitions. [2019-11-15 21:43:38,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 21:43:38,697 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 365 [2019-11-15 21:43:38,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:43:38,707 INFO L225 Difference]: With dead ends: 3946 [2019-11-15 21:43:38,707 INFO L226 Difference]: Without dead ends: 2164 [2019-11-15 21:43:38,709 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 363 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-11-15 21:43:38,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2164 states. [2019-11-15 21:43:38,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2164 to 1962. [2019-11-15 21:43:38,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1962 states. [2019-11-15 21:43:38,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1962 states to 1962 states and 2149 transitions. [2019-11-15 21:43:38,752 INFO L78 Accepts]: Start accepts. Automaton has 1962 states and 2149 transitions. Word has length 365 [2019-11-15 21:43:38,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:43:38,752 INFO L462 AbstractCegarLoop]: Abstraction has 1962 states and 2149 transitions. [2019-11-15 21:43:38,752 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 21:43:38,753 INFO L276 IsEmpty]: Start isEmpty. Operand 1962 states and 2149 transitions. [2019-11-15 21:43:38,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 538 [2019-11-15 21:43:38,758 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:43:38,759 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:43:38,964 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:43:38,964 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:43:38,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:43:38,965 INFO L82 PathProgramCache]: Analyzing trace with hash -842004897, now seen corresponding path program 1 times [2019-11-15 21:43:38,965 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:43:38,966 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399105333] [2019-11-15 21:43:38,966 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:43:38,966 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:43:38,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:43:39,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:43:40,082 INFO L134 CoverageAnalysis]: Checked inductivity of 774 backedges. 636 proven. 0 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2019-11-15 21:43:40,083 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399105333] [2019-11-15 21:43:40,083 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:43:40,083 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 21:43:40,083 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911439491] [2019-11-15 21:43:40,084 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 21:43:40,084 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:43:40,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 21:43:40,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:43:40,086 INFO L87 Difference]: Start difference. First operand 1962 states and 2149 transitions. Second operand 8 states. [2019-11-15 21:43:41,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:43:41,314 INFO L93 Difference]: Finished difference Result 3756 states and 4129 transitions. [2019-11-15 21:43:41,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 21:43:41,315 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 537 [2019-11-15 21:43:41,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:43:41,324 INFO L225 Difference]: With dead ends: 3756 [2019-11-15 21:43:41,324 INFO L226 Difference]: Without dead ends: 1974 [2019-11-15 21:43:41,327 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=40, Unknown=0, NotChecked=0, Total=72 [2019-11-15 21:43:41,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1974 states. [2019-11-15 21:43:41,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1974 to 1962. [2019-11-15 21:43:41,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1962 states. [2019-11-15 21:43:41,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1962 states to 1962 states and 2135 transitions. [2019-11-15 21:43:41,364 INFO L78 Accepts]: Start accepts. Automaton has 1962 states and 2135 transitions. Word has length 537 [2019-11-15 21:43:41,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:43:41,365 INFO L462 AbstractCegarLoop]: Abstraction has 1962 states and 2135 transitions. [2019-11-15 21:43:41,365 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 21:43:41,366 INFO L276 IsEmpty]: Start isEmpty. Operand 1962 states and 2135 transitions. [2019-11-15 21:43:41,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 651 [2019-11-15 21:43:41,372 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:43:41,373 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:43:41,373 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:43:41,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:43:41,374 INFO L82 PathProgramCache]: Analyzing trace with hash -963993425, now seen corresponding path program 1 times [2019-11-15 21:43:41,374 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:43:41,374 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540013478] [2019-11-15 21:43:41,374 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:43:41,375 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:43:41,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:43:41,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:43:41,964 INFO L134 CoverageAnalysis]: Checked inductivity of 1244 backedges. 896 proven. 0 refuted. 0 times theorem prover too weak. 348 trivial. 0 not checked. [2019-11-15 21:43:41,965 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540013478] [2019-11-15 21:43:41,965 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:43:41,965 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:43:41,965 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134347630] [2019-11-15 21:43:41,966 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:43:41,966 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:43:41,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:43:41,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:43:41,967 INFO L87 Difference]: Start difference. First operand 1962 states and 2135 transitions. Second operand 3 states. [2019-11-15 21:43:42,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:43:42,547 INFO L93 Difference]: Finished difference Result 4456 states and 4878 transitions. [2019-11-15 21:43:42,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:43:42,548 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 650 [2019-11-15 21:43:42,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:43:42,562 INFO L225 Difference]: With dead ends: 4456 [2019-11-15 21:43:42,562 INFO L226 Difference]: Without dead ends: 2674 [2019-11-15 21:43:42,565 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:43:42,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2674 states. [2019-11-15 21:43:42,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2674 to 2318. [2019-11-15 21:43:42,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2318 states. [2019-11-15 21:43:42,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2318 states to 2318 states and 2536 transitions. [2019-11-15 21:43:42,607 INFO L78 Accepts]: Start accepts. Automaton has 2318 states and 2536 transitions. Word has length 650 [2019-11-15 21:43:42,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:43:42,608 INFO L462 AbstractCegarLoop]: Abstraction has 2318 states and 2536 transitions. [2019-11-15 21:43:42,608 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:43:42,608 INFO L276 IsEmpty]: Start isEmpty. Operand 2318 states and 2536 transitions. [2019-11-15 21:43:42,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 653 [2019-11-15 21:43:42,614 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:43:42,615 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:43:42,615 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:43:42,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:43:42,616 INFO L82 PathProgramCache]: Analyzing trace with hash 2048365184, now seen corresponding path program 1 times [2019-11-15 21:43:42,616 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:43:42,616 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548907529] [2019-11-15 21:43:42,616 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:43:42,617 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:43:42,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:43:42,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:43:43,170 INFO L134 CoverageAnalysis]: Checked inductivity of 1610 backedges. 1120 proven. 0 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2019-11-15 21:43:43,171 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548907529] [2019-11-15 21:43:43,171 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:43:43,171 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:43:43,171 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674145051] [2019-11-15 21:43:43,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:43:43,172 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:43:43,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:43:43,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:43:43,173 INFO L87 Difference]: Start difference. First operand 2318 states and 2536 transitions. Second operand 3 states. [2019-11-15 21:43:43,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:43:43,709 INFO L93 Difference]: Finished difference Result 4634 states and 5074 transitions. [2019-11-15 21:43:43,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:43:43,709 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 652 [2019-11-15 21:43:43,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:43:43,720 INFO L225 Difference]: With dead ends: 4634 [2019-11-15 21:43:43,720 INFO L226 Difference]: Without dead ends: 2318 [2019-11-15 21:43:43,723 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:43:43,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2318 states. [2019-11-15 21:43:43,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2318 to 2318. [2019-11-15 21:43:43,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2318 states. [2019-11-15 21:43:43,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2318 states to 2318 states and 2494 transitions. [2019-11-15 21:43:43,763 INFO L78 Accepts]: Start accepts. Automaton has 2318 states and 2494 transitions. Word has length 652 [2019-11-15 21:43:43,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:43:43,764 INFO L462 AbstractCegarLoop]: Abstraction has 2318 states and 2494 transitions. [2019-11-15 21:43:43,764 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:43:43,764 INFO L276 IsEmpty]: Start isEmpty. Operand 2318 states and 2494 transitions. [2019-11-15 21:43:43,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 696 [2019-11-15 21:43:43,771 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:43:43,772 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:43:43,772 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:43:43,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:43:43,772 INFO L82 PathProgramCache]: Analyzing trace with hash 689865864, now seen corresponding path program 1 times [2019-11-15 21:43:43,773 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:43:43,773 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036400575] [2019-11-15 21:43:43,773 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:43:43,773 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:43:43,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:43:43,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:43:45,045 INFO L134 CoverageAnalysis]: Checked inductivity of 1291 backedges. 769 proven. 174 refuted. 0 times theorem prover too weak. 348 trivial. 0 not checked. [2019-11-15 21:43:45,045 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036400575] [2019-11-15 21:43:45,045 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1972476003] [2019-11-15 21:43:45,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_62d470ff-10fb-4b4c-ae29-ec78864f1e76/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 21:43:45,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:43:45,184 INFO L256 TraceCheckSpWp]: Trace formula consists of 847 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-15 21:43:45,204 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:43:46,005 INFO L134 CoverageAnalysis]: Checked inductivity of 1291 backedges. 914 proven. 29 refuted. 0 times theorem prover too weak. 348 trivial. 0 not checked. [2019-11-15 21:43:46,005 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:43:46,005 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 7 [2019-11-15 21:43:46,006 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416948776] [2019-11-15 21:43:46,007 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 21:43:46,007 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:43:46,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 21:43:46,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:43:46,008 INFO L87 Difference]: Start difference. First operand 2318 states and 2494 transitions. Second operand 8 states. [2019-11-15 21:43:47,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:43:47,317 INFO L93 Difference]: Finished difference Result 4853 states and 5228 transitions. [2019-11-15 21:43:47,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 21:43:47,317 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 695 [2019-11-15 21:43:47,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:43:47,330 INFO L225 Difference]: With dead ends: 4853 [2019-11-15 21:43:47,330 INFO L226 Difference]: Without dead ends: 2715 [2019-11-15 21:43:47,332 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 703 GetRequests, 692 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-11-15 21:43:47,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2715 states. [2019-11-15 21:43:47,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2715 to 2674. [2019-11-15 21:43:47,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2674 states. [2019-11-15 21:43:47,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2674 states to 2674 states and 2859 transitions. [2019-11-15 21:43:47,399 INFO L78 Accepts]: Start accepts. Automaton has 2674 states and 2859 transitions. Word has length 695 [2019-11-15 21:43:47,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:43:47,400 INFO L462 AbstractCegarLoop]: Abstraction has 2674 states and 2859 transitions. [2019-11-15 21:43:47,400 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 21:43:47,400 INFO L276 IsEmpty]: Start isEmpty. Operand 2674 states and 2859 transitions. [2019-11-15 21:43:47,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 698 [2019-11-15 21:43:47,407 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:43:47,408 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:43:47,611 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:43:47,611 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:43:47,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:43:47,612 INFO L82 PathProgramCache]: Analyzing trace with hash -2025724903, now seen corresponding path program 1 times [2019-11-15 21:43:47,612 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:43:47,612 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762660535] [2019-11-15 21:43:47,612 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:43:47,613 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:43:47,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:43:47,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:43:48,583 INFO L134 CoverageAnalysis]: Checked inductivity of 1612 backedges. 1000 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-11-15 21:43:48,583 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762660535] [2019-11-15 21:43:48,583 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:43:48,584 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 21:43:48,584 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370995596] [2019-11-15 21:43:48,585 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 21:43:48,585 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:43:48,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 21:43:48,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:43:48,586 INFO L87 Difference]: Start difference. First operand 2674 states and 2859 transitions. Second operand 7 states. [2019-11-15 21:43:49,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:43:49,528 INFO L93 Difference]: Finished difference Result 5396 states and 5769 transitions. [2019-11-15 21:43:49,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 21:43:49,529 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 697 [2019-11-15 21:43:49,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:43:49,542 INFO L225 Difference]: With dead ends: 5396 [2019-11-15 21:43:49,542 INFO L226 Difference]: Without dead ends: 2852 [2019-11-15 21:43:49,545 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 21:43:49,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2852 states. [2019-11-15 21:43:49,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2852 to 2674. [2019-11-15 21:43:49,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2674 states. [2019-11-15 21:43:49,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2674 states to 2674 states and 2823 transitions. [2019-11-15 21:43:49,597 INFO L78 Accepts]: Start accepts. Automaton has 2674 states and 2823 transitions. Word has length 697 [2019-11-15 21:43:49,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:43:49,597 INFO L462 AbstractCegarLoop]: Abstraction has 2674 states and 2823 transitions. [2019-11-15 21:43:49,598 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 21:43:49,598 INFO L276 IsEmpty]: Start isEmpty. Operand 2674 states and 2823 transitions. [2019-11-15 21:43:49,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 723 [2019-11-15 21:43:49,605 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:43:49,606 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:43:49,607 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:43:49,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:43:49,607 INFO L82 PathProgramCache]: Analyzing trace with hash 750664143, now seen corresponding path program 1 times [2019-11-15 21:43:49,608 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:43:49,608 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363566312] [2019-11-15 21:43:49,608 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:43:49,608 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:43:49,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:43:49,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:43:50,008 INFO L134 CoverageAnalysis]: Checked inductivity of 1637 backedges. 1140 proven. 0 refuted. 0 times theorem prover too weak. 497 trivial. 0 not checked. [2019-11-15 21:43:50,008 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363566312] [2019-11-15 21:43:50,009 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:43:50,009 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:43:50,009 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125900877] [2019-11-15 21:43:50,010 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:43:50,010 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:43:50,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:43:50,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:43:50,011 INFO L87 Difference]: Start difference. First operand 2674 states and 2823 transitions. Second operand 3 states. [2019-11-15 21:43:50,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:43:50,446 INFO L93 Difference]: Finished difference Result 5702 states and 6027 transitions. [2019-11-15 21:43:50,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:43:50,446 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 722 [2019-11-15 21:43:50,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:43:50,460 INFO L225 Difference]: With dead ends: 5702 [2019-11-15 21:43:50,460 INFO L226 Difference]: Without dead ends: 3208 [2019-11-15 21:43:50,463 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 21:43:50,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3208 states. [2019-11-15 21:43:50,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3208 to 3030. [2019-11-15 21:43:50,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3030 states. [2019-11-15 21:43:50,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3030 states to 3030 states and 3188 transitions. [2019-11-15 21:43:50,504 INFO L78 Accepts]: Start accepts. Automaton has 3030 states and 3188 transitions. Word has length 722 [2019-11-15 21:43:50,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:43:50,505 INFO L462 AbstractCegarLoop]: Abstraction has 3030 states and 3188 transitions. [2019-11-15 21:43:50,505 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:43:50,505 INFO L276 IsEmpty]: Start isEmpty. Operand 3030 states and 3188 transitions. [2019-11-15 21:43:50,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 878 [2019-11-15 21:43:50,514 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:43:50,515 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, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-15 21:43:50,515 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:43:50,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:43:50,516 INFO L82 PathProgramCache]: Analyzing trace with hash -1954280938, now seen corresponding path program 1 times [2019-11-15 21:43:50,516 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:43:50,516 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638884488] [2019-11-15 21:43:50,516 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:43:50,516 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:43:50,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:43:50,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:43:51,197 INFO L134 CoverageAnalysis]: Checked inductivity of 2336 backedges. 1516 proven. 0 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2019-11-15 21:43:51,198 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638884488] [2019-11-15 21:43:51,198 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:43:51,198 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:43:51,198 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863054754] [2019-11-15 21:43:51,199 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:43:51,199 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:43:51,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:43:51,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:43:51,200 INFO L87 Difference]: Start difference. First operand 3030 states and 3188 transitions. Second operand 4 states. [2019-11-15 21:43:52,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:43:52,114 INFO L93 Difference]: Finished difference Result 6948 states and 7354 transitions. [2019-11-15 21:43:52,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:43:52,115 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 877 [2019-11-15 21:43:52,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:43:52,129 INFO L225 Difference]: With dead ends: 6948 [2019-11-15 21:43:52,129 INFO L226 Difference]: Without dead ends: 3920 [2019-11-15 21:43:52,132 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 21:43:52,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3920 states. [2019-11-15 21:43:52,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3920 to 3742. [2019-11-15 21:43:52,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3742 states. [2019-11-15 21:43:52,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3742 states to 3742 states and 3909 transitions. [2019-11-15 21:43:52,185 INFO L78 Accepts]: Start accepts. Automaton has 3742 states and 3909 transitions. Word has length 877 [2019-11-15 21:43:52,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:43:52,185 INFO L462 AbstractCegarLoop]: Abstraction has 3742 states and 3909 transitions. [2019-11-15 21:43:52,185 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:43:52,186 INFO L276 IsEmpty]: Start isEmpty. Operand 3742 states and 3909 transitions. [2019-11-15 21:43:52,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 971 [2019-11-15 21:43:52,197 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:43:52,198 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, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:43:52,198 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:43:52,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:43:52,199 INFO L82 PathProgramCache]: Analyzing trace with hash 625456656, now seen corresponding path program 1 times [2019-11-15 21:43:52,199 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:43:52,199 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143141714] [2019-11-15 21:43:52,199 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:43:52,200 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:43:52,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:43:52,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:43:54,140 INFO L134 CoverageAnalysis]: Checked inductivity of 2909 backedges. 1978 proven. 0 refuted. 0 times theorem prover too weak. 931 trivial. 0 not checked. [2019-11-15 21:43:54,140 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143141714] [2019-11-15 21:43:54,140 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:43:54,141 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 21:43:54,141 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209464831] [2019-11-15 21:43:54,141 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 21:43:54,141 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:43:54,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 21:43:54,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:43:54,142 INFO L87 Difference]: Start difference. First operand 3742 states and 3909 transitions. Second operand 7 states. [2019-11-15 21:43:55,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:43:55,177 INFO L93 Difference]: Finished difference Result 7307 states and 7640 transitions. [2019-11-15 21:43:55,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 21:43:55,177 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 970 [2019-11-15 21:43:55,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:43:55,183 INFO L225 Difference]: With dead ends: 7307 [2019-11-15 21:43:55,184 INFO L226 Difference]: Without dead ends: 3745 [2019-11-15 21:43:55,186 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:43:55,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3745 states. [2019-11-15 21:43:55,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3745 to 3742. [2019-11-15 21:43:55,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3742 states. [2019-11-15 21:43:55,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3742 states to 3742 states and 3907 transitions. [2019-11-15 21:43:55,228 INFO L78 Accepts]: Start accepts. Automaton has 3742 states and 3907 transitions. Word has length 970 [2019-11-15 21:43:55,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:43:55,229 INFO L462 AbstractCegarLoop]: Abstraction has 3742 states and 3907 transitions. [2019-11-15 21:43:55,229 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 21:43:55,229 INFO L276 IsEmpty]: Start isEmpty. Operand 3742 states and 3907 transitions. [2019-11-15 21:43:55,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1048 [2019-11-15 21:43:55,240 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:43:55,241 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 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, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-15 21:43:55,241 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:43:55,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:43:55,242 INFO L82 PathProgramCache]: Analyzing trace with hash -1401544166, now seen corresponding path program 1 times [2019-11-15 21:43:55,242 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:43:55,242 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979204945] [2019-11-15 21:43:55,243 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:43:55,243 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:43:55,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:43:55,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:43:56,327 INFO L134 CoverageAnalysis]: Checked inductivity of 3551 backedges. 1082 proven. 0 refuted. 0 times theorem prover too weak. 2469 trivial. 0 not checked. [2019-11-15 21:43:56,327 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979204945] [2019-11-15 21:43:56,327 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:43:56,327 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:43:56,327 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221117586] [2019-11-15 21:43:56,328 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:43:56,328 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:43:56,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:43:56,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:43:56,329 INFO L87 Difference]: Start difference. First operand 3742 states and 3907 transitions. Second operand 4 states. [2019-11-15 21:43:57,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:43:57,031 INFO L93 Difference]: Finished difference Result 7838 states and 8187 transitions. [2019-11-15 21:43:57,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:43:57,032 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1047 [2019-11-15 21:43:57,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:43:57,039 INFO L225 Difference]: With dead ends: 7838 [2019-11-15 21:43:57,039 INFO L226 Difference]: Without dead ends: 3920 [2019-11-15 21:43:57,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 21:43:57,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3920 states. [2019-11-15 21:43:57,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3920 to 3564. [2019-11-15 21:43:57,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3564 states. [2019-11-15 21:43:57,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3564 states to 3564 states and 3651 transitions. [2019-11-15 21:43:57,099 INFO L78 Accepts]: Start accepts. Automaton has 3564 states and 3651 transitions. Word has length 1047 [2019-11-15 21:43:57,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:43:57,100 INFO L462 AbstractCegarLoop]: Abstraction has 3564 states and 3651 transitions. [2019-11-15 21:43:57,100 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:43:57,100 INFO L276 IsEmpty]: Start isEmpty. Operand 3564 states and 3651 transitions. [2019-11-15 21:43:57,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1096 [2019-11-15 21:43:57,118 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:43:57,119 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 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, 7, 7, 7, 7, 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, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:43:57,119 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:43:57,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:43:57,120 INFO L82 PathProgramCache]: Analyzing trace with hash -1689291374, now seen corresponding path program 1 times [2019-11-15 21:43:57,120 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:43:57,120 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299911754] [2019-11-15 21:43:57,121 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:43:57,121 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:43:57,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:43:57,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:43:58,192 INFO L134 CoverageAnalysis]: Checked inductivity of 3788 backedges. 1122 proven. 0 refuted. 0 times theorem prover too weak. 2666 trivial. 0 not checked. [2019-11-15 21:43:58,192 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299911754] [2019-11-15 21:43:58,193 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:43:58,193 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:43:58,193 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795369926] [2019-11-15 21:43:58,194 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:43:58,194 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:43:58,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:43:58,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:43:58,194 INFO L87 Difference]: Start difference. First operand 3564 states and 3651 transitions. Second operand 5 states. [2019-11-15 21:43:58,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:43:58,985 INFO L93 Difference]: Finished difference Result 7480 states and 7680 transitions. [2019-11-15 21:43:58,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 21:43:58,986 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1095 [2019-11-15 21:43:58,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:43:58,986 INFO L225 Difference]: With dead ends: 7480 [2019-11-15 21:43:58,986 INFO L226 Difference]: Without dead ends: 0 [2019-11-15 21:43:58,990 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 21:43:58,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-15 21:43:58,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-15 21:43:58,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-15 21:43:58,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 21:43:58,991 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1095 [2019-11-15 21:43:58,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:43:58,992 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 21:43:58,992 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:43:58,992 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-15 21:43:58,992 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-15 21:43:58,995 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-15 21:43:59,208 WARN L191 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 213 DAG size of output: 122 [2019-11-15 21:43:59,419 WARN L191 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 210 DAG size of output: 124 [2019-11-15 21:44:00,044 WARN L191 SmtUtils]: Spent 619.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 52 [2019-11-15 21:44:00,471 WARN L191 SmtUtils]: Spent 425.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 56 [2019-11-15 21:44:00,473 INFO L443 ceAbstractionStarter]: For program point L432(lines 432 870) no Hoare annotation was computed. [2019-11-15 21:44:00,473 INFO L443 ceAbstractionStarter]: For program point L366(lines 366 870) no Hoare annotation was computed. [2019-11-15 21:44:00,473 INFO L443 ceAbstractionStarter]: For program point L168-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:44:00,473 INFO L443 ceAbstractionStarter]: For program point L102-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:44:00,473 INFO L443 ceAbstractionStarter]: For program point L36-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:44:00,473 INFO L443 ceAbstractionStarter]: For program point L235(lines 235 870) no Hoare annotation was computed. [2019-11-15 21:44:00,473 INFO L443 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2019-11-15 21:44:00,473 INFO L443 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2019-11-15 21:44:00,473 INFO L443 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-11-15 21:44:00,473 INFO L443 ceAbstractionStarter]: For program point L764(lines 764 870) no Hoare annotation was computed. [2019-11-15 21:44:00,473 INFO L443 ceAbstractionStarter]: For program point L632(lines 632 870) no Hoare annotation was computed. [2019-11-15 21:44:00,473 INFO L443 ceAbstractionStarter]: For program point L500(lines 500 870) no Hoare annotation was computed. [2019-11-15 21:44:00,473 INFO L443 ceAbstractionStarter]: For program point L831(lines 831 870) no Hoare annotation was computed. [2019-11-15 21:44:00,473 INFO L443 ceAbstractionStarter]: For program point L171-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:44:00,474 INFO L443 ceAbstractionStarter]: For program point L105-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:44:00,474 INFO L443 ceAbstractionStarter]: For program point L39-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:44:00,474 INFO L443 ceAbstractionStarter]: For program point L700(lines 700 870) no Hoare annotation was computed. [2019-11-15 21:44:00,474 INFO L443 ceAbstractionStarter]: For program point L568(lines 568 870) no Hoare annotation was computed. [2019-11-15 21:44:00,474 INFO L443 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-11-15 21:44:00,474 INFO L443 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2019-11-15 21:44:00,474 INFO L443 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-11-15 21:44:00,474 INFO L443 ceAbstractionStarter]: For program point L305(lines 305 870) no Hoare annotation was computed. [2019-11-15 21:44:00,474 INFO L443 ceAbstractionStarter]: For program point L438(lines 438 870) no Hoare annotation was computed. [2019-11-15 21:44:00,474 INFO L443 ceAbstractionStarter]: For program point L372(lines 372 870) no Hoare annotation was computed. [2019-11-15 21:44:00,474 INFO L443 ceAbstractionStarter]: For program point L174-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:44:00,474 INFO L443 ceAbstractionStarter]: For program point L108-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:44:00,474 INFO L443 ceAbstractionStarter]: For program point L42-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:44:00,474 INFO L443 ceAbstractionStarter]: For program point L241(lines 241 870) no Hoare annotation was computed. [2019-11-15 21:44:00,475 INFO L443 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-11-15 21:44:00,475 INFO L443 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-11-15 21:44:00,475 INFO L443 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2019-11-15 21:44:00,475 INFO L443 ceAbstractionStarter]: For program point L638(lines 638 870) no Hoare annotation was computed. [2019-11-15 21:44:00,475 INFO L443 ceAbstractionStarter]: For program point L506(lines 506 870) no Hoare annotation was computed. [2019-11-15 21:44:00,475 INFO L443 ceAbstractionStarter]: For program point L837(lines 837 870) no Hoare annotation was computed. [2019-11-15 21:44:00,475 INFO L443 ceAbstractionStarter]: For program point L771(lines 771 870) no Hoare annotation was computed. [2019-11-15 21:44:00,475 INFO L443 ceAbstractionStarter]: For program point L573(lines 573 870) no Hoare annotation was computed. [2019-11-15 21:44:00,475 INFO L443 ceAbstractionStarter]: For program point L177-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:44:00,475 INFO L443 ceAbstractionStarter]: For program point L111-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:44:00,475 INFO L443 ceAbstractionStarter]: For program point L45-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:44:00,475 INFO L443 ceAbstractionStarter]: For program point L706(lines 706 870) no Hoare annotation was computed. [2019-11-15 21:44:00,475 INFO L443 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2019-11-15 21:44:00,476 INFO L443 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-11-15 21:44:00,476 INFO L443 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-11-15 21:44:00,476 INFO L443 ceAbstractionStarter]: For program point L311(lines 311 870) no Hoare annotation was computed. [2019-11-15 21:44:00,476 INFO L443 ceAbstractionStarter]: For program point L444(lines 444 870) no Hoare annotation was computed. [2019-11-15 21:44:00,476 INFO L443 ceAbstractionStarter]: For program point L378(lines 378 870) no Hoare annotation was computed. [2019-11-15 21:44:00,476 INFO L443 ceAbstractionStarter]: For program point L180-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:44:00,476 INFO L443 ceAbstractionStarter]: For program point L114-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:44:00,476 INFO L443 ceAbstractionStarter]: For program point L48-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:44:00,476 INFO L443 ceAbstractionStarter]: For program point L247(lines 247 870) no Hoare annotation was computed. [2019-11-15 21:44:00,476 INFO L443 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-11-15 21:44:00,476 INFO L443 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2019-11-15 21:44:00,476 INFO L443 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2019-11-15 21:44:00,477 INFO L443 ceAbstractionStarter]: For program point L842(lines 842 870) no Hoare annotation was computed. [2019-11-15 21:44:00,477 INFO L443 ceAbstractionStarter]: For program point L644(lines 644 870) no Hoare annotation was computed. [2019-11-15 21:44:00,477 INFO L443 ceAbstractionStarter]: For program point L512(lines 512 870) no Hoare annotation was computed. [2019-11-15 21:44:00,477 INFO L443 ceAbstractionStarter]: For program point L777(lines 777 870) no Hoare annotation was computed. [2019-11-15 21:44:00,477 INFO L443 ceAbstractionStarter]: For program point L579(lines 579 870) no Hoare annotation was computed. [2019-11-15 21:44:00,477 INFO L443 ceAbstractionStarter]: For program point L183-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:44:00,477 INFO L443 ceAbstractionStarter]: For program point L117-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:44:00,477 INFO L443 ceAbstractionStarter]: For program point L51-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:44:00,477 INFO L443 ceAbstractionStarter]: For program point L712(lines 712 870) no Hoare annotation was computed. [2019-11-15 21:44:00,477 INFO L443 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-11-15 21:44:00,477 INFO L443 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2019-11-15 21:44:00,477 INFO L443 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2019-11-15 21:44:00,477 INFO L443 ceAbstractionStarter]: For program point L449(lines 449 870) no Hoare annotation was computed. [2019-11-15 21:44:00,477 INFO L443 ceAbstractionStarter]: For program point L317(lines 317 870) no Hoare annotation was computed. [2019-11-15 21:44:00,478 INFO L443 ceAbstractionStarter]: For program point L384(lines 384 870) no Hoare annotation was computed. [2019-11-15 21:44:00,478 INFO L443 ceAbstractionStarter]: For program point L252(lines 252 870) no Hoare annotation was computed. [2019-11-15 21:44:00,478 INFO L443 ceAbstractionStarter]: For program point L186-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:44:00,478 INFO L443 ceAbstractionStarter]: For program point L120-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:44:00,478 INFO L443 ceAbstractionStarter]: For program point L54-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:44:00,478 INFO L443 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2019-11-15 21:44:00,478 INFO L443 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-11-15 21:44:00,478 INFO L443 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2019-11-15 21:44:00,478 INFO L443 ceAbstractionStarter]: For program point L848(lines 848 870) no Hoare annotation was computed. [2019-11-15 21:44:00,478 INFO L443 ceAbstractionStarter]: For program point L650(lines 650 870) no Hoare annotation was computed. [2019-11-15 21:44:00,478 INFO L443 ceAbstractionStarter]: For program point L518(lines 518 870) no Hoare annotation was computed. [2019-11-15 21:44:00,478 INFO L443 ceAbstractionStarter]: For program point L783(lines 783 870) no Hoare annotation was computed. [2019-11-15 21:44:00,479 INFO L443 ceAbstractionStarter]: For program point L585(lines 585 870) no Hoare annotation was computed. [2019-11-15 21:44:00,479 INFO L443 ceAbstractionStarter]: For program point L189-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:44:00,479 INFO L443 ceAbstractionStarter]: For program point L123-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:44:00,479 INFO L443 ceAbstractionStarter]: For program point L57-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:44:00,479 INFO L443 ceAbstractionStarter]: For program point L718(lines 718 870) no Hoare annotation was computed. [2019-11-15 21:44:00,479 INFO L443 ceAbstractionStarter]: For program point L454(lines 454 870) no Hoare annotation was computed. [2019-11-15 21:44:00,479 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-15 21:44:00,480 INFO L443 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-11-15 21:44:00,480 INFO L443 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2019-11-15 21:44:00,480 INFO L443 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2019-11-15 21:44:00,480 INFO L443 ceAbstractionStarter]: For program point L323(lines 323 870) no Hoare annotation was computed. [2019-11-15 21:44:00,480 INFO L443 ceAbstractionStarter]: For program point L390(lines 390 870) no Hoare annotation was computed. [2019-11-15 21:44:00,480 INFO L443 ceAbstractionStarter]: For program point L258(lines 258 870) no Hoare annotation was computed. [2019-11-15 21:44:00,480 INFO L443 ceAbstractionStarter]: For program point L192-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:44:00,480 INFO L443 ceAbstractionStarter]: For program point L126-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:44:00,481 INFO L443 ceAbstractionStarter]: For program point L60-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:44:00,481 INFO L443 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2019-11-15 21:44:00,481 INFO L443 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2019-11-15 21:44:00,481 INFO L443 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2019-11-15 21:44:00,481 INFO L443 ceAbstractionStarter]: For program point L854(lines 854 870) no Hoare annotation was computed. [2019-11-15 21:44:00,481 INFO L443 ceAbstractionStarter]: For program point L656(lines 656 870) no Hoare annotation was computed. [2019-11-15 21:44:00,481 INFO L443 ceAbstractionStarter]: For program point L524(lines 524 870) no Hoare annotation was computed. [2019-11-15 21:44:00,482 INFO L443 ceAbstractionStarter]: For program point L789(lines 789 870) no Hoare annotation was computed. [2019-11-15 21:44:00,482 INFO L443 ceAbstractionStarter]: For program point L591(lines 591 870) no Hoare annotation was computed. [2019-11-15 21:44:00,482 INFO L443 ceAbstractionStarter]: For program point L195-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:44:00,482 INFO L443 ceAbstractionStarter]: For program point L129-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:44:00,482 INFO L443 ceAbstractionStarter]: For program point L63-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:44:00,482 INFO L443 ceAbstractionStarter]: For program point L724(lines 724 870) no Hoare annotation was computed. [2019-11-15 21:44:00,482 INFO L443 ceAbstractionStarter]: For program point L460(lines 460 870) no Hoare annotation was computed. [2019-11-15 21:44:00,482 INFO L443 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2019-11-15 21:44:00,483 INFO L443 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-11-15 21:44:00,483 INFO L443 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2019-11-15 21:44:00,483 INFO L443 ceAbstractionStarter]: For program point L329(lines 329 870) no Hoare annotation was computed. [2019-11-15 21:44:00,483 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-15 21:44:00,483 INFO L443 ceAbstractionStarter]: For program point L396(lines 396 870) no Hoare annotation was computed. [2019-11-15 21:44:00,483 INFO L443 ceAbstractionStarter]: For program point L264(lines 264 870) no Hoare annotation was computed. [2019-11-15 21:44:00,483 INFO L443 ceAbstractionStarter]: For program point L198-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:44:00,483 INFO L443 ceAbstractionStarter]: For program point L132-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:44:00,484 INFO L443 ceAbstractionStarter]: For program point L66-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:44:00,484 INFO L443 ceAbstractionStarter]: For program point L859(lines 859 870) no Hoare annotation was computed. [2019-11-15 21:44:00,484 INFO L443 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2019-11-15 21:44:00,484 INFO L443 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2019-11-15 21:44:00,484 INFO L443 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2019-11-15 21:44:00,484 INFO L443 ceAbstractionStarter]: For program point L662(lines 662 870) no Hoare annotation was computed. [2019-11-15 21:44:00,484 INFO L443 ceAbstractionStarter]: For program point L530(lines 530 870) no Hoare annotation was computed. [2019-11-15 21:44:00,484 INFO L443 ceAbstractionStarter]: For program point L795(lines 795 870) no Hoare annotation was computed. [2019-11-15 21:44:00,484 INFO L443 ceAbstractionStarter]: For program point L597(lines 597 870) no Hoare annotation was computed. [2019-11-15 21:44:00,484 INFO L443 ceAbstractionStarter]: For program point L201-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:44:00,484 INFO L443 ceAbstractionStarter]: For program point L135-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:44:00,484 INFO L443 ceAbstractionStarter]: For program point L69-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:44:00,484 INFO L443 ceAbstractionStarter]: For program point L730(lines 730 870) no Hoare annotation was computed. [2019-11-15 21:44:00,484 INFO L443 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2019-11-15 21:44:00,485 INFO L443 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-11-15 21:44:00,485 INFO L443 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2019-11-15 21:44:00,485 INFO L443 ceAbstractionStarter]: For program point L467(lines 467 870) no Hoare annotation was computed. [2019-11-15 21:44:00,485 INFO L443 ceAbstractionStarter]: For program point L335(lines 335 870) no Hoare annotation was computed. [2019-11-15 21:44:00,485 INFO L443 ceAbstractionStarter]: For program point L269(lines 269 870) no Hoare annotation was computed. [2019-11-15 21:44:00,485 INFO L443 ceAbstractionStarter]: For program point L402(lines 402 870) no Hoare annotation was computed. [2019-11-15 21:44:00,485 INFO L443 ceAbstractionStarter]: For program point L138-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:44:00,485 INFO L443 ceAbstractionStarter]: For program point L72-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:44:00,485 INFO L443 ceAbstractionStarter]: For program point L865(lines 865 870) no Hoare annotation was computed. [2019-11-15 21:44:00,485 INFO L443 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2019-11-15 21:44:00,485 INFO L443 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2019-11-15 21:44:00,485 INFO L443 ceAbstractionStarter]: For program point L668(lines 668 870) no Hoare annotation was computed. [2019-11-15 21:44:00,485 INFO L443 ceAbstractionStarter]: For program point L536(lines 536 870) no Hoare annotation was computed. [2019-11-15 21:44:00,486 INFO L443 ceAbstractionStarter]: For program point L801(lines 801 870) no Hoare annotation was computed. [2019-11-15 21:44:00,486 INFO L443 ceAbstractionStarter]: For program point L735(lines 735 870) no Hoare annotation was computed. [2019-11-15 21:44:00,486 INFO L443 ceAbstractionStarter]: For program point L603(lines 603 870) no Hoare annotation was computed. [2019-11-15 21:44:00,486 INFO L443 ceAbstractionStarter]: For program point L141-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:44:00,486 INFO L443 ceAbstractionStarter]: For program point L75-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:44:00,486 INFO L443 ceAbstractionStarter]: For program point L472(lines 472 870) no Hoare annotation was computed. [2019-11-15 21:44:00,486 INFO L443 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2019-11-15 21:44:00,486 INFO L443 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2019-11-15 21:44:00,486 INFO L443 ceAbstractionStarter]: For program point L341(lines 341 870) no Hoare annotation was computed. [2019-11-15 21:44:00,486 INFO L443 ceAbstractionStarter]: For program point L275(lines 275 870) no Hoare annotation was computed. [2019-11-15 21:44:00,486 INFO L443 ceAbstractionStarter]: For program point L408(lines 408 870) no Hoare annotation was computed. [2019-11-15 21:44:00,486 INFO L443 ceAbstractionStarter]: For program point L144-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:44:00,486 INFO L443 ceAbstractionStarter]: For program point L78-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:44:00,487 INFO L439 ceAbstractionStarter]: At program point L871(lines 20 872) the Hoare annotation is: (let ((.cse4 (<= ~a15~0 7)) (.cse3 (not (= ~a15~0 7))) (.cse2 (= 8 ~a15~0)) (.cse1 (not (= ~a21~0 9))) (.cse6 (<= ~a12~0 11)) (.cse0 (= ~a24~0 1)) (.cse5 (not (= ~a21~0 7))) (.cse7 (< 0 (+ ~a12~0 43)))) (or (and (= 8 ~a21~0) .cse0) (and .cse1 (not (= 3 ULTIMATE.start_calculate_output_~input)) .cse2 .cse0 (<= (+ ~a12~0 49) 0)) (and .cse3 .cse0 (< 80 ~a12~0) (not (= 6 ~a21~0))) (and (<= (+ ~a12~0 460225) 0) .cse4 .cse0) (or (and .cse4 .cse5) (and .cse4 .cse3)) (and .cse2 .cse0 .cse6 .cse7) (and (= ~a21~0 6) .cse0 (<= ~a12~0 95442)) (and .cse1 .cse0 .cse6 .cse5) (and .cse0 (and (= ~a15~0 8) .cse5) .cse7))) [2019-11-15 21:44:00,487 INFO L443 ceAbstractionStarter]: For program point L541(lines 541 870) no Hoare annotation was computed. [2019-11-15 21:44:00,487 INFO L443 ceAbstractionStarter]: For program point L211(lines 211 870) no Hoare annotation was computed. [2019-11-15 21:44:00,487 INFO L443 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2019-11-15 21:44:00,487 INFO L443 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-11-15 21:44:00,487 INFO L443 ceAbstractionStarter]: For program point L674(lines 674 870) no Hoare annotation was computed. [2019-11-15 21:44:00,487 INFO L443 ceAbstractionStarter]: For program point L807(lines 807 870) no Hoare annotation was computed. [2019-11-15 21:44:00,488 INFO L443 ceAbstractionStarter]: For program point L741(lines 741 870) no Hoare annotation was computed. [2019-11-15 21:44:00,488 INFO L443 ceAbstractionStarter]: For program point L609(lines 609 870) no Hoare annotation was computed. [2019-11-15 21:44:00,488 INFO L443 ceAbstractionStarter]: For program point L147-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:44:00,488 INFO L443 ceAbstractionStarter]: For program point L81-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:44:00,488 INFO L446 ceAbstractionStarter]: At program point L874(lines 874 890) the Hoare annotation is: true [2019-11-15 21:44:00,488 INFO L443 ceAbstractionStarter]: For program point L478(lines 478 870) no Hoare annotation was computed. [2019-11-15 21:44:00,488 INFO L443 ceAbstractionStarter]: For program point L280(lines 280 870) no Hoare annotation was computed. [2019-11-15 21:44:00,488 INFO L443 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-11-15 21:44:00,488 INFO L443 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2019-11-15 21:44:00,488 INFO L443 ceAbstractionStarter]: For program point L677(lines 677 870) no Hoare annotation was computed. [2019-11-15 21:44:00,488 INFO L443 ceAbstractionStarter]: For program point L347(lines 347 870) no Hoare annotation was computed. [2019-11-15 21:44:00,488 INFO L443 ceAbstractionStarter]: For program point L414(lines 414 870) no Hoare annotation was computed. [2019-11-15 21:44:00,488 INFO L443 ceAbstractionStarter]: For program point L150-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:44:00,488 INFO L443 ceAbstractionStarter]: For program point L84-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:44:00,488 INFO L443 ceAbstractionStarter]: For program point L547(lines 547 870) no Hoare annotation was computed. [2019-11-15 21:44:00,489 INFO L443 ceAbstractionStarter]: For program point L217(lines 217 870) no Hoare annotation was computed. [2019-11-15 21:44:00,489 INFO L443 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2019-11-15 21:44:00,489 INFO L443 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2019-11-15 21:44:00,489 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-15 21:44:00,489 INFO L443 ceAbstractionStarter]: For program point L747(lines 747 870) no Hoare annotation was computed. [2019-11-15 21:44:00,489 INFO L443 ceAbstractionStarter]: For program point L615(lines 615 870) no Hoare annotation was computed. [2019-11-15 21:44:00,489 INFO L443 ceAbstractionStarter]: For program point L153-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:44:00,489 INFO L443 ceAbstractionStarter]: For program point L87-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:44:00,489 INFO L443 ceAbstractionStarter]: For program point L21(lines 21 23) no Hoare annotation was computed. [2019-11-15 21:44:00,489 INFO L443 ceAbstractionStarter]: For program point L21-2(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:44:00,489 INFO L443 ceAbstractionStarter]: For program point L814(lines 814 870) no Hoare annotation was computed. [2019-11-15 21:44:00,489 INFO L439 ceAbstractionStarter]: At program point L880-2(lines 880 889) the Hoare annotation is: (let ((.cse2 (<= ~a15~0 7)) (.cse1 (not (= ~a15~0 7))) (.cse5 (<= ~a12~0 11)) (.cse7 (not (= ~a21~0 9))) (.cse4 (= 8 ~a15~0)) (.cse0 (= ~a24~0 1)) (.cse3 (not (= ~a21~0 7))) (.cse6 (< 0 (+ ~a12~0 43)))) (or (and (= 8 ~a21~0) .cse0) (and .cse1 .cse0 (< 80 ~a12~0) (not (= 6 ~a21~0))) (and (<= (+ ~a12~0 460225) 0) .cse2 .cse0) (or (and .cse2 .cse3) (and .cse2 .cse1)) (and .cse4 .cse0 .cse5 .cse6) (and (= ~a21~0 6) .cse0 (<= ~a12~0 95442)) (and .cse7 .cse0 .cse5 .cse3) (and .cse7 .cse4 .cse0 (<= (+ ~a12~0 49) 0)) (and .cse0 (and (= ~a15~0 8) .cse3) .cse6))) [2019-11-15 21:44:00,489 INFO L443 ceAbstractionStarter]: For program point L484(lines 484 870) no Hoare annotation was computed. [2019-11-15 21:44:00,489 INFO L443 ceAbstractionStarter]: For program point L286(lines 286 870) no Hoare annotation was computed. [2019-11-15 21:44:00,490 INFO L443 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-11-15 21:44:00,490 INFO L443 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2019-11-15 21:44:00,490 INFO L443 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2019-11-15 21:44:00,490 INFO L443 ceAbstractionStarter]: For program point L683(lines 683 870) no Hoare annotation was computed. [2019-11-15 21:44:00,490 INFO L443 ceAbstractionStarter]: For program point L353(lines 353 870) no Hoare annotation was computed. [2019-11-15 21:44:00,490 INFO L443 ceAbstractionStarter]: For program point L552(lines 552 870) no Hoare annotation was computed. [2019-11-15 21:44:00,490 INFO L443 ceAbstractionStarter]: For program point L420(lines 420 870) no Hoare annotation was computed. [2019-11-15 21:44:00,490 INFO L443 ceAbstractionStarter]: For program point L156-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:44:00,491 INFO L443 ceAbstractionStarter]: For program point L90-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:44:00,491 INFO L443 ceAbstractionStarter]: For program point L24-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:44:00,491 INFO L443 ceAbstractionStarter]: For program point L223(lines 223 870) no Hoare annotation was computed. [2019-11-15 21:44:00,491 INFO L443 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2019-11-15 21:44:00,491 INFO L443 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2019-11-15 21:44:00,491 INFO L443 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2019-11-15 21:44:00,491 INFO L443 ceAbstractionStarter]: For program point L752(lines 752 870) no Hoare annotation was computed. [2019-11-15 21:44:00,491 INFO L443 ceAbstractionStarter]: For program point L885(line 885) no Hoare annotation was computed. [2019-11-15 21:44:00,491 INFO L443 ceAbstractionStarter]: For program point L819(lines 819 870) no Hoare annotation was computed. [2019-11-15 21:44:00,491 INFO L443 ceAbstractionStarter]: For program point L621(lines 621 870) no Hoare annotation was computed. [2019-11-15 21:44:00,492 INFO L443 ceAbstractionStarter]: For program point L555(lines 555 870) no Hoare annotation was computed. [2019-11-15 21:44:00,492 INFO L443 ceAbstractionStarter]: For program point L159-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:44:00,492 INFO L443 ceAbstractionStarter]: For program point L93-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:44:00,492 INFO L443 ceAbstractionStarter]: For program point L27-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:44:00,492 INFO L443 ceAbstractionStarter]: For program point L688(lines 688 870) no Hoare annotation was computed. [2019-11-15 21:44:00,492 INFO L443 ceAbstractionStarter]: For program point L490(lines 490 870) no Hoare annotation was computed. [2019-11-15 21:44:00,492 INFO L443 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2019-11-15 21:44:00,492 INFO L443 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2019-11-15 21:44:00,492 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-15 21:44:00,492 INFO L443 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-11-15 21:44:00,492 INFO L443 ceAbstractionStarter]: For program point L359(lines 359 870) no Hoare annotation was computed. [2019-11-15 21:44:00,492 INFO L443 ceAbstractionStarter]: For program point L293(lines 293 870) no Hoare annotation was computed. [2019-11-15 21:44:00,492 INFO L443 ceAbstractionStarter]: For program point L426(lines 426 870) no Hoare annotation was computed. [2019-11-15 21:44:00,492 INFO L443 ceAbstractionStarter]: For program point L162-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:44:00,492 INFO L443 ceAbstractionStarter]: For program point L96-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:44:00,492 INFO L443 ceAbstractionStarter]: For program point L30-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:44:00,493 INFO L443 ceAbstractionStarter]: For program point L229(lines 229 870) no Hoare annotation was computed. [2019-11-15 21:44:00,493 INFO L443 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2019-11-15 21:44:00,493 INFO L443 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2019-11-15 21:44:00,493 INFO L443 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2019-11-15 21:44:00,493 INFO L443 ceAbstractionStarter]: For program point L758(lines 758 870) no Hoare annotation was computed. [2019-11-15 21:44:00,493 INFO L443 ceAbstractionStarter]: For program point L626(lines 626 870) no Hoare annotation was computed. [2019-11-15 21:44:00,493 INFO L443 ceAbstractionStarter]: For program point L825(lines 825 870) no Hoare annotation was computed. [2019-11-15 21:44:00,493 INFO L443 ceAbstractionStarter]: For program point L561(lines 561 870) no Hoare annotation was computed. [2019-11-15 21:44:00,493 INFO L443 ceAbstractionStarter]: For program point L495(lines 495 870) no Hoare annotation was computed. [2019-11-15 21:44:00,493 INFO L443 ceAbstractionStarter]: For program point L165-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:44:00,493 INFO L443 ceAbstractionStarter]: For program point L99-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:44:00,493 INFO L443 ceAbstractionStarter]: For program point L33-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:44:00,493 INFO L443 ceAbstractionStarter]: For program point L694(lines 694 870) no Hoare annotation was computed. [2019-11-15 21:44:00,493 INFO L443 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2019-11-15 21:44:00,493 INFO L443 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-11-15 21:44:00,493 INFO L443 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-11-15 21:44:00,494 INFO L443 ceAbstractionStarter]: For program point L299(lines 299 870) no Hoare annotation was computed. [2019-11-15 21:44:00,494 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 112) no Hoare annotation was computed. [2019-11-15 21:44:00,514 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 09:44:00 BoogieIcfgContainer [2019-11-15 21:44:00,514 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 21:44:00,515 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 21:44:00,515 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 21:44:00,515 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 21:44:00,515 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:43:24" (3/4) ... [2019-11-15 21:44:00,518 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-15 21:44:00,545 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-15 21:44:00,547 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-15 21:44:00,695 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_62d470ff-10fb-4b4c-ae29-ec78864f1e76/bin/uautomizer/witness.graphml [2019-11-15 21:44:00,695 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 21:44:00,696 INFO L168 Benchmark]: Toolchain (without parser) took 38861.72 ms. Allocated memory was 1.0 GB in the beginning and 3.0 GB in the end (delta: 1.9 GB). Free memory was 940.7 MB in the beginning and 2.6 GB in the end (delta: -1.6 GB). Peak memory consumption was 300.7 MB. Max. memory is 11.5 GB. [2019-11-15 21:44:00,697 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:44:00,697 INFO L168 Benchmark]: CACSL2BoogieTranslator took 646.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.7 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -181.2 MB). Peak memory consumption was 23.9 MB. Max. memory is 11.5 GB. [2019-11-15 21:44:00,697 INFO L168 Benchmark]: Boogie Procedure Inliner took 108.08 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 21:44:00,698 INFO L168 Benchmark]: Boogie Preprocessor took 102.21 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: 5.5 MB). Peak memory consumption was 5.5 MB. Max. memory is 11.5 GB. [2019-11-15 21:44:00,698 INFO L168 Benchmark]: RCFGBuilder took 1572.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 974.9 MB in the end (delta: 125.4 MB). Peak memory consumption was 125.4 MB. Max. memory is 11.5 GB. [2019-11-15 21:44:00,698 INFO L168 Benchmark]: TraceAbstraction took 36247.89 ms. Allocated memory was 1.2 GB in the beginning and 3.0 GB in the end (delta: 1.8 GB). Free memory was 974.9 MB in the beginning and 2.6 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. [2019-11-15 21:44:00,699 INFO L168 Benchmark]: Witness Printer took 180.53 ms. Allocated memory is still 3.0 GB. Free memory was 2.6 GB in the beginning and 2.6 GB in the end (delta: 54.8 MB). Peak memory consumption was 54.8 MB. Max. memory is 11.5 GB. [2019-11-15 21:44:00,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.22 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 646.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.7 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -181.2 MB). Peak memory consumption was 23.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 108.08 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. * Boogie Preprocessor took 102.21 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: 5.5 MB). Peak memory consumption was 5.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1572.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 974.9 MB in the end (delta: 125.4 MB). Peak memory consumption was 125.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 36247.89 ms. Allocated memory was 1.2 GB in the beginning and 3.0 GB in the end (delta: 1.8 GB). Free memory was 974.9 MB in the beginning and 2.6 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. * Witness Printer took 180.53 ms. Allocated memory is still 3.0 GB. Free memory was 2.6 GB in the beginning and 2.6 GB in the end (delta: 54.8 MB). Peak memory consumption was 54.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 112]: 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: 880]: Loop Invariant Derived loop invariant: ((((((((8 == a21 && a24 == 1) || (((!(a15 == 7) && a24 == 1) && 80 < a12) && !(6 == a21))) || ((a12 + 460225 <= 0 && a15 <= 7) && a24 == 1)) || (a15 <= 7 && !(a21 == 7)) || (a15 <= 7 && !(a15 == 7))) || (((8 == a15 && a24 == 1) && a12 <= 11) && 0 < a12 + 43)) || ((a21 == 6 && a24 == 1) && a12 <= 95442)) || (((!(a21 == 9) && a24 == 1) && a12 <= 11) && !(a21 == 7))) || (((!(a21 == 9) && 8 == a15) && a24 == 1) && a12 + 49 <= 0)) || ((a24 == 1 && a15 == 8 && !(a21 == 7)) && 0 < a12 + 43) - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: ((((((((8 == a21 && a24 == 1) || ((((!(a21 == 9) && !(3 == input)) && 8 == a15) && a24 == 1) && a12 + 49 <= 0)) || (((!(a15 == 7) && a24 == 1) && 80 < a12) && !(6 == a21))) || ((a12 + 460225 <= 0 && a15 <= 7) && a24 == 1)) || (a15 <= 7 && !(a21 == 7)) || (a15 <= 7 && !(a15 == 7))) || (((8 == a15 && a24 == 1) && a12 <= 11) && 0 < a12 + 43)) || ((a21 == 6 && a24 == 1) && a12 <= 95442)) || (((!(a21 == 9) && a24 == 1) && a12 <= 11) && !(a21 == 7))) || ((a24 == 1 && a15 == 8 && !(a21 == 7)) && 0 < a12 + 43) - InvariantResult [Line: 874]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 245 locations, 1 error locations. Result: SAFE, OverallTime: 36.1s, OverallIterations: 18, TraceHistogramMax: 10, AutomataDifference: 18.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.4s, HoareTripleCheckerStatistics: 1650 SDtfs, 4712 SDslu, 221 SDs, 0 SdLazy, 15652 SolverSat, 2022 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2180 GetRequests, 2100 SyntacticMatches, 8 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3742occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 18 MinimizatonAttempts, 3126 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 70 NumberOfFragments, 255 HoareAnnotationTreeSize, 3 FomulaSimplifications, 631749 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 3 FomulaSimplificationsInter, 92208 FormulaSimplificationTreeSizeReductionInter, 1.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 5.2s InterpolantComputationTime, 11933 NumberOfCodeBlocks, 11933 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 11910 ConstructedInterpolants, 0 QuantifiedInterpolants, 27576344 SizeOfPredicates, 12 NumberOfNonLiveVariables, 2656 ConjunctsInSsa, 32 ConjunctsInUnsatCore, 23 InterpolantComputations, 16 PerfectInterpolantSequences, 24980/25368 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...