./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem11_label44.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_39fe9cd9-7b53-43f5-9a0e-5acaf7e72506/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_39fe9cd9-7b53-43f5-9a0e-5acaf7e72506/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_39fe9cd9-7b53-43f5-9a0e-5acaf7e72506/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_39fe9cd9-7b53-43f5-9a0e-5acaf7e72506/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem11_label44.c -s /tmp/vcloud-vcloud-master/worker/run_dir_39fe9cd9-7b53-43f5-9a0e-5acaf7e72506/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_39fe9cd9-7b53-43f5-9a0e-5acaf7e72506/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 06d11383001c52cfbf19a51eafe2dc3d238c9679 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 21:20:21,665 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 21:20:21,668 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 21:20:21,683 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 21:20:21,684 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 21:20:21,685 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 21:20:21,688 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 21:20:21,698 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 21:20:21,703 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 21:20:21,707 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 21:20:21,710 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 21:20:21,712 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 21:20:21,712 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 21:20:21,715 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 21:20:21,716 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 21:20:21,717 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 21:20:21,718 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 21:20:21,719 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 21:20:21,722 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 21:20:21,726 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 21:20:21,729 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 21:20:21,731 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 21:20:21,735 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 21:20:21,736 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 21:20:21,740 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 21:20:21,741 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 21:20:21,741 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 21:20:21,744 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 21:20:21,745 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 21:20:21,746 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 21:20:21,746 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 21:20:21,747 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 21:20:21,748 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 21:20:21,749 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 21:20:21,751 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 21:20:21,751 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 21:20:21,752 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 21:20:21,753 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 21:20:21,753 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 21:20:21,754 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 21:20:21,755 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 21:20:21,757 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_39fe9cd9-7b53-43f5-9a0e-5acaf7e72506/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 21:20:21,788 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 21:20:21,789 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 21:20:21,790 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 21:20:21,790 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 21:20:21,790 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 21:20:21,791 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 21:20:21,791 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 21:20:21,791 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 21:20:21,791 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 21:20:21,791 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 21:20:21,792 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 21:20:21,792 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 21:20:21,792 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 21:20:21,792 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 21:20:21,792 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 21:20:21,793 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 21:20:21,793 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 21:20:21,793 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 21:20:21,793 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 21:20:21,794 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 21:20:21,794 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 21:20:21,794 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 21:20:21,794 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 21:20:21,795 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 21:20:21,795 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 21:20:21,795 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 21:20:21,795 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 21:20:21,795 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 21:20:21,796 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_39fe9cd9-7b53-43f5-9a0e-5acaf7e72506/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 -> 06d11383001c52cfbf19a51eafe2dc3d238c9679 [2019-11-15 21:20:21,826 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 21:20:21,838 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 21:20:21,842 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 21:20:21,844 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 21:20:21,845 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 21:20:21,846 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_39fe9cd9-7b53-43f5-9a0e-5acaf7e72506/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem11_label44.c [2019-11-15 21:20:21,917 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_39fe9cd9-7b53-43f5-9a0e-5acaf7e72506/bin/uautomizer/data/6d5dec67a/f6696474e83d48e493eb4b96bdb4e777/FLAG18bd8c2c4 [2019-11-15 21:20:22,571 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 21:20:22,572 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_39fe9cd9-7b53-43f5-9a0e-5acaf7e72506/sv-benchmarks/c/eca-rers2012/Problem11_label44.c [2019-11-15 21:20:22,593 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_39fe9cd9-7b53-43f5-9a0e-5acaf7e72506/bin/uautomizer/data/6d5dec67a/f6696474e83d48e493eb4b96bdb4e777/FLAG18bd8c2c4 [2019-11-15 21:20:22,761 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_39fe9cd9-7b53-43f5-9a0e-5acaf7e72506/bin/uautomizer/data/6d5dec67a/f6696474e83d48e493eb4b96bdb4e777 [2019-11-15 21:20:22,763 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 21:20:22,764 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 21:20:22,765 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 21:20:22,765 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 21:20:22,769 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 21:20:22,770 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:20:22" (1/1) ... [2019-11-15 21:20:22,773 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@585fc3e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:20:22, skipping insertion in model container [2019-11-15 21:20:22,773 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:20:22" (1/1) ... [2019-11-15 21:20:22,782 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 21:20:22,867 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 21:20:23,686 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:20:23,699 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 21:20:23,991 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:20:24,013 INFO L192 MainTranslator]: Completed translation [2019-11-15 21:20:24,014 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:20:24 WrapperNode [2019-11-15 21:20:24,014 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 21:20:24,015 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 21:20:24,015 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 21:20:24,015 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 21:20:24,026 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:20:24" (1/1) ... [2019-11-15 21:20:24,078 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:20:24" (1/1) ... [2019-11-15 21:20:24,199 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 21:20:24,199 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 21:20:24,199 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 21:20:24,199 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 21:20:24,211 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:20:24" (1/1) ... [2019-11-15 21:20:24,211 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:20:24" (1/1) ... [2019-11-15 21:20:24,222 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:20:24" (1/1) ... [2019-11-15 21:20:24,222 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:20:24" (1/1) ... [2019-11-15 21:20:24,276 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:20:24" (1/1) ... [2019-11-15 21:20:24,306 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:20:24" (1/1) ... [2019-11-15 21:20:24,337 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:20:24" (1/1) ... [2019-11-15 21:20:24,358 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 21:20:24,358 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 21:20:24,359 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 21:20:24,359 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 21:20:24,360 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:20:24" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_39fe9cd9-7b53-43f5-9a0e-5acaf7e72506/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 21:20:24,455 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 21:20:24,456 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 21:20:27,179 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 21:20:27,179 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-15 21:20:27,181 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:20:27 BoogieIcfgContainer [2019-11-15 21:20:27,181 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 21:20:27,183 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 21:20:27,183 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 21:20:27,188 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 21:20:27,189 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 09:20:22" (1/3) ... [2019-11-15 21:20:27,191 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66f2aee3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:20:27, skipping insertion in model container [2019-11-15 21:20:27,192 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:20:24" (2/3) ... [2019-11-15 21:20:27,192 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66f2aee3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:20:27, skipping insertion in model container [2019-11-15 21:20:27,193 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:20:27" (3/3) ... [2019-11-15 21:20:27,195 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem11_label44.c [2019-11-15 21:20:27,208 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 21:20:27,220 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 21:20:27,235 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 21:20:27,286 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 21:20:27,287 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 21:20:27,287 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 21:20:27,287 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 21:20:27,288 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 21:20:27,288 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 21:20:27,288 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 21:20:27,289 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 21:20:27,333 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states. [2019-11-15 21:20:27,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-15 21:20:27,344 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:20:27,346 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] [2019-11-15 21:20:27,350 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:20:27,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:20:27,359 INFO L82 PathProgramCache]: Analyzing trace with hash 678582746, now seen corresponding path program 1 times [2019-11-15 21:20:27,372 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:20:27,373 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531756418] [2019-11-15 21:20:27,374 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:27,374 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:27,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:20:27,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:27,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:20:27,724 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531756418] [2019-11-15 21:20:27,726 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:20:27,726 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:20:27,730 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166154644] [2019-11-15 21:20:27,735 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:20:27,736 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:20:27,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:20:27,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:20:27,757 INFO L87 Difference]: Start difference. First operand 283 states. Second operand 4 states. [2019-11-15 21:20:30,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:20:30,992 INFO L93 Difference]: Finished difference Result 968 states and 1740 transitions. [2019-11-15 21:20:30,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:20:30,995 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2019-11-15 21:20:30,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:20:31,023 INFO L225 Difference]: With dead ends: 968 [2019-11-15 21:20:31,023 INFO L226 Difference]: Without dead ends: 602 [2019-11-15 21:20:31,030 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:20:31,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2019-11-15 21:20:31,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 407. [2019-11-15 21:20:31,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-15 21:20:31,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 590 transitions. [2019-11-15 21:20:31,120 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 590 transitions. Word has length 26 [2019-11-15 21:20:31,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:20:31,120 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 590 transitions. [2019-11-15 21:20:31,121 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:20:31,121 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 590 transitions. [2019-11-15 21:20:31,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-15 21:20:31,126 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:20:31,126 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:20:31,127 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:20:31,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:20:31,127 INFO L82 PathProgramCache]: Analyzing trace with hash -308519566, now seen corresponding path program 1 times [2019-11-15 21:20:31,127 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:20:31,128 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930353491] [2019-11-15 21:20:31,128 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:31,128 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:31,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:20:31,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:31,267 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:20:31,268 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930353491] [2019-11-15 21:20:31,268 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:20:31,269 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:20:31,269 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094330008] [2019-11-15 21:20:31,271 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:20:31,271 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:20:31,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:20:31,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:20:31,272 INFO L87 Difference]: Start difference. First operand 407 states and 590 transitions. Second operand 4 states. [2019-11-15 21:20:33,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:20:33,512 INFO L93 Difference]: Finished difference Result 1567 states and 2285 transitions. [2019-11-15 21:20:33,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:20:33,513 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-11-15 21:20:33,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:20:33,523 INFO L225 Difference]: With dead ends: 1567 [2019-11-15 21:20:33,523 INFO L226 Difference]: Without dead ends: 1162 [2019-11-15 21:20:33,529 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:20:33,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1162 states. [2019-11-15 21:20:33,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1162 to 1148. [2019-11-15 21:20:33,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1148 states. [2019-11-15 21:20:33,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1148 states to 1148 states and 1566 transitions. [2019-11-15 21:20:33,597 INFO L78 Accepts]: Start accepts. Automaton has 1148 states and 1566 transitions. Word has length 94 [2019-11-15 21:20:33,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:20:33,598 INFO L462 AbstractCegarLoop]: Abstraction has 1148 states and 1566 transitions. [2019-11-15 21:20:33,599 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:20:33,599 INFO L276 IsEmpty]: Start isEmpty. Operand 1148 states and 1566 transitions. [2019-11-15 21:20:33,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-15 21:20:33,602 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:20:33,602 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:20:33,602 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:20:33,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:20:33,603 INFO L82 PathProgramCache]: Analyzing trace with hash 1249111919, now seen corresponding path program 1 times [2019-11-15 21:20:33,603 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:20:33,603 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561016945] [2019-11-15 21:20:33,604 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:33,604 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:33,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:20:33,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:33,707 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:20:33,708 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561016945] [2019-11-15 21:20:33,710 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:20:33,710 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:20:33,710 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267837551] [2019-11-15 21:20:33,711 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:20:33,713 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:20:33,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:20:33,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:20:33,715 INFO L87 Difference]: Start difference. First operand 1148 states and 1566 transitions. Second operand 4 states. [2019-11-15 21:20:35,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:20:35,800 INFO L93 Difference]: Finished difference Result 4144 states and 5719 transitions. [2019-11-15 21:20:35,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:20:35,801 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-11-15 21:20:35,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:20:35,829 INFO L225 Difference]: With dead ends: 4144 [2019-11-15 21:20:35,830 INFO L226 Difference]: Without dead ends: 2998 [2019-11-15 21:20:35,834 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:20:35,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2998 states. [2019-11-15 21:20:35,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2998 to 2998. [2019-11-15 21:20:35,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2998 states. [2019-11-15 21:20:35,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2998 states to 2998 states and 3666 transitions. [2019-11-15 21:20:35,963 INFO L78 Accepts]: Start accepts. Automaton has 2998 states and 3666 transitions. Word has length 97 [2019-11-15 21:20:35,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:20:35,964 INFO L462 AbstractCegarLoop]: Abstraction has 2998 states and 3666 transitions. [2019-11-15 21:20:35,964 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:20:35,965 INFO L276 IsEmpty]: Start isEmpty. Operand 2998 states and 3666 transitions. [2019-11-15 21:20:35,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-11-15 21:20:35,982 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:20:35,983 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:20:35,983 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:20:35,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:20:35,984 INFO L82 PathProgramCache]: Analyzing trace with hash -101534449, now seen corresponding path program 1 times [2019-11-15 21:20:35,985 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:20:35,985 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891201273] [2019-11-15 21:20:35,985 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:35,986 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:35,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:20:36,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:36,263 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:20:36,264 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891201273] [2019-11-15 21:20:36,264 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:20:36,264 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:20:36,265 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23465321] [2019-11-15 21:20:36,267 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:20:36,267 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:20:36,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:20:36,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:20:36,268 INFO L87 Difference]: Start difference. First operand 2998 states and 3666 transitions. Second operand 5 states. [2019-11-15 21:20:38,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:20:38,919 INFO L93 Difference]: Finished difference Result 9336 states and 11717 transitions. [2019-11-15 21:20:38,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 21:20:38,920 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 153 [2019-11-15 21:20:38,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:20:38,966 INFO L225 Difference]: With dead ends: 9336 [2019-11-15 21:20:38,966 INFO L226 Difference]: Without dead ends: 6524 [2019-11-15 21:20:38,971 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:20:38,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6524 states. [2019-11-15 21:20:39,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6524 to 6523. [2019-11-15 21:20:39,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6523 states. [2019-11-15 21:20:39,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6523 states to 6523 states and 7930 transitions. [2019-11-15 21:20:39,162 INFO L78 Accepts]: Start accepts. Automaton has 6523 states and 7930 transitions. Word has length 153 [2019-11-15 21:20:39,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:20:39,164 INFO L462 AbstractCegarLoop]: Abstraction has 6523 states and 7930 transitions. [2019-11-15 21:20:39,165 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:20:39,165 INFO L276 IsEmpty]: Start isEmpty. Operand 6523 states and 7930 transitions. [2019-11-15 21:20:39,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-11-15 21:20:39,174 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:20:39,175 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-15 21:20:39,175 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:20:39,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:20:39,176 INFO L82 PathProgramCache]: Analyzing trace with hash -801477748, now seen corresponding path program 1 times [2019-11-15 21:20:39,176 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:20:39,176 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688768627] [2019-11-15 21:20:39,177 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:39,177 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:39,177 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:20:39,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:39,465 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-11-15 21:20:39,467 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688768627] [2019-11-15 21:20:39,467 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:20:39,468 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:20:39,468 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051708292] [2019-11-15 21:20:39,469 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:20:39,470 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:20:39,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:20:39,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:20:39,473 INFO L87 Difference]: Start difference. First operand 6523 states and 7930 transitions. Second operand 4 states. [2019-11-15 21:20:41,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:20:41,676 INFO L93 Difference]: Finished difference Result 14541 states and 17831 transitions. [2019-11-15 21:20:41,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:20:41,676 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 219 [2019-11-15 21:20:41,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:20:41,728 INFO L225 Difference]: With dead ends: 14541 [2019-11-15 21:20:41,728 INFO L226 Difference]: Without dead ends: 8204 [2019-11-15 21:20:41,737 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:20:41,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8204 states. [2019-11-15 21:20:41,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8204 to 7442. [2019-11-15 21:20:41,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7442 states. [2019-11-15 21:20:41,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7442 states to 7442 states and 8862 transitions. [2019-11-15 21:20:41,918 INFO L78 Accepts]: Start accepts. Automaton has 7442 states and 8862 transitions. Word has length 219 [2019-11-15 21:20:41,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:20:41,919 INFO L462 AbstractCegarLoop]: Abstraction has 7442 states and 8862 transitions. [2019-11-15 21:20:41,920 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:20:41,920 INFO L276 IsEmpty]: Start isEmpty. Operand 7442 states and 8862 transitions. [2019-11-15 21:20:41,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-11-15 21:20:41,925 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:20:41,926 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-15 21:20:41,926 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:20:41,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:20:41,927 INFO L82 PathProgramCache]: Analyzing trace with hash 1442400907, now seen corresponding path program 1 times [2019-11-15 21:20:41,927 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:20:41,927 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373819893] [2019-11-15 21:20:41,928 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:41,928 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:41,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:20:41,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:42,199 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:20:42,200 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373819893] [2019-11-15 21:20:42,201 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:20:42,201 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:20:42,202 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101062626] [2019-11-15 21:20:42,202 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:20:42,202 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:20:42,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:20:42,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:20:42,204 INFO L87 Difference]: Start difference. First operand 7442 states and 8862 transitions. Second operand 4 states. [2019-11-15 21:20:43,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:20:43,858 INFO L93 Difference]: Finished difference Result 17112 states and 20555 transitions. [2019-11-15 21:20:43,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:20:43,858 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 230 [2019-11-15 21:20:43,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:20:43,908 INFO L225 Difference]: With dead ends: 17112 [2019-11-15 21:20:43,909 INFO L226 Difference]: Without dead ends: 9856 [2019-11-15 21:20:43,918 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:20:43,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9856 states. [2019-11-15 21:20:44,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9856 to 9466. [2019-11-15 21:20:44,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9466 states. [2019-11-15 21:20:44,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9466 states to 9466 states and 11150 transitions. [2019-11-15 21:20:44,127 INFO L78 Accepts]: Start accepts. Automaton has 9466 states and 11150 transitions. Word has length 230 [2019-11-15 21:20:44,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:20:44,128 INFO L462 AbstractCegarLoop]: Abstraction has 9466 states and 11150 transitions. [2019-11-15 21:20:44,129 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:20:44,129 INFO L276 IsEmpty]: Start isEmpty. Operand 9466 states and 11150 transitions. [2019-11-15 21:20:44,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-11-15 21:20:44,136 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:20:44,137 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-15 21:20:44,137 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:20:44,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:20:44,142 INFO L82 PathProgramCache]: Analyzing trace with hash -1616620059, now seen corresponding path program 1 times [2019-11-15 21:20:44,143 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:20:44,143 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113730021] [2019-11-15 21:20:44,143 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:44,144 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:44,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:20:44,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:44,748 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:20:44,748 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113730021] [2019-11-15 21:20:44,749 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:20:44,749 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:20:44,749 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910908770] [2019-11-15 21:20:44,750 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:20:44,750 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:20:44,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:20:44,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:20:44,751 INFO L87 Difference]: Start difference. First operand 9466 states and 11150 transitions. Second operand 5 states. [2019-11-15 21:20:47,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:20:47,274 INFO L93 Difference]: Finished difference Result 20253 states and 23894 transitions. [2019-11-15 21:20:47,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 21:20:47,275 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 258 [2019-11-15 21:20:47,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:20:47,311 INFO L225 Difference]: With dead ends: 20253 [2019-11-15 21:20:47,312 INFO L226 Difference]: Without dead ends: 12083 [2019-11-15 21:20:47,325 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:20:47,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12083 states. [2019-11-15 21:20:47,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12083 to 10953. [2019-11-15 21:20:47,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10953 states. [2019-11-15 21:20:47,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10953 states to 10953 states and 12810 transitions. [2019-11-15 21:20:47,501 INFO L78 Accepts]: Start accepts. Automaton has 10953 states and 12810 transitions. Word has length 258 [2019-11-15 21:20:47,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:20:47,502 INFO L462 AbstractCegarLoop]: Abstraction has 10953 states and 12810 transitions. [2019-11-15 21:20:47,502 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:20:47,503 INFO L276 IsEmpty]: Start isEmpty. Operand 10953 states and 12810 transitions. [2019-11-15 21:20:47,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-11-15 21:20:47,509 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:20:47,510 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-15 21:20:47,510 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:20:47,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:20:47,511 INFO L82 PathProgramCache]: Analyzing trace with hash 292208959, now seen corresponding path program 1 times [2019-11-15 21:20:47,511 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:20:47,511 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132883775] [2019-11-15 21:20:47,512 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:47,512 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:47,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:20:47,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:47,828 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-11-15 21:20:47,828 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132883775] [2019-11-15 21:20:47,829 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:20:47,829 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:20:47,829 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050634401] [2019-11-15 21:20:47,830 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:20:47,830 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:20:47,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:20:47,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:20:47,831 INFO L87 Difference]: Start difference. First operand 10953 states and 12810 transitions. Second operand 5 states. [2019-11-15 21:20:51,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:20:51,073 INFO L93 Difference]: Finished difference Result 34618 states and 40717 transitions. [2019-11-15 21:20:51,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 21:20:51,078 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 261 [2019-11-15 21:20:51,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:20:51,128 INFO L225 Difference]: With dead ends: 34618 [2019-11-15 21:20:51,129 INFO L226 Difference]: Without dead ends: 23851 [2019-11-15 21:20:51,145 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:20:51,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23851 states. [2019-11-15 21:20:51,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23851 to 17579. [2019-11-15 21:20:51,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17579 states. [2019-11-15 21:20:51,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17579 states to 17579 states and 20174 transitions. [2019-11-15 21:20:51,494 INFO L78 Accepts]: Start accepts. Automaton has 17579 states and 20174 transitions. Word has length 261 [2019-11-15 21:20:51,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:20:51,495 INFO L462 AbstractCegarLoop]: Abstraction has 17579 states and 20174 transitions. [2019-11-15 21:20:51,495 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:20:51,496 INFO L276 IsEmpty]: Start isEmpty. Operand 17579 states and 20174 transitions. [2019-11-15 21:20:51,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-11-15 21:20:51,510 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:20:51,512 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:20:51,513 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:20:51,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:20:51,513 INFO L82 PathProgramCache]: Analyzing trace with hash -1313485887, now seen corresponding path program 1 times [2019-11-15 21:20:51,513 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:20:51,514 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020950148] [2019-11-15 21:20:51,514 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:51,514 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:51,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:20:51,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:51,807 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2019-11-15 21:20:51,808 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020950148] [2019-11-15 21:20:51,809 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:20:51,809 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 21:20:51,809 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659442501] [2019-11-15 21:20:51,810 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:20:51,811 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:20:51,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:20:51,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:20:51,811 INFO L87 Difference]: Start difference. First operand 17579 states and 20174 transitions. Second operand 3 states. [2019-11-15 21:20:52,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:20:52,524 INFO L93 Difference]: Finished difference Result 33484 states and 38341 transitions. [2019-11-15 21:20:52,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:20:52,525 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 308 [2019-11-15 21:20:52,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:20:52,578 INFO L225 Difference]: With dead ends: 33484 [2019-11-15 21:20:52,578 INFO L226 Difference]: Without dead ends: 16649 [2019-11-15 21:20:52,596 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 21:20:52,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16649 states. [2019-11-15 21:20:52,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16649 to 16645. [2019-11-15 21:20:52,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16645 states. [2019-11-15 21:20:52,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16645 states to 16645 states and 18992 transitions. [2019-11-15 21:20:52,984 INFO L78 Accepts]: Start accepts. Automaton has 16645 states and 18992 transitions. Word has length 308 [2019-11-15 21:20:52,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:20:52,985 INFO L462 AbstractCegarLoop]: Abstraction has 16645 states and 18992 transitions. [2019-11-15 21:20:52,986 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:20:52,986 INFO L276 IsEmpty]: Start isEmpty. Operand 16645 states and 18992 transitions. [2019-11-15 21:20:53,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 427 [2019-11-15 21:20:53,019 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:20:53,020 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:20:53,023 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:20:53,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:20:53,024 INFO L82 PathProgramCache]: Analyzing trace with hash -306541705, now seen corresponding path program 1 times [2019-11-15 21:20:53,024 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:20:53,025 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781766094] [2019-11-15 21:20:53,025 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:53,026 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:53,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:20:53,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:53,445 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 503 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-11-15 21:20:53,445 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781766094] [2019-11-15 21:20:53,446 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:20:53,447 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:20:53,449 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154927859] [2019-11-15 21:20:53,449 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:20:53,450 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:20:53,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:20:53,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:20:53,451 INFO L87 Difference]: Start difference. First operand 16645 states and 18992 transitions. Second operand 4 states. [2019-11-15 21:20:55,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:20:55,332 INFO L93 Difference]: Finished difference Result 33131 states and 37836 transitions. [2019-11-15 21:20:55,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:20:55,333 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 426 [2019-11-15 21:20:55,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:20:55,359 INFO L225 Difference]: With dead ends: 33131 [2019-11-15 21:20:55,359 INFO L226 Difference]: Without dead ends: 16672 [2019-11-15 21:20:55,373 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:20:55,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16672 states. [2019-11-15 21:20:55,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16672 to 16645. [2019-11-15 21:20:55,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16645 states. [2019-11-15 21:20:55,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16645 states to 16645 states and 18734 transitions. [2019-11-15 21:20:55,642 INFO L78 Accepts]: Start accepts. Automaton has 16645 states and 18734 transitions. Word has length 426 [2019-11-15 21:20:55,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:20:55,643 INFO L462 AbstractCegarLoop]: Abstraction has 16645 states and 18734 transitions. [2019-11-15 21:20:55,644 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:20:55,644 INFO L276 IsEmpty]: Start isEmpty. Operand 16645 states and 18734 transitions. [2019-11-15 21:20:55,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 442 [2019-11-15 21:20:55,682 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:20:55,683 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:20:55,683 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:20:55,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:20:55,684 INFO L82 PathProgramCache]: Analyzing trace with hash -758299991, now seen corresponding path program 1 times [2019-11-15 21:20:55,684 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:20:55,685 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001846595] [2019-11-15 21:20:55,685 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:55,685 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:55,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:20:55,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:56,320 INFO L134 CoverageAnalysis]: Checked inductivity of 642 backedges. 529 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2019-11-15 21:20:56,320 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001846595] [2019-11-15 21:20:56,320 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:20:56,321 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:20:56,321 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099308409] [2019-11-15 21:20:56,323 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:20:56,323 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:20:56,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:20:56,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:20:56,324 INFO L87 Difference]: Start difference. First operand 16645 states and 18734 transitions. Second operand 3 states. [2019-11-15 21:20:57,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:20:57,330 INFO L93 Difference]: Finished difference Result 32536 states and 36592 transitions. [2019-11-15 21:20:57,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:20:57,331 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 441 [2019-11-15 21:20:57,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:20:57,343 INFO L225 Difference]: With dead ends: 32536 [2019-11-15 21:20:57,344 INFO L226 Difference]: Without dead ends: 15157 [2019-11-15 21:20:57,350 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:20:57,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15157 states. [2019-11-15 21:20:57,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15157 to 11657. [2019-11-15 21:20:57,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11657 states. [2019-11-15 21:20:57,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11657 states to 11657 states and 12837 transitions. [2019-11-15 21:20:57,507 INFO L78 Accepts]: Start accepts. Automaton has 11657 states and 12837 transitions. Word has length 441 [2019-11-15 21:20:57,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:20:57,508 INFO L462 AbstractCegarLoop]: Abstraction has 11657 states and 12837 transitions. [2019-11-15 21:20:57,508 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:20:57,508 INFO L276 IsEmpty]: Start isEmpty. Operand 11657 states and 12837 transitions. [2019-11-15 21:20:57,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 497 [2019-11-15 21:20:57,540 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:20:57,541 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:20:57,541 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:20:57,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:20:57,542 INFO L82 PathProgramCache]: Analyzing trace with hash -1640817050, now seen corresponding path program 1 times [2019-11-15 21:20:57,542 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:20:57,542 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098842238] [2019-11-15 21:20:57,543 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:57,543 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:57,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:20:57,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:58,138 INFO L134 CoverageAnalysis]: Checked inductivity of 488 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 417 trivial. 0 not checked. [2019-11-15 21:20:58,139 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098842238] [2019-11-15 21:20:58,139 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:20:58,140 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 21:20:58,140 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017509072] [2019-11-15 21:20:58,141 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:20:58,141 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:20:58,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:20:58,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:20:58,142 INFO L87 Difference]: Start difference. First operand 11657 states and 12837 transitions. Second operand 3 states. [2019-11-15 21:20:59,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:20:59,010 INFO L93 Difference]: Finished difference Result 22569 states and 24860 transitions. [2019-11-15 21:20:59,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:20:59,011 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 496 [2019-11-15 21:20:59,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:20:59,012 INFO L225 Difference]: With dead ends: 22569 [2019-11-15 21:20:59,012 INFO L226 Difference]: Without dead ends: 0 [2019-11-15 21:20:59,019 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 21:20:59,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-15 21:20:59,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-15 21:20:59,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-15 21:20:59,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 21:20:59,020 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 496 [2019-11-15 21:20:59,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:20:59,021 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 21:20:59,021 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:20:59,021 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-15 21:20:59,022 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-15 21:20:59,027 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-15 21:20:59,253 WARN L191 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 256 DAG size of output: 123 [2019-11-15 21:20:59,432 WARN L191 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 256 DAG size of output: 123 [2019-11-15 21:21:00,299 WARN L191 SmtUtils]: Spent 859.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 55 [2019-11-15 21:21:00,928 WARN L191 SmtUtils]: Spent 627.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 55 [2019-11-15 21:21:00,930 INFO L443 ceAbstractionStarter]: For program point L168(line 168) no Hoare annotation was computed. [2019-11-15 21:21:00,930 INFO L443 ceAbstractionStarter]: For program point L102(line 102) no Hoare annotation was computed. [2019-11-15 21:21:00,930 INFO L443 ceAbstractionStarter]: For program point L36(line 36) no Hoare annotation was computed. [2019-11-15 21:21:00,931 INFO L446 ceAbstractionStarter]: At program point L1028(lines 1028 1044) the Hoare annotation is: true [2019-11-15 21:21:00,931 INFO L443 ceAbstractionStarter]: For program point L566(lines 566 1024) no Hoare annotation was computed. [2019-11-15 21:21:00,931 INFO L443 ceAbstractionStarter]: For program point L500(lines 500 1024) no Hoare annotation was computed. [2019-11-15 21:21:00,931 INFO L443 ceAbstractionStarter]: For program point L170-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 21:21:00,931 INFO L443 ceAbstractionStarter]: For program point L104-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 21:21:00,931 INFO L443 ceAbstractionStarter]: For program point L38-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 21:21:00,931 INFO L443 ceAbstractionStarter]: For program point L963(lines 963 1024) no Hoare annotation was computed. [2019-11-15 21:21:00,931 INFO L443 ceAbstractionStarter]: For program point L831(lines 831 1024) no Hoare annotation was computed. [2019-11-15 21:21:00,931 INFO L443 ceAbstractionStarter]: For program point L171(line 171) no Hoare annotation was computed. [2019-11-15 21:21:00,931 INFO L443 ceAbstractionStarter]: For program point L105(line 105) no Hoare annotation was computed. [2019-11-15 21:21:00,932 INFO L443 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2019-11-15 21:21:00,932 INFO L443 ceAbstractionStarter]: For program point L898(lines 898 1024) no Hoare annotation was computed. [2019-11-15 21:21:00,932 INFO L443 ceAbstractionStarter]: For program point L436(lines 436 1024) no Hoare annotation was computed. [2019-11-15 21:21:00,932 INFO L443 ceAbstractionStarter]: For program point L370(lines 370 1024) no Hoare annotation was computed. [2019-11-15 21:21:00,932 INFO L443 ceAbstractionStarter]: For program point L635(lines 635 1024) no Hoare annotation was computed. [2019-11-15 21:21:00,932 INFO L443 ceAbstractionStarter]: For program point L305(lines 305 1024) no Hoare annotation was computed. [2019-11-15 21:21:00,932 INFO L443 ceAbstractionStarter]: For program point L173-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 21:21:00,932 INFO L443 ceAbstractionStarter]: For program point L107-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 21:21:00,932 INFO L443 ceAbstractionStarter]: For program point L41-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 21:21:00,932 INFO L443 ceAbstractionStarter]: For program point L240(lines 240 1024) no Hoare annotation was computed. [2019-11-15 21:21:00,933 INFO L443 ceAbstractionStarter]: For program point L174(line 174) no Hoare annotation was computed. [2019-11-15 21:21:00,933 INFO L443 ceAbstractionStarter]: For program point L108(line 108) no Hoare annotation was computed. [2019-11-15 21:21:00,933 INFO L443 ceAbstractionStarter]: For program point L42(line 42) no Hoare annotation was computed. [2019-11-15 21:21:00,933 INFO L443 ceAbstractionStarter]: For program point L769(lines 769 1024) no Hoare annotation was computed. [2019-11-15 21:21:00,933 INFO L439 ceAbstractionStarter]: At program point L1034-2(lines 1034 1043) the Hoare annotation is: (let ((.cse4 (= ~a25~0 9))) (let ((.cse7 (< 245 ~a29~0)) (.cse1 (<= ~a29~0 140)) (.cse10 (= 10 ~a25~0)) (.cse8 (not .cse4)) (.cse5 (<= ~a23~0 138)) (.cse3 (= 1 ~a4~0)) (.cse9 (<= 130 ~a29~0)) (.cse11 (<= 312 ~a23~0)) (.cse0 (= 1 ~a3~0)) (.cse6 (= 12 ~a25~0)) (.cse2 (= 15 ~a8~0))) (or (and .cse0 (or (and .cse1 (<= ~a23~0 312) .cse2 .cse3 (< 138 ~a23~0)) (and .cse4 .cse5 .cse2 .cse3) (and .cse6 .cse2 .cse3))) (and .cse1 .cse4 .cse0 .cse5 .cse2) (and (and .cse5 .cse7) .cse0 .cse2) (and .cse8 .cse0 .cse2 .cse3 .cse9) (and .cse0 .cse2 .cse3 .cse7) (and .cse5 .cse10 .cse2 .cse3) (and .cse1 .cse0 .cse10 .cse2) (and .cse8 (not (= ~a25~0 11)) .cse0 .cse2 .cse3 .cse11) (and .cse8 .cse0 .cse5 .cse2 (not (= ~a4~0 1))) (and .cse0 .cse2 .cse3 .cse9 .cse11) (and .cse0 (and .cse6 (<= ~a4~0 0)) .cse2)))) [2019-11-15 21:21:00,934 INFO L443 ceAbstractionStarter]: For program point L836(lines 836 1024) no Hoare annotation was computed. [2019-11-15 21:21:00,934 INFO L443 ceAbstractionStarter]: For program point L572(lines 572 1024) no Hoare annotation was computed. [2019-11-15 21:21:00,934 INFO L443 ceAbstractionStarter]: For program point L176-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 21:21:00,934 INFO L443 ceAbstractionStarter]: For program point L110-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 21:21:00,934 INFO L443 ceAbstractionStarter]: For program point L44-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 21:21:00,934 INFO L443 ceAbstractionStarter]: For program point L969(lines 969 1024) no Hoare annotation was computed. [2019-11-15 21:21:00,934 INFO L443 ceAbstractionStarter]: For program point L903(lines 903 1024) no Hoare annotation was computed. [2019-11-15 21:21:00,934 INFO L443 ceAbstractionStarter]: For program point L507(lines 507 1024) no Hoare annotation was computed. [2019-11-15 21:21:00,934 INFO L443 ceAbstractionStarter]: For program point L177(line 177) no Hoare annotation was computed. [2019-11-15 21:21:00,934 INFO L443 ceAbstractionStarter]: For program point L111(line 111) no Hoare annotation was computed. [2019-11-15 21:21:00,935 INFO L443 ceAbstractionStarter]: For program point L45(line 45) no Hoare annotation was computed. [2019-11-15 21:21:00,935 INFO L443 ceAbstractionStarter]: For program point L970(lines 970 980) no Hoare annotation was computed. [2019-11-15 21:21:00,935 INFO L443 ceAbstractionStarter]: For program point L904(lines 904 914) no Hoare annotation was computed. [2019-11-15 21:21:00,935 INFO L443 ceAbstractionStarter]: For program point L970-2(lines 970 980) no Hoare annotation was computed. [2019-11-15 21:21:00,935 INFO L443 ceAbstractionStarter]: For program point L904-2(lines 904 914) no Hoare annotation was computed. [2019-11-15 21:21:00,935 INFO L443 ceAbstractionStarter]: For program point L706(lines 706 1024) no Hoare annotation was computed. [2019-11-15 21:21:00,935 INFO L443 ceAbstractionStarter]: For program point L310(lines 310 1024) no Hoare annotation was computed. [2019-11-15 21:21:00,935 INFO L443 ceAbstractionStarter]: For program point L575(lines 575 1024) no Hoare annotation was computed. [2019-11-15 21:21:00,935 INFO L443 ceAbstractionStarter]: For program point L443(lines 443 1024) no Hoare annotation was computed. [2019-11-15 21:21:00,935 INFO L443 ceAbstractionStarter]: For program point L377(lines 377 1024) no Hoare annotation was computed. [2019-11-15 21:21:00,935 INFO L443 ceAbstractionStarter]: For program point L179-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 21:21:00,936 INFO L443 ceAbstractionStarter]: For program point L113-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 21:21:00,936 INFO L443 ceAbstractionStarter]: For program point L47-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 21:21:00,936 INFO L443 ceAbstractionStarter]: For program point L774(lines 774 1024) no Hoare annotation was computed. [2019-11-15 21:21:00,936 INFO L443 ceAbstractionStarter]: For program point L642(lines 642 1024) no Hoare annotation was computed. [2019-11-15 21:21:00,936 INFO L443 ceAbstractionStarter]: For program point L180(line 180) no Hoare annotation was computed. [2019-11-15 21:21:00,936 INFO L443 ceAbstractionStarter]: For program point L114(line 114) no Hoare annotation was computed. [2019-11-15 21:21:00,936 INFO L443 ceAbstractionStarter]: For program point L48(line 48) no Hoare annotation was computed. [2019-11-15 21:21:00,936 INFO L443 ceAbstractionStarter]: For program point L1039(line 1039) no Hoare annotation was computed. [2019-11-15 21:21:00,936 INFO L443 ceAbstractionStarter]: For program point L841(lines 841 1024) no Hoare annotation was computed. [2019-11-15 21:21:00,936 INFO L443 ceAbstractionStarter]: For program point L247(lines 247 1024) no Hoare annotation was computed. [2019-11-15 21:21:00,936 INFO L443 ceAbstractionStarter]: For program point L182-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 21:21:00,937 INFO L443 ceAbstractionStarter]: For program point L116-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 21:21:00,937 INFO L443 ceAbstractionStarter]: For program point L50-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 21:21:00,937 INFO L443 ceAbstractionStarter]: For program point L183(line 183) no Hoare annotation was computed. [2019-11-15 21:21:00,937 INFO L443 ceAbstractionStarter]: For program point L117(line 117) no Hoare annotation was computed. [2019-11-15 21:21:00,937 INFO L443 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2019-11-15 21:21:00,937 INFO L443 ceAbstractionStarter]: For program point L712(lines 712 1024) no Hoare annotation was computed. [2019-11-15 21:21:00,937 INFO L443 ceAbstractionStarter]: For program point L514(lines 514 1024) no Hoare annotation was computed. [2019-11-15 21:21:00,937 INFO L443 ceAbstractionStarter]: For program point L647(lines 647 1024) no Hoare annotation was computed. [2019-11-15 21:21:00,937 INFO L443 ceAbstractionStarter]: For program point L581(lines 581 1024) no Hoare annotation was computed. [2019-11-15 21:21:00,937 INFO L443 ceAbstractionStarter]: For program point L515(lines 515 525) no Hoare annotation was computed. [2019-11-15 21:21:00,938 INFO L443 ceAbstractionStarter]: For program point L515-2(lines 515 525) no Hoare annotation was computed. [2019-11-15 21:21:00,938 INFO L443 ceAbstractionStarter]: For program point L317(lines 317 1024) no Hoare annotation was computed. [2019-11-15 21:21:00,938 INFO L443 ceAbstractionStarter]: For program point L185-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 21:21:00,938 INFO L443 ceAbstractionStarter]: For program point L119-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 21:21:00,938 INFO L443 ceAbstractionStarter]: For program point L53-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 21:21:00,938 INFO L443 ceAbstractionStarter]: For program point L846(lines 846 1024) no Hoare annotation was computed. [2019-11-15 21:21:00,938 INFO L443 ceAbstractionStarter]: For program point L780(lines 780 1024) no Hoare annotation was computed. [2019-11-15 21:21:00,938 INFO L443 ceAbstractionStarter]: For program point L648(lines 648 657) no Hoare annotation was computed. [2019-11-15 21:21:00,938 INFO L443 ceAbstractionStarter]: For program point L648-2(lines 648 657) no Hoare annotation was computed. [2019-11-15 21:21:00,938 INFO L443 ceAbstractionStarter]: For program point L450(lines 450 1024) no Hoare annotation was computed. [2019-11-15 21:21:00,938 INFO L443 ceAbstractionStarter]: For program point L384(lines 384 1024) no Hoare annotation was computed. [2019-11-15 21:21:00,939 INFO L443 ceAbstractionStarter]: For program point L186(line 186) no Hoare annotation was computed. [2019-11-15 21:21:00,939 INFO L443 ceAbstractionStarter]: For program point L120(line 120) no Hoare annotation was computed. [2019-11-15 21:21:00,939 INFO L443 ceAbstractionStarter]: For program point L54(line 54) no Hoare annotation was computed. [2019-11-15 21:21:00,939 INFO L443 ceAbstractionStarter]: For program point L254(lines 254 1024) no Hoare annotation was computed. [2019-11-15 21:21:00,939 INFO L443 ceAbstractionStarter]: For program point L188-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 21:21:00,939 INFO L443 ceAbstractionStarter]: For program point L122-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 21:21:00,939 INFO L443 ceAbstractionStarter]: For program point L56-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 21:21:00,939 INFO L443 ceAbstractionStarter]: For program point L981(lines 981 1024) no Hoare annotation was computed. [2019-11-15 21:21:00,939 INFO L443 ceAbstractionStarter]: For program point L915(lines 915 1024) no Hoare annotation was computed. [2019-11-15 21:21:00,939 INFO L443 ceAbstractionStarter]: For program point L717(lines 717 1024) no Hoare annotation was computed. [2019-11-15 21:21:00,939 INFO L443 ceAbstractionStarter]: For program point L189(line 189) no Hoare annotation was computed. [2019-11-15 21:21:00,940 INFO L443 ceAbstractionStarter]: For program point L123(line 123) no Hoare annotation was computed. [2019-11-15 21:21:00,940 INFO L443 ceAbstractionStarter]: For program point L57(line 57) no Hoare annotation was computed. [2019-11-15 21:21:00,940 INFO L443 ceAbstractionStarter]: For program point L916(lines 916 926) no Hoare annotation was computed. [2019-11-15 21:21:00,940 INFO L443 ceAbstractionStarter]: For program point L916-2(lines 916 926) no Hoare annotation was computed. [2019-11-15 21:21:00,940 INFO L443 ceAbstractionStarter]: For program point L718(lines 718 730) no Hoare annotation was computed. [2019-11-15 21:21:00,940 INFO L443 ceAbstractionStarter]: For program point L718-2(lines 718 730) no Hoare annotation was computed. [2019-11-15 21:21:00,940 INFO L443 ceAbstractionStarter]: For program point L586(lines 586 1024) no Hoare annotation was computed. [2019-11-15 21:21:00,940 INFO L443 ceAbstractionStarter]: For program point L322(lines 322 1024) no Hoare annotation was computed. [2019-11-15 21:21:00,940 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-15 21:21:00,940 INFO L443 ceAbstractionStarter]: For program point L587(lines 587 597) no Hoare annotation was computed. [2019-11-15 21:21:00,940 INFO L443 ceAbstractionStarter]: For program point L587-2(lines 587 597) no Hoare annotation was computed. [2019-11-15 21:21:00,943 INFO L443 ceAbstractionStarter]: For program point L191-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 21:21:00,943 INFO L443 ceAbstractionStarter]: For program point L125-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 21:21:00,943 INFO L443 ceAbstractionStarter]: For program point L59-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 21:21:00,944 INFO L443 ceAbstractionStarter]: For program point L852(lines 852 1024) no Hoare annotation was computed. [2019-11-15 21:21:00,944 INFO L443 ceAbstractionStarter]: For program point L456(lines 456 1024) no Hoare annotation was computed. [2019-11-15 21:21:00,944 INFO L443 ceAbstractionStarter]: For program point L192(line 192) no Hoare annotation was computed. [2019-11-15 21:21:00,944 INFO L443 ceAbstractionStarter]: For program point L126(line 126) no Hoare annotation was computed. [2019-11-15 21:21:00,944 INFO L443 ceAbstractionStarter]: For program point L60(line 60) no Hoare annotation was computed. [2019-11-15 21:21:00,944 INFO L443 ceAbstractionStarter]: For program point L787(lines 787 1024) no Hoare annotation was computed. [2019-11-15 21:21:00,945 INFO L443 ceAbstractionStarter]: For program point L391(lines 391 1024) no Hoare annotation was computed. [2019-11-15 21:21:00,945 INFO L443 ceAbstractionStarter]: For program point L260(lines 260 1024) no Hoare annotation was computed. [2019-11-15 21:21:00,945 INFO L443 ceAbstractionStarter]: For program point L194-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 21:21:00,945 INFO L443 ceAbstractionStarter]: For program point L128-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 21:21:00,945 INFO L443 ceAbstractionStarter]: For program point L62-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 21:21:00,945 INFO L443 ceAbstractionStarter]: For program point L195(line 195) no Hoare annotation was computed. [2019-11-15 21:21:00,946 INFO L443 ceAbstractionStarter]: For program point L129(line 129) no Hoare annotation was computed. [2019-11-15 21:21:00,946 INFO L443 ceAbstractionStarter]: For program point L63(line 63) no Hoare annotation was computed. [2019-11-15 21:21:00,946 INFO L443 ceAbstractionStarter]: For program point L988(lines 988 1024) no Hoare annotation was computed. [2019-11-15 21:21:00,946 INFO L443 ceAbstractionStarter]: For program point L658(lines 658 1024) no Hoare annotation was computed. [2019-11-15 21:21:00,946 INFO L443 ceAbstractionStarter]: For program point L526(lines 526 1024) no Hoare annotation was computed. [2019-11-15 21:21:00,946 INFO L443 ceAbstractionStarter]: For program point L329(lines 329 1024) no Hoare annotation was computed. [2019-11-15 21:21:00,947 INFO L443 ceAbstractionStarter]: For program point L197-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 21:21:00,947 INFO L443 ceAbstractionStarter]: For program point L131-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 21:21:00,947 INFO L443 ceAbstractionStarter]: For program point L65-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 21:21:00,947 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-15 21:21:00,947 INFO L443 ceAbstractionStarter]: For program point L792(lines 792 1024) no Hoare annotation was computed. [2019-11-15 21:21:00,947 INFO L443 ceAbstractionStarter]: For program point L198(line 198) no Hoare annotation was computed. [2019-11-15 21:21:00,947 INFO L443 ceAbstractionStarter]: For program point L132(line 132) no Hoare annotation was computed. [2019-11-15 21:21:00,948 INFO L443 ceAbstractionStarter]: For program point L66(line 66) no Hoare annotation was computed. [2019-11-15 21:21:00,948 INFO L443 ceAbstractionStarter]: For program point L859(lines 859 1024) no Hoare annotation was computed. [2019-11-15 21:21:00,948 INFO L443 ceAbstractionStarter]: For program point L463(lines 463 1024) no Hoare annotation was computed. [2019-11-15 21:21:00,948 INFO L443 ceAbstractionStarter]: For program point L265(lines 265 1024) no Hoare annotation was computed. [2019-11-15 21:21:00,948 INFO L443 ceAbstractionStarter]: For program point L398(lines 398 1024) no Hoare annotation was computed. [2019-11-15 21:21:00,948 INFO L443 ceAbstractionStarter]: For program point L200-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 21:21:00,949 INFO L443 ceAbstractionStarter]: For program point L134-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 21:21:00,949 INFO L443 ceAbstractionStarter]: For program point L68-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 21:21:00,949 INFO L443 ceAbstractionStarter]: For program point L993(lines 993 1024) no Hoare annotation was computed. [2019-11-15 21:21:00,949 INFO L443 ceAbstractionStarter]: For program point L927(lines 927 1024) no Hoare annotation was computed. [2019-11-15 21:21:00,949 INFO L443 ceAbstractionStarter]: For program point L663(lines 663 1024) no Hoare annotation was computed. [2019-11-15 21:21:00,949 INFO L443 ceAbstractionStarter]: For program point L531(lines 531 1024) no Hoare annotation was computed. [2019-11-15 21:21:00,950 INFO L443 ceAbstractionStarter]: For program point L399(lines 399 410) no Hoare annotation was computed. [2019-11-15 21:21:00,950 INFO L443 ceAbstractionStarter]: For program point L399-2(lines 399 410) no Hoare annotation was computed. [2019-11-15 21:21:00,950 INFO L443 ceAbstractionStarter]: For program point L201(line 201) no Hoare annotation was computed. [2019-11-15 21:21:00,950 INFO L443 ceAbstractionStarter]: For program point L135(line 135) no Hoare annotation was computed. [2019-11-15 21:21:00,950 INFO L443 ceAbstractionStarter]: For program point L69(line 69) no Hoare annotation was computed. [2019-11-15 21:21:00,950 INFO L443 ceAbstractionStarter]: For program point L598(lines 598 1024) no Hoare annotation was computed. [2019-11-15 21:21:00,951 INFO L443 ceAbstractionStarter]: For program point L334(lines 334 1024) no Hoare annotation was computed. [2019-11-15 21:21:00,951 INFO L443 ceAbstractionStarter]: For program point L268(lines 268 1024) no Hoare annotation was computed. [2019-11-15 21:21:00,951 INFO L443 ceAbstractionStarter]: For program point L731(lines 731 1024) no Hoare annotation was computed. [2019-11-15 21:21:00,951 INFO L443 ceAbstractionStarter]: For program point L203-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 21:21:00,951 INFO L443 ceAbstractionStarter]: For program point L137-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 21:21:00,951 INFO L443 ceAbstractionStarter]: For program point L71-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 21:21:00,952 INFO L443 ceAbstractionStarter]: For program point L204(line 204) no Hoare annotation was computed. [2019-11-15 21:21:00,952 INFO L443 ceAbstractionStarter]: For program point L138(line 138) no Hoare annotation was computed. [2019-11-15 21:21:00,952 INFO L443 ceAbstractionStarter]: For program point L72(line 72) no Hoare annotation was computed. [2019-11-15 21:21:00,952 INFO L443 ceAbstractionStarter]: For program point L865(lines 865 1024) no Hoare annotation was computed. [2019-11-15 21:21:00,952 INFO L443 ceAbstractionStarter]: For program point L799(lines 799 1024) no Hoare annotation was computed. [2019-11-15 21:21:00,952 INFO L443 ceAbstractionStarter]: For program point L932(lines 932 1024) no Hoare annotation was computed. [2019-11-15 21:21:00,953 INFO L443 ceAbstractionStarter]: For program point L866(lines 866 875) no Hoare annotation was computed. [2019-11-15 21:21:00,953 INFO L443 ceAbstractionStarter]: For program point L866-2(lines 866 875) no Hoare annotation was computed. [2019-11-15 21:21:00,953 INFO L443 ceAbstractionStarter]: For program point L470(lines 470 1024) no Hoare annotation was computed. [2019-11-15 21:21:00,953 INFO L443 ceAbstractionStarter]: For program point L140-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 21:21:00,953 INFO L443 ceAbstractionStarter]: For program point L74-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 21:21:00,953 INFO L443 ceAbstractionStarter]: For program point L603(lines 603 1024) no Hoare annotation was computed. [2019-11-15 21:21:00,954 INFO L443 ceAbstractionStarter]: For program point L537(lines 537 1024) no Hoare annotation was computed. [2019-11-15 21:21:00,954 INFO L443 ceAbstractionStarter]: For program point L141(line 141) no Hoare annotation was computed. [2019-11-15 21:21:00,954 INFO L443 ceAbstractionStarter]: For program point L75(line 75) no Hoare annotation was computed. [2019-11-15 21:21:00,954 INFO L443 ceAbstractionStarter]: For program point L1000(lines 1000 1024) no Hoare annotation was computed. [2019-11-15 21:21:00,954 INFO L443 ceAbstractionStarter]: For program point L670(lines 670 1024) no Hoare annotation was computed. [2019-11-15 21:21:00,954 INFO L443 ceAbstractionStarter]: For program point L604(lines 604 614) no Hoare annotation was computed. [2019-11-15 21:21:00,954 INFO L443 ceAbstractionStarter]: For program point L604-2(lines 604 614) no Hoare annotation was computed. [2019-11-15 21:21:00,955 INFO L443 ceAbstractionStarter]: For program point L340(lines 340 1024) no Hoare annotation was computed. [2019-11-15 21:21:00,955 INFO L443 ceAbstractionStarter]: For program point L275(lines 275 1024) no Hoare annotation was computed. [2019-11-15 21:21:00,955 INFO L443 ceAbstractionStarter]: For program point L143-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 21:21:00,955 INFO L443 ceAbstractionStarter]: For program point L77-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 21:21:00,955 INFO L443 ceAbstractionStarter]: For program point L804(lines 804 1024) no Hoare annotation was computed. [2019-11-15 21:21:00,955 INFO L443 ceAbstractionStarter]: For program point L738(lines 738 1024) no Hoare annotation was computed. [2019-11-15 21:21:00,956 INFO L443 ceAbstractionStarter]: For program point L144(line 144) no Hoare annotation was computed. [2019-11-15 21:21:00,956 INFO L443 ceAbstractionStarter]: For program point L78(line 78) no Hoare annotation was computed. [2019-11-15 21:21:00,956 INFO L443 ceAbstractionStarter]: For program point L805(lines 805 815) no Hoare annotation was computed. [2019-11-15 21:21:00,956 INFO L443 ceAbstractionStarter]: For program point L805-2(lines 805 815) no Hoare annotation was computed. [2019-11-15 21:21:00,956 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 84) no Hoare annotation was computed. [2019-11-15 21:21:00,957 INFO L443 ceAbstractionStarter]: For program point L542(lines 542 1024) no Hoare annotation was computed. [2019-11-15 21:21:00,957 INFO L443 ceAbstractionStarter]: For program point L146-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 21:21:00,957 INFO L443 ceAbstractionStarter]: For program point L80-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 21:21:00,957 INFO L443 ceAbstractionStarter]: For program point L1005(lines 1005 1024) no Hoare annotation was computed. [2019-11-15 21:21:00,957 INFO L443 ceAbstractionStarter]: For program point L939(lines 939 1024) no Hoare annotation was computed. [2019-11-15 21:21:00,957 INFO L443 ceAbstractionStarter]: For program point L675(lines 675 1024) no Hoare annotation was computed. [2019-11-15 21:21:00,958 INFO L443 ceAbstractionStarter]: For program point L477(lines 477 1024) no Hoare annotation was computed. [2019-11-15 21:21:00,958 INFO L443 ceAbstractionStarter]: For program point L411(lines 411 1024) no Hoare annotation was computed. [2019-11-15 21:21:00,958 INFO L443 ceAbstractionStarter]: For program point L147(line 147) no Hoare annotation was computed. [2019-11-15 21:21:00,958 INFO L443 ceAbstractionStarter]: For program point L81(line 81) no Hoare annotation was computed. [2019-11-15 21:21:00,958 INFO L443 ceAbstractionStarter]: For program point L940(lines 940 952) no Hoare annotation was computed. [2019-11-15 21:21:00,958 INFO L443 ceAbstractionStarter]: For program point L940-2(lines 940 952) no Hoare annotation was computed. [2019-11-15 21:21:00,959 INFO L443 ceAbstractionStarter]: For program point L478(lines 478 486) no Hoare annotation was computed. [2019-11-15 21:21:00,959 INFO L443 ceAbstractionStarter]: For program point L478-2(lines 478 486) no Hoare annotation was computed. [2019-11-15 21:21:00,959 INFO L443 ceAbstractionStarter]: For program point L346(lines 346 1024) no Hoare annotation was computed. [2019-11-15 21:21:00,959 INFO L443 ceAbstractionStarter]: For program point L280(lines 280 1024) no Hoare annotation was computed. [2019-11-15 21:21:00,959 INFO L443 ceAbstractionStarter]: For program point L214(lines 214 1024) no Hoare annotation was computed. [2019-11-15 21:21:00,959 INFO L443 ceAbstractionStarter]: For program point L743(lines 743 1024) no Hoare annotation was computed. [2019-11-15 21:21:00,960 INFO L443 ceAbstractionStarter]: For program point L149-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 21:21:00,960 INFO L443 ceAbstractionStarter]: For program point L83-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 21:21:00,960 INFO L443 ceAbstractionStarter]: For program point L876(lines 876 1024) no Hoare annotation was computed. [2019-11-15 21:21:00,960 INFO L443 ceAbstractionStarter]: For program point L150(line 150) no Hoare annotation was computed. [2019-11-15 21:21:00,960 INFO L443 ceAbstractionStarter]: For program point L84(line 84) no Hoare annotation was computed. [2019-11-15 21:21:00,960 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-15 21:21:00,961 INFO L443 ceAbstractionStarter]: For program point L152-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 21:21:00,961 INFO L443 ceAbstractionStarter]: For program point L86-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 21:21:00,961 INFO L443 ceAbstractionStarter]: For program point L681(lines 681 1024) no Hoare annotation was computed. [2019-11-15 21:21:00,961 INFO L443 ceAbstractionStarter]: For program point L615(lines 615 1024) no Hoare annotation was computed. [2019-11-15 21:21:00,961 INFO L443 ceAbstractionStarter]: For program point L549(lines 549 1024) no Hoare annotation was computed. [2019-11-15 21:21:00,961 INFO L443 ceAbstractionStarter]: For program point L417(lines 417 1024) no Hoare annotation was computed. [2019-11-15 21:21:00,962 INFO L443 ceAbstractionStarter]: For program point L153(line 153) no Hoare annotation was computed. [2019-11-15 21:21:00,962 INFO L443 ceAbstractionStarter]: For program point L87(line 87) no Hoare annotation was computed. [2019-11-15 21:21:00,962 INFO L443 ceAbstractionStarter]: For program point L1012(lines 1012 1024) no Hoare annotation was computed. [2019-11-15 21:21:00,962 INFO L443 ceAbstractionStarter]: For program point L881(lines 881 1024) no Hoare annotation was computed. [2019-11-15 21:21:00,962 INFO L443 ceAbstractionStarter]: For program point L353(lines 353 1024) no Hoare annotation was computed. [2019-11-15 21:21:00,962 INFO L443 ceAbstractionStarter]: For program point L287(lines 287 1024) no Hoare annotation was computed. [2019-11-15 21:21:00,962 INFO L443 ceAbstractionStarter]: For program point L221(lines 221 1024) no Hoare annotation was computed. [2019-11-15 21:21:00,962 INFO L443 ceAbstractionStarter]: For program point L155-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 21:21:00,962 INFO L443 ceAbstractionStarter]: For program point L89-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 21:21:00,962 INFO L443 ceAbstractionStarter]: For program point L23(lines 23 25) no Hoare annotation was computed. [2019-11-15 21:21:00,962 INFO L443 ceAbstractionStarter]: For program point L23-2(lines 22 1026) no Hoare annotation was computed. [2019-11-15 21:21:00,963 INFO L443 ceAbstractionStarter]: For program point L816(lines 816 1024) no Hoare annotation was computed. [2019-11-15 21:21:00,963 INFO L443 ceAbstractionStarter]: For program point L750(lines 750 1024) no Hoare annotation was computed. [2019-11-15 21:21:00,963 INFO L443 ceAbstractionStarter]: For program point L156(line 156) no Hoare annotation was computed. [2019-11-15 21:21:00,963 INFO L443 ceAbstractionStarter]: For program point L90(line 90) no Hoare annotation was computed. [2019-11-15 21:21:00,963 INFO L443 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2019-11-15 21:21:00,963 INFO L443 ceAbstractionStarter]: For program point L487(lines 487 1024) no Hoare annotation was computed. [2019-11-15 21:21:00,963 INFO L443 ceAbstractionStarter]: For program point L488(lines 488 499) no Hoare annotation was computed. [2019-11-15 21:21:00,963 INFO L443 ceAbstractionStarter]: For program point L422(lines 422 1024) no Hoare annotation was computed. [2019-11-15 21:21:00,963 INFO L443 ceAbstractionStarter]: For program point L488-2(lines 488 499) no Hoare annotation was computed. [2019-11-15 21:21:00,963 INFO L443 ceAbstractionStarter]: For program point L158-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 21:21:00,963 INFO L443 ceAbstractionStarter]: For program point L92-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 21:21:00,963 INFO L443 ceAbstractionStarter]: For program point L26-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 21:21:00,964 INFO L443 ceAbstractionStarter]: For program point L1017(lines 1017 1024) no Hoare annotation was computed. [2019-11-15 21:21:00,964 INFO L443 ceAbstractionStarter]: For program point L621(lines 621 1024) no Hoare annotation was computed. [2019-11-15 21:21:00,964 INFO L443 ceAbstractionStarter]: For program point L555(lines 555 1024) no Hoare annotation was computed. [2019-11-15 21:21:00,964 INFO L443 ceAbstractionStarter]: For program point L159(line 159) no Hoare annotation was computed. [2019-11-15 21:21:00,964 INFO L443 ceAbstractionStarter]: For program point L93(line 93) no Hoare annotation was computed. [2019-11-15 21:21:00,964 INFO L443 ceAbstractionStarter]: For program point L27(line 27) no Hoare annotation was computed. [2019-11-15 21:21:00,964 INFO L443 ceAbstractionStarter]: For program point L886(lines 886 1024) no Hoare annotation was computed. [2019-11-15 21:21:00,964 INFO L443 ceAbstractionStarter]: For program point L688(lines 688 1024) no Hoare annotation was computed. [2019-11-15 21:21:00,965 INFO L443 ceAbstractionStarter]: For program point L358(lines 358 1024) no Hoare annotation was computed. [2019-11-15 21:21:00,965 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-15 21:21:00,965 INFO L443 ceAbstractionStarter]: For program point L953(lines 953 1024) no Hoare annotation was computed. [2019-11-15 21:21:00,965 INFO L443 ceAbstractionStarter]: For program point L227(lines 227 1024) no Hoare annotation was computed. [2019-11-15 21:21:00,965 INFO L443 ceAbstractionStarter]: For program point L161-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 21:21:00,965 INFO L443 ceAbstractionStarter]: For program point L95-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 21:21:00,966 INFO L443 ceAbstractionStarter]: For program point L29-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 21:21:00,966 INFO L443 ceAbstractionStarter]: For program point L822(lines 822 1024) no Hoare annotation was computed. [2019-11-15 21:21:00,966 INFO L443 ceAbstractionStarter]: For program point L294(lines 294 1024) no Hoare annotation was computed. [2019-11-15 21:21:00,966 INFO L443 ceAbstractionStarter]: For program point L162(line 162) no Hoare annotation was computed. [2019-11-15 21:21:00,966 INFO L443 ceAbstractionStarter]: For program point L96(line 96) no Hoare annotation was computed. [2019-11-15 21:21:00,966 INFO L443 ceAbstractionStarter]: For program point L30(line 30) no Hoare annotation was computed. [2019-11-15 21:21:00,967 INFO L443 ceAbstractionStarter]: For program point L757(lines 757 1024) no Hoare annotation was computed. [2019-11-15 21:21:00,967 INFO L443 ceAbstractionStarter]: For program point L758(lines 758 768) no Hoare annotation was computed. [2019-11-15 21:21:00,967 INFO L443 ceAbstractionStarter]: For program point L758-2(lines 758 768) no Hoare annotation was computed. [2019-11-15 21:21:00,967 INFO L443 ceAbstractionStarter]: For program point L164-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 21:21:00,967 INFO L443 ceAbstractionStarter]: For program point L98-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 21:21:00,967 INFO L443 ceAbstractionStarter]: For program point L32-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 21:21:00,968 INFO L443 ceAbstractionStarter]: For program point L825(lines 825 1024) no Hoare annotation was computed. [2019-11-15 21:21:00,968 INFO L443 ceAbstractionStarter]: For program point L561(lines 561 1024) no Hoare annotation was computed. [2019-11-15 21:21:00,968 INFO L443 ceAbstractionStarter]: For program point L429(lines 429 1024) no Hoare annotation was computed. [2019-11-15 21:21:00,968 INFO L443 ceAbstractionStarter]: For program point L165(line 165) no Hoare annotation was computed. [2019-11-15 21:21:00,968 INFO L443 ceAbstractionStarter]: For program point L99(line 99) no Hoare annotation was computed. [2019-11-15 21:21:00,968 INFO L443 ceAbstractionStarter]: For program point L33(line 33) no Hoare annotation was computed. [2019-11-15 21:21:00,969 INFO L443 ceAbstractionStarter]: For program point L958(lines 958 1024) no Hoare annotation was computed. [2019-11-15 21:21:00,969 INFO L443 ceAbstractionStarter]: For program point L694(lines 694 1024) no Hoare annotation was computed. [2019-11-15 21:21:00,969 INFO L443 ceAbstractionStarter]: For program point L628(lines 628 1024) no Hoare annotation was computed. [2019-11-15 21:21:00,969 INFO L439 ceAbstractionStarter]: At program point L1025(lines 22 1026) the Hoare annotation is: (let ((.cse4 (= ~a25~0 9))) (let ((.cse7 (< 245 ~a29~0)) (.cse1 (<= ~a29~0 140)) (.cse10 (= 10 ~a25~0)) (.cse8 (not .cse4)) (.cse5 (<= ~a23~0 138)) (.cse3 (= 1 ~a4~0)) (.cse9 (<= 130 ~a29~0)) (.cse11 (<= 312 ~a23~0)) (.cse0 (= 1 ~a3~0)) (.cse6 (= 12 ~a25~0)) (.cse2 (= 15 ~a8~0))) (or (and .cse0 (or (and .cse1 (<= ~a23~0 312) .cse2 .cse3 (< 138 ~a23~0)) (and .cse4 .cse5 .cse2 .cse3) (and .cse6 .cse2 .cse3))) (and .cse1 .cse4 .cse0 .cse5 .cse2) (and (and .cse5 .cse7) .cse0 .cse2) (and .cse8 .cse0 .cse2 .cse3 .cse9) (and .cse0 .cse2 .cse3 .cse7) (and .cse5 .cse10 .cse2 .cse3) (and .cse1 .cse0 .cse10 .cse2) (and .cse8 (not (= ~a25~0 11)) .cse0 .cse2 .cse3 .cse11) (and .cse8 .cse0 .cse5 .cse2 (not (= ~a4~0 1))) (and .cse0 .cse2 .cse3 .cse9 .cse11) (and .cse0 (and .cse6 (<= ~a4~0 0)) .cse2)))) [2019-11-15 21:21:00,969 INFO L443 ceAbstractionStarter]: For program point L893(lines 893 1024) no Hoare annotation was computed. [2019-11-15 21:21:00,969 INFO L443 ceAbstractionStarter]: For program point L695(lines 695 705) no Hoare annotation was computed. [2019-11-15 21:21:00,970 INFO L443 ceAbstractionStarter]: For program point L695-2(lines 695 705) no Hoare annotation was computed. [2019-11-15 21:21:00,970 INFO L443 ceAbstractionStarter]: For program point L365(lines 365 1024) no Hoare annotation was computed. [2019-11-15 21:21:00,970 INFO L443 ceAbstractionStarter]: For program point L299(lines 299 1024) no Hoare annotation was computed. [2019-11-15 21:21:00,970 INFO L443 ceAbstractionStarter]: For program point L233(lines 233 1024) no Hoare annotation was computed. [2019-11-15 21:21:00,970 INFO L443 ceAbstractionStarter]: For program point L167-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 21:21:00,970 INFO L443 ceAbstractionStarter]: For program point L101-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 21:21:00,970 INFO L443 ceAbstractionStarter]: For program point L35-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 21:21:01,002 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 09:21:01 BoogieIcfgContainer [2019-11-15 21:21:01,002 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 21:21:01,003 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 21:21:01,003 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 21:21:01,003 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 21:21:01,004 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:20:27" (3/4) ... [2019-11-15 21:21:01,008 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-15 21:21:01,041 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-15 21:21:01,044 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-15 21:21:01,292 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_39fe9cd9-7b53-43f5-9a0e-5acaf7e72506/bin/uautomizer/witness.graphml [2019-11-15 21:21:01,293 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 21:21:01,295 INFO L168 Benchmark]: Toolchain (without parser) took 38530.20 ms. Allocated memory was 1.0 GB in the beginning and 1.9 GB in the end (delta: 918.0 MB). Free memory was 939.3 MB in the beginning and 1.4 GB in the end (delta: -480.5 MB). Peak memory consumption was 437.6 MB. Max. memory is 11.5 GB. [2019-11-15 21:21:01,295 INFO L168 Benchmark]: CDTParser took 0.38 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:21:01,296 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1249.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 165.7 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -175.1 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. [2019-11-15 21:21:01,296 INFO L168 Benchmark]: Boogie Procedure Inliner took 183.82 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: 20.1 MB). Peak memory consumption was 20.1 MB. Max. memory is 11.5 GB. [2019-11-15 21:21:01,297 INFO L168 Benchmark]: Boogie Preprocessor took 158.98 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: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2019-11-15 21:21:01,297 INFO L168 Benchmark]: RCFGBuilder took 2822.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 904.0 MB in the end (delta: 176.8 MB). Peak memory consumption was 176.8 MB. Max. memory is 11.5 GB. [2019-11-15 21:21:01,298 INFO L168 Benchmark]: TraceAbstraction took 33819.45 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 752.4 MB). Free memory was 904.0 MB in the beginning and 1.5 GB in the end (delta: -564.2 MB). Peak memory consumption was 188.1 MB. Max. memory is 11.5 GB. [2019-11-15 21:21:01,298 INFO L168 Benchmark]: Witness Printer took 290.33 ms. Allocated memory is still 1.9 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 48.5 MB). Peak memory consumption was 48.5 MB. Max. memory is 11.5 GB. [2019-11-15 21:21:01,301 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 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1249.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 165.7 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -175.1 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 183.82 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: 20.1 MB). Peak memory consumption was 20.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 158.98 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: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2822.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 904.0 MB in the end (delta: 176.8 MB). Peak memory consumption was 176.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 33819.45 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 752.4 MB). Free memory was 904.0 MB in the beginning and 1.5 GB in the end (delta: -564.2 MB). Peak memory consumption was 188.1 MB. Max. memory is 11.5 GB. * Witness Printer took 290.33 ms. Allocated memory is still 1.9 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 48.5 MB). Peak memory consumption was 48.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 84]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1028]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1034]: Loop Invariant Derived loop invariant: ((((((((((1 == a3 && ((((((a29 <= 140 && a23 <= 312) && 15 == a8) && 1 == a4) && 138 < a23) || (((a25 == 9 && a23 <= 138) && 15 == a8) && 1 == a4)) || ((12 == a25 && 15 == a8) && 1 == a4))) || ((((a29 <= 140 && a25 == 9) && 1 == a3) && a23 <= 138) && 15 == a8)) || (((a23 <= 138 && 245 < a29) && 1 == a3) && 15 == a8)) || ((((!(a25 == 9) && 1 == a3) && 15 == a8) && 1 == a4) && 130 <= a29)) || (((1 == a3 && 15 == a8) && 1 == a4) && 245 < a29)) || (((a23 <= 138 && 10 == a25) && 15 == a8) && 1 == a4)) || (((a29 <= 140 && 1 == a3) && 10 == a25) && 15 == a8)) || (((((!(a25 == 9) && !(a25 == 11)) && 1 == a3) && 15 == a8) && 1 == a4) && 312 <= a23)) || ((((!(a25 == 9) && 1 == a3) && a23 <= 138) && 15 == a8) && !(a4 == 1))) || ((((1 == a3 && 15 == a8) && 1 == a4) && 130 <= a29) && 312 <= a23)) || ((1 == a3 && 12 == a25 && a4 <= 0) && 15 == a8) - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: ((((((((((1 == a3 && ((((((a29 <= 140 && a23 <= 312) && 15 == a8) && 1 == a4) && 138 < a23) || (((a25 == 9 && a23 <= 138) && 15 == a8) && 1 == a4)) || ((12 == a25 && 15 == a8) && 1 == a4))) || ((((a29 <= 140 && a25 == 9) && 1 == a3) && a23 <= 138) && 15 == a8)) || (((a23 <= 138 && 245 < a29) && 1 == a3) && 15 == a8)) || ((((!(a25 == 9) && 1 == a3) && 15 == a8) && 1 == a4) && 130 <= a29)) || (((1 == a3 && 15 == a8) && 1 == a4) && 245 < a29)) || (((a23 <= 138 && 10 == a25) && 15 == a8) && 1 == a4)) || (((a29 <= 140 && 1 == a3) && 10 == a25) && 15 == a8)) || (((((!(a25 == 9) && !(a25 == 11)) && 1 == a3) && 15 == a8) && 1 == a4) && 312 <= a23)) || ((((!(a25 == 9) && 1 == a3) && a23 <= 138) && 15 == a8) && !(a4 == 1))) || ((((1 == a3 && 15 == a8) && 1 == a4) && 130 <= a29) && 312 <= a23)) || ((1 == a3 && 12 == a25 && a4 <= 0) && 15 == a8) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 283 locations, 1 error locations. Result: SAFE, OverallTime: 33.6s, OverallIterations: 12, TraceHistogramMax: 5, AutomataDifference: 24.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.9s, HoareTripleCheckerStatistics: 1520 SDtfs, 4314 SDslu, 466 SDs, 0 SdLazy, 12149 SolverSat, 2313 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 18.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 43 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17579occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 12295 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 136 NumberOfFragments, 401 HoareAnnotationTreeSize, 3 FomulaSimplifications, 5174 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 3 FomulaSimplificationsInter, 1874 FormulaSimplificationTreeSizeReductionInter, 1.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 3009 NumberOfCodeBlocks, 3009 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 2997 ConstructedInterpolants, 0 QuantifiedInterpolants, 2296024 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 2465/2465 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...