./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem03_label10.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_7b5c45c3-52bb-4a6a-b359-85e12b5e9479/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_7b5c45c3-52bb-4a6a-b359-85e12b5e9479/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_7b5c45c3-52bb-4a6a-b359-85e12b5e9479/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_7b5c45c3-52bb-4a6a-b359-85e12b5e9479/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem03_label10.c -s /tmp/vcloud-vcloud-master/worker/run_dir_7b5c45c3-52bb-4a6a-b359-85e12b5e9479/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_7b5c45c3-52bb-4a6a-b359-85e12b5e9479/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 bbc1feb3ff32d0c91c18b795ac9c4037252af2bf ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:52:34,651 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:52:34,653 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:52:34,670 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:52:34,670 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:52:34,671 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:52:34,673 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:52:34,683 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:52:34,688 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:52:34,691 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:52:34,692 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:52:34,693 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:52:34,693 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:52:34,694 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:52:34,695 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:52:34,695 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:52:34,696 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:52:34,697 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:52:34,698 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:52:34,700 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:52:34,704 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:52:34,706 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:52:34,708 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:52:34,710 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:52:34,716 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:52:34,716 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:52:34,717 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:52:34,720 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:52:34,721 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:52:34,723 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:52:34,723 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:52:34,724 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:52:34,724 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:52:34,725 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:52:34,728 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:52:34,728 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:52:34,729 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:52:34,729 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:52:34,729 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:52:34,730 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:52:34,731 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:52:34,732 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_7b5c45c3-52bb-4a6a-b359-85e12b5e9479/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 23:52:34,759 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:52:34,759 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:52:34,760 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:52:34,760 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:52:34,760 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:52:34,761 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:52:34,761 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 23:52:34,761 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:52:34,761 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 23:52:34,762 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:52:34,762 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 23:52:34,762 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 23:52:34,762 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 23:52:34,762 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 23:52:34,763 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 23:52:34,763 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:52:34,763 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 23:52:34,763 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:52:34,763 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:52:34,764 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 23:52:34,764 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 23:52:34,764 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:52:34,764 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:52:34,765 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 23:52:34,765 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 23:52:34,765 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 23:52:34,765 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 23:52:34,765 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 23:52:34,766 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_7b5c45c3-52bb-4a6a-b359-85e12b5e9479/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 -> bbc1feb3ff32d0c91c18b795ac9c4037252af2bf [2019-11-15 23:52:34,815 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:52:34,834 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:52:34,837 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:52:34,840 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:52:34,840 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:52:34,842 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_7b5c45c3-52bb-4a6a-b359-85e12b5e9479/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem03_label10.c [2019-11-15 23:52:34,897 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7b5c45c3-52bb-4a6a-b359-85e12b5e9479/bin/uautomizer/data/3efcc8efe/60b36a4f373f40d7b4b358ad46c3b9e4/FLAGf69dba0f0 [2019-11-15 23:52:35,465 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:52:35,465 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_7b5c45c3-52bb-4a6a-b359-85e12b5e9479/sv-benchmarks/c/eca-rers2012/Problem03_label10.c [2019-11-15 23:52:35,489 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7b5c45c3-52bb-4a6a-b359-85e12b5e9479/bin/uautomizer/data/3efcc8efe/60b36a4f373f40d7b4b358ad46c3b9e4/FLAGf69dba0f0 [2019-11-15 23:52:35,629 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_7b5c45c3-52bb-4a6a-b359-85e12b5e9479/bin/uautomizer/data/3efcc8efe/60b36a4f373f40d7b4b358ad46c3b9e4 [2019-11-15 23:52:35,632 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:52:35,639 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 23:52:35,641 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:52:35,641 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:52:35,645 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:52:35,646 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:52:35" (1/1) ... [2019-11-15 23:52:35,649 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35a1eac9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:52:35, skipping insertion in model container [2019-11-15 23:52:35,649 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:52:35" (1/1) ... [2019-11-15 23:52:35,657 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:52:35,749 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:52:36,536 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:52:36,545 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:52:36,984 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:52:37,007 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:52:37,008 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:52:37 WrapperNode [2019-11-15 23:52:37,008 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:52:37,009 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 23:52:37,009 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 23:52:37,009 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 23:52:37,019 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:52:37" (1/1) ... [2019-11-15 23:52:37,065 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:52:37" (1/1) ... [2019-11-15 23:52:37,161 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 23:52:37,163 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:52:37,164 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:52:37,164 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:52:37,174 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:52:37" (1/1) ... [2019-11-15 23:52:37,175 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:52:37" (1/1) ... [2019-11-15 23:52:37,181 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:52:37" (1/1) ... [2019-11-15 23:52:37,181 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:52:37" (1/1) ... [2019-11-15 23:52:37,235 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:52:37" (1/1) ... [2019-11-15 23:52:37,261 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:52:37" (1/1) ... [2019-11-15 23:52:37,283 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:52:37" (1/1) ... [2019-11-15 23:52:37,297 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:52:37,297 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:52:37,297 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:52:37,298 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:52:37,299 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:52:37" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7b5c45c3-52bb-4a6a-b359-85e12b5e9479/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:52:37,362 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:52:37,363 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:52:39,652 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:52:39,652 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-15 23:52:39,653 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:52:39 BoogieIcfgContainer [2019-11-15 23:52:39,654 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:52:39,654 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 23:52:39,654 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 23:52:39,657 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 23:52:39,659 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 11:52:35" (1/3) ... [2019-11-15 23:52:39,660 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72f3dd55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:52:39, skipping insertion in model container [2019-11-15 23:52:39,661 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:52:37" (2/3) ... [2019-11-15 23:52:39,661 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72f3dd55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:52:39, skipping insertion in model container [2019-11-15 23:52:39,662 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:52:39" (3/3) ... [2019-11-15 23:52:39,663 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem03_label10.c [2019-11-15 23:52:39,672 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 23:52:39,681 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 23:52:39,691 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 23:52:39,729 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 23:52:39,729 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 23:52:39,730 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 23:52:39,730 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:52:39,730 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:52:39,730 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 23:52:39,730 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:52:39,731 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 23:52:39,756 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states. [2019-11-15 23:52:39,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-11-15 23:52:39,783 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:52:39,784 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:39,786 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:52:39,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:39,791 INFO L82 PathProgramCache]: Analyzing trace with hash 991324555, now seen corresponding path program 1 times [2019-11-15 23:52:39,798 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:39,799 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790662815] [2019-11-15 23:52:39,799 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:39,799 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:39,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:40,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:40,479 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:52:40,480 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790662815] [2019-11-15 23:52:40,480 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:52:40,481 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:52:40,482 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437276803] [2019-11-15 23:52:40,487 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:52:40,487 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:52:40,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:52:40,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:52:40,502 INFO L87 Difference]: Start difference. First operand 302 states. Second operand 4 states. [2019-11-15 23:52:42,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:52:42,745 INFO L93 Difference]: Finished difference Result 1075 states and 1929 transitions. [2019-11-15 23:52:42,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:52:42,746 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 181 [2019-11-15 23:52:42,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:52:42,765 INFO L225 Difference]: With dead ends: 1075 [2019-11-15 23:52:42,765 INFO L226 Difference]: Without dead ends: 677 [2019-11-15 23:52:42,770 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:52:42,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2019-11-15 23:52:42,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 451. [2019-11-15 23:52:42,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 451 states. [2019-11-15 23:52:42,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 700 transitions. [2019-11-15 23:52:42,841 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 700 transitions. Word has length 181 [2019-11-15 23:52:42,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:52:42,843 INFO L462 AbstractCegarLoop]: Abstraction has 451 states and 700 transitions. [2019-11-15 23:52:42,843 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:52:42,843 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 700 transitions. [2019-11-15 23:52:42,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-11-15 23:52:42,846 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:52:42,847 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:52:42,847 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:52:42,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:42,848 INFO L82 PathProgramCache]: Analyzing trace with hash -1803921076, now seen corresponding path program 1 times [2019-11-15 23:52:42,848 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:42,848 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158815843] [2019-11-15 23:52:42,848 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:42,849 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:42,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:42,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:42,964 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:52:42,965 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158815843] [2019-11-15 23:52:42,965 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:52:42,965 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:52:42,966 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354629210] [2019-11-15 23:52:42,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:52:42,969 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:52:42,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:52:42,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:52:42,970 INFO L87 Difference]: Start difference. First operand 451 states and 700 transitions. Second operand 3 states. [2019-11-15 23:52:43,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:52:43,943 INFO L93 Difference]: Finished difference Result 1323 states and 2069 transitions. [2019-11-15 23:52:43,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:52:43,944 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 189 [2019-11-15 23:52:43,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:52:43,950 INFO L225 Difference]: With dead ends: 1323 [2019-11-15 23:52:43,950 INFO L226 Difference]: Without dead ends: 874 [2019-11-15 23:52:43,952 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:52:43,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2019-11-15 23:52:44,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 859. [2019-11-15 23:52:44,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 859 states. [2019-11-15 23:52:44,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 859 states to 859 states and 1315 transitions. [2019-11-15 23:52:44,012 INFO L78 Accepts]: Start accepts. Automaton has 859 states and 1315 transitions. Word has length 189 [2019-11-15 23:52:44,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:52:44,015 INFO L462 AbstractCegarLoop]: Abstraction has 859 states and 1315 transitions. [2019-11-15 23:52:44,015 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:52:44,015 INFO L276 IsEmpty]: Start isEmpty. Operand 859 states and 1315 transitions. [2019-11-15 23:52:44,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-11-15 23:52:44,021 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:52:44,021 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:52:44,022 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:52:44,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:44,023 INFO L82 PathProgramCache]: Analyzing trace with hash -716075313, now seen corresponding path program 1 times [2019-11-15 23:52:44,023 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:44,024 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21574961] [2019-11-15 23:52:44,025 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:44,025 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:44,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:44,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:44,103 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:52:44,104 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21574961] [2019-11-15 23:52:44,104 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:52:44,104 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:52:44,104 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548297514] [2019-11-15 23:52:44,105 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:52:44,105 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:52:44,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:52:44,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:52:44,106 INFO L87 Difference]: Start difference. First operand 859 states and 1315 transitions. Second operand 3 states. [2019-11-15 23:52:44,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:52:44,617 INFO L93 Difference]: Finished difference Result 1695 states and 2599 transitions. [2019-11-15 23:52:44,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:52:44,617 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 194 [2019-11-15 23:52:44,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:52:44,624 INFO L225 Difference]: With dead ends: 1695 [2019-11-15 23:52:44,624 INFO L226 Difference]: Without dead ends: 838 [2019-11-15 23:52:44,626 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:52:44,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2019-11-15 23:52:44,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 838. [2019-11-15 23:52:44,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 838 states. [2019-11-15 23:52:44,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1236 transitions. [2019-11-15 23:52:44,657 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1236 transitions. Word has length 194 [2019-11-15 23:52:44,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:52:44,657 INFO L462 AbstractCegarLoop]: Abstraction has 838 states and 1236 transitions. [2019-11-15 23:52:44,657 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:52:44,657 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1236 transitions. [2019-11-15 23:52:44,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-11-15 23:52:44,661 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:52:44,661 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:52:44,661 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:52:44,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:44,662 INFO L82 PathProgramCache]: Analyzing trace with hash -1122639935, now seen corresponding path program 1 times [2019-11-15 23:52:44,662 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:44,662 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699036643] [2019-11-15 23:52:44,662 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:44,663 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:44,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:44,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:44,769 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-15 23:52:44,769 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699036643] [2019-11-15 23:52:44,769 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:52:44,770 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:52:44,770 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661125951] [2019-11-15 23:52:44,770 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:52:44,771 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:52:44,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:52:44,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:52:44,772 INFO L87 Difference]: Start difference. First operand 838 states and 1236 transitions. Second operand 4 states. [2019-11-15 23:52:46,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:52:46,447 INFO L93 Difference]: Finished difference Result 3313 states and 4894 transitions. [2019-11-15 23:52:46,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:52:46,448 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 195 [2019-11-15 23:52:46,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:52:46,462 INFO L225 Difference]: With dead ends: 3313 [2019-11-15 23:52:46,462 INFO L226 Difference]: Without dead ends: 2477 [2019-11-15 23:52:46,464 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:52:46,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2477 states. [2019-11-15 23:52:46,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2477 to 1655. [2019-11-15 23:52:46,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1655 states. [2019-11-15 23:52:46,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1655 states to 1655 states and 2337 transitions. [2019-11-15 23:52:46,512 INFO L78 Accepts]: Start accepts. Automaton has 1655 states and 2337 transitions. Word has length 195 [2019-11-15 23:52:46,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:52:46,513 INFO L462 AbstractCegarLoop]: Abstraction has 1655 states and 2337 transitions. [2019-11-15 23:52:46,513 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:52:46,513 INFO L276 IsEmpty]: Start isEmpty. Operand 1655 states and 2337 transitions. [2019-11-15 23:52:46,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-11-15 23:52:46,518 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:52:46,518 INFO L380 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:46,518 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:52:46,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:46,519 INFO L82 PathProgramCache]: Analyzing trace with hash -331316582, now seen corresponding path program 1 times [2019-11-15 23:52:46,519 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:46,519 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002808688] [2019-11-15 23:52:46,519 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:46,520 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:46,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:46,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:46,603 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-15 23:52:46,604 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002808688] [2019-11-15 23:52:46,604 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:52:46,604 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:52:46,605 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382042463] [2019-11-15 23:52:46,605 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:52:46,606 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:52:46,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:52:46,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:52:46,607 INFO L87 Difference]: Start difference. First operand 1655 states and 2337 transitions. Second operand 3 states. [2019-11-15 23:52:47,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:52:47,660 INFO L93 Difference]: Finished difference Result 4133 states and 5815 transitions. [2019-11-15 23:52:47,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:52:47,661 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 198 [2019-11-15 23:52:47,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:52:47,675 INFO L225 Difference]: With dead ends: 4133 [2019-11-15 23:52:47,675 INFO L226 Difference]: Without dead ends: 2480 [2019-11-15 23:52:47,677 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:52:47,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2480 states. [2019-11-15 23:52:47,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2480 to 2479. [2019-11-15 23:52:47,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2479 states. [2019-11-15 23:52:47,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2479 states to 2479 states and 3454 transitions. [2019-11-15 23:52:47,737 INFO L78 Accepts]: Start accepts. Automaton has 2479 states and 3454 transitions. Word has length 198 [2019-11-15 23:52:47,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:52:47,737 INFO L462 AbstractCegarLoop]: Abstraction has 2479 states and 3454 transitions. [2019-11-15 23:52:47,737 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:52:47,737 INFO L276 IsEmpty]: Start isEmpty. Operand 2479 states and 3454 transitions. [2019-11-15 23:52:47,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-11-15 23:52:47,743 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:52:47,744 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:52:47,744 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:52:47,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:47,745 INFO L82 PathProgramCache]: Analyzing trace with hash -1798503547, now seen corresponding path program 1 times [2019-11-15 23:52:47,745 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:47,745 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828570352] [2019-11-15 23:52:47,745 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:47,746 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:47,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:47,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:47,827 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-15 23:52:47,828 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828570352] [2019-11-15 23:52:47,829 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:52:47,829 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:52:47,829 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203297435] [2019-11-15 23:52:47,830 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:52:47,830 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:52:47,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:52:47,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:52:47,830 INFO L87 Difference]: Start difference. First operand 2479 states and 3454 transitions. Second operand 3 states. [2019-11-15 23:52:48,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:52:48,260 INFO L93 Difference]: Finished difference Result 7424 states and 10346 transitions. [2019-11-15 23:52:48,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:52:48,260 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 201 [2019-11-15 23:52:48,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:52:48,286 INFO L225 Difference]: With dead ends: 7424 [2019-11-15 23:52:48,286 INFO L226 Difference]: Without dead ends: 4947 [2019-11-15 23:52:48,290 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:52:48,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4947 states. [2019-11-15 23:52:48,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4947 to 4945. [2019-11-15 23:52:48,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4945 states. [2019-11-15 23:52:48,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4945 states to 4945 states and 6884 transitions. [2019-11-15 23:52:48,396 INFO L78 Accepts]: Start accepts. Automaton has 4945 states and 6884 transitions. Word has length 201 [2019-11-15 23:52:48,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:52:48,396 INFO L462 AbstractCegarLoop]: Abstraction has 4945 states and 6884 transitions. [2019-11-15 23:52:48,397 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:52:48,397 INFO L276 IsEmpty]: Start isEmpty. Operand 4945 states and 6884 transitions. [2019-11-15 23:52:48,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-11-15 23:52:48,407 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:52:48,407 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:48,408 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:52:48,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:48,409 INFO L82 PathProgramCache]: Analyzing trace with hash -1112433142, now seen corresponding path program 1 times [2019-11-15 23:52:48,409 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:48,409 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893853342] [2019-11-15 23:52:48,410 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:48,410 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:48,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:48,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:48,495 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-15 23:52:48,495 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893853342] [2019-11-15 23:52:48,496 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:52:48,496 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:52:48,496 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991016887] [2019-11-15 23:52:48,497 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:52:48,497 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:52:48,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:52:48,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:52:48,497 INFO L87 Difference]: Start difference. First operand 4945 states and 6884 transitions. Second operand 3 states. [2019-11-15 23:52:49,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:52:49,454 INFO L93 Difference]: Finished difference Result 14560 states and 20285 transitions. [2019-11-15 23:52:49,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:52:49,454 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 203 [2019-11-15 23:52:49,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:52:49,506 INFO L225 Difference]: With dead ends: 14560 [2019-11-15 23:52:49,507 INFO L226 Difference]: Without dead ends: 9617 [2019-11-15 23:52:49,514 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:52:49,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9617 states. [2019-11-15 23:52:49,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9617 to 9615. [2019-11-15 23:52:49,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9615 states. [2019-11-15 23:52:49,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9615 states to 9615 states and 12497 transitions. [2019-11-15 23:52:49,784 INFO L78 Accepts]: Start accepts. Automaton has 9615 states and 12497 transitions. Word has length 203 [2019-11-15 23:52:49,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:52:49,785 INFO L462 AbstractCegarLoop]: Abstraction has 9615 states and 12497 transitions. [2019-11-15 23:52:49,786 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:52:49,786 INFO L276 IsEmpty]: Start isEmpty. Operand 9615 states and 12497 transitions. [2019-11-15 23:52:49,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-11-15 23:52:49,797 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:52:49,798 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:49,798 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:52:49,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:49,798 INFO L82 PathProgramCache]: Analyzing trace with hash 579998981, now seen corresponding path program 2 times [2019-11-15 23:52:49,798 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:49,799 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321651546] [2019-11-15 23:52:49,799 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:49,799 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:49,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:49,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:49,876 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-15 23:52:49,876 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321651546] [2019-11-15 23:52:49,877 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:52:49,877 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:52:49,877 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412264041] [2019-11-15 23:52:49,878 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:52:49,878 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:52:49,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:52:49,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:52:49,878 INFO L87 Difference]: Start difference. First operand 9615 states and 12497 transitions. Second operand 3 states. [2019-11-15 23:52:50,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:52:50,878 INFO L93 Difference]: Finished difference Result 26540 states and 34570 transitions. [2019-11-15 23:52:50,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:52:50,878 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 205 [2019-11-15 23:52:50,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:52:50,929 INFO L225 Difference]: With dead ends: 26540 [2019-11-15 23:52:50,929 INFO L226 Difference]: Without dead ends: 16927 [2019-11-15 23:52:50,942 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:52:50,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16927 states. [2019-11-15 23:52:51,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16927 to 16923. [2019-11-15 23:52:51,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16923 states. [2019-11-15 23:52:51,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16923 states to 16923 states and 20100 transitions. [2019-11-15 23:52:51,202 INFO L78 Accepts]: Start accepts. Automaton has 16923 states and 20100 transitions. Word has length 205 [2019-11-15 23:52:51,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:52:51,202 INFO L462 AbstractCegarLoop]: Abstraction has 16923 states and 20100 transitions. [2019-11-15 23:52:51,202 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:52:51,202 INFO L276 IsEmpty]: Start isEmpty. Operand 16923 states and 20100 transitions. [2019-11-15 23:52:51,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-11-15 23:52:51,223 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:52:51,224 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:52:51,224 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:52:51,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:51,224 INFO L82 PathProgramCache]: Analyzing trace with hash -942107321, now seen corresponding path program 1 times [2019-11-15 23:52:51,225 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:51,225 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586977260] [2019-11-15 23:52:51,225 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:51,225 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:51,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:51,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:51,406 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:52:51,407 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586977260] [2019-11-15 23:52:51,407 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:52:51,408 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:52:51,408 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441068533] [2019-11-15 23:52:51,408 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:52:51,409 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:52:51,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:52:51,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:52:51,409 INFO L87 Difference]: Start difference. First operand 16923 states and 20100 transitions. Second operand 5 states. [2019-11-15 23:52:53,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:52:53,328 INFO L93 Difference]: Finished difference Result 35285 states and 41994 transitions. [2019-11-15 23:52:53,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:52:53,329 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 219 [2019-11-15 23:52:53,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:52:53,362 INFO L225 Difference]: With dead ends: 35285 [2019-11-15 23:52:53,362 INFO L226 Difference]: Without dead ends: 18364 [2019-11-15 23:52:53,378 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:52:53,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18364 states. [2019-11-15 23:52:53,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18364 to 17532. [2019-11-15 23:52:53,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17532 states. [2019-11-15 23:52:53,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17532 states to 17532 states and 20720 transitions. [2019-11-15 23:52:53,608 INFO L78 Accepts]: Start accepts. Automaton has 17532 states and 20720 transitions. Word has length 219 [2019-11-15 23:52:53,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:52:53,609 INFO L462 AbstractCegarLoop]: Abstraction has 17532 states and 20720 transitions. [2019-11-15 23:52:53,609 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:52:53,609 INFO L276 IsEmpty]: Start isEmpty. Operand 17532 states and 20720 transitions. [2019-11-15 23:52:53,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2019-11-15 23:52:53,628 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:52:53,629 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:53,632 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:52:53,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:53,633 INFO L82 PathProgramCache]: Analyzing trace with hash -765401032, now seen corresponding path program 1 times [2019-11-15 23:52:53,633 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:53,634 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082824913] [2019-11-15 23:52:53,635 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:53,635 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:53,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:53,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:53,744 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-15 23:52:53,744 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082824913] [2019-11-15 23:52:53,745 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:52:53,745 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:52:53,746 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868459275] [2019-11-15 23:52:53,747 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:52:53,747 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:52:53,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:52:53,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:52:53,748 INFO L87 Difference]: Start difference. First operand 17532 states and 20720 transitions. Second operand 4 states. [2019-11-15 23:52:54,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:52:54,836 INFO L93 Difference]: Finished difference Result 35064 states and 41442 transitions. [2019-11-15 23:52:54,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:52:54,837 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 223 [2019-11-15 23:52:54,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:52:54,864 INFO L225 Difference]: With dead ends: 35064 [2019-11-15 23:52:54,864 INFO L226 Difference]: Without dead ends: 17534 [2019-11-15 23:52:54,888 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:52:54,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17534 states. [2019-11-15 23:52:55,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17534 to 17532. [2019-11-15 23:52:55,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17532 states. [2019-11-15 23:52:55,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17532 states to 17532 states and 20181 transitions. [2019-11-15 23:52:55,310 INFO L78 Accepts]: Start accepts. Automaton has 17532 states and 20181 transitions. Word has length 223 [2019-11-15 23:52:55,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:52:55,310 INFO L462 AbstractCegarLoop]: Abstraction has 17532 states and 20181 transitions. [2019-11-15 23:52:55,310 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:52:55,310 INFO L276 IsEmpty]: Start isEmpty. Operand 17532 states and 20181 transitions. [2019-11-15 23:52:55,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-11-15 23:52:55,328 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:52:55,328 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:52:55,328 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:52:55,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:55,329 INFO L82 PathProgramCache]: Analyzing trace with hash -1099774521, now seen corresponding path program 1 times [2019-11-15 23:52:55,329 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:55,329 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144485067] [2019-11-15 23:52:55,330 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:55,330 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:55,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:55,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:55,524 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 50 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:52:55,525 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144485067] [2019-11-15 23:52:55,525 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1305394764] [2019-11-15 23:52:55,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7b5c45c3-52bb-4a6a-b359-85e12b5e9479/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:52:55,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:55,654 INFO L256 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 23:52:55,676 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:52:55,750 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-15 23:52:55,750 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 23:52:55,750 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2019-11-15 23:52:55,751 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275100159] [2019-11-15 23:52:55,751 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:52:55,751 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:52:55,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:52:55,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:52:55,752 INFO L87 Difference]: Start difference. First operand 17532 states and 20181 transitions. Second operand 3 states. [2019-11-15 23:52:56,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:52:56,798 INFO L93 Difference]: Finished difference Result 34660 states and 39922 transitions. [2019-11-15 23:52:56,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:52:56,798 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 229 [2019-11-15 23:52:56,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:52:56,816 INFO L225 Difference]: With dead ends: 34660 [2019-11-15 23:52:56,816 INFO L226 Difference]: Without dead ends: 17130 [2019-11-15 23:52:56,826 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:52:56,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17130 states. [2019-11-15 23:52:56,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17130 to 16314. [2019-11-15 23:52:56,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16314 states. [2019-11-15 23:52:56,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16314 states to 16314 states and 18381 transitions. [2019-11-15 23:52:56,996 INFO L78 Accepts]: Start accepts. Automaton has 16314 states and 18381 transitions. Word has length 229 [2019-11-15 23:52:56,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:52:56,997 INFO L462 AbstractCegarLoop]: Abstraction has 16314 states and 18381 transitions. [2019-11-15 23:52:56,997 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:52:56,997 INFO L276 IsEmpty]: Start isEmpty. Operand 16314 states and 18381 transitions. [2019-11-15 23:52:57,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-11-15 23:52:57,027 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:52:57,028 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:57,240 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:52:57,240 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:52:57,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:57,245 INFO L82 PathProgramCache]: Analyzing trace with hash -1221063350, now seen corresponding path program 1 times [2019-11-15 23:52:57,245 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:57,245 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464198047] [2019-11-15 23:52:57,245 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:57,245 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:57,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:57,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:57,467 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 76 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-15 23:52:57,467 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464198047] [2019-11-15 23:52:57,468 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1142356405] [2019-11-15 23:52:57,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7b5c45c3-52bb-4a6a-b359-85e12b5e9479/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:52:57,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:57,641 INFO L256 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 23:52:57,660 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:52:57,950 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-15 23:52:57,951 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 23:52:57,951 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2019-11-15 23:52:57,951 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931336229] [2019-11-15 23:52:57,952 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:52:57,952 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:52:57,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:52:57,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:52:57,953 INFO L87 Difference]: Start difference. First operand 16314 states and 18381 transitions. Second operand 3 states. [2019-11-15 23:52:58,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:52:58,442 INFO L93 Difference]: Finished difference Result 47676 states and 53681 transitions. [2019-11-15 23:52:58,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:52:58,442 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 258 [2019-11-15 23:52:58,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:52:58,472 INFO L225 Difference]: With dead ends: 47676 [2019-11-15 23:52:58,472 INFO L226 Difference]: Without dead ends: 31364 [2019-11-15 23:52:58,485 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 257 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:52:58,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31364 states. [2019-11-15 23:52:58,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31364 to 31362. [2019-11-15 23:52:58,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31362 states. [2019-11-15 23:52:58,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31362 states to 31362 states and 35287 transitions. [2019-11-15 23:52:58,820 INFO L78 Accepts]: Start accepts. Automaton has 31362 states and 35287 transitions. Word has length 258 [2019-11-15 23:52:58,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:52:58,820 INFO L462 AbstractCegarLoop]: Abstraction has 31362 states and 35287 transitions. [2019-11-15 23:52:58,820 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:52:58,821 INFO L276 IsEmpty]: Start isEmpty. Operand 31362 states and 35287 transitions. [2019-11-15 23:52:58,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2019-11-15 23:52:58,847 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:52:58,847 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:52:59,053 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:52:59,054 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:52:59,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:59,054 INFO L82 PathProgramCache]: Analyzing trace with hash 1710674889, now seen corresponding path program 1 times [2019-11-15 23:52:59,054 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:59,054 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842835564] [2019-11-15 23:52:59,055 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:59,055 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:59,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:59,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:59,249 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-15 23:52:59,250 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842835564] [2019-11-15 23:52:59,250 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:52:59,250 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:52:59,250 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601823291] [2019-11-15 23:52:59,251 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:52:59,251 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:52:59,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:52:59,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:52:59,252 INFO L87 Difference]: Start difference. First operand 31362 states and 35287 transitions. Second operand 4 states. [2019-11-15 23:53:00,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:53:00,481 INFO L93 Difference]: Finished difference Result 88385 states and 99396 transitions. [2019-11-15 23:53:00,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:53:00,482 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 281 [2019-11-15 23:53:00,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:53:00,531 INFO L225 Difference]: With dead ends: 88385 [2019-11-15 23:53:00,531 INFO L226 Difference]: Without dead ends: 57025 [2019-11-15 23:53:00,548 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:53:00,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57025 states. [2019-11-15 23:53:01,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57025 to 57023. [2019-11-15 23:53:01,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57023 states. [2019-11-15 23:53:01,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57023 states to 57023 states and 64060 transitions. [2019-11-15 23:53:01,086 INFO L78 Accepts]: Start accepts. Automaton has 57023 states and 64060 transitions. Word has length 281 [2019-11-15 23:53:01,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:53:01,086 INFO L462 AbstractCegarLoop]: Abstraction has 57023 states and 64060 transitions. [2019-11-15 23:53:01,086 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:53:01,086 INFO L276 IsEmpty]: Start isEmpty. Operand 57023 states and 64060 transitions. [2019-11-15 23:53:01,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2019-11-15 23:53:01,111 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:53:01,111 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-15 23:53:01,112 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:53:01,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:53:01,112 INFO L82 PathProgramCache]: Analyzing trace with hash -625354885, now seen corresponding path program 1 times [2019-11-15 23:53:01,113 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:53:01,113 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719648932] [2019-11-15 23:53:01,113 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:53:01,113 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:53:01,114 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:53:01,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:53:01,354 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-11-15 23:53:01,355 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719648932] [2019-11-15 23:53:01,355 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:53:01,356 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:53:01,356 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391433808] [2019-11-15 23:53:01,356 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:53:01,357 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:53:01,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:53:01,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:53:01,357 INFO L87 Difference]: Start difference. First operand 57023 states and 64060 transitions. Second operand 3 states. [2019-11-15 23:53:02,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:53:02,063 INFO L93 Difference]: Finished difference Result 150649 states and 168878 transitions. [2019-11-15 23:53:02,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:53:02,063 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 332 [2019-11-15 23:53:02,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:53:02,176 INFO L225 Difference]: With dead ends: 150649 [2019-11-15 23:53:02,176 INFO L226 Difference]: Without dead ends: 93628 [2019-11-15 23:53:02,207 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:53:02,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93628 states. [2019-11-15 23:53:03,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93628 to 93626. [2019-11-15 23:53:03,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93626 states. [2019-11-15 23:53:03,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93626 states to 93626 states and 104802 transitions. [2019-11-15 23:53:03,604 INFO L78 Accepts]: Start accepts. Automaton has 93626 states and 104802 transitions. Word has length 332 [2019-11-15 23:53:03,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:53:03,604 INFO L462 AbstractCegarLoop]: Abstraction has 93626 states and 104802 transitions. [2019-11-15 23:53:03,604 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:53:03,604 INFO L276 IsEmpty]: Start isEmpty. Operand 93626 states and 104802 transitions. [2019-11-15 23:53:03,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2019-11-15 23:53:03,644 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:53:03,645 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-15 23:53:03,645 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:53:03,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:53:03,646 INFO L82 PathProgramCache]: Analyzing trace with hash -2069549447, now seen corresponding path program 1 times [2019-11-15 23:53:03,646 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:53:03,646 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659490564] [2019-11-15 23:53:03,647 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:53:03,647 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:53:03,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:53:03,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:53:03,779 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2019-11-15 23:53:03,779 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659490564] [2019-11-15 23:53:03,779 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:53:03,780 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:53:03,780 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033320186] [2019-11-15 23:53:03,780 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:53:03,781 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:53:03,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:53:03,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:53:03,781 INFO L87 Difference]: Start difference. First operand 93626 states and 104802 transitions. Second operand 4 states. [2019-11-15 23:53:05,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:53:05,922 INFO L93 Difference]: Finished difference Result 206331 states and 232381 transitions. [2019-11-15 23:53:05,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:53:05,922 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 344 [2019-11-15 23:53:05,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:53:06,023 INFO L225 Difference]: With dead ends: 206331 [2019-11-15 23:53:06,023 INFO L226 Difference]: Without dead ends: 112707 [2019-11-15 23:53:06,057 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:53:06,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112707 states. [2019-11-15 23:53:07,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112707 to 112691. [2019-11-15 23:53:07,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112691 states. [2019-11-15 23:53:07,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112691 states to 112691 states and 123941 transitions. [2019-11-15 23:53:07,141 INFO L78 Accepts]: Start accepts. Automaton has 112691 states and 123941 transitions. Word has length 344 [2019-11-15 23:53:07,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:53:07,141 INFO L462 AbstractCegarLoop]: Abstraction has 112691 states and 123941 transitions. [2019-11-15 23:53:07,142 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:53:07,142 INFO L276 IsEmpty]: Start isEmpty. Operand 112691 states and 123941 transitions. [2019-11-15 23:53:07,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2019-11-15 23:53:07,169 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:53:07,170 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:07,170 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:53:07,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:53:07,170 INFO L82 PathProgramCache]: Analyzing trace with hash 1140434467, now seen corresponding path program 1 times [2019-11-15 23:53:07,170 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:53:07,171 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420368425] [2019-11-15 23:53:07,171 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:53:07,171 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:53:07,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:53:07,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:53:07,570 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 226 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2019-11-15 23:53:07,570 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420368425] [2019-11-15 23:53:07,570 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:53:07,571 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:53:07,571 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829216870] [2019-11-15 23:53:07,571 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:53:07,572 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:53:07,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:53:07,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:53:07,572 INFO L87 Difference]: Start difference. First operand 112691 states and 123941 transitions. Second operand 3 states. [2019-11-15 23:53:09,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:53:09,640 INFO L93 Difference]: Finished difference Result 244323 states and 269032 transitions. [2019-11-15 23:53:09,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:53:09,640 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 408 [2019-11-15 23:53:09,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:53:09,641 INFO L225 Difference]: With dead ends: 244323 [2019-11-15 23:53:09,641 INFO L226 Difference]: Without dead ends: 0 [2019-11-15 23:53:09,693 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:53:09,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-15 23:53:09,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-15 23:53:09,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-15 23:53:09,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 23:53:09,693 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 408 [2019-11-15 23:53:09,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:53:09,694 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:53:09,694 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:53:09,694 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-15 23:53:09,694 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-15 23:53:09,697 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-15 23:53:11,428 WARN L191 SmtUtils]: Spent 1.72 s on a formula simplification. DAG size of input: 672 DAG size of output: 172 [2019-11-15 23:53:14,364 WARN L191 SmtUtils]: Spent 2.93 s on a formula simplification. DAG size of input: 672 DAG size of output: 172 [2019-11-15 23:53:16,185 WARN L191 SmtUtils]: Spent 1.82 s on a formula simplification. DAG size of input: 172 DAG size of output: 86 [2019-11-15 23:53:17,660 WARN L191 SmtUtils]: Spent 1.47 s on a formula simplification. DAG size of input: 172 DAG size of output: 86 [2019-11-15 23:53:17,661 INFO L443 ceAbstractionStarter]: For program point L498(lines 498 511) no Hoare annotation was computed. [2019-11-15 23:53:17,662 INFO L443 ceAbstractionStarter]: For program point L498-2(lines 498 511) no Hoare annotation was computed. [2019-11-15 23:53:17,662 INFO L443 ceAbstractionStarter]: For program point L1423(lines 1423 1465) no Hoare annotation was computed. [2019-11-15 23:53:17,662 INFO L443 ceAbstractionStarter]: For program point L366(lines 366 1465) no Hoare annotation was computed. [2019-11-15 23:53:17,662 INFO L443 ceAbstractionStarter]: For program point L1622-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 23:53:17,662 INFO L443 ceAbstractionStarter]: For program point L1556-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 23:53:17,662 INFO L443 ceAbstractionStarter]: For program point L1490-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 23:53:17,662 INFO L443 ceAbstractionStarter]: For program point L301(lines 301 1465) no Hoare annotation was computed. [2019-11-15 23:53:17,662 INFO L443 ceAbstractionStarter]: For program point L1226(lines 1226 1465) no Hoare annotation was computed. [2019-11-15 23:53:17,662 INFO L443 ceAbstractionStarter]: For program point L1623(line 1623) no Hoare annotation was computed. [2019-11-15 23:53:17,662 INFO L443 ceAbstractionStarter]: For program point L566(lines 566 1465) no Hoare annotation was computed. [2019-11-15 23:53:17,662 INFO L443 ceAbstractionStarter]: For program point L1557(line 1557) no Hoare annotation was computed. [2019-11-15 23:53:17,662 INFO L443 ceAbstractionStarter]: For program point L1491(line 1491) no Hoare annotation was computed. [2019-11-15 23:53:17,662 INFO L443 ceAbstractionStarter]: For program point L434(lines 434 1465) no Hoare annotation was computed. [2019-11-15 23:53:17,663 INFO L443 ceAbstractionStarter]: For program point L1359(lines 1359 1465) no Hoare annotation was computed. [2019-11-15 23:53:17,663 INFO L443 ceAbstractionStarter]: For program point L1095(lines 1095 1465) no Hoare annotation was computed. [2019-11-15 23:53:17,663 INFO L443 ceAbstractionStarter]: For program point L633(lines 633 1465) no Hoare annotation was computed. [2019-11-15 23:53:17,663 INFO L443 ceAbstractionStarter]: For program point L1360(lines 1360 1379) no Hoare annotation was computed. [2019-11-15 23:53:17,663 INFO L443 ceAbstractionStarter]: For program point L1360-2(lines 1360 1379) no Hoare annotation was computed. [2019-11-15 23:53:17,663 INFO L443 ceAbstractionStarter]: For program point L1162(lines 1162 1465) no Hoare annotation was computed. [2019-11-15 23:53:17,663 INFO L443 ceAbstractionStarter]: For program point L105(lines 105 1465) no Hoare annotation was computed. [2019-11-15 23:53:17,663 INFO L443 ceAbstractionStarter]: For program point L1625-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 23:53:17,663 INFO L443 ceAbstractionStarter]: For program point L1559-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 23:53:17,663 INFO L443 ceAbstractionStarter]: For program point L1493-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 23:53:17,663 INFO L443 ceAbstractionStarter]: For program point L238(lines 238 1465) no Hoare annotation was computed. [2019-11-15 23:53:17,664 INFO L443 ceAbstractionStarter]: For program point L172(lines 172 1465) no Hoare annotation was computed. [2019-11-15 23:53:17,664 INFO L443 ceAbstractionStarter]: For program point L1031(lines 1031 1465) no Hoare annotation was computed. [2019-11-15 23:53:17,664 INFO L443 ceAbstractionStarter]: For program point L899(lines 899 1465) no Hoare annotation was computed. [2019-11-15 23:53:17,664 INFO L443 ceAbstractionStarter]: For program point L701(lines 701 1465) no Hoare annotation was computed. [2019-11-15 23:53:17,664 INFO L443 ceAbstractionStarter]: For program point L1626(line 1626) no Hoare annotation was computed. [2019-11-15 23:53:17,664 INFO L443 ceAbstractionStarter]: For program point L1560(line 1560) no Hoare annotation was computed. [2019-11-15 23:53:17,664 INFO L443 ceAbstractionStarter]: For program point L1494(line 1494) no Hoare annotation was computed. [2019-11-15 23:53:17,664 INFO L443 ceAbstractionStarter]: For program point L966(lines 966 1465) no Hoare annotation was computed. [2019-11-15 23:53:17,664 INFO L443 ceAbstractionStarter]: For program point L769(lines 769 1465) no Hoare annotation was computed. [2019-11-15 23:53:17,664 INFO L443 ceAbstractionStarter]: For program point L1628-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 23:53:17,664 INFO L443 ceAbstractionStarter]: For program point L1562-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 23:53:17,664 INFO L443 ceAbstractionStarter]: For program point L1496-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 23:53:17,664 INFO L443 ceAbstractionStarter]: For program point L836(lines 836 1465) no Hoare annotation was computed. [2019-11-15 23:53:17,664 INFO L443 ceAbstractionStarter]: For program point L1629(line 1629) no Hoare annotation was computed. [2019-11-15 23:53:17,664 INFO L443 ceAbstractionStarter]: For program point L1563(line 1563) no Hoare annotation was computed. [2019-11-15 23:53:17,664 INFO L443 ceAbstractionStarter]: For program point L1497(line 1497) no Hoare annotation was computed. [2019-11-15 23:53:17,664 INFO L443 ceAbstractionStarter]: For program point L441(lines 441 1465) no Hoare annotation was computed. [2019-11-15 23:53:17,664 INFO L443 ceAbstractionStarter]: For program point L1432(lines 1432 1465) no Hoare annotation was computed. [2019-11-15 23:53:17,665 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 1578) no Hoare annotation was computed. [2019-11-15 23:53:17,665 INFO L443 ceAbstractionStarter]: For program point L574(lines 574 1465) no Hoare annotation was computed. [2019-11-15 23:53:17,665 INFO L443 ceAbstractionStarter]: For program point L1631-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 23:53:17,665 INFO L443 ceAbstractionStarter]: For program point L1565-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 23:53:17,665 INFO L443 ceAbstractionStarter]: For program point L1499-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 23:53:17,665 INFO L443 ceAbstractionStarter]: For program point L1632(line 1632) no Hoare annotation was computed. [2019-11-15 23:53:17,665 INFO L443 ceAbstractionStarter]: For program point L1566(line 1566) no Hoare annotation was computed. [2019-11-15 23:53:17,665 INFO L443 ceAbstractionStarter]: For program point L1500(line 1500) no Hoare annotation was computed. [2019-11-15 23:53:17,665 INFO L443 ceAbstractionStarter]: For program point L377(lines 377 1465) no Hoare annotation was computed. [2019-11-15 23:53:17,665 INFO L443 ceAbstractionStarter]: For program point L1104(lines 1104 1465) no Hoare annotation was computed. [2019-11-15 23:53:17,665 INFO L443 ceAbstractionStarter]: For program point L1038(lines 1038 1465) no Hoare annotation was computed. [2019-11-15 23:53:17,665 INFO L443 ceAbstractionStarter]: For program point L378(lines 378 395) no Hoare annotation was computed. [2019-11-15 23:53:17,666 INFO L443 ceAbstractionStarter]: For program point L312(lines 312 1465) no Hoare annotation was computed. [2019-11-15 23:53:17,666 INFO L443 ceAbstractionStarter]: For program point L378-2(lines 378 395) no Hoare annotation was computed. [2019-11-15 23:53:17,666 INFO L443 ceAbstractionStarter]: For program point L1237(lines 1237 1465) no Hoare annotation was computed. [2019-11-15 23:53:17,666 INFO L443 ceAbstractionStarter]: For program point L114(lines 114 1465) no Hoare annotation was computed. [2019-11-15 23:53:17,666 INFO L443 ceAbstractionStarter]: For program point L1039(lines 1039 1059) no Hoare annotation was computed. [2019-11-15 23:53:17,666 INFO L443 ceAbstractionStarter]: For program point L1039-2(lines 1039 1059) no Hoare annotation was computed. [2019-11-15 23:53:17,666 INFO L443 ceAbstractionStarter]: For program point L907(lines 907 1465) no Hoare annotation was computed. [2019-11-15 23:53:17,666 INFO L443 ceAbstractionStarter]: For program point L709(lines 709 1465) no Hoare annotation was computed. [2019-11-15 23:53:17,666 INFO L443 ceAbstractionStarter]: For program point L643(lines 643 1465) no Hoare annotation was computed. [2019-11-15 23:53:17,666 INFO L443 ceAbstractionStarter]: For program point L1634-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 23:53:17,666 INFO L443 ceAbstractionStarter]: For program point L1568-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 23:53:17,666 INFO L443 ceAbstractionStarter]: For program point L1502-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 23:53:17,667 INFO L443 ceAbstractionStarter]: For program point L181(lines 181 1465) no Hoare annotation was computed. [2019-11-15 23:53:17,667 INFO L443 ceAbstractionStarter]: For program point L710(lines 710 731) no Hoare annotation was computed. [2019-11-15 23:53:17,667 INFO L443 ceAbstractionStarter]: For program point L710-2(lines 710 731) no Hoare annotation was computed. [2019-11-15 23:53:17,667 INFO L443 ceAbstractionStarter]: For program point L1635(line 1635) no Hoare annotation was computed. [2019-11-15 23:53:17,667 INFO L443 ceAbstractionStarter]: For program point L1569(line 1569) no Hoare annotation was computed. [2019-11-15 23:53:17,667 INFO L443 ceAbstractionStarter]: For program point L1503(line 1503) no Hoare annotation was computed. [2019-11-15 23:53:17,667 INFO L443 ceAbstractionStarter]: For program point L1305(lines 1305 1465) no Hoare annotation was computed. [2019-11-15 23:53:17,667 INFO L443 ceAbstractionStarter]: For program point L248(lines 248 1465) no Hoare annotation was computed. [2019-11-15 23:53:17,667 INFO L443 ceAbstractionStarter]: For program point L1173(lines 1173 1465) no Hoare annotation was computed. [2019-11-15 23:53:17,667 INFO L443 ceAbstractionStarter]: For program point L975(lines 975 1465) no Hoare annotation was computed. [2019-11-15 23:53:17,667 INFO L443 ceAbstractionStarter]: For program point L777(lines 777 1465) no Hoare annotation was computed. [2019-11-15 23:53:17,668 INFO L443 ceAbstractionStarter]: For program point L513(lines 513 1465) no Hoare annotation was computed. [2019-11-15 23:53:17,668 INFO L443 ceAbstractionStarter]: For program point L844(lines 844 1465) no Hoare annotation was computed. [2019-11-15 23:53:17,668 INFO L443 ceAbstractionStarter]: For program point L1637-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 23:53:17,668 INFO L443 ceAbstractionStarter]: For program point L1571-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 23:53:17,668 INFO L443 ceAbstractionStarter]: For program point L1505-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 23:53:17,668 INFO L443 ceAbstractionStarter]: For program point L1638(line 1638) no Hoare annotation was computed. [2019-11-15 23:53:17,668 INFO L443 ceAbstractionStarter]: For program point L1572(line 1572) no Hoare annotation was computed. [2019-11-15 23:53:17,668 INFO L443 ceAbstractionStarter]: For program point L1506(line 1506) no Hoare annotation was computed. [2019-11-15 23:53:17,668 INFO L443 ceAbstractionStarter]: For program point L450(lines 450 1465) no Hoare annotation was computed. [2019-11-15 23:53:17,668 INFO L443 ceAbstractionStarter]: For program point L583(lines 583 1465) no Hoare annotation was computed. [2019-11-15 23:53:17,668 INFO L443 ceAbstractionStarter]: For program point L1640-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 23:53:17,668 INFO L443 ceAbstractionStarter]: For program point L1574-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 23:53:17,669 INFO L443 ceAbstractionStarter]: For program point L1508-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 23:53:17,669 INFO L443 ceAbstractionStarter]: For program point L1442(lines 1442 1465) no Hoare annotation was computed. [2019-11-15 23:53:17,669 INFO L443 ceAbstractionStarter]: For program point L319(lines 319 1465) no Hoare annotation was computed. [2019-11-15 23:53:17,669 INFO L443 ceAbstractionStarter]: For program point L1112(lines 1112 1465) no Hoare annotation was computed. [2019-11-15 23:53:17,669 INFO L443 ceAbstractionStarter]: For program point L55(lines 55 1465) no Hoare annotation was computed. [2019-11-15 23:53:17,669 INFO L443 ceAbstractionStarter]: For program point L1641(line 1641) no Hoare annotation was computed. [2019-11-15 23:53:17,669 INFO L443 ceAbstractionStarter]: For program point L1575(line 1575) no Hoare annotation was computed. [2019-11-15 23:53:17,669 INFO L443 ceAbstractionStarter]: For program point L1509(line 1509) no Hoare annotation was computed. [2019-11-15 23:53:17,669 INFO L443 ceAbstractionStarter]: For program point L56(lines 56 71) no Hoare annotation was computed. [2019-11-15 23:53:17,669 INFO L443 ceAbstractionStarter]: For program point L56-2(lines 56 71) no Hoare annotation was computed. [2019-11-15 23:53:17,669 INFO L443 ceAbstractionStarter]: For program point L784(lines 784 1465) no Hoare annotation was computed. [2019-11-15 23:53:17,669 INFO L443 ceAbstractionStarter]: For program point L1643-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 23:53:17,670 INFO L443 ceAbstractionStarter]: For program point L1577-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 23:53:17,670 INFO L443 ceAbstractionStarter]: For program point L1511-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 23:53:17,670 INFO L443 ceAbstractionStarter]: For program point L1313(lines 1313 1465) no Hoare annotation was computed. [2019-11-15 23:53:17,670 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-15 23:53:17,670 INFO L443 ceAbstractionStarter]: For program point L983(lines 983 1465) no Hoare annotation was computed. [2019-11-15 23:53:17,670 INFO L443 ceAbstractionStarter]: For program point L917(lines 917 1465) no Hoare annotation was computed. [2019-11-15 23:53:17,670 INFO L443 ceAbstractionStarter]: For program point L653(lines 653 1465) no Hoare annotation was computed. [2019-11-15 23:53:17,670 INFO L443 ceAbstractionStarter]: For program point L1644(line 1644) no Hoare annotation was computed. [2019-11-15 23:53:17,670 INFO L443 ceAbstractionStarter]: For program point L1578(line 1578) no Hoare annotation was computed. [2019-11-15 23:53:17,670 INFO L443 ceAbstractionStarter]: For program point L1512(line 1512) no Hoare annotation was computed. [2019-11-15 23:53:17,670 INFO L443 ceAbstractionStarter]: For program point L257(lines 257 1465) no Hoare annotation was computed. [2019-11-15 23:53:17,671 INFO L443 ceAbstractionStarter]: For program point L191(lines 191 1465) no Hoare annotation was computed. [2019-11-15 23:53:17,671 INFO L443 ceAbstractionStarter]: For program point L1182(lines 1182 1465) no Hoare annotation was computed. [2019-11-15 23:53:17,671 INFO L443 ceAbstractionStarter]: For program point L918(lines 918 935) no Hoare annotation was computed. [2019-11-15 23:53:17,671 INFO L443 ceAbstractionStarter]: For program point L918-2(lines 918 935) no Hoare annotation was computed. [2019-11-15 23:53:17,671 INFO L443 ceAbstractionStarter]: For program point L522(lines 522 1465) no Hoare annotation was computed. [2019-11-15 23:53:17,671 INFO L443 ceAbstractionStarter]: For program point L1381(lines 1381 1465) no Hoare annotation was computed. [2019-11-15 23:53:17,671 INFO L443 ceAbstractionStarter]: For program point L1249(lines 1249 1465) no Hoare annotation was computed. [2019-11-15 23:53:17,671 INFO L443 ceAbstractionStarter]: For program point L192(lines 192 211) no Hoare annotation was computed. [2019-11-15 23:53:17,671 INFO L443 ceAbstractionStarter]: For program point L126(lines 126 1465) no Hoare annotation was computed. [2019-11-15 23:53:17,671 INFO L443 ceAbstractionStarter]: For program point L192-2(lines 192 211) no Hoare annotation was computed. [2019-11-15 23:53:17,671 INFO L443 ceAbstractionStarter]: For program point L853(lines 853 1465) no Hoare annotation was computed. [2019-11-15 23:53:17,671 INFO L443 ceAbstractionStarter]: For program point L1646-1(lines 1646 1648) no Hoare annotation was computed. [2019-11-15 23:53:17,672 INFO L443 ceAbstractionStarter]: For program point L1580-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 23:53:17,672 INFO L443 ceAbstractionStarter]: For program point L1514-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 23:53:17,672 INFO L443 ceAbstractionStarter]: For program point L1382(lines 1382 1400) no Hoare annotation was computed. [2019-11-15 23:53:17,672 INFO L443 ceAbstractionStarter]: For program point L1382-2(lines 1382 1400) no Hoare annotation was computed. [2019-11-15 23:53:17,672 INFO L443 ceAbstractionStarter]: For program point L1250(lines 1250 1272) no Hoare annotation was computed. [2019-11-15 23:53:17,672 INFO L443 ceAbstractionStarter]: For program point L1250-2(lines 1250 1272) no Hoare annotation was computed. [2019-11-15 23:53:17,672 INFO L443 ceAbstractionStarter]: For program point L1647(line 1647) no Hoare annotation was computed. [2019-11-15 23:53:17,672 INFO L443 ceAbstractionStarter]: For program point L1581(line 1581) no Hoare annotation was computed. [2019-11-15 23:53:17,672 INFO L443 ceAbstractionStarter]: For program point L1515(line 1515) no Hoare annotation was computed. [2019-11-15 23:53:17,672 INFO L443 ceAbstractionStarter]: For program point L458(lines 458 1465) no Hoare annotation was computed. [2019-11-15 23:53:17,672 INFO L443 ceAbstractionStarter]: For program point L1120(lines 1120 1465) no Hoare annotation was computed. [2019-11-15 23:53:17,672 INFO L443 ceAbstractionStarter]: For program point L658(lines 658 1465) no Hoare annotation was computed. [2019-11-15 23:53:17,676 INFO L439 ceAbstractionStarter]: At program point L1649(lines 54 1650) the Hoare annotation is: (let ((.cse1 (= 1 ~a6~0))) (let ((.cse0 (not (= ~a12~0 1))) (.cse20 (not .cse1)) (.cse9 (= ~a27~0 1))) (let ((.cse2 (= ~a5~0 1)) (.cse17 (not .cse9)) (.cse3 (= ~a11~0 1)) (.cse19 (and .cse0 .cse20)) (.cse10 (= ~a16~0 1))) (let ((.cse15 (= 1 ~a3~0)) (.cse18 (and .cse17 .cse3 .cse19 .cse10)) (.cse14 (<= ~a27~0 0)) (.cse16 (and .cse9 .cse20)) (.cse11 (<= ~a3~0 0)) (.cse5 (and .cse0 .cse9 .cse20)) (.cse7 (not (= ~a7~0 1))) (.cse4 (= ~a26~0 1)) (.cse6 (= 1 ~a0~0)) (.cse13 (and .cse20 .cse2)) (.cse8 (<= ~a11~0 0)) (.cse12 (= 1 ~a4~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse2 .cse3 .cse6) (and .cse7 .cse8 .cse2 .cse4 .cse6) (and .cse9 .cse8 .cse2 .cse6 .cse10) (and .cse11 .cse2 .cse3 .cse4 .cse10 .cse12) (and .cse0 .cse7 .cse9 .cse1 .cse8 .cse2) (and .cse8 .cse4 .cse13 .cse12) (and .cse7 .cse8 .cse2 .cse4 .cse12) (and .cse8 .cse2 .cse4 .cse6 .cse10 .cse14) (and .cse9 .cse1 .cse2 .cse3 .cse4 .cse6 .cse10) (and .cse11 .cse8 .cse13) (and .cse3 .cse4 .cse13 .cse12) (and .cse15 .cse8 .cse6 .cse13) (and .cse7 .cse15 .cse5 .cse2 .cse3 .cse10) (and .cse0 .cse9 .cse15 .cse8 .cse2 .cse4) (and .cse11 .cse7 .cse16 .cse2 .cse3 .cse4 .cse10) (and .cse7 .cse15 .cse8 .cse2 .cse6 .cse12) (and .cse0 .cse1 .cse8 .cse2 .cse6) (and .cse7 .cse15 .cse1 .cse2 .cse3 .cse10 .cse14) (and .cse11 .cse5 .cse2 .cse3 .cse4 .cse10) (and .cse7 .cse8 .cse4 .cse13) (and .cse11 .cse2 .cse3 .cse4 .cse6 .cse10 .cse14) (and .cse3 .cse4 .cse6 .cse10 .cse13 .cse14) (and .cse11 .cse5 .cse2 .cse3 .cse12) (and (and .cse11 .cse17 .cse3 .cse10 .cse13) .cse4) (and .cse18 .cse2 .cse6) (and .cse8 .cse4 .cse6 .cse13) (and .cse11 .cse9 .cse8 .cse2 .cse4 .cse10) (and .cse7 .cse2 .cse3 .cse19 .cse6) (and .cse7 .cse1 .cse8 .cse2 .cse6 .cse10 .cse12 .cse14) (and .cse11 .cse16 .cse2 .cse3 .cse4 .cse6 .cse10) (and .cse11 .cse9 .cse1 .cse2 .cse3 .cse6) (and .cse11 .cse7 .cse2 .cse3 .cse4 .cse6) (and .cse8 .cse2 .cse4 .cse6 .cse10 .cse12) (and .cse7 .cse18 .cse2) (and .cse7 .cse5 .cse2 .cse3 .cse4) (and .cse7 .cse9 .cse1 .cse2 .cse3 .cse10 .cse12) (and .cse11 .cse7 .cse8 .cse2 .cse6 .cse10 .cse14) (and .cse16 .cse8 .cse2 .cse6) (and .cse7 .cse9 .cse8 .cse2 .cse6) (and .cse9 .cse1 .cse8 .cse2 .cse12) (and .cse11 .cse9 .cse1 .cse2 .cse3 .cse4) (and .cse11 .cse2 .cse3 .cse4 .cse6 .cse12) (and .cse11 .cse0 .cse9 .cse1 .cse2 .cse3) (and .cse5 .cse8 .cse2 .cse4) (and .cse0 .cse7 .cse8 .cse2 .cse4) (and .cse7 .cse3 .cse4 .cse6 .cse13) (and .cse0 .cse1 .cse8 .cse2 .cse12)))))) [2019-11-15 23:53:17,676 INFO L443 ceAbstractionStarter]: For program point L592(lines 592 1465) no Hoare annotation was computed. [2019-11-15 23:53:17,676 INFO L443 ceAbstractionStarter]: For program point L1583-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 23:53:17,677 INFO L443 ceAbstractionStarter]: For program point L1517-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 23:53:17,677 INFO L443 ceAbstractionStarter]: For program point L1584(line 1584) no Hoare annotation was computed. [2019-11-15 23:53:17,677 INFO L443 ceAbstractionStarter]: For program point L1518(line 1518) no Hoare annotation was computed. [2019-11-15 23:53:17,677 INFO L443 ceAbstractionStarter]: For program point L1452(lines 1452 1465) no Hoare annotation was computed. [2019-11-15 23:53:17,677 INFO L443 ceAbstractionStarter]: For program point L329(lines 329 1465) no Hoare annotation was computed. [2019-11-15 23:53:17,677 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-15 23:53:17,677 INFO L443 ceAbstractionStarter]: For program point L1321(lines 1321 1465) no Hoare annotation was computed. [2019-11-15 23:53:17,678 INFO L446 ceAbstractionStarter]: At program point L1652(lines 1652 1669) the Hoare annotation is: true [2019-11-15 23:53:17,678 INFO L443 ceAbstractionStarter]: For program point L529(lines 529 1465) no Hoare annotation was computed. [2019-11-15 23:53:17,678 INFO L443 ceAbstractionStarter]: For program point L1586-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 23:53:17,678 INFO L443 ceAbstractionStarter]: For program point L1520-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 23:53:17,678 INFO L443 ceAbstractionStarter]: For program point L397(lines 397 1465) no Hoare annotation was computed. [2019-11-15 23:53:17,678 INFO L443 ceAbstractionStarter]: For program point L265(lines 265 1465) no Hoare annotation was computed. [2019-11-15 23:53:17,678 INFO L443 ceAbstractionStarter]: For program point L1190(lines 1190 1465) no Hoare annotation was computed. [2019-11-15 23:53:17,679 INFO L443 ceAbstractionStarter]: For program point L1587(line 1587) no Hoare annotation was computed. [2019-11-15 23:53:17,679 INFO L443 ceAbstractionStarter]: For program point L1521(line 1521) no Hoare annotation was computed. [2019-11-15 23:53:17,679 INFO L443 ceAbstractionStarter]: For program point L795(lines 795 1465) no Hoare annotation was computed. [2019-11-15 23:53:17,679 INFO L443 ceAbstractionStarter]: For program point L135(lines 135 1465) no Hoare annotation was computed. [2019-11-15 23:53:17,679 INFO L443 ceAbstractionStarter]: For program point L994(lines 994 1465) no Hoare annotation was computed. [2019-11-15 23:53:17,679 INFO L443 ceAbstractionStarter]: For program point L1589-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 23:53:17,679 INFO L443 ceAbstractionStarter]: For program point L1523-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 23:53:17,680 INFO L443 ceAbstractionStarter]: For program point L1127(lines 1127 1465) no Hoare annotation was computed. [2019-11-15 23:53:17,680 INFO L443 ceAbstractionStarter]: For program point L1061(lines 1061 1465) no Hoare annotation was computed. [2019-11-15 23:53:17,680 INFO L443 ceAbstractionStarter]: For program point L863(lines 863 1465) no Hoare annotation was computed. [2019-11-15 23:53:17,680 INFO L443 ceAbstractionStarter]: For program point L665(lines 665 1465) no Hoare annotation was computed. [2019-11-15 23:53:17,680 INFO L443 ceAbstractionStarter]: For program point L1590(line 1590) no Hoare annotation was computed. [2019-11-15 23:53:17,680 INFO L443 ceAbstractionStarter]: For program point L1524(line 1524) no Hoare annotation was computed. [2019-11-15 23:53:17,680 INFO L443 ceAbstractionStarter]: For program point L467(lines 467 1465) no Hoare annotation was computed. [2019-11-15 23:53:17,681 INFO L443 ceAbstractionStarter]: For program point L1326(lines 1326 1465) no Hoare annotation was computed. [2019-11-15 23:53:17,681 INFO L443 ceAbstractionStarter]: For program point L468(lines 468 478) no Hoare annotation was computed. [2019-11-15 23:53:17,681 INFO L443 ceAbstractionStarter]: For program point L468-2(lines 468 478) no Hoare annotation was computed. [2019-11-15 23:53:17,681 INFO L443 ceAbstractionStarter]: For program point L733(lines 733 1465) no Hoare annotation was computed. [2019-11-15 23:53:17,682 INFO L439 ceAbstractionStarter]: At program point L1658-2(lines 1658 1668) the Hoare annotation is: (let ((.cse1 (= 1 ~a6~0))) (let ((.cse0 (not (= ~a12~0 1))) (.cse20 (not .cse1)) (.cse9 (= ~a27~0 1))) (let ((.cse2 (= ~a5~0 1)) (.cse17 (not .cse9)) (.cse3 (= ~a11~0 1)) (.cse19 (and .cse0 .cse20)) (.cse10 (= ~a16~0 1))) (let ((.cse15 (= 1 ~a3~0)) (.cse18 (and .cse17 .cse3 .cse19 .cse10)) (.cse14 (<= ~a27~0 0)) (.cse16 (and .cse9 .cse20)) (.cse11 (<= ~a3~0 0)) (.cse5 (and .cse0 .cse9 .cse20)) (.cse7 (not (= ~a7~0 1))) (.cse4 (= ~a26~0 1)) (.cse6 (= 1 ~a0~0)) (.cse13 (and .cse20 .cse2)) (.cse8 (<= ~a11~0 0)) (.cse12 (= 1 ~a4~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse2 .cse3 .cse6) (and .cse7 .cse8 .cse2 .cse4 .cse6) (and .cse9 .cse8 .cse2 .cse6 .cse10) (and .cse11 .cse2 .cse3 .cse4 .cse10 .cse12) (and .cse0 .cse7 .cse9 .cse1 .cse8 .cse2) (and .cse8 .cse4 .cse13 .cse12) (and .cse7 .cse8 .cse2 .cse4 .cse12) (and .cse8 .cse2 .cse4 .cse6 .cse10 .cse14) (and .cse9 .cse1 .cse2 .cse3 .cse4 .cse6 .cse10) (and .cse11 .cse8 .cse13) (and .cse3 .cse4 .cse13 .cse12) (and .cse15 .cse8 .cse6 .cse13) (and .cse7 .cse15 .cse5 .cse2 .cse3 .cse10) (and .cse0 .cse9 .cse15 .cse8 .cse2 .cse4) (and .cse11 .cse7 .cse16 .cse2 .cse3 .cse4 .cse10) (and .cse7 .cse15 .cse8 .cse2 .cse6 .cse12) (and .cse0 .cse1 .cse8 .cse2 .cse6) (and .cse7 .cse15 .cse1 .cse2 .cse3 .cse10 .cse14) (and .cse11 .cse5 .cse2 .cse3 .cse4 .cse10) (and .cse7 .cse8 .cse4 .cse13) (and .cse11 .cse2 .cse3 .cse4 .cse6 .cse10 .cse14) (and .cse3 .cse4 .cse6 .cse10 .cse13 .cse14) (and .cse11 .cse5 .cse2 .cse3 .cse12) (and (and .cse11 .cse17 .cse3 .cse10 .cse13) .cse4) (and .cse18 .cse2 .cse6) (and .cse8 .cse4 .cse6 .cse13) (and .cse11 .cse9 .cse8 .cse2 .cse4 .cse10) (and .cse7 .cse2 .cse3 .cse19 .cse6) (and .cse7 .cse1 .cse8 .cse2 .cse6 .cse10 .cse12 .cse14) (and .cse11 .cse16 .cse2 .cse3 .cse4 .cse6 .cse10) (and .cse11 .cse9 .cse1 .cse2 .cse3 .cse6) (and .cse11 .cse7 .cse2 .cse3 .cse4 .cse6) (and .cse8 .cse2 .cse4 .cse6 .cse10 .cse12) (and .cse7 .cse18 .cse2) (and .cse7 .cse5 .cse2 .cse3 .cse4) (and .cse7 .cse9 .cse1 .cse2 .cse3 .cse10 .cse12) (and .cse11 .cse7 .cse8 .cse2 .cse6 .cse10 .cse14) (and .cse16 .cse8 .cse2 .cse6) (and .cse7 .cse9 .cse8 .cse2 .cse6) (and .cse9 .cse1 .cse8 .cse2 .cse12) (and .cse11 .cse9 .cse1 .cse2 .cse3 .cse4) (and .cse11 .cse2 .cse3 .cse4 .cse6 .cse12) (and .cse11 .cse0 .cse9 .cse1 .cse2 .cse3) (and .cse5 .cse8 .cse2 .cse4) (and .cse0 .cse7 .cse8 .cse2 .cse4) (and .cse7 .cse3 .cse4 .cse6 .cse13) (and .cse0 .cse1 .cse8 .cse2 .cse12)))))) [2019-11-15 23:53:17,682 INFO L443 ceAbstractionStarter]: For program point L1592-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 23:53:17,682 INFO L443 ceAbstractionStarter]: For program point L1526-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 23:53:17,682 INFO L443 ceAbstractionStarter]: For program point L1460(lines 1460 1465) no Hoare annotation was computed. [2019-11-15 23:53:17,682 INFO L443 ceAbstractionStarter]: For program point L73(lines 73 1465) no Hoare annotation was computed. [2019-11-15 23:53:17,682 INFO L443 ceAbstractionStarter]: For program point L1593(line 1593) no Hoare annotation was computed. [2019-11-15 23:53:17,682 INFO L443 ceAbstractionStarter]: For program point L1527(line 1527) no Hoare annotation was computed. [2019-11-15 23:53:17,683 INFO L443 ceAbstractionStarter]: For program point L603(lines 603 1465) no Hoare annotation was computed. [2019-11-15 23:53:17,683 INFO L443 ceAbstractionStarter]: For program point L405(lines 405 1465) no Hoare annotation was computed. [2019-11-15 23:53:17,683 INFO L443 ceAbstractionStarter]: For program point L339(lines 339 1465) no Hoare annotation was computed. [2019-11-15 23:53:17,683 INFO L443 ceAbstractionStarter]: For program point L1132(lines 1132 1465) no Hoare annotation was computed. [2019-11-15 23:53:17,683 INFO L443 ceAbstractionStarter]: For program point L1066(lines 1066 1465) no Hoare annotation was computed. [2019-11-15 23:53:17,683 INFO L443 ceAbstractionStarter]: For program point L868(lines 868 1465) no Hoare annotation was computed. [2019-11-15 23:53:17,683 INFO L443 ceAbstractionStarter]: For program point L1595-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 23:53:17,684 INFO L443 ceAbstractionStarter]: For program point L1529-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 23:53:17,684 INFO L443 ceAbstractionStarter]: For program point L869(lines 869 887) no Hoare annotation was computed. [2019-11-15 23:53:17,684 INFO L443 ceAbstractionStarter]: For program point L869-2(lines 869 887) no Hoare annotation was computed. [2019-11-15 23:53:17,684 INFO L443 ceAbstractionStarter]: For program point L1596(line 1596) no Hoare annotation was computed. [2019-11-15 23:53:17,684 INFO L443 ceAbstractionStarter]: For program point L539(lines 539 1465) no Hoare annotation was computed. [2019-11-15 23:53:17,684 INFO L443 ceAbstractionStarter]: For program point L1530(line 1530) no Hoare annotation was computed. [2019-11-15 23:53:17,684 INFO L443 ceAbstractionStarter]: For program point L1200(lines 1200 1465) no Hoare annotation was computed. [2019-11-15 23:53:17,685 INFO L443 ceAbstractionStarter]: For program point L804(lines 804 1465) no Hoare annotation was computed. [2019-11-15 23:53:17,685 INFO L443 ceAbstractionStarter]: For program point L1663(line 1663) no Hoare annotation was computed. [2019-11-15 23:53:17,685 INFO L443 ceAbstractionStarter]: For program point L276(lines 276 1465) no Hoare annotation was computed. [2019-11-15 23:53:17,685 INFO L443 ceAbstractionStarter]: For program point L1003(lines 1003 1465) no Hoare annotation was computed. [2019-11-15 23:53:17,685 INFO L443 ceAbstractionStarter]: For program point L937(lines 937 1465) no Hoare annotation was computed. [2019-11-15 23:53:17,685 INFO L443 ceAbstractionStarter]: For program point L1598-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 23:53:17,685 INFO L443 ceAbstractionStarter]: For program point L1532-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 23:53:17,686 INFO L443 ceAbstractionStarter]: For program point L1466(lines 1466 1468) no Hoare annotation was computed. [2019-11-15 23:53:17,686 INFO L443 ceAbstractionStarter]: For program point L1466-2(lines 54 1650) no Hoare annotation was computed. [2019-11-15 23:53:17,686 INFO L443 ceAbstractionStarter]: For program point L1599(line 1599) no Hoare annotation was computed. [2019-11-15 23:53:17,686 INFO L443 ceAbstractionStarter]: For program point L1533(line 1533) no Hoare annotation was computed. [2019-11-15 23:53:17,686 INFO L443 ceAbstractionStarter]: For program point L1467(line 1467) no Hoare annotation was computed. [2019-11-15 23:53:17,686 INFO L443 ceAbstractionStarter]: For program point L146(lines 146 1465) no Hoare annotation was computed. [2019-11-15 23:53:17,686 INFO L443 ceAbstractionStarter]: For program point L675(lines 675 1465) no Hoare annotation was computed. [2019-11-15 23:53:17,687 INFO L443 ceAbstractionStarter]: For program point L1402(lines 1402 1465) no Hoare annotation was computed. [2019-11-15 23:53:17,687 INFO L443 ceAbstractionStarter]: For program point L1336(lines 1336 1465) no Hoare annotation was computed. [2019-11-15 23:53:17,687 INFO L443 ceAbstractionStarter]: For program point L213(lines 213 1465) no Hoare annotation was computed. [2019-11-15 23:53:17,687 INFO L443 ceAbstractionStarter]: For program point L1601-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 23:53:17,687 INFO L443 ceAbstractionStarter]: For program point L1535-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 23:53:17,687 INFO L443 ceAbstractionStarter]: For program point L1469-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 23:53:17,687 INFO L443 ceAbstractionStarter]: For program point L1403(lines 1403 1421) no Hoare annotation was computed. [2019-11-15 23:53:17,688 INFO L443 ceAbstractionStarter]: For program point L1403-2(lines 1403 1421) no Hoare annotation was computed. [2019-11-15 23:53:17,688 INFO L443 ceAbstractionStarter]: For program point L82(lines 82 1465) no Hoare annotation was computed. [2019-11-15 23:53:17,688 INFO L443 ceAbstractionStarter]: For program point L743(lines 743 1465) no Hoare annotation was computed. [2019-11-15 23:53:17,688 INFO L443 ceAbstractionStarter]: For program point L1602(line 1602) no Hoare annotation was computed. [2019-11-15 23:53:17,688 INFO L443 ceAbstractionStarter]: For program point L1536(line 1536) no Hoare annotation was computed. [2019-11-15 23:53:17,688 INFO L443 ceAbstractionStarter]: For program point L1470(line 1470) no Hoare annotation was computed. [2019-11-15 23:53:17,688 INFO L443 ceAbstractionStarter]: For program point L1074(lines 1074 1465) no Hoare annotation was computed. [2019-11-15 23:53:17,688 INFO L443 ceAbstractionStarter]: For program point L546(lines 546 1465) no Hoare annotation was computed. [2019-11-15 23:53:17,689 INFO L443 ceAbstractionStarter]: For program point L480(lines 480 1465) no Hoare annotation was computed. [2019-11-15 23:53:17,689 INFO L443 ceAbstractionStarter]: For program point L414(lines 414 1465) no Hoare annotation was computed. [2019-11-15 23:53:17,689 INFO L443 ceAbstractionStarter]: For program point L348(lines 348 1465) no Hoare annotation was computed. [2019-11-15 23:53:17,689 INFO L443 ceAbstractionStarter]: For program point L1604-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 23:53:17,689 INFO L443 ceAbstractionStarter]: For program point L1538-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 23:53:17,689 INFO L443 ceAbstractionStarter]: For program point L1472-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 23:53:17,689 INFO L443 ceAbstractionStarter]: For program point L1274(lines 1274 1465) no Hoare annotation was computed. [2019-11-15 23:53:17,690 INFO L443 ceAbstractionStarter]: For program point L1142(lines 1142 1465) no Hoare annotation was computed. [2019-11-15 23:53:17,690 INFO L443 ceAbstractionStarter]: For program point L614(lines 614 1465) no Hoare annotation was computed. [2019-11-15 23:53:17,690 INFO L443 ceAbstractionStarter]: For program point L1605(line 1605) no Hoare annotation was computed. [2019-11-15 23:53:17,690 INFO L443 ceAbstractionStarter]: For program point L1539(line 1539) no Hoare annotation was computed. [2019-11-15 23:53:17,690 INFO L443 ceAbstractionStarter]: For program point L1473(line 1473) no Hoare annotation was computed. [2019-11-15 23:53:17,690 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-15 23:53:17,690 INFO L443 ceAbstractionStarter]: For program point L284(lines 284 1465) no Hoare annotation was computed. [2019-11-15 23:53:17,691 INFO L443 ceAbstractionStarter]: For program point L1011(lines 1011 1465) no Hoare annotation was computed. [2019-11-15 23:53:17,691 INFO L443 ceAbstractionStarter]: For program point L813(lines 813 1465) no Hoare annotation was computed. [2019-11-15 23:53:17,691 INFO L443 ceAbstractionStarter]: For program point L1210(lines 1210 1465) no Hoare annotation was computed. [2019-11-15 23:53:17,691 INFO L443 ceAbstractionStarter]: For program point L1607-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 23:53:17,691 INFO L443 ceAbstractionStarter]: For program point L1541-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 23:53:17,691 INFO L443 ceAbstractionStarter]: For program point L1475-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 23:53:17,691 INFO L443 ceAbstractionStarter]: For program point L1211(lines 1211 1224) no Hoare annotation was computed. [2019-11-15 23:53:17,692 INFO L443 ceAbstractionStarter]: For program point L1211-2(lines 1211 1224) no Hoare annotation was computed. [2019-11-15 23:53:17,692 INFO L443 ceAbstractionStarter]: For program point L947(lines 947 1465) no Hoare annotation was computed. [2019-11-15 23:53:17,692 INFO L443 ceAbstractionStarter]: For program point L1608(line 1608) no Hoare annotation was computed. [2019-11-15 23:53:17,692 INFO L443 ceAbstractionStarter]: For program point L1542(line 1542) no Hoare annotation was computed. [2019-11-15 23:53:17,692 INFO L443 ceAbstractionStarter]: For program point L1476(line 1476) no Hoare annotation was computed. [2019-11-15 23:53:17,692 INFO L443 ceAbstractionStarter]: For program point L1344(lines 1344 1465) no Hoare annotation was computed. [2019-11-15 23:53:17,692 INFO L443 ceAbstractionStarter]: For program point L155(lines 155 1465) no Hoare annotation was computed. [2019-11-15 23:53:17,693 INFO L443 ceAbstractionStarter]: For program point L89(lines 89 1465) no Hoare annotation was computed. [2019-11-15 23:53:17,693 INFO L443 ceAbstractionStarter]: For program point L684(lines 684 1465) no Hoare annotation was computed. [2019-11-15 23:53:17,693 INFO L443 ceAbstractionStarter]: For program point L222(lines 222 1465) no Hoare annotation was computed. [2019-11-15 23:53:17,693 INFO L443 ceAbstractionStarter]: For program point L685(lines 685 699) no Hoare annotation was computed. [2019-11-15 23:53:17,693 INFO L443 ceAbstractionStarter]: For program point L685-2(lines 685 699) no Hoare annotation was computed. [2019-11-15 23:53:17,693 INFO L443 ceAbstractionStarter]: For program point L1610-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 23:53:17,694 INFO L443 ceAbstractionStarter]: For program point L1544-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 23:53:17,694 INFO L443 ceAbstractionStarter]: For program point L1478-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 23:53:17,694 INFO L443 ceAbstractionStarter]: For program point L1611(line 1611) no Hoare annotation was computed. [2019-11-15 23:53:17,694 INFO L443 ceAbstractionStarter]: For program point L1545(line 1545) no Hoare annotation was computed. [2019-11-15 23:53:17,694 INFO L443 ceAbstractionStarter]: For program point L488(lines 488 1465) no Hoare annotation was computed. [2019-11-15 23:53:17,694 INFO L443 ceAbstractionStarter]: For program point L1479(line 1479) no Hoare annotation was computed. [2019-11-15 23:53:17,694 INFO L443 ceAbstractionStarter]: For program point L422(lines 422 1465) no Hoare annotation was computed. [2019-11-15 23:53:17,694 INFO L443 ceAbstractionStarter]: For program point L356(lines 356 1465) no Hoare annotation was computed. [2019-11-15 23:53:17,695 INFO L443 ceAbstractionStarter]: For program point L753(lines 753 1465) no Hoare annotation was computed. [2019-11-15 23:53:17,695 INFO L443 ceAbstractionStarter]: For program point L622(lines 622 1465) no Hoare annotation was computed. [2019-11-15 23:53:17,695 INFO L443 ceAbstractionStarter]: For program point L556(lines 556 1465) no Hoare annotation was computed. [2019-11-15 23:53:17,695 INFO L443 ceAbstractionStarter]: For program point L1613-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 23:53:17,695 INFO L443 ceAbstractionStarter]: For program point L1547-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 23:53:17,695 INFO L443 ceAbstractionStarter]: For program point L1481-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 23:53:17,696 INFO L443 ceAbstractionStarter]: For program point L292(lines 292 1465) no Hoare annotation was computed. [2019-11-15 23:53:17,696 INFO L443 ceAbstractionStarter]: For program point L1283(lines 1283 1465) no Hoare annotation was computed. [2019-11-15 23:53:17,696 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-15 23:53:17,696 INFO L443 ceAbstractionStarter]: For program point L1614(line 1614) no Hoare annotation was computed. [2019-11-15 23:53:17,696 INFO L443 ceAbstractionStarter]: For program point L1548(line 1548) no Hoare annotation was computed. [2019-11-15 23:53:17,696 INFO L443 ceAbstractionStarter]: For program point L1482(line 1482) no Hoare annotation was computed. [2019-11-15 23:53:17,696 INFO L443 ceAbstractionStarter]: For program point L1350(lines 1350 1465) no Hoare annotation was computed. [2019-11-15 23:53:17,696 INFO L443 ceAbstractionStarter]: For program point L1284(lines 1284 1303) no Hoare annotation was computed. [2019-11-15 23:53:17,697 INFO L443 ceAbstractionStarter]: For program point L1284-2(lines 1284 1303) no Hoare annotation was computed. [2019-11-15 23:53:17,697 INFO L443 ceAbstractionStarter]: For program point L1152(lines 1152 1465) no Hoare annotation was computed. [2019-11-15 23:53:17,697 INFO L443 ceAbstractionStarter]: For program point L95(lines 95 1465) no Hoare annotation was computed. [2019-11-15 23:53:17,697 INFO L443 ceAbstractionStarter]: For program point L1086(lines 1086 1465) no Hoare annotation was computed. [2019-11-15 23:53:17,697 INFO L443 ceAbstractionStarter]: For program point L1021(lines 1021 1465) no Hoare annotation was computed. [2019-11-15 23:53:17,697 INFO L443 ceAbstractionStarter]: For program point L955(lines 955 1465) no Hoare annotation was computed. [2019-11-15 23:53:17,697 INFO L443 ceAbstractionStarter]: For program point L889(lines 889 1465) no Hoare annotation was computed. [2019-11-15 23:53:17,698 INFO L443 ceAbstractionStarter]: For program point L1616-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 23:53:17,698 INFO L443 ceAbstractionStarter]: For program point L1550-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 23:53:17,698 INFO L443 ceAbstractionStarter]: For program point L1484-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 23:53:17,698 INFO L443 ceAbstractionStarter]: For program point L1617(line 1617) no Hoare annotation was computed. [2019-11-15 23:53:17,698 INFO L443 ceAbstractionStarter]: For program point L1551(line 1551) no Hoare annotation was computed. [2019-11-15 23:53:17,698 INFO L443 ceAbstractionStarter]: For program point L1485(line 1485) no Hoare annotation was computed. [2019-11-15 23:53:17,698 INFO L443 ceAbstractionStarter]: For program point L164(lines 164 1465) no Hoare annotation was computed. [2019-11-15 23:53:17,699 INFO L443 ceAbstractionStarter]: For program point L825(lines 825 1465) no Hoare annotation was computed. [2019-11-15 23:53:17,699 INFO L443 ceAbstractionStarter]: For program point L1619-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 23:53:17,699 INFO L443 ceAbstractionStarter]: For program point L1553-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 23:53:17,699 INFO L443 ceAbstractionStarter]: For program point L1487-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 23:53:17,699 INFO L443 ceAbstractionStarter]: For program point L761(lines 761 1465) no Hoare annotation was computed. [2019-11-15 23:53:17,699 INFO L443 ceAbstractionStarter]: For program point L1620(line 1620) no Hoare annotation was computed. [2019-11-15 23:53:17,699 INFO L443 ceAbstractionStarter]: For program point L1554(line 1554) no Hoare annotation was computed. [2019-11-15 23:53:17,699 INFO L443 ceAbstractionStarter]: For program point L497(lines 497 1465) no Hoare annotation was computed. [2019-11-15 23:53:17,700 INFO L443 ceAbstractionStarter]: For program point L1488(line 1488) no Hoare annotation was computed. [2019-11-15 23:53:17,700 INFO L443 ceAbstractionStarter]: For program point L233(lines 233 1465) no Hoare annotation was computed. [2019-11-15 23:53:17,761 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 11:53:17 BoogieIcfgContainer [2019-11-15 23:53:17,761 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 23:53:17,762 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 23:53:17,762 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 23:53:17,762 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 23:53:17,763 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:52:39" (3/4) ... [2019-11-15 23:53:17,766 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-15 23:53:17,814 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-15 23:53:17,819 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-15 23:53:18,032 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_7b5c45c3-52bb-4a6a-b359-85e12b5e9479/bin/uautomizer/witness.graphml [2019-11-15 23:53:18,032 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 23:53:18,033 INFO L168 Benchmark]: Toolchain (without parser) took 42400.23 ms. Allocated memory was 1.0 GB in the beginning and 3.9 GB in the end (delta: 2.9 GB). Free memory was 936.7 MB in the beginning and 2.7 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. [2019-11-15 23:53:18,034 INFO L168 Benchmark]: CDTParser took 0.38 ms. Allocated memory is still 1.0 GB. Free memory is still 966.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:53:18,034 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1368.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 936.7 MB in the beginning and 1.1 GB in the end (delta: -131.9 MB). Peak memory consumption was 29.3 MB. Max. memory is 11.5 GB. [2019-11-15 23:53:18,034 INFO L168 Benchmark]: Boogie Procedure Inliner took 153.92 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: 14.8 MB). Peak memory consumption was 14.8 MB. Max. memory is 11.5 GB. [2019-11-15 23:53:18,035 INFO L168 Benchmark]: Boogie Preprocessor took 133.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-15 23:53:18,035 INFO L168 Benchmark]: RCFGBuilder took 2356.46 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 19.4 MB). Peak memory consumption was 193.6 MB. Max. memory is 11.5 GB. [2019-11-15 23:53:18,035 INFO L168 Benchmark]: TraceAbstraction took 38107.12 ms. Allocated memory was 1.2 GB in the beginning and 3.9 GB in the end (delta: 2.8 GB). Free memory was 1.0 GB in the beginning and 2.7 GB in the end (delta: -1.7 GB). Peak memory consumption was 2.4 GB. Max. memory is 11.5 GB. [2019-11-15 23:53:18,036 INFO L168 Benchmark]: Witness Printer took 270.46 ms. Allocated memory is still 3.9 GB. Free memory was 2.7 GB in the beginning and 2.7 GB in the end (delta: 59.3 MB). Peak memory consumption was 59.3 MB. Max. memory is 11.5 GB. [2019-11-15 23:53:18,038 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.38 ms. Allocated memory is still 1.0 GB. Free memory is still 966.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1368.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 936.7 MB in the beginning and 1.1 GB in the end (delta: -131.9 MB). Peak memory consumption was 29.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 153.92 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: 14.8 MB). Peak memory consumption was 14.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 133.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2356.46 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 19.4 MB). Peak memory consumption was 193.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 38107.12 ms. Allocated memory was 1.2 GB in the beginning and 3.9 GB in the end (delta: 2.8 GB). Free memory was 1.0 GB in the beginning and 2.7 GB in the end (delta: -1.7 GB). Peak memory consumption was 2.4 GB. Max. memory is 11.5 GB. * Witness Printer took 270.46 ms. Allocated memory is still 3.9 GB. Free memory was 2.7 GB in the beginning and 2.7 GB in the end (delta: 59.3 MB). Peak memory consumption was 59.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1578]: 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: 1652]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1658]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((!(a12 == 1) && 1 == a6) && a5 == 1) && a11 == 1) && a26 == 1) || (((((!(a12 == 1) && a27 == 1) && !(1 == a6)) && a5 == 1) && a11 == 1) && 1 == a0)) || ((((!(a7 == 1) && a11 <= 0) && a5 == 1) && a26 == 1) && 1 == a0)) || ((((a27 == 1 && a11 <= 0) && a5 == 1) && 1 == a0) && a16 == 1)) || (((((a3 <= 0 && a5 == 1) && a11 == 1) && a26 == 1) && a16 == 1) && 1 == a4)) || (((((!(a12 == 1) && !(a7 == 1)) && a27 == 1) && 1 == a6) && a11 <= 0) && a5 == 1)) || (((a11 <= 0 && a26 == 1) && !(1 == a6) && a5 == 1) && 1 == a4)) || ((((!(a7 == 1) && a11 <= 0) && a5 == 1) && a26 == 1) && 1 == a4)) || (((((a11 <= 0 && a5 == 1) && a26 == 1) && 1 == a0) && a16 == 1) && a27 <= 0)) || ((((((a27 == 1 && 1 == a6) && a5 == 1) && a11 == 1) && a26 == 1) && 1 == a0) && a16 == 1)) || ((a3 <= 0 && a11 <= 0) && !(1 == a6) && a5 == 1)) || (((a11 == 1 && a26 == 1) && !(1 == a6) && a5 == 1) && 1 == a4)) || (((1 == a3 && a11 <= 0) && 1 == a0) && !(1 == a6) && a5 == 1)) || (((((!(a7 == 1) && 1 == a3) && (!(a12 == 1) && a27 == 1) && !(1 == a6)) && a5 == 1) && a11 == 1) && a16 == 1)) || (((((!(a12 == 1) && a27 == 1) && 1 == a3) && a11 <= 0) && a5 == 1) && a26 == 1)) || ((((((a3 <= 0 && !(a7 == 1)) && a27 == 1 && !(1 == a6)) && a5 == 1) && a11 == 1) && a26 == 1) && a16 == 1)) || (((((!(a7 == 1) && 1 == a3) && a11 <= 0) && a5 == 1) && 1 == a0) && 1 == a4)) || ((((!(a12 == 1) && 1 == a6) && a11 <= 0) && a5 == 1) && 1 == a0)) || ((((((!(a7 == 1) && 1 == a3) && 1 == a6) && a5 == 1) && a11 == 1) && a16 == 1) && a27 <= 0)) || (((((a3 <= 0 && (!(a12 == 1) && a27 == 1) && !(1 == a6)) && a5 == 1) && a11 == 1) && a26 == 1) && a16 == 1)) || (((!(a7 == 1) && a11 <= 0) && a26 == 1) && !(1 == a6) && a5 == 1)) || ((((((a3 <= 0 && a5 == 1) && a11 == 1) && a26 == 1) && 1 == a0) && a16 == 1) && a27 <= 0)) || (((((a11 == 1 && a26 == 1) && 1 == a0) && a16 == 1) && !(1 == a6) && a5 == 1) && a27 <= 0)) || ((((a3 <= 0 && (!(a12 == 1) && a27 == 1) && !(1 == a6)) && a5 == 1) && a11 == 1) && 1 == a4)) || (((((a3 <= 0 && !(a27 == 1)) && a11 == 1) && a16 == 1) && !(1 == a6) && a5 == 1) && a26 == 1)) || (((((!(a27 == 1) && a11 == 1) && !(a12 == 1) && !(1 == a6)) && a16 == 1) && a5 == 1) && 1 == a0)) || (((a11 <= 0 && a26 == 1) && 1 == a0) && !(1 == a6) && a5 == 1)) || (((((a3 <= 0 && a27 == 1) && a11 <= 0) && a5 == 1) && a26 == 1) && a16 == 1)) || ((((!(a7 == 1) && a5 == 1) && a11 == 1) && !(a12 == 1) && !(1 == a6)) && 1 == a0)) || (((((((!(a7 == 1) && 1 == a6) && a11 <= 0) && a5 == 1) && 1 == a0) && a16 == 1) && 1 == a4) && a27 <= 0)) || ((((((a3 <= 0 && a27 == 1 && !(1 == a6)) && a5 == 1) && a11 == 1) && a26 == 1) && 1 == a0) && a16 == 1)) || (((((a3 <= 0 && a27 == 1) && 1 == a6) && a5 == 1) && a11 == 1) && 1 == a0)) || (((((a3 <= 0 && !(a7 == 1)) && a5 == 1) && a11 == 1) && a26 == 1) && 1 == a0)) || (((((a11 <= 0 && a5 == 1) && a26 == 1) && 1 == a0) && a16 == 1) && 1 == a4)) || ((!(a7 == 1) && ((!(a27 == 1) && a11 == 1) && !(a12 == 1) && !(1 == a6)) && a16 == 1) && a5 == 1)) || ((((!(a7 == 1) && (!(a12 == 1) && a27 == 1) && !(1 == a6)) && a5 == 1) && a11 == 1) && a26 == 1)) || ((((((!(a7 == 1) && a27 == 1) && 1 == a6) && a5 == 1) && a11 == 1) && a16 == 1) && 1 == a4)) || ((((((a3 <= 0 && !(a7 == 1)) && a11 <= 0) && a5 == 1) && 1 == a0) && a16 == 1) && a27 <= 0)) || ((((a27 == 1 && !(1 == a6)) && a11 <= 0) && a5 == 1) && 1 == a0)) || ((((!(a7 == 1) && a27 == 1) && a11 <= 0) && a5 == 1) && 1 == a0)) || ((((a27 == 1 && 1 == a6) && a11 <= 0) && a5 == 1) && 1 == a4)) || (((((a3 <= 0 && a27 == 1) && 1 == a6) && a5 == 1) && a11 == 1) && a26 == 1)) || (((((a3 <= 0 && a5 == 1) && a11 == 1) && a26 == 1) && 1 == a0) && 1 == a4)) || (((((a3 <= 0 && !(a12 == 1)) && a27 == 1) && 1 == a6) && a5 == 1) && a11 == 1)) || (((((!(a12 == 1) && a27 == 1) && !(1 == a6)) && a11 <= 0) && a5 == 1) && a26 == 1)) || ((((!(a12 == 1) && !(a7 == 1)) && a11 <= 0) && a5 == 1) && a26 == 1)) || ((((!(a7 == 1) && a11 == 1) && a26 == 1) && 1 == a0) && !(1 == a6) && a5 == 1)) || ((((!(a12 == 1) && 1 == a6) && a11 <= 0) && a5 == 1) && 1 == a4) - InvariantResult [Line: 54]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((!(a12 == 1) && 1 == a6) && a5 == 1) && a11 == 1) && a26 == 1) || (((((!(a12 == 1) && a27 == 1) && !(1 == a6)) && a5 == 1) && a11 == 1) && 1 == a0)) || ((((!(a7 == 1) && a11 <= 0) && a5 == 1) && a26 == 1) && 1 == a0)) || ((((a27 == 1 && a11 <= 0) && a5 == 1) && 1 == a0) && a16 == 1)) || (((((a3 <= 0 && a5 == 1) && a11 == 1) && a26 == 1) && a16 == 1) && 1 == a4)) || (((((!(a12 == 1) && !(a7 == 1)) && a27 == 1) && 1 == a6) && a11 <= 0) && a5 == 1)) || (((a11 <= 0 && a26 == 1) && !(1 == a6) && a5 == 1) && 1 == a4)) || ((((!(a7 == 1) && a11 <= 0) && a5 == 1) && a26 == 1) && 1 == a4)) || (((((a11 <= 0 && a5 == 1) && a26 == 1) && 1 == a0) && a16 == 1) && a27 <= 0)) || ((((((a27 == 1 && 1 == a6) && a5 == 1) && a11 == 1) && a26 == 1) && 1 == a0) && a16 == 1)) || ((a3 <= 0 && a11 <= 0) && !(1 == a6) && a5 == 1)) || (((a11 == 1 && a26 == 1) && !(1 == a6) && a5 == 1) && 1 == a4)) || (((1 == a3 && a11 <= 0) && 1 == a0) && !(1 == a6) && a5 == 1)) || (((((!(a7 == 1) && 1 == a3) && (!(a12 == 1) && a27 == 1) && !(1 == a6)) && a5 == 1) && a11 == 1) && a16 == 1)) || (((((!(a12 == 1) && a27 == 1) && 1 == a3) && a11 <= 0) && a5 == 1) && a26 == 1)) || ((((((a3 <= 0 && !(a7 == 1)) && a27 == 1 && !(1 == a6)) && a5 == 1) && a11 == 1) && a26 == 1) && a16 == 1)) || (((((!(a7 == 1) && 1 == a3) && a11 <= 0) && a5 == 1) && 1 == a0) && 1 == a4)) || ((((!(a12 == 1) && 1 == a6) && a11 <= 0) && a5 == 1) && 1 == a0)) || ((((((!(a7 == 1) && 1 == a3) && 1 == a6) && a5 == 1) && a11 == 1) && a16 == 1) && a27 <= 0)) || (((((a3 <= 0 && (!(a12 == 1) && a27 == 1) && !(1 == a6)) && a5 == 1) && a11 == 1) && a26 == 1) && a16 == 1)) || (((!(a7 == 1) && a11 <= 0) && a26 == 1) && !(1 == a6) && a5 == 1)) || ((((((a3 <= 0 && a5 == 1) && a11 == 1) && a26 == 1) && 1 == a0) && a16 == 1) && a27 <= 0)) || (((((a11 == 1 && a26 == 1) && 1 == a0) && a16 == 1) && !(1 == a6) && a5 == 1) && a27 <= 0)) || ((((a3 <= 0 && (!(a12 == 1) && a27 == 1) && !(1 == a6)) && a5 == 1) && a11 == 1) && 1 == a4)) || (((((a3 <= 0 && !(a27 == 1)) && a11 == 1) && a16 == 1) && !(1 == a6) && a5 == 1) && a26 == 1)) || (((((!(a27 == 1) && a11 == 1) && !(a12 == 1) && !(1 == a6)) && a16 == 1) && a5 == 1) && 1 == a0)) || (((a11 <= 0 && a26 == 1) && 1 == a0) && !(1 == a6) && a5 == 1)) || (((((a3 <= 0 && a27 == 1) && a11 <= 0) && a5 == 1) && a26 == 1) && a16 == 1)) || ((((!(a7 == 1) && a5 == 1) && a11 == 1) && !(a12 == 1) && !(1 == a6)) && 1 == a0)) || (((((((!(a7 == 1) && 1 == a6) && a11 <= 0) && a5 == 1) && 1 == a0) && a16 == 1) && 1 == a4) && a27 <= 0)) || ((((((a3 <= 0 && a27 == 1 && !(1 == a6)) && a5 == 1) && a11 == 1) && a26 == 1) && 1 == a0) && a16 == 1)) || (((((a3 <= 0 && a27 == 1) && 1 == a6) && a5 == 1) && a11 == 1) && 1 == a0)) || (((((a3 <= 0 && !(a7 == 1)) && a5 == 1) && a11 == 1) && a26 == 1) && 1 == a0)) || (((((a11 <= 0 && a5 == 1) && a26 == 1) && 1 == a0) && a16 == 1) && 1 == a4)) || ((!(a7 == 1) && ((!(a27 == 1) && a11 == 1) && !(a12 == 1) && !(1 == a6)) && a16 == 1) && a5 == 1)) || ((((!(a7 == 1) && (!(a12 == 1) && a27 == 1) && !(1 == a6)) && a5 == 1) && a11 == 1) && a26 == 1)) || ((((((!(a7 == 1) && a27 == 1) && 1 == a6) && a5 == 1) && a11 == 1) && a16 == 1) && 1 == a4)) || ((((((a3 <= 0 && !(a7 == 1)) && a11 <= 0) && a5 == 1) && 1 == a0) && a16 == 1) && a27 <= 0)) || ((((a27 == 1 && !(1 == a6)) && a11 <= 0) && a5 == 1) && 1 == a0)) || ((((!(a7 == 1) && a27 == 1) && a11 <= 0) && a5 == 1) && 1 == a0)) || ((((a27 == 1 && 1 == a6) && a11 <= 0) && a5 == 1) && 1 == a4)) || (((((a3 <= 0 && a27 == 1) && 1 == a6) && a5 == 1) && a11 == 1) && a26 == 1)) || (((((a3 <= 0 && a5 == 1) && a11 == 1) && a26 == 1) && 1 == a0) && 1 == a4)) || (((((a3 <= 0 && !(a12 == 1)) && a27 == 1) && 1 == a6) && a5 == 1) && a11 == 1)) || (((((!(a12 == 1) && a27 == 1) && !(1 == a6)) && a11 <= 0) && a5 == 1) && a26 == 1)) || ((((!(a12 == 1) && !(a7 == 1)) && a11 <= 0) && a5 == 1) && a26 == 1)) || ((((!(a7 == 1) && a11 == 1) && a26 == 1) && 1 == a0) && !(1 == a6) && a5 == 1)) || ((((!(a12 == 1) && 1 == a6) && a11 <= 0) && a5 == 1) && 1 == a4) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 302 locations, 1 error locations. Result: SAFE, OverallTime: 37.9s, OverallIterations: 16, TraceHistogramMax: 4, AutomataDifference: 20.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 7.9s, HoareTripleCheckerStatistics: 2855 SDtfs, 5400 SDslu, 1187 SDs, 0 SdLazy, 9799 SolverSat, 2103 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 535 GetRequests, 502 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=112691occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.0s AutomataMinimizationTime, 16 MinimizatonAttempts, 2744 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 1202 NumberOfFragments, 2015 HoareAnnotationTreeSize, 3 FomulaSimplifications, 42886 FormulaSimplificationTreeSizeReduction, 4.6s HoareSimplificationTime, 3 FomulaSimplificationsInter, 7846 FormulaSimplificationTreeSizeReductionInter, 3.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 4347 NumberOfCodeBlocks, 4347 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 4329 ConstructedInterpolants, 0 QuantifiedInterpolants, 1998649 SizeOfPredicates, 0 NumberOfNonLiveVariables, 862 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 18 InterpolantComputations, 16 PerfectInterpolantSequences, 1360/1367 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...