./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label26.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_d8768fe4-8e60-46c7-ad9d-6f34464eb70f/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_d8768fe4-8e60-46c7-ad9d-6f34464eb70f/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_d8768fe4-8e60-46c7-ad9d-6f34464eb70f/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_d8768fe4-8e60-46c7-ad9d-6f34464eb70f/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label26.c -s /tmp/vcloud-vcloud-master/worker/run_dir_d8768fe4-8e60-46c7-ad9d-6f34464eb70f/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_d8768fe4-8e60-46c7-ad9d-6f34464eb70f/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 e002fb6463a65ebb6b75b40986db95c31112380a ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 23:44:01,540 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:44:01,542 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:44:01,552 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:44:01,552 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:44:01,553 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:44:01,554 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:44:01,556 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:44:01,558 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:44:01,559 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:44:01,559 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:44:01,561 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:44:01,561 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:44:01,562 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:44:01,562 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:44:01,563 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:44:01,564 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:44:01,565 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:44:01,566 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:44:01,568 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:44:01,569 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:44:01,570 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:44:01,571 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:44:01,572 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:44:01,574 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:44:01,574 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:44:01,574 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:44:01,575 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:44:01,575 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:44:01,576 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:44:01,576 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:44:01,577 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:44:01,578 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:44:01,578 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:44:01,579 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:44:01,579 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:44:01,580 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:44:01,580 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:44:01,580 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:44:01,581 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:44:01,581 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:44:01,582 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_d8768fe4-8e60-46c7-ad9d-6f34464eb70f/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 23:44:01,594 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:44:01,594 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:44:01,595 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:44:01,595 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:44:01,596 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:44:01,596 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:44:01,596 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 23:44:01,596 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:44:01,596 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 23:44:01,597 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:44:01,597 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 23:44:01,597 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 23:44:01,597 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 23:44:01,597 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 23:44:01,598 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 23:44:01,598 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:44:01,598 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 23:44:01,598 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:44:01,599 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:44:01,599 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 23:44:01,599 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 23:44:01,599 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:44:01,599 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:44:01,600 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 23:44:01,600 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 23:44:01,600 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 23:44:01,600 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 23:44:01,600 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 23:44:01,601 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_d8768fe4-8e60-46c7-ad9d-6f34464eb70f/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 -> e002fb6463a65ebb6b75b40986db95c31112380a [2019-11-15 23:44:01,625 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:44:01,635 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:44:01,638 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:44:01,639 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:44:01,639 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:44:01,640 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_d8768fe4-8e60-46c7-ad9d-6f34464eb70f/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem01_label26.c [2019-11-15 23:44:01,695 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d8768fe4-8e60-46c7-ad9d-6f34464eb70f/bin/uautomizer/data/0c337c0c0/94f4283703d5469c85eaae3bec32f01d/FLAG26c39222b [2019-11-15 23:44:02,201 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:44:02,202 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_d8768fe4-8e60-46c7-ad9d-6f34464eb70f/sv-benchmarks/c/eca-rers2012/Problem01_label26.c [2019-11-15 23:44:02,230 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d8768fe4-8e60-46c7-ad9d-6f34464eb70f/bin/uautomizer/data/0c337c0c0/94f4283703d5469c85eaae3bec32f01d/FLAG26c39222b [2019-11-15 23:44:02,706 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_d8768fe4-8e60-46c7-ad9d-6f34464eb70f/bin/uautomizer/data/0c337c0c0/94f4283703d5469c85eaae3bec32f01d [2019-11-15 23:44:02,709 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:44:02,710 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 23:44:02,711 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:44:02,716 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:44:02,718 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:44:02,719 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:44:02" (1/1) ... [2019-11-15 23:44:02,721 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f0d4389 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:44:02, skipping insertion in model container [2019-11-15 23:44:02,721 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:44:02" (1/1) ... [2019-11-15 23:44:02,725 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:44:02,771 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:44:03,133 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:44:03,138 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:44:03,280 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:44:03,291 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:44:03,291 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:44:03 WrapperNode [2019-11-15 23:44:03,291 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:44:03,292 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 23:44:03,292 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 23:44:03,292 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 23:44:03,300 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:44:03" (1/1) ... [2019-11-15 23:44:03,316 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:44:03" (1/1) ... [2019-11-15 23:44:03,366 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 23:44:03,367 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:44:03,367 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:44:03,367 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:44:03,376 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:44:03" (1/1) ... [2019-11-15 23:44:03,377 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:44:03" (1/1) ... [2019-11-15 23:44:03,384 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:44:03" (1/1) ... [2019-11-15 23:44:03,399 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:44:03" (1/1) ... [2019-11-15 23:44:03,427 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:44:03" (1/1) ... [2019-11-15 23:44:03,436 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:44:03" (1/1) ... [2019-11-15 23:44:03,441 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:44:03" (1/1) ... [2019-11-15 23:44:03,447 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:44:03,447 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:44:03,448 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:44:03,448 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:44:03,449 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:44:03" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d8768fe4-8e60-46c7-ad9d-6f34464eb70f/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:44:03,522 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:44:03,522 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:44:04,770 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:44:04,770 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-15 23:44:04,771 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:44:04 BoogieIcfgContainer [2019-11-15 23:44:04,772 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:44:04,773 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 23:44:04,773 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 23:44:04,775 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 23:44:04,775 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 11:44:02" (1/3) ... [2019-11-15 23:44:04,776 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40ff4d63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:44:04, skipping insertion in model container [2019-11-15 23:44:04,776 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:44:03" (2/3) ... [2019-11-15 23:44:04,781 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40ff4d63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:44:04, skipping insertion in model container [2019-11-15 23:44:04,781 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:44:04" (3/3) ... [2019-11-15 23:44:04,783 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label26.c [2019-11-15 23:44:04,792 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 23:44:04,800 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 23:44:04,810 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 23:44:04,849 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 23:44:04,849 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 23:44:04,850 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 23:44:04,850 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:44:04,850 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:44:04,850 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 23:44:04,850 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:44:04,851 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 23:44:04,873 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states. [2019-11-15 23:44:04,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-15 23:44:04,889 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:44:04,890 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:44:04,891 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:44:04,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:44:04,897 INFO L82 PathProgramCache]: Analyzing trace with hash -583926962, now seen corresponding path program 1 times [2019-11-15 23:44:04,904 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:44:04,904 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940857531] [2019-11-15 23:44:04,905 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:04,905 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:04,905 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:44:05,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:44:05,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:44:05,223 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940857531] [2019-11-15 23:44:05,224 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:44:05,224 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:44:05,225 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521556688] [2019-11-15 23:44:05,229 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:44:05,229 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:44:05,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:44:05,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:44:05,243 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 4 states. [2019-11-15 23:44:06,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:44:06,453 INFO L93 Difference]: Finished difference Result 662 states and 1178 transitions. [2019-11-15 23:44:06,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:44:06,455 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-11-15 23:44:06,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:44:06,471 INFO L225 Difference]: With dead ends: 662 [2019-11-15 23:44:06,471 INFO L226 Difference]: Without dead ends: 397 [2019-11-15 23:44:06,479 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:44:06,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2019-11-15 23:44:06,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 397. [2019-11-15 23:44:06,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-11-15 23:44:06,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 553 transitions. [2019-11-15 23:44:06,575 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 553 transitions. Word has length 103 [2019-11-15 23:44:06,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:44:06,576 INFO L462 AbstractCegarLoop]: Abstraction has 397 states and 553 transitions. [2019-11-15 23:44:06,576 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:44:06,576 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 553 transitions. [2019-11-15 23:44:06,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-11-15 23:44:06,585 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:44:06,586 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:44:06,586 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:44:06,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:44:06,587 INFO L82 PathProgramCache]: Analyzing trace with hash 1625453403, now seen corresponding path program 1 times [2019-11-15 23:44:06,587 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:44:06,587 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102642484] [2019-11-15 23:44:06,588 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:06,588 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:06,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:44:06,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:44:06,799 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:44:06,799 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102642484] [2019-11-15 23:44:06,799 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:44:06,800 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:44:06,800 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387755907] [2019-11-15 23:44:06,801 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:44:06,802 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:44:06,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:44:06,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:44:06,802 INFO L87 Difference]: Start difference. First operand 397 states and 553 transitions. Second operand 4 states. [2019-11-15 23:44:07,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:44:07,698 INFO L93 Difference]: Finished difference Result 1447 states and 2019 transitions. [2019-11-15 23:44:07,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:44:07,698 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2019-11-15 23:44:07,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:44:07,704 INFO L225 Difference]: With dead ends: 1447 [2019-11-15 23:44:07,704 INFO L226 Difference]: Without dead ends: 1052 [2019-11-15 23:44:07,707 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:44:07,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2019-11-15 23:44:07,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 659. [2019-11-15 23:44:07,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 659 states. [2019-11-15 23:44:07,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 851 transitions. [2019-11-15 23:44:07,728 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 851 transitions. Word has length 110 [2019-11-15 23:44:07,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:44:07,728 INFO L462 AbstractCegarLoop]: Abstraction has 659 states and 851 transitions. [2019-11-15 23:44:07,728 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:44:07,729 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 851 transitions. [2019-11-15 23:44:07,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-11-15 23:44:07,730 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:44:07,731 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:44:07,731 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:44:07,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:44:07,731 INFO L82 PathProgramCache]: Analyzing trace with hash 733143454, now seen corresponding path program 1 times [2019-11-15 23:44:07,731 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:44:07,732 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496815167] [2019-11-15 23:44:07,732 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:07,732 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:07,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:44:07,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:44:07,806 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:44:07,808 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496815167] [2019-11-15 23:44:07,808 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:44:07,808 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:44:07,808 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562886908] [2019-11-15 23:44:07,810 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:44:07,810 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:44:07,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:44:07,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:44:07,814 INFO L87 Difference]: Start difference. First operand 659 states and 851 transitions. Second operand 4 states. [2019-11-15 23:44:08,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:44:08,507 INFO L93 Difference]: Finished difference Result 1578 states and 1998 transitions. [2019-11-15 23:44:08,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:44:08,507 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 124 [2019-11-15 23:44:08,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:44:08,511 INFO L225 Difference]: With dead ends: 1578 [2019-11-15 23:44:08,511 INFO L226 Difference]: Without dead ends: 790 [2019-11-15 23:44:08,513 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:44:08,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2019-11-15 23:44:08,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 790. [2019-11-15 23:44:08,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2019-11-15 23:44:08,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 930 transitions. [2019-11-15 23:44:08,528 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 930 transitions. Word has length 124 [2019-11-15 23:44:08,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:44:08,528 INFO L462 AbstractCegarLoop]: Abstraction has 790 states and 930 transitions. [2019-11-15 23:44:08,528 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:44:08,529 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 930 transitions. [2019-11-15 23:44:08,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-11-15 23:44:08,530 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:44:08,531 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:44:08,531 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:44:08,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:44:08,531 INFO L82 PathProgramCache]: Analyzing trace with hash 2001117315, now seen corresponding path program 1 times [2019-11-15 23:44:08,532 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:44:08,532 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833441404] [2019-11-15 23:44:08,532 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:08,532 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:08,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:44:08,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:44:08,581 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:44:08,581 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833441404] [2019-11-15 23:44:08,581 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:44:08,582 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:44:08,582 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746800687] [2019-11-15 23:44:08,582 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:44:08,582 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:44:08,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:44:08,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:44:08,583 INFO L87 Difference]: Start difference. First operand 790 states and 930 transitions. Second operand 3 states. [2019-11-15 23:44:09,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:44:09,057 INFO L93 Difference]: Finished difference Result 2233 states and 2643 transitions. [2019-11-15 23:44:09,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:44:09,060 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 125 [2019-11-15 23:44:09,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:44:09,066 INFO L225 Difference]: With dead ends: 2233 [2019-11-15 23:44:09,067 INFO L226 Difference]: Without dead ends: 1445 [2019-11-15 23:44:09,068 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:44:09,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2019-11-15 23:44:09,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 1183. [2019-11-15 23:44:09,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1183 states. [2019-11-15 23:44:09,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1374 transitions. [2019-11-15 23:44:09,102 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1374 transitions. Word has length 125 [2019-11-15 23:44:09,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:44:09,103 INFO L462 AbstractCegarLoop]: Abstraction has 1183 states and 1374 transitions. [2019-11-15 23:44:09,103 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:44:09,103 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1374 transitions. [2019-11-15 23:44:09,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-11-15 23:44:09,108 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:44:09,108 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:44:09,108 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:44:09,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:44:09,109 INFO L82 PathProgramCache]: Analyzing trace with hash 891303243, now seen corresponding path program 1 times [2019-11-15 23:44:09,109 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:44:09,109 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239197669] [2019-11-15 23:44:09,109 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:09,110 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:09,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:44:09,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:44:09,208 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-15 23:44:09,209 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239197669] [2019-11-15 23:44:09,209 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:44:09,209 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:44:09,210 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53979751] [2019-11-15 23:44:09,210 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:44:09,211 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:44:09,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:44:09,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:44:09,213 INFO L87 Difference]: Start difference. First operand 1183 states and 1374 transitions. Second operand 3 states. [2019-11-15 23:44:09,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:44:09,737 INFO L93 Difference]: Finished difference Result 3150 states and 3674 transitions. [2019-11-15 23:44:09,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:44:09,738 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 129 [2019-11-15 23:44:09,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:44:09,747 INFO L225 Difference]: With dead ends: 3150 [2019-11-15 23:44:09,747 INFO L226 Difference]: Without dead ends: 1969 [2019-11-15 23:44:09,749 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:44:09,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2019-11-15 23:44:09,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1445. [2019-11-15 23:44:09,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1445 states. [2019-11-15 23:44:09,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 1682 transitions. [2019-11-15 23:44:09,783 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 1682 transitions. Word has length 129 [2019-11-15 23:44:09,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:44:09,784 INFO L462 AbstractCegarLoop]: Abstraction has 1445 states and 1682 transitions. [2019-11-15 23:44:09,784 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:44:09,784 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1682 transitions. [2019-11-15 23:44:09,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-11-15 23:44:09,787 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:44:09,787 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:44:09,787 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:44:09,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:44:09,787 INFO L82 PathProgramCache]: Analyzing trace with hash 1514660785, now seen corresponding path program 1 times [2019-11-15 23:44:09,788 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:44:09,788 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036502545] [2019-11-15 23:44:09,788 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:09,788 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:09,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:44:09,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:44:09,843 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-15 23:44:09,844 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036502545] [2019-11-15 23:44:09,845 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:44:09,845 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:44:09,845 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246536696] [2019-11-15 23:44:09,845 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:44:09,846 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:44:09,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:44:09,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:44:09,847 INFO L87 Difference]: Start difference. First operand 1445 states and 1682 transitions. Second operand 3 states. [2019-11-15 23:44:10,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:44:10,291 INFO L93 Difference]: Finished difference Result 3019 states and 3514 transitions. [2019-11-15 23:44:10,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:44:10,293 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 131 [2019-11-15 23:44:10,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:44:10,300 INFO L225 Difference]: With dead ends: 3019 [2019-11-15 23:44:10,300 INFO L226 Difference]: Without dead ends: 1576 [2019-11-15 23:44:10,302 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:44:10,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1576 states. [2019-11-15 23:44:10,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1576 to 1445. [2019-11-15 23:44:10,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1445 states. [2019-11-15 23:44:10,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 1682 transitions. [2019-11-15 23:44:10,354 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 1682 transitions. Word has length 131 [2019-11-15 23:44:10,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:44:10,354 INFO L462 AbstractCegarLoop]: Abstraction has 1445 states and 1682 transitions. [2019-11-15 23:44:10,354 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:44:10,354 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1682 transitions. [2019-11-15 23:44:10,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-11-15 23:44:10,357 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:44:10,357 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:44:10,358 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:44:10,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:44:10,360 INFO L82 PathProgramCache]: Analyzing trace with hash 263294258, now seen corresponding path program 1 times [2019-11-15 23:44:10,360 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:44:10,361 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145591648] [2019-11-15 23:44:10,361 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:10,361 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:10,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:44:10,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:44:10,451 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:44:10,451 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145591648] [2019-11-15 23:44:10,451 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:44:10,451 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:44:10,452 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632039747] [2019-11-15 23:44:10,452 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:44:10,452 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:44:10,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:44:10,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:44:10,453 INFO L87 Difference]: Start difference. First operand 1445 states and 1682 transitions. Second operand 3 states. [2019-11-15 23:44:10,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:44:10,904 INFO L93 Difference]: Finished difference Result 3281 states and 3792 transitions. [2019-11-15 23:44:10,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:44:10,904 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 132 [2019-11-15 23:44:10,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:44:10,915 INFO L225 Difference]: With dead ends: 3281 [2019-11-15 23:44:10,915 INFO L226 Difference]: Without dead ends: 1838 [2019-11-15 23:44:10,917 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:44:10,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2019-11-15 23:44:10,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1707. [2019-11-15 23:44:10,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1707 states. [2019-11-15 23:44:11,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 1965 transitions. [2019-11-15 23:44:11,000 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 1965 transitions. Word has length 132 [2019-11-15 23:44:11,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:44:11,000 INFO L462 AbstractCegarLoop]: Abstraction has 1707 states and 1965 transitions. [2019-11-15 23:44:11,000 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:44:11,001 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 1965 transitions. [2019-11-15 23:44:11,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-11-15 23:44:11,006 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:44:11,006 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:44:11,006 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:44:11,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:44:11,007 INFO L82 PathProgramCache]: Analyzing trace with hash 294946666, now seen corresponding path program 1 times [2019-11-15 23:44:11,007 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:44:11,007 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046286977] [2019-11-15 23:44:11,007 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:11,007 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:11,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:44:11,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:44:11,189 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:44:11,189 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046286977] [2019-11-15 23:44:11,189 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:44:11,190 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 23:44:11,190 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093738007] [2019-11-15 23:44:11,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 23:44:11,190 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:44:11,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 23:44:11,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:44:11,191 INFO L87 Difference]: Start difference. First operand 1707 states and 1965 transitions. Second operand 8 states. [2019-11-15 23:44:12,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:44:12,148 INFO L93 Difference]: Finished difference Result 3582 states and 4117 transitions. [2019-11-15 23:44:12,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:44:12,152 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 136 [2019-11-15 23:44:12,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:44:12,167 INFO L225 Difference]: With dead ends: 3582 [2019-11-15 23:44:12,167 INFO L226 Difference]: Without dead ends: 2008 [2019-11-15 23:44:12,170 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:44:12,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2008 states. [2019-11-15 23:44:12,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2008 to 1707. [2019-11-15 23:44:12,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1707 states. [2019-11-15 23:44:12,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 1953 transitions. [2019-11-15 23:44:12,210 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 1953 transitions. Word has length 136 [2019-11-15 23:44:12,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:44:12,212 INFO L462 AbstractCegarLoop]: Abstraction has 1707 states and 1953 transitions. [2019-11-15 23:44:12,212 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 23:44:12,212 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 1953 transitions. [2019-11-15 23:44:12,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-11-15 23:44:12,219 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:44:12,219 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-15 23:44:12,219 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:44:12,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:44:12,220 INFO L82 PathProgramCache]: Analyzing trace with hash 2118430365, now seen corresponding path program 1 times [2019-11-15 23:44:12,220 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:44:12,220 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038883741] [2019-11-15 23:44:12,220 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:12,220 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:12,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:44:12,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:44:12,322 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:44:12,322 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038883741] [2019-11-15 23:44:12,323 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:44:12,323 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:44:12,323 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373724614] [2019-11-15 23:44:12,324 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:44:12,324 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:44:12,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:44:12,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:44:12,325 INFO L87 Difference]: Start difference. First operand 1707 states and 1953 transitions. Second operand 3 states. [2019-11-15 23:44:12,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:44:12,673 INFO L93 Difference]: Finished difference Result 2102 states and 2422 transitions. [2019-11-15 23:44:12,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:44:12,673 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 162 [2019-11-15 23:44:12,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:44:12,684 INFO L225 Difference]: With dead ends: 2102 [2019-11-15 23:44:12,685 INFO L226 Difference]: Without dead ends: 2100 [2019-11-15 23:44:12,685 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:44:12,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2100 states. [2019-11-15 23:44:12,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2100 to 1838. [2019-11-15 23:44:12,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-11-15 23:44:12,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2129 transitions. [2019-11-15 23:44:12,729 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2129 transitions. Word has length 162 [2019-11-15 23:44:12,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:44:12,730 INFO L462 AbstractCegarLoop]: Abstraction has 1838 states and 2129 transitions. [2019-11-15 23:44:12,730 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:44:12,730 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2129 transitions. [2019-11-15 23:44:12,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-11-15 23:44:12,735 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:44:12,735 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:44:12,736 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:44:12,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:44:12,736 INFO L82 PathProgramCache]: Analyzing trace with hash 172823534, now seen corresponding path program 1 times [2019-11-15 23:44:12,736 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:44:12,737 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125502504] [2019-11-15 23:44:12,737 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:12,737 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:12,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:44:12,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:44:12,837 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-11-15 23:44:12,837 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125502504] [2019-11-15 23:44:12,837 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:44:12,837 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:44:12,838 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841519585] [2019-11-15 23:44:12,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:44:12,838 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:44:12,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:44:12,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:44:12,839 INFO L87 Difference]: Start difference. First operand 1838 states and 2129 transitions. Second operand 3 states. [2019-11-15 23:44:13,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:44:13,268 INFO L93 Difference]: Finished difference Result 3674 states and 4254 transitions. [2019-11-15 23:44:13,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:44:13,269 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 167 [2019-11-15 23:44:13,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:44:13,277 INFO L225 Difference]: With dead ends: 3674 [2019-11-15 23:44:13,277 INFO L226 Difference]: Without dead ends: 1838 [2019-11-15 23:44:13,279 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:44:13,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2019-11-15 23:44:13,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1838. [2019-11-15 23:44:13,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-11-15 23:44:13,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2011 transitions. [2019-11-15 23:44:13,318 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2011 transitions. Word has length 167 [2019-11-15 23:44:13,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:44:13,318 INFO L462 AbstractCegarLoop]: Abstraction has 1838 states and 2011 transitions. [2019-11-15 23:44:13,319 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:44:13,319 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2011 transitions. [2019-11-15 23:44:13,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-11-15 23:44:13,323 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:44:13,323 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:44:13,324 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:44:13,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:44:13,324 INFO L82 PathProgramCache]: Analyzing trace with hash -1369122589, now seen corresponding path program 1 times [2019-11-15 23:44:13,324 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:44:13,324 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573380052] [2019-11-15 23:44:13,325 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:13,325 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:13,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:44:13,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:44:13,411 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-11-15 23:44:13,411 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573380052] [2019-11-15 23:44:13,411 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:44:13,412 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:44:13,412 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411891556] [2019-11-15 23:44:13,412 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:44:13,412 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:44:13,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:44:13,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:44:13,413 INFO L87 Difference]: Start difference. First operand 1838 states and 2011 transitions. Second operand 3 states. [2019-11-15 23:44:13,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:44:13,791 INFO L93 Difference]: Finished difference Result 3674 states and 4020 transitions. [2019-11-15 23:44:13,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:44:13,791 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 197 [2019-11-15 23:44:13,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:44:13,800 INFO L225 Difference]: With dead ends: 3674 [2019-11-15 23:44:13,800 INFO L226 Difference]: Without dead ends: 1838 [2019-11-15 23:44:13,802 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:44:13,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2019-11-15 23:44:13,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1707. [2019-11-15 23:44:13,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1707 states. [2019-11-15 23:44:13,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 1855 transitions. [2019-11-15 23:44:13,845 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 1855 transitions. Word has length 197 [2019-11-15 23:44:13,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:44:13,846 INFO L462 AbstractCegarLoop]: Abstraction has 1707 states and 1855 transitions. [2019-11-15 23:44:13,846 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:44:13,846 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 1855 transitions. [2019-11-15 23:44:13,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-11-15 23:44:13,850 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:44:13,850 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:44:13,851 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:44:13,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:44:13,851 INFO L82 PathProgramCache]: Analyzing trace with hash 2102385007, now seen corresponding path program 1 times [2019-11-15 23:44:13,851 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:44:13,851 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292098949] [2019-11-15 23:44:13,852 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:13,852 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:13,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:44:13,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:44:14,077 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 181 proven. 93 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-15 23:44:14,078 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292098949] [2019-11-15 23:44:14,078 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1816361451] [2019-11-15 23:44:14,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d8768fe4-8e60-46c7-ad9d-6f34464eb70f/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:44:14,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:44:14,189 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:44:14,211 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:44:14,329 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2019-11-15 23:44:14,330 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 23:44:14,330 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2019-11-15 23:44:14,330 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744856683] [2019-11-15 23:44:14,331 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:44:14,331 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:44:14,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:44:14,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-11-15 23:44:14,332 INFO L87 Difference]: Start difference. First operand 1707 states and 1855 transitions. Second operand 3 states. [2019-11-15 23:44:14,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:44:14,722 INFO L93 Difference]: Finished difference Result 3410 states and 3720 transitions. [2019-11-15 23:44:14,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:44:14,723 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 226 [2019-11-15 23:44:14,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:44:14,724 INFO L225 Difference]: With dead ends: 3410 [2019-11-15 23:44:14,724 INFO L226 Difference]: Without dead ends: 0 [2019-11-15 23:44:14,726 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 227 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-11-15 23:44:14,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-15 23:44:14,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-15 23:44:14,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-15 23:44:14,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 23:44:14,730 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 226 [2019-11-15 23:44:14,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:44:14,730 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:44:14,731 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:44:14,731 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-15 23:44:14,731 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-15 23:44:14,939 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:44:14,943 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-15 23:44:15,134 INFO L443 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-11-15 23:44:15,134 INFO L443 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-11-15 23:44:15,134 INFO L443 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 23:44:15,134 INFO L443 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 23:44:15,134 INFO L443 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 23:44:15,134 INFO L443 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 23:44:15,134 INFO L443 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 23:44:15,134 INFO L443 ceAbstractionStarter]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 23:44:15,134 INFO L443 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-11-15 23:44:15,135 INFO L443 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-11-15 23:44:15,135 INFO L443 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2019-11-15 23:44:15,135 INFO L443 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2019-11-15 23:44:15,135 INFO L443 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2019-11-15 23:44:15,135 INFO L443 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2019-11-15 23:44:15,135 INFO L443 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2019-11-15 23:44:15,135 INFO L443 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2019-11-15 23:44:15,135 INFO L443 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-11-15 23:44:15,135 INFO L443 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-11-15 23:44:15,135 INFO L443 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 23:44:15,135 INFO L443 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 23:44:15,136 INFO L443 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 23:44:15,136 INFO L443 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 23:44:15,136 INFO L443 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 23:44:15,136 INFO L443 ceAbstractionStarter]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 23:44:15,136 INFO L443 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-11-15 23:44:15,136 INFO L443 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-11-15 23:44:15,136 INFO L443 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2019-11-15 23:44:15,136 INFO L443 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2019-11-15 23:44:15,136 INFO L443 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2019-11-15 23:44:15,136 INFO L443 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2019-11-15 23:44:15,136 INFO L443 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2019-11-15 23:44:15,136 INFO L443 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2019-11-15 23:44:15,137 INFO L443 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-11-15 23:44:15,137 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 485) no Hoare annotation was computed. [2019-11-15 23:44:15,137 INFO L443 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-11-15 23:44:15,137 INFO L443 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-11-15 23:44:15,137 INFO L443 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-11-15 23:44:15,137 INFO L443 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-11-15 23:44:15,137 INFO L443 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-11-15 23:44:15,137 INFO L443 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2019-11-15 23:44:15,137 INFO L443 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 23:44:15,137 INFO L443 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 23:44:15,137 INFO L443 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 23:44:15,138 INFO L443 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 23:44:15,138 INFO L443 ceAbstractionStarter]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 23:44:15,138 INFO L443 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-11-15 23:44:15,138 INFO L443 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-11-15 23:44:15,138 INFO L443 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2019-11-15 23:44:15,138 INFO L443 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2019-11-15 23:44:15,138 INFO L443 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2019-11-15 23:44:15,138 INFO L443 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2019-11-15 23:44:15,138 INFO L443 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2019-11-15 23:44:15,138 INFO L443 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2019-11-15 23:44:15,138 INFO L443 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-11-15 23:44:15,139 INFO L439 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse0 (= ~a21~0 1))) (or (not (= 15 ~a8~0)) (and (not (= ~a7~0 1)) .cse0 (= ~a20~0 1)) (and .cse0 (<= ~a20~0 0)))) [2019-11-15 23:44:15,139 INFO L443 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 23:44:15,139 INFO L443 ceAbstractionStarter]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 23:44:15,139 INFO L443 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 23:44:15,139 INFO L443 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 23:44:15,139 INFO L443 ceAbstractionStarter]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 23:44:15,142 INFO L443 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-11-15 23:44:15,142 INFO L443 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2019-11-15 23:44:15,142 INFO L443 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2019-11-15 23:44:15,142 INFO L443 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2019-11-15 23:44:15,143 INFO L443 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2019-11-15 23:44:15,143 INFO L443 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2019-11-15 23:44:15,143 INFO L443 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-11-15 23:44:15,143 INFO L443 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-11-15 23:44:15,143 INFO L443 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-11-15 23:44:15,143 INFO L443 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-11-15 23:44:15,143 INFO L443 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-11-15 23:44:15,144 INFO L443 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-11-15 23:44:15,144 INFO L443 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-11-15 23:44:15,144 INFO L446 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-11-15 23:44:15,144 INFO L443 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 23:44:15,144 INFO L443 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 23:44:15,144 INFO L443 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 23:44:15,144 INFO L443 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 23:44:15,145 INFO L443 ceAbstractionStarter]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 23:44:15,145 INFO L443 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-11-15 23:44:15,145 INFO L443 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-11-15 23:44:15,145 INFO L443 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-11-15 23:44:15,145 INFO L443 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2019-11-15 23:44:15,145 INFO L443 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2019-11-15 23:44:15,145 INFO L443 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2019-11-15 23:44:15,145 INFO L443 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2019-11-15 23:44:15,146 INFO L443 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2019-11-15 23:44:15,146 INFO L443 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-11-15 23:44:15,146 INFO L443 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 23:44:15,146 INFO L443 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 23:44:15,146 INFO L443 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 23:44:15,146 INFO L443 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 23:44:15,146 INFO L443 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-11-15 23:44:15,147 INFO L443 ceAbstractionStarter]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 23:44:15,147 INFO L443 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-11-15 23:44:15,147 INFO L443 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-11-15 23:44:15,147 INFO L443 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2019-11-15 23:44:15,147 INFO L443 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2019-11-15 23:44:15,147 INFO L443 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2019-11-15 23:44:15,147 INFO L443 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2019-11-15 23:44:15,148 INFO L443 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2019-11-15 23:44:15,148 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-15 23:44:15,148 INFO L443 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-11-15 23:44:15,148 INFO L443 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-11-15 23:44:15,148 INFO L443 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-11-15 23:44:15,148 INFO L443 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-11-15 23:44:15,148 INFO L443 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-11-15 23:44:15,149 INFO L443 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-11-15 23:44:15,149 INFO L443 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 23:44:15,150 INFO L439 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse0 (= ~a21~0 1))) (or (not (= 15 ~a8~0)) (and (not (= ~a7~0 1)) .cse0 (= ~a20~0 1)) (and .cse0 (<= ~a20~0 0)))) [2019-11-15 23:44:15,150 INFO L443 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 23:44:15,150 INFO L443 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 23:44:15,150 INFO L443 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 23:44:15,150 INFO L443 ceAbstractionStarter]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 23:44:15,150 INFO L443 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-11-15 23:44:15,151 INFO L443 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2019-11-15 23:44:15,151 INFO L443 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2019-11-15 23:44:15,151 INFO L443 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2019-11-15 23:44:15,151 INFO L443 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2019-11-15 23:44:15,151 INFO L443 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2019-11-15 23:44:15,152 INFO L443 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-11-15 23:44:15,152 INFO L443 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-11-15 23:44:15,152 INFO L443 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 23:44:15,152 INFO L443 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 23:44:15,152 INFO L443 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 23:44:15,152 INFO L443 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 23:44:15,152 INFO L443 ceAbstractionStarter]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 23:44:15,152 INFO L443 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-11-15 23:44:15,153 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-15 23:44:15,153 INFO L443 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-11-15 23:44:15,153 INFO L443 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-11-15 23:44:15,153 INFO L443 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-11-15 23:44:15,153 INFO L443 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2019-11-15 23:44:15,153 INFO L443 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2019-11-15 23:44:15,153 INFO L443 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2019-11-15 23:44:15,154 INFO L443 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2019-11-15 23:44:15,154 INFO L443 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2019-11-15 23:44:15,154 INFO L443 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-11-15 23:44:15,154 INFO L443 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-11-15 23:44:15,154 INFO L443 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-11-15 23:44:15,154 INFO L443 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 23:44:15,154 INFO L443 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 23:44:15,154 INFO L443 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 23:44:15,155 INFO L443 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 23:44:15,155 INFO L443 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2019-11-15 23:44:15,155 INFO L443 ceAbstractionStarter]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 23:44:15,155 INFO L443 ceAbstractionStarter]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2019-11-15 23:44:15,155 INFO L443 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-11-15 23:44:15,155 INFO L443 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-11-15 23:44:15,155 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-15 23:44:15,156 INFO L443 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2019-11-15 23:44:15,156 INFO L443 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2019-11-15 23:44:15,156 INFO L443 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2019-11-15 23:44:15,156 INFO L443 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2019-11-15 23:44:15,156 INFO L443 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2019-11-15 23:44:15,156 INFO L443 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2019-11-15 23:44:15,156 INFO L443 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-11-15 23:44:15,156 INFO L443 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-11-15 23:44:15,157 INFO L443 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-11-15 23:44:15,157 INFO L443 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-11-15 23:44:15,157 INFO L443 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 23:44:15,157 INFO L443 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 23:44:15,157 INFO L443 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 23:44:15,157 INFO L443 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 23:44:15,157 INFO L443 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 23:44:15,158 INFO L443 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-11-15 23:44:15,158 INFO L443 ceAbstractionStarter]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 23:44:15,158 INFO L443 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-11-15 23:44:15,158 INFO L443 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-11-15 23:44:15,158 INFO L443 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2019-11-15 23:44:15,158 INFO L443 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2019-11-15 23:44:15,158 INFO L443 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2019-11-15 23:44:15,159 INFO L443 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2019-11-15 23:44:15,159 INFO L443 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2019-11-15 23:44:15,159 INFO L443 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2019-11-15 23:44:15,159 INFO L443 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-11-15 23:44:15,159 INFO L443 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-11-15 23:44:15,159 INFO L443 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-11-15 23:44:15,159 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-15 23:44:15,159 INFO L443 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-11-15 23:44:15,160 INFO L443 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-11-15 23:44:15,160 INFO L443 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-11-15 23:44:15,160 INFO L443 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 23:44:15,160 INFO L443 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 23:44:15,160 INFO L443 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 23:44:15,160 INFO L443 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 23:44:15,160 INFO L443 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 23:44:15,161 INFO L443 ceAbstractionStarter]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 23:44:15,161 INFO L443 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-11-15 23:44:15,161 INFO L443 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2019-11-15 23:44:15,161 INFO L443 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2019-11-15 23:44:15,161 INFO L443 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2019-11-15 23:44:15,161 INFO L443 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2019-11-15 23:44:15,161 INFO L443 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2019-11-15 23:44:15,162 INFO L443 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2019-11-15 23:44:15,162 INFO L443 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-11-15 23:44:15,162 INFO L443 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-11-15 23:44:15,162 INFO L443 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-11-15 23:44:15,186 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 11:44:15 BoogieIcfgContainer [2019-11-15 23:44:15,186 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 23:44:15,186 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 23:44:15,186 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 23:44:15,186 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 23:44:15,187 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:44:04" (3/4) ... [2019-11-15 23:44:15,190 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-15 23:44:15,220 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-15 23:44:15,221 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-15 23:44:15,398 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_d8768fe4-8e60-46c7-ad9d-6f34464eb70f/bin/uautomizer/witness.graphml [2019-11-15 23:44:15,398 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 23:44:15,400 INFO L168 Benchmark]: Toolchain (without parser) took 12689.37 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 412.1 MB). Free memory was 939.3 MB in the beginning and 1.2 GB in the end (delta: -281.6 MB). Peak memory consumption was 130.5 MB. Max. memory is 11.5 GB. [2019-11-15 23:44:15,401 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:44:15,401 INFO L168 Benchmark]: CACSL2BoogieTranslator took 580.42 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.7 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -161.5 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. [2019-11-15 23:44:15,402 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.71 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.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 23:44:15,402 INFO L168 Benchmark]: Boogie Preprocessor took 80.24 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:44:15,402 INFO L168 Benchmark]: RCFGBuilder took 1324.26 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 975.4 MB in the end (delta: 114.6 MB). Peak memory consumption was 114.6 MB. Max. memory is 11.5 GB. [2019-11-15 23:44:15,403 INFO L168 Benchmark]: TraceAbstraction took 10413.38 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 288.4 MB). Free memory was 975.4 MB in the beginning and 1.2 GB in the end (delta: -260.6 MB). Peak memory consumption was 27.8 MB. Max. memory is 11.5 GB. [2019-11-15 23:44:15,403 INFO L168 Benchmark]: Witness Printer took 212.06 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 15.1 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. [2019-11-15 23:44:15,405 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 580.42 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.7 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -161.5 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 74.71 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.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 80.24 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1324.26 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 975.4 MB in the end (delta: 114.6 MB). Peak memory consumption was 114.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 10413.38 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 288.4 MB). Free memory was 975.4 MB in the beginning and 1.2 GB in the end (delta: -260.6 MB). Peak memory consumption was 27.8 MB. Max. memory is 11.5 GB. * Witness Printer took 212.06 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 15.1 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 485]: 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: 30]: Loop Invariant Derived loop invariant: (!(15 == a8) || ((!(a7 == 1) && a21 == 1) && a20 == 1)) || (a21 == 1 && a20 <= 0) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: (!(15 == a8) || ((!(a7 == 1) && a21 == 1) && a20 == 1)) || (a21 == 1 && a20 <= 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 198 locations, 1 error locations. Result: SAFE, OverallTime: 10.3s, OverallIterations: 12, TraceHistogramMax: 6, AutomataDifference: 7.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, HoareTripleCheckerStatistics: 775 SDtfs, 1975 SDslu, 106 SDs, 0 SdLazy, 5458 SolverSat, 856 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 270 GetRequests, 240 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1838occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 12 MinimizatonAttempts, 2135 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 40 NumberOfFragments, 47 HoareAnnotationTreeSize, 3 FomulaSimplifications, 20956 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 6 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 1968 NumberOfCodeBlocks, 1968 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1955 ConstructedInterpolants, 0 QuantifiedInterpolants, 719614 SizeOfPredicates, 1 NumberOfNonLiveVariables, 432 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 13 InterpolantComputations, 12 PerfectInterpolantSequences, 1058/1151 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...