./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix000_power.opt.i --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_41273b15-5f1b-4935-8377-46d1271e3a18/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_41273b15-5f1b-4935-8377-46d1271e3a18/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_41273b15-5f1b-4935-8377-46d1271e3a18/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_41273b15-5f1b-4935-8377-46d1271e3a18/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix000_power.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_41273b15-5f1b-4935-8377-46d1271e3a18/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_41273b15-5f1b-4935-8377-46d1271e3a18/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 69417dd099e45f70ae9a3d3ca34de041dff6082f ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-16 00:08:02,590 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:08:02,592 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:08:02,605 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:08:02,605 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:08:02,607 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:08:02,608 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:08:02,618 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:08:02,622 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:08:02,625 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:08:02,626 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:08:02,627 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:08:02,627 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:08:02,628 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:08:02,629 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:08:02,629 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:08:02,630 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:08:02,631 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:08:02,632 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:08:02,636 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:08:02,639 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:08:02,640 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:08:02,643 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:08:02,643 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:08:02,648 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:08:02,648 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:08:02,648 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:08:02,650 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:08:02,650 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:08:02,652 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:08:02,652 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:08:02,652 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:08:02,653 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:08:02,654 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:08:02,655 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:08:02,655 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:08:02,656 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:08:02,656 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:08:02,656 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:08:02,657 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:08:02,657 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:08:02,658 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_41273b15-5f1b-4935-8377-46d1271e3a18/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-16 00:08:02,683 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:08:02,683 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:08:02,684 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:08:02,684 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:08:02,685 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:08:02,685 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:08:02,685 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:08:02,685 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:08:02,685 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:08:02,686 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:08:02,686 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-16 00:08:02,686 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-16 00:08:02,686 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-16 00:08:02,686 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:08:02,687 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:08:02,687 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:08:02,687 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-16 00:08:02,687 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:08:02,688 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:08:02,688 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-16 00:08:02,688 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-16 00:08:02,688 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:08:02,688 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:08:02,689 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-16 00:08:02,689 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-16 00:08:02,689 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:08:02,689 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-16 00:08:02,689 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-16 00:08:02,690 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_41273b15-5f1b-4935-8377-46d1271e3a18/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 -> 69417dd099e45f70ae9a3d3ca34de041dff6082f [2019-11-16 00:08:02,736 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:08:02,751 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:08:02,753 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:08:02,755 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:08:02,755 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:08:02,757 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_41273b15-5f1b-4935-8377-46d1271e3a18/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix000_power.opt.i [2019-11-16 00:08:02,815 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_41273b15-5f1b-4935-8377-46d1271e3a18/bin/uautomizer/data/6272ca1c8/a0560cb7e8b2465f8d1d5508f3786e38/FLAG498a708b4 [2019-11-16 00:08:03,276 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:08:03,276 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_41273b15-5f1b-4935-8377-46d1271e3a18/sv-benchmarks/c/pthread-wmm/mix000_power.opt.i [2019-11-16 00:08:03,289 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_41273b15-5f1b-4935-8377-46d1271e3a18/bin/uautomizer/data/6272ca1c8/a0560cb7e8b2465f8d1d5508f3786e38/FLAG498a708b4 [2019-11-16 00:08:03,614 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_41273b15-5f1b-4935-8377-46d1271e3a18/bin/uautomizer/data/6272ca1c8/a0560cb7e8b2465f8d1d5508f3786e38 [2019-11-16 00:08:03,616 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:08:03,618 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:08:03,618 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:08:03,619 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:08:03,622 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:08:03,623 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:08:03" (1/1) ... [2019-11-16 00:08:03,625 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32febd0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:08:03, skipping insertion in model container [2019-11-16 00:08:03,625 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:08:03" (1/1) ... [2019-11-16 00:08:03,631 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:08:03,677 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:08:04,082 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:08:04,094 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:08:04,152 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:08:04,227 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:08:04,228 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:08:04 WrapperNode [2019-11-16 00:08:04,228 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:08:04,229 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:08:04,229 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:08:04,229 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:08:04,237 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:08:04" (1/1) ... [2019-11-16 00:08:04,255 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:08:04" (1/1) ... [2019-11-16 00:08:04,284 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:08:04,285 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:08:04,285 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:08:04,285 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:08:04,294 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:08:04" (1/1) ... [2019-11-16 00:08:04,294 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:08:04" (1/1) ... [2019-11-16 00:08:04,298 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:08:04" (1/1) ... [2019-11-16 00:08:04,299 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:08:04" (1/1) ... [2019-11-16 00:08:04,314 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:08:04" (1/1) ... [2019-11-16 00:08:04,319 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:08:04" (1/1) ... [2019-11-16 00:08:04,323 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:08:04" (1/1) ... [2019-11-16 00:08:04,327 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:08:04,328 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:08:04,328 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:08:04,328 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:08:04,329 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:08:04" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_41273b15-5f1b-4935-8377-46d1271e3a18/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-16 00:08:04,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-16 00:08:04,395 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-16 00:08:04,395 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-16 00:08:04,395 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-16 00:08:04,396 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-16 00:08:04,396 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-16 00:08:04,397 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-16 00:08:04,397 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-16 00:08:04,397 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-16 00:08:04,397 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:08:04,399 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:08:04,401 WARN L202 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-11-16 00:08:05,179 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:08:05,180 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-16 00:08:05,181 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:08:05 BoogieIcfgContainer [2019-11-16 00:08:05,181 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:08:05,182 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-16 00:08:05,182 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-16 00:08:05,185 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-16 00:08:05,185 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:08:03" (1/3) ... [2019-11-16 00:08:05,186 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e0d8159 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:08:05, skipping insertion in model container [2019-11-16 00:08:05,186 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:08:04" (2/3) ... [2019-11-16 00:08:05,186 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e0d8159 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:08:05, skipping insertion in model container [2019-11-16 00:08:05,187 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:08:05" (3/3) ... [2019-11-16 00:08:05,188 INFO L109 eAbstractionObserver]: Analyzing ICFG mix000_power.opt.i [2019-11-16 00:08:05,230 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,230 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,230 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,230 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,230 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,231 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,231 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,231 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,231 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,231 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,232 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,232 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,232 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,232 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,232 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,232 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,233 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,233 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,233 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,233 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,233 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,233 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,234 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,234 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,234 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,234 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,234 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,235 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,235 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,235 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,235 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,235 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,236 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,236 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,236 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,236 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,236 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,236 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,237 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,237 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,237 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,237 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,237 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,237 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,238 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,238 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,238 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,238 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,238 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,239 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,239 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,239 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,239 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,239 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,239 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,240 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,240 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,240 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,240 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,240 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,240 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,241 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,241 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,241 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,241 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,241 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,241 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,242 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,242 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,242 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,242 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,242 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,243 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,243 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,243 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,243 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,243 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,243 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,243 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,244 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,244 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,244 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,244 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,244 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,245 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,245 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,245 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,245 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,245 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,245 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,246 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,246 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,246 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,246 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,247 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,247 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,247 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,248 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,248 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,248 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,250 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,250 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,251 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,251 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,251 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,251 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,251 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,251 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,252 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,252 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,252 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,252 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,252 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,253 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,253 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,253 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,253 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,253 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,253 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,253 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,254 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,254 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,254 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,254 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,254 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,255 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,255 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,255 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,255 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,255 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,255 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,256 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,256 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,256 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,256 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,256 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,256 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,257 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,257 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,257 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,257 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,257 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,257 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,258 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,258 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,258 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,258 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,258 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,258 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,259 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,259 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,259 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,259 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,259 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,259 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,260 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,260 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,260 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,260 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,260 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,260 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,261 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,261 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,261 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,261 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,261 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,261 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,262 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,262 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,262 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,262 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,262 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,263 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,263 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,263 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,263 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,263 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,263 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,264 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,264 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,264 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,264 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,264 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,264 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,264 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,265 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,265 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,265 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,265 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,265 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,265 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,266 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,266 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,266 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,266 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,266 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,267 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,267 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,267 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,268 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,268 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,268 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,268 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,268 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,268 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,269 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,269 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,269 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,269 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,269 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,269 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,270 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,270 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,270 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,270 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,270 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:08:05,279 WARN L141 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-16 00:08:05,279 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-16 00:08:05,287 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-16 00:08:05,297 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-16 00:08:05,314 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-16 00:08:05,314 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-16 00:08:05,314 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-16 00:08:05,315 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:08:05,315 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:08:05,315 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-16 00:08:05,315 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:08:05,315 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-16 00:08:05,327 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 172 places, 225 transitions [2019-11-16 00:08:13,139 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 80072 states. [2019-11-16 00:08:13,141 INFO L276 IsEmpty]: Start isEmpty. Operand 80072 states. [2019-11-16 00:08:13,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-16 00:08:13,150 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:08:13,151 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:08:13,153 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:08:13,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:08:13,158 INFO L82 PathProgramCache]: Analyzing trace with hash -1993251115, now seen corresponding path program 1 times [2019-11-16 00:08:13,166 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:08:13,166 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791811583] [2019-11-16 00:08:13,167 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:13,167 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:13,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:08:13,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:13,423 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-16 00:08:13,424 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791811583] [2019-11-16 00:08:13,425 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:08:13,430 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:08:13,430 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305752119] [2019-11-16 00:08:13,434 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:08:13,434 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:08:13,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:08:13,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:08:13,447 INFO L87 Difference]: Start difference. First operand 80072 states. Second operand 4 states. [2019-11-16 00:08:14,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:08:14,681 INFO L93 Difference]: Finished difference Result 80712 states and 324637 transitions. [2019-11-16 00:08:14,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:08:14,683 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-11-16 00:08:14,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:08:15,057 INFO L225 Difference]: With dead ends: 80712 [2019-11-16 00:08:15,057 INFO L226 Difference]: Without dead ends: 59000 [2019-11-16 00:08:15,058 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:08:16,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59000 states. [2019-11-16 00:08:18,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59000 to 59000. [2019-11-16 00:08:18,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59000 states. [2019-11-16 00:08:18,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59000 states to 59000 states and 240125 transitions. [2019-11-16 00:08:18,404 INFO L78 Accepts]: Start accepts. Automaton has 59000 states and 240125 transitions. Word has length 39 [2019-11-16 00:08:18,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:08:18,405 INFO L462 AbstractCegarLoop]: Abstraction has 59000 states and 240125 transitions. [2019-11-16 00:08:18,405 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:08:18,406 INFO L276 IsEmpty]: Start isEmpty. Operand 59000 states and 240125 transitions. [2019-11-16 00:08:18,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-16 00:08:18,416 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:08:18,416 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:08:18,416 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:08:18,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:08:18,417 INFO L82 PathProgramCache]: Analyzing trace with hash 901797958, now seen corresponding path program 1 times [2019-11-16 00:08:18,417 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:08:18,417 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019411843] [2019-11-16 00:08:18,417 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:18,418 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:18,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:08:18,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:18,513 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-16 00:08:18,514 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019411843] [2019-11-16 00:08:18,514 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:08:18,514 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:08:18,514 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403414498] [2019-11-16 00:08:18,516 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:08:18,516 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:08:18,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:08:18,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:08:18,517 INFO L87 Difference]: Start difference. First operand 59000 states and 240125 transitions. Second operand 5 states. [2019-11-16 00:08:19,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:08:19,832 INFO L93 Difference]: Finished difference Result 95594 states and 363716 transitions. [2019-11-16 00:08:19,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:08:19,833 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-11-16 00:08:19,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:08:20,201 INFO L225 Difference]: With dead ends: 95594 [2019-11-16 00:08:20,201 INFO L226 Difference]: Without dead ends: 95042 [2019-11-16 00:08:20,202 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:08:26,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95042 states. [2019-11-16 00:08:27,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95042 to 93164. [2019-11-16 00:08:27,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93164 states. [2019-11-16 00:08:28,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93164 states to 93164 states and 356302 transitions. [2019-11-16 00:08:28,162 INFO L78 Accepts]: Start accepts. Automaton has 93164 states and 356302 transitions. Word has length 47 [2019-11-16 00:08:28,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:08:28,164 INFO L462 AbstractCegarLoop]: Abstraction has 93164 states and 356302 transitions. [2019-11-16 00:08:28,164 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:08:28,164 INFO L276 IsEmpty]: Start isEmpty. Operand 93164 states and 356302 transitions. [2019-11-16 00:08:28,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-16 00:08:28,170 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:08:28,171 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:08:28,171 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:08:28,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:08:28,172 INFO L82 PathProgramCache]: Analyzing trace with hash 410147852, now seen corresponding path program 1 times [2019-11-16 00:08:28,172 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:08:28,172 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232683912] [2019-11-16 00:08:28,172 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:28,172 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:28,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:08:28,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:28,265 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-16 00:08:28,265 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232683912] [2019-11-16 00:08:28,265 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:08:28,265 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:08:28,265 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964456673] [2019-11-16 00:08:28,266 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:08:28,266 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:08:28,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:08:28,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:08:28,267 INFO L87 Difference]: Start difference. First operand 93164 states and 356302 transitions. Second operand 5 states. [2019-11-16 00:08:29,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:08:29,209 INFO L93 Difference]: Finished difference Result 118508 states and 442883 transitions. [2019-11-16 00:08:29,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:08:29,210 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-11-16 00:08:29,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:08:29,603 INFO L225 Difference]: With dead ends: 118508 [2019-11-16 00:08:29,603 INFO L226 Difference]: Without dead ends: 118060 [2019-11-16 00:08:29,604 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:08:30,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118060 states. [2019-11-16 00:08:33,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118060 to 104153. [2019-11-16 00:08:33,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104153 states. [2019-11-16 00:08:33,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104153 states to 104153 states and 394236 transitions. [2019-11-16 00:08:33,282 INFO L78 Accepts]: Start accepts. Automaton has 104153 states and 394236 transitions. Word has length 48 [2019-11-16 00:08:33,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:08:33,283 INFO L462 AbstractCegarLoop]: Abstraction has 104153 states and 394236 transitions. [2019-11-16 00:08:33,283 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:08:33,283 INFO L276 IsEmpty]: Start isEmpty. Operand 104153 states and 394236 transitions. [2019-11-16 00:08:33,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-16 00:08:33,292 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:08:33,293 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:08:33,293 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:08:33,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:08:33,293 INFO L82 PathProgramCache]: Analyzing trace with hash -101372750, now seen corresponding path program 1 times [2019-11-16 00:08:33,294 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:08:33,294 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177666192] [2019-11-16 00:08:33,294 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:33,294 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:33,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:08:33,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:33,347 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-16 00:08:33,347 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177666192] [2019-11-16 00:08:33,348 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:08:33,348 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:08:33,348 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445355724] [2019-11-16 00:08:33,349 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:08:33,349 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:08:33,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:08:33,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:08:33,355 INFO L87 Difference]: Start difference. First operand 104153 states and 394236 transitions. Second operand 3 states. [2019-11-16 00:08:34,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:08:34,072 INFO L93 Difference]: Finished difference Result 170911 states and 627058 transitions. [2019-11-16 00:08:34,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:08:34,073 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-11-16 00:08:34,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:08:34,478 INFO L225 Difference]: With dead ends: 170911 [2019-11-16 00:08:34,478 INFO L226 Difference]: Without dead ends: 170911 [2019-11-16 00:08:34,478 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-16 00:08:37,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170911 states. [2019-11-16 00:08:38,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170911 to 157189. [2019-11-16 00:08:38,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157189 states. [2019-11-16 00:08:39,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157189 states to 157189 states and 581290 transitions. [2019-11-16 00:08:39,400 INFO L78 Accepts]: Start accepts. Automaton has 157189 states and 581290 transitions. Word has length 50 [2019-11-16 00:08:39,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:08:39,401 INFO L462 AbstractCegarLoop]: Abstraction has 157189 states and 581290 transitions. [2019-11-16 00:08:39,401 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:08:39,401 INFO L276 IsEmpty]: Start isEmpty. Operand 157189 states and 581290 transitions. [2019-11-16 00:08:39,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-16 00:08:39,424 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:08:39,424 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:08:39,425 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:08:39,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:08:39,425 INFO L82 PathProgramCache]: Analyzing trace with hash 1006283261, now seen corresponding path program 1 times [2019-11-16 00:08:39,425 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:08:39,425 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766599437] [2019-11-16 00:08:39,426 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:39,426 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:39,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:08:39,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:39,519 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-16 00:08:39,519 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766599437] [2019-11-16 00:08:39,520 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:08:39,520 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:08:39,520 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200338003] [2019-11-16 00:08:39,520 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:08:39,520 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:08:39,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:08:39,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:08:39,521 INFO L87 Difference]: Start difference. First operand 157189 states and 581290 transitions. Second operand 6 states. [2019-11-16 00:08:45,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:08:45,900 INFO L93 Difference]: Finished difference Result 212573 states and 766172 transitions. [2019-11-16 00:08:45,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-16 00:08:45,900 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-11-16 00:08:45,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:08:46,399 INFO L225 Difference]: With dead ends: 212573 [2019-11-16 00:08:46,399 INFO L226 Difference]: Without dead ends: 212053 [2019-11-16 00:08:46,399 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2019-11-16 00:08:48,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212053 states. [2019-11-16 00:08:50,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212053 to 157971. [2019-11-16 00:08:50,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157971 states. [2019-11-16 00:08:51,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157971 states to 157971 states and 584227 transitions. [2019-11-16 00:08:51,235 INFO L78 Accepts]: Start accepts. Automaton has 157971 states and 584227 transitions. Word has length 54 [2019-11-16 00:08:51,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:08:51,236 INFO L462 AbstractCegarLoop]: Abstraction has 157971 states and 584227 transitions. [2019-11-16 00:08:51,236 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:08:51,236 INFO L276 IsEmpty]: Start isEmpty. Operand 157971 states and 584227 transitions. [2019-11-16 00:08:51,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-16 00:08:51,254 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:08:51,254 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:08:51,254 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:08:51,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:08:51,254 INFO L82 PathProgramCache]: Analyzing trace with hash -1519606445, now seen corresponding path program 1 times [2019-11-16 00:08:51,255 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:08:51,255 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253152731] [2019-11-16 00:08:51,255 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:51,255 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:51,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:08:51,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:51,432 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-16 00:08:51,433 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253152731] [2019-11-16 00:08:51,433 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:08:51,433 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:08:51,433 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680348044] [2019-11-16 00:08:51,433 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:08:51,433 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:08:51,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:08:51,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:08:51,434 INFO L87 Difference]: Start difference. First operand 157971 states and 584227 transitions. Second operand 6 states. [2019-11-16 00:08:52,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:08:52,964 INFO L93 Difference]: Finished difference Result 208198 states and 766451 transitions. [2019-11-16 00:08:52,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:08:52,964 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-11-16 00:08:52,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:08:53,468 INFO L225 Difference]: With dead ends: 208198 [2019-11-16 00:08:53,468 INFO L226 Difference]: Without dead ends: 208198 [2019-11-16 00:08:53,468 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:08:55,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208198 states. [2019-11-16 00:08:59,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208198 to 193994. [2019-11-16 00:08:59,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193994 states. [2019-11-16 00:08:59,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193994 states to 193994 states and 714235 transitions. [2019-11-16 00:08:59,739 INFO L78 Accepts]: Start accepts. Automaton has 193994 states and 714235 transitions. Word has length 54 [2019-11-16 00:08:59,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:08:59,740 INFO L462 AbstractCegarLoop]: Abstraction has 193994 states and 714235 transitions. [2019-11-16 00:08:59,740 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:08:59,740 INFO L276 IsEmpty]: Start isEmpty. Operand 193994 states and 714235 transitions. [2019-11-16 00:08:59,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-16 00:08:59,763 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:08:59,763 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:08:59,763 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:08:59,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:08:59,764 INFO L82 PathProgramCache]: Analyzing trace with hash 978409492, now seen corresponding path program 1 times [2019-11-16 00:08:59,764 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:08:59,764 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250200273] [2019-11-16 00:08:59,764 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:59,764 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:59,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:08:59,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:59,900 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-16 00:08:59,900 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250200273] [2019-11-16 00:08:59,901 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:08:59,901 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:08:59,901 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231801240] [2019-11-16 00:08:59,901 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:08:59,901 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:08:59,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:08:59,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:08:59,902 INFO L87 Difference]: Start difference. First operand 193994 states and 714235 transitions. Second operand 7 states. [2019-11-16 00:09:03,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:09:03,304 INFO L93 Difference]: Finished difference Result 277137 states and 986575 transitions. [2019-11-16 00:09:03,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-16 00:09:03,306 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-11-16 00:09:03,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:09:03,941 INFO L225 Difference]: With dead ends: 277137 [2019-11-16 00:09:03,942 INFO L226 Difference]: Without dead ends: 277137 [2019-11-16 00:09:03,942 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:09:06,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277137 states. [2019-11-16 00:09:16,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277137 to 222093. [2019-11-16 00:09:17,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222093 states. [2019-11-16 00:09:18,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222093 states to 222093 states and 805379 transitions. [2019-11-16 00:09:18,453 INFO L78 Accepts]: Start accepts. Automaton has 222093 states and 805379 transitions. Word has length 54 [2019-11-16 00:09:18,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:09:18,453 INFO L462 AbstractCegarLoop]: Abstraction has 222093 states and 805379 transitions. [2019-11-16 00:09:18,453 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:09:18,453 INFO L276 IsEmpty]: Start isEmpty. Operand 222093 states and 805379 transitions. [2019-11-16 00:09:18,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-16 00:09:18,476 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:09:18,476 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:09:18,476 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:09:18,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:18,477 INFO L82 PathProgramCache]: Analyzing trace with hash 1865913173, now seen corresponding path program 1 times [2019-11-16 00:09:18,477 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:09:18,477 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748986096] [2019-11-16 00:09:18,477 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:18,478 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:18,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:09:18,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:18,557 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-16 00:09:18,557 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748986096] [2019-11-16 00:09:18,557 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:09:18,557 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:09:18,558 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355054006] [2019-11-16 00:09:18,558 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:09:18,558 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:09:18,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:09:18,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:09:18,559 INFO L87 Difference]: Start difference. First operand 222093 states and 805379 transitions. Second operand 4 states. [2019-11-16 00:09:18,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:09:18,681 INFO L93 Difference]: Finished difference Result 31666 states and 98776 transitions. [2019-11-16 00:09:18,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:09:18,681 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2019-11-16 00:09:18,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:09:18,733 INFO L225 Difference]: With dead ends: 31666 [2019-11-16 00:09:18,733 INFO L226 Difference]: Without dead ends: 25368 [2019-11-16 00:09:18,734 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:09:18,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25368 states. [2019-11-16 00:09:19,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25368 to 25121. [2019-11-16 00:09:19,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25121 states. [2019-11-16 00:09:19,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25121 states to 25121 states and 76285 transitions. [2019-11-16 00:09:19,099 INFO L78 Accepts]: Start accepts. Automaton has 25121 states and 76285 transitions. Word has length 54 [2019-11-16 00:09:19,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:09:19,100 INFO L462 AbstractCegarLoop]: Abstraction has 25121 states and 76285 transitions. [2019-11-16 00:09:19,100 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:09:19,100 INFO L276 IsEmpty]: Start isEmpty. Operand 25121 states and 76285 transitions. [2019-11-16 00:09:19,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-16 00:09:19,105 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:09:19,106 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:09:19,106 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:09:19,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:19,106 INFO L82 PathProgramCache]: Analyzing trace with hash 1209339817, now seen corresponding path program 1 times [2019-11-16 00:09:19,106 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:09:19,106 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465467668] [2019-11-16 00:09:19,106 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:19,106 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:19,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:09:19,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:19,202 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-16 00:09:19,202 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465467668] [2019-11-16 00:09:19,202 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:09:19,202 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:09:19,203 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238668056] [2019-11-16 00:09:19,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:09:19,203 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:09:19,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:09:19,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:09:19,204 INFO L87 Difference]: Start difference. First operand 25121 states and 76285 transitions. Second operand 4 states. [2019-11-16 00:09:19,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:09:19,662 INFO L93 Difference]: Finished difference Result 32379 states and 99236 transitions. [2019-11-16 00:09:19,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:09:19,663 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-11-16 00:09:19,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:09:19,709 INFO L225 Difference]: With dead ends: 32379 [2019-11-16 00:09:19,709 INFO L226 Difference]: Without dead ends: 32379 [2019-11-16 00:09:19,709 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:09:19,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32379 states. [2019-11-16 00:09:20,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32379 to 28488. [2019-11-16 00:09:20,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28488 states. [2019-11-16 00:09:20,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28488 states to 28488 states and 86775 transitions. [2019-11-16 00:09:20,097 INFO L78 Accepts]: Start accepts. Automaton has 28488 states and 86775 transitions. Word has length 64 [2019-11-16 00:09:20,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:09:20,097 INFO L462 AbstractCegarLoop]: Abstraction has 28488 states and 86775 transitions. [2019-11-16 00:09:20,097 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:09:20,097 INFO L276 IsEmpty]: Start isEmpty. Operand 28488 states and 86775 transitions. [2019-11-16 00:09:20,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-16 00:09:20,104 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:09:20,104 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:09:20,104 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:09:20,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:20,105 INFO L82 PathProgramCache]: Analyzing trace with hash -1342817144, now seen corresponding path program 1 times [2019-11-16 00:09:20,105 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:09:20,105 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372340783] [2019-11-16 00:09:20,105 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:20,105 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:20,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:09:20,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:20,215 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-16 00:09:20,215 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372340783] [2019-11-16 00:09:20,216 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:09:20,216 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:09:20,216 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046592242] [2019-11-16 00:09:20,217 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:09:20,217 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:09:20,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:09:20,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:09:20,218 INFO L87 Difference]: Start difference. First operand 28488 states and 86775 transitions. Second operand 6 states. [2019-11-16 00:09:20,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:09:20,904 INFO L93 Difference]: Finished difference Result 38566 states and 114981 transitions. [2019-11-16 00:09:20,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-16 00:09:20,904 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2019-11-16 00:09:20,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:09:20,958 INFO L225 Difference]: With dead ends: 38566 [2019-11-16 00:09:20,958 INFO L226 Difference]: Without dead ends: 38518 [2019-11-16 00:09:20,958 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2019-11-16 00:09:21,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38518 states. [2019-11-16 00:09:21,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38518 to 32517. [2019-11-16 00:09:21,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32517 states. [2019-11-16 00:09:21,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32517 states to 32517 states and 97747 transitions. [2019-11-16 00:09:21,426 INFO L78 Accepts]: Start accepts. Automaton has 32517 states and 97747 transitions. Word has length 64 [2019-11-16 00:09:21,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:09:21,426 INFO L462 AbstractCegarLoop]: Abstraction has 32517 states and 97747 transitions. [2019-11-16 00:09:21,426 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:09:21,427 INFO L276 IsEmpty]: Start isEmpty. Operand 32517 states and 97747 transitions. [2019-11-16 00:09:21,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-11-16 00:09:21,440 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:09:21,440 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:09:21,440 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:09:21,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:21,440 INFO L82 PathProgramCache]: Analyzing trace with hash -886142855, now seen corresponding path program 1 times [2019-11-16 00:09:21,441 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:09:21,441 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467640408] [2019-11-16 00:09:21,441 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:21,441 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:21,441 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:09:21,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:21,491 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-16 00:09:21,491 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467640408] [2019-11-16 00:09:21,491 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:09:21,491 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:09:21,492 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774654594] [2019-11-16 00:09:21,492 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:09:21,492 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:09:21,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:09:21,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:09:21,493 INFO L87 Difference]: Start difference. First operand 32517 states and 97747 transitions. Second operand 3 states. [2019-11-16 00:09:21,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:09:21,694 INFO L93 Difference]: Finished difference Result 36901 states and 109184 transitions. [2019-11-16 00:09:21,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:09:21,695 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-11-16 00:09:21,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:09:21,761 INFO L225 Difference]: With dead ends: 36901 [2019-11-16 00:09:21,762 INFO L226 Difference]: Without dead ends: 36901 [2019-11-16 00:09:21,762 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-16 00:09:21,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36901 states. [2019-11-16 00:09:23,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36901 to 32227. [2019-11-16 00:09:23,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32227 states. [2019-11-16 00:09:23,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32227 states to 32227 states and 94698 transitions. [2019-11-16 00:09:23,279 INFO L78 Accepts]: Start accepts. Automaton has 32227 states and 94698 transitions. Word has length 70 [2019-11-16 00:09:23,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:09:23,279 INFO L462 AbstractCegarLoop]: Abstraction has 32227 states and 94698 transitions. [2019-11-16 00:09:23,279 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:09:23,279 INFO L276 IsEmpty]: Start isEmpty. Operand 32227 states and 94698 transitions. [2019-11-16 00:09:23,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-16 00:09:23,289 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:09:23,289 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:09:23,289 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:09:23,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:23,290 INFO L82 PathProgramCache]: Analyzing trace with hash -1869471284, now seen corresponding path program 1 times [2019-11-16 00:09:23,290 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:09:23,290 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526857924] [2019-11-16 00:09:23,290 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:23,290 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:23,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:09:23,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:23,441 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-16 00:09:23,442 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526857924] [2019-11-16 00:09:23,443 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:09:23,443 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:09:23,444 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390014089] [2019-11-16 00:09:23,444 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:09:23,444 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:09:23,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:09:23,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:09:23,445 INFO L87 Difference]: Start difference. First operand 32227 states and 94698 transitions. Second operand 7 states. [2019-11-16 00:09:24,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:09:24,410 INFO L93 Difference]: Finished difference Result 44458 states and 130306 transitions. [2019-11-16 00:09:24,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-16 00:09:24,411 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 71 [2019-11-16 00:09:24,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:09:24,469 INFO L225 Difference]: With dead ends: 44458 [2019-11-16 00:09:24,469 INFO L226 Difference]: Without dead ends: 44245 [2019-11-16 00:09:24,470 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-11-16 00:09:24,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44245 states. [2019-11-16 00:09:24,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44245 to 37608. [2019-11-16 00:09:24,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37608 states. [2019-11-16 00:09:24,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37608 states to 37608 states and 110222 transitions. [2019-11-16 00:09:24,985 INFO L78 Accepts]: Start accepts. Automaton has 37608 states and 110222 transitions. Word has length 71 [2019-11-16 00:09:24,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:09:24,985 INFO L462 AbstractCegarLoop]: Abstraction has 37608 states and 110222 transitions. [2019-11-16 00:09:24,985 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:09:24,985 INFO L276 IsEmpty]: Start isEmpty. Operand 37608 states and 110222 transitions. [2019-11-16 00:09:24,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-16 00:09:24,997 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:09:24,997 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:09:24,998 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:09:24,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:24,998 INFO L82 PathProgramCache]: Analyzing trace with hash 628544653, now seen corresponding path program 1 times [2019-11-16 00:09:24,998 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:09:24,998 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719235158] [2019-11-16 00:09:24,998 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:24,998 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:24,998 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:09:25,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:25,141 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-16 00:09:25,141 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719235158] [2019-11-16 00:09:25,141 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:09:25,141 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-16 00:09:25,142 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979393569] [2019-11-16 00:09:25,142 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-16 00:09:25,142 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:09:25,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-16 00:09:25,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:09:25,142 INFO L87 Difference]: Start difference. First operand 37608 states and 110222 transitions. Second operand 8 states. [2019-11-16 00:09:26,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:09:26,384 INFO L93 Difference]: Finished difference Result 45174 states and 130617 transitions. [2019-11-16 00:09:26,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-16 00:09:26,385 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 71 [2019-11-16 00:09:26,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:09:26,443 INFO L225 Difference]: With dead ends: 45174 [2019-11-16 00:09:26,443 INFO L226 Difference]: Without dead ends: 45174 [2019-11-16 00:09:26,443 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-11-16 00:09:26,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45174 states. [2019-11-16 00:09:26,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45174 to 39735. [2019-11-16 00:09:26,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39735 states. [2019-11-16 00:09:26,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39735 states to 39735 states and 115957 transitions. [2019-11-16 00:09:26,981 INFO L78 Accepts]: Start accepts. Automaton has 39735 states and 115957 transitions. Word has length 71 [2019-11-16 00:09:26,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:09:26,981 INFO L462 AbstractCegarLoop]: Abstraction has 39735 states and 115957 transitions. [2019-11-16 00:09:26,981 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-16 00:09:26,981 INFO L276 IsEmpty]: Start isEmpty. Operand 39735 states and 115957 transitions. [2019-11-16 00:09:26,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-16 00:09:26,994 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:09:26,994 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:09:26,994 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:09:26,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:26,995 INFO L82 PathProgramCache]: Analyzing trace with hash 1516048334, now seen corresponding path program 1 times [2019-11-16 00:09:26,995 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:09:26,995 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024812333] [2019-11-16 00:09:26,995 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:26,995 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:26,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:09:27,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:27,069 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-16 00:09:27,069 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024812333] [2019-11-16 00:09:27,070 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:09:27,070 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:09:27,070 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251664133] [2019-11-16 00:09:27,070 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:09:27,071 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:09:27,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:09:27,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:09:27,071 INFO L87 Difference]: Start difference. First operand 39735 states and 115957 transitions. Second operand 3 states. [2019-11-16 00:09:27,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:09:27,203 INFO L93 Difference]: Finished difference Result 32259 states and 92079 transitions. [2019-11-16 00:09:27,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:09:27,204 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-11-16 00:09:27,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:09:27,257 INFO L225 Difference]: With dead ends: 32259 [2019-11-16 00:09:27,257 INFO L226 Difference]: Without dead ends: 32103 [2019-11-16 00:09:27,258 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:09:27,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32103 states. [2019-11-16 00:09:28,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32103 to 30373. [2019-11-16 00:09:28,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30373 states. [2019-11-16 00:09:28,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30373 states to 30373 states and 86835 transitions. [2019-11-16 00:09:28,141 INFO L78 Accepts]: Start accepts. Automaton has 30373 states and 86835 transitions. Word has length 71 [2019-11-16 00:09:28,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:09:28,141 INFO L462 AbstractCegarLoop]: Abstraction has 30373 states and 86835 transitions. [2019-11-16 00:09:28,141 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:09:28,141 INFO L276 IsEmpty]: Start isEmpty. Operand 30373 states and 86835 transitions. [2019-11-16 00:09:28,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-16 00:09:28,154 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:09:28,154 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:09:28,154 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:09:28,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:28,155 INFO L82 PathProgramCache]: Analyzing trace with hash -480769285, now seen corresponding path program 1 times [2019-11-16 00:09:28,155 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:09:28,155 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530046573] [2019-11-16 00:09:28,155 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:28,156 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:28,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:09:28,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:28,318 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-16 00:09:28,319 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530046573] [2019-11-16 00:09:28,319 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:09:28,319 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-16 00:09:28,319 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885654555] [2019-11-16 00:09:28,320 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-16 00:09:28,320 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:09:28,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-16 00:09:28,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:09:28,321 INFO L87 Difference]: Start difference. First operand 30373 states and 86835 transitions. Second operand 8 states. [2019-11-16 00:09:29,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:09:29,139 INFO L93 Difference]: Finished difference Result 33879 states and 96034 transitions. [2019-11-16 00:09:29,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-16 00:09:29,139 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 72 [2019-11-16 00:09:29,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:09:29,189 INFO L225 Difference]: With dead ends: 33879 [2019-11-16 00:09:29,189 INFO L226 Difference]: Without dead ends: 33879 [2019-11-16 00:09:29,189 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-11-16 00:09:29,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33879 states. [2019-11-16 00:09:29,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33879 to 31309. [2019-11-16 00:09:29,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31309 states. [2019-11-16 00:09:29,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31309 states to 31309 states and 89292 transitions. [2019-11-16 00:09:29,589 INFO L78 Accepts]: Start accepts. Automaton has 31309 states and 89292 transitions. Word has length 72 [2019-11-16 00:09:29,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:09:29,589 INFO L462 AbstractCegarLoop]: Abstraction has 31309 states and 89292 transitions. [2019-11-16 00:09:29,589 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-16 00:09:29,589 INFO L276 IsEmpty]: Start isEmpty. Operand 31309 states and 89292 transitions. [2019-11-16 00:09:29,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-16 00:09:29,603 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:09:29,604 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:09:29,604 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:09:29,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:29,604 INFO L82 PathProgramCache]: Analyzing trace with hash 406734396, now seen corresponding path program 1 times [2019-11-16 00:09:29,604 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:09:29,605 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449912839] [2019-11-16 00:09:29,605 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:29,605 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:29,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:09:29,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:29,678 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-16 00:09:29,679 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449912839] [2019-11-16 00:09:29,679 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:09:29,679 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:09:29,679 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244271446] [2019-11-16 00:09:29,680 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:09:29,680 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:09:29,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:09:29,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:09:29,680 INFO L87 Difference]: Start difference. First operand 31309 states and 89292 transitions. Second operand 5 states. [2019-11-16 00:09:29,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:09:29,779 INFO L93 Difference]: Finished difference Result 10978 states and 27240 transitions. [2019-11-16 00:09:29,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:09:29,780 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2019-11-16 00:09:29,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:09:29,791 INFO L225 Difference]: With dead ends: 10978 [2019-11-16 00:09:29,791 INFO L226 Difference]: Without dead ends: 9559 [2019-11-16 00:09:29,791 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:09:29,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9559 states. [2019-11-16 00:09:29,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9559 to 7168. [2019-11-16 00:09:29,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7168 states. [2019-11-16 00:09:29,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7168 states to 7168 states and 17856 transitions. [2019-11-16 00:09:29,873 INFO L78 Accepts]: Start accepts. Automaton has 7168 states and 17856 transitions. Word has length 72 [2019-11-16 00:09:29,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:09:29,873 INFO L462 AbstractCegarLoop]: Abstraction has 7168 states and 17856 transitions. [2019-11-16 00:09:29,874 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:09:29,874 INFO L276 IsEmpty]: Start isEmpty. Operand 7168 states and 17856 transitions. [2019-11-16 00:09:29,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-16 00:09:29,879 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:09:29,879 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:09:29,880 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:09:29,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:29,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1068847130, now seen corresponding path program 1 times [2019-11-16 00:09:29,880 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:09:29,880 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470906948] [2019-11-16 00:09:29,880 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:29,880 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:29,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:09:29,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:29,970 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-16 00:09:29,971 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470906948] [2019-11-16 00:09:29,971 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:09:29,971 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:09:29,971 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892640052] [2019-11-16 00:09:29,972 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:09:29,972 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:09:29,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:09:29,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:09:29,972 INFO L87 Difference]: Start difference. First operand 7168 states and 17856 transitions. Second operand 4 states. [2019-11-16 00:09:30,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:09:30,183 INFO L93 Difference]: Finished difference Result 8324 states and 20367 transitions. [2019-11-16 00:09:30,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:09:30,183 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-11-16 00:09:30,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:09:30,193 INFO L225 Difference]: With dead ends: 8324 [2019-11-16 00:09:30,193 INFO L226 Difference]: Without dead ends: 8324 [2019-11-16 00:09:30,193 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:09:30,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8324 states. [2019-11-16 00:09:30,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8324 to 7790. [2019-11-16 00:09:30,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7790 states. [2019-11-16 00:09:30,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7790 states to 7790 states and 19208 transitions. [2019-11-16 00:09:30,272 INFO L78 Accepts]: Start accepts. Automaton has 7790 states and 19208 transitions. Word has length 101 [2019-11-16 00:09:30,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:09:30,273 INFO L462 AbstractCegarLoop]: Abstraction has 7790 states and 19208 transitions. [2019-11-16 00:09:30,273 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:09:30,273 INFO L276 IsEmpty]: Start isEmpty. Operand 7790 states and 19208 transitions. [2019-11-16 00:09:30,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-16 00:09:30,278 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:09:30,279 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:09:30,279 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:09:30,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:30,279 INFO L82 PathProgramCache]: Analyzing trace with hash 175917351, now seen corresponding path program 1 times [2019-11-16 00:09:30,279 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:09:30,279 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219454102] [2019-11-16 00:09:30,279 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:30,280 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:30,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:09:30,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:30,417 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-16 00:09:30,417 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219454102] [2019-11-16 00:09:30,417 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:09:30,418 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:09:30,418 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125703021] [2019-11-16 00:09:30,418 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:09:30,418 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:09:30,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:09:30,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:09:30,419 INFO L87 Difference]: Start difference. First operand 7790 states and 19208 transitions. Second operand 7 states. [2019-11-16 00:09:30,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:09:30,812 INFO L93 Difference]: Finished difference Result 12610 states and 29969 transitions. [2019-11-16 00:09:30,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:09:30,813 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 101 [2019-11-16 00:09:30,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:09:30,823 INFO L225 Difference]: With dead ends: 12610 [2019-11-16 00:09:30,824 INFO L226 Difference]: Without dead ends: 12527 [2019-11-16 00:09:30,824 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:09:30,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12527 states. [2019-11-16 00:09:30,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12527 to 10295. [2019-11-16 00:09:30,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10295 states. [2019-11-16 00:09:30,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10295 states to 10295 states and 24742 transitions. [2019-11-16 00:09:30,939 INFO L78 Accepts]: Start accepts. Automaton has 10295 states and 24742 transitions. Word has length 101 [2019-11-16 00:09:30,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:09:30,939 INFO L462 AbstractCegarLoop]: Abstraction has 10295 states and 24742 transitions. [2019-11-16 00:09:30,939 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:09:30,940 INFO L276 IsEmpty]: Start isEmpty. Operand 10295 states and 24742 transitions. [2019-11-16 00:09:30,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-16 00:09:30,947 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:09:30,948 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:09:30,948 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:09:30,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:30,948 INFO L82 PathProgramCache]: Analyzing trace with hash -1901291992, now seen corresponding path program 1 times [2019-11-16 00:09:30,948 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:09:30,948 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742214956] [2019-11-16 00:09:30,948 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:30,949 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:30,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:09:30,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:31,074 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-16 00:09:31,074 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742214956] [2019-11-16 00:09:31,075 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:09:31,075 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:09:31,075 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67062455] [2019-11-16 00:09:31,075 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:09:31,075 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:09:31,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:09:31,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:09:31,076 INFO L87 Difference]: Start difference. First operand 10295 states and 24742 transitions. Second operand 7 states. [2019-11-16 00:09:31,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:09:31,615 INFO L93 Difference]: Finished difference Result 13668 states and 31488 transitions. [2019-11-16 00:09:31,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-16 00:09:31,616 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 101 [2019-11-16 00:09:31,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:09:31,627 INFO L225 Difference]: With dead ends: 13668 [2019-11-16 00:09:31,627 INFO L226 Difference]: Without dead ends: 13668 [2019-11-16 00:09:31,627 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-11-16 00:09:31,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13668 states. [2019-11-16 00:09:31,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13668 to 11386. [2019-11-16 00:09:31,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11386 states. [2019-11-16 00:09:31,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11386 states to 11386 states and 26587 transitions. [2019-11-16 00:09:31,755 INFO L78 Accepts]: Start accepts. Automaton has 11386 states and 26587 transitions. Word has length 101 [2019-11-16 00:09:31,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:09:31,755 INFO L462 AbstractCegarLoop]: Abstraction has 11386 states and 26587 transitions. [2019-11-16 00:09:31,755 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:09:31,755 INFO L276 IsEmpty]: Start isEmpty. Operand 11386 states and 26587 transitions. [2019-11-16 00:09:31,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-16 00:09:31,764 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:09:31,765 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:09:31,765 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:09:31,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:31,765 INFO L82 PathProgramCache]: Analyzing trace with hash -1689941079, now seen corresponding path program 1 times [2019-11-16 00:09:31,765 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:09:31,765 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327209192] [2019-11-16 00:09:31,765 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:31,766 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:31,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:09:31,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:31,885 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-16 00:09:31,885 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327209192] [2019-11-16 00:09:31,885 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:09:31,885 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:09:31,885 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929032073] [2019-11-16 00:09:31,886 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:09:31,886 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:09:31,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:09:31,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:09:31,886 INFO L87 Difference]: Start difference. First operand 11386 states and 26587 transitions. Second operand 7 states. [2019-11-16 00:09:32,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:09:32,484 INFO L93 Difference]: Finished difference Result 16253 states and 37843 transitions. [2019-11-16 00:09:32,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-16 00:09:32,484 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 101 [2019-11-16 00:09:32,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:09:32,498 INFO L225 Difference]: With dead ends: 16253 [2019-11-16 00:09:32,498 INFO L226 Difference]: Without dead ends: 16253 [2019-11-16 00:09:32,498 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-11-16 00:09:32,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16253 states. [2019-11-16 00:09:32,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16253 to 14164. [2019-11-16 00:09:32,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14164 states. [2019-11-16 00:09:32,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14164 states to 14164 states and 33167 transitions. [2019-11-16 00:09:32,651 INFO L78 Accepts]: Start accepts. Automaton has 14164 states and 33167 transitions. Word has length 101 [2019-11-16 00:09:32,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:09:32,651 INFO L462 AbstractCegarLoop]: Abstraction has 14164 states and 33167 transitions. [2019-11-16 00:09:32,651 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:09:32,651 INFO L276 IsEmpty]: Start isEmpty. Operand 14164 states and 33167 transitions. [2019-11-16 00:09:32,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-16 00:09:32,663 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:09:32,663 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:09:32,663 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:09:32,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:32,664 INFO L82 PathProgramCache]: Analyzing trace with hash 2094492040, now seen corresponding path program 1 times [2019-11-16 00:09:32,664 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:09:32,664 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903327100] [2019-11-16 00:09:32,664 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:32,664 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:32,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:09:32,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:32,736 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-16 00:09:32,736 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903327100] [2019-11-16 00:09:32,736 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:09:32,736 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:09:32,737 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901782257] [2019-11-16 00:09:32,737 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:09:32,737 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:09:32,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:09:32,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:09:32,738 INFO L87 Difference]: Start difference. First operand 14164 states and 33167 transitions. Second operand 4 states. [2019-11-16 00:09:33,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:09:33,056 INFO L93 Difference]: Finished difference Result 14245 states and 33356 transitions. [2019-11-16 00:09:33,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:09:33,057 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-11-16 00:09:33,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:09:33,073 INFO L225 Difference]: With dead ends: 14245 [2019-11-16 00:09:33,073 INFO L226 Difference]: Without dead ends: 14227 [2019-11-16 00:09:33,074 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:09:33,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14227 states. [2019-11-16 00:09:33,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14227 to 13870. [2019-11-16 00:09:33,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13870 states. [2019-11-16 00:09:33,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13870 states to 13870 states and 32507 transitions. [2019-11-16 00:09:33,413 INFO L78 Accepts]: Start accepts. Automaton has 13870 states and 32507 transitions. Word has length 101 [2019-11-16 00:09:33,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:09:33,413 INFO L462 AbstractCegarLoop]: Abstraction has 13870 states and 32507 transitions. [2019-11-16 00:09:33,413 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:09:33,413 INFO L276 IsEmpty]: Start isEmpty. Operand 13870 states and 32507 transitions. [2019-11-16 00:09:33,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-16 00:09:33,429 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:09:33,429 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:09:33,430 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:09:33,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:33,430 INFO L82 PathProgramCache]: Analyzing trace with hash 297540681, now seen corresponding path program 1 times [2019-11-16 00:09:33,430 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:09:33,430 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578277187] [2019-11-16 00:09:33,431 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:33,431 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:33,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:09:33,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:33,637 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-16 00:09:33,637 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578277187] [2019-11-16 00:09:33,637 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:09:33,638 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:09:33,638 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285115847] [2019-11-16 00:09:33,638 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:09:33,638 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:09:33,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:09:33,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:09:33,640 INFO L87 Difference]: Start difference. First operand 13870 states and 32507 transitions. Second operand 7 states. [2019-11-16 00:09:34,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:09:34,039 INFO L93 Difference]: Finished difference Result 14571 states and 33943 transitions. [2019-11-16 00:09:34,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-16 00:09:34,040 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 101 [2019-11-16 00:09:34,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:09:34,057 INFO L225 Difference]: With dead ends: 14571 [2019-11-16 00:09:34,057 INFO L226 Difference]: Without dead ends: 14571 [2019-11-16 00:09:34,058 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-11-16 00:09:34,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14571 states. [2019-11-16 00:09:34,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14571 to 12043. [2019-11-16 00:09:34,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12043 states. [2019-11-16 00:09:34,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12043 states to 12043 states and 28144 transitions. [2019-11-16 00:09:34,244 INFO L78 Accepts]: Start accepts. Automaton has 12043 states and 28144 transitions. Word has length 101 [2019-11-16 00:09:34,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:09:34,244 INFO L462 AbstractCegarLoop]: Abstraction has 12043 states and 28144 transitions. [2019-11-16 00:09:34,244 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:09:34,245 INFO L276 IsEmpty]: Start isEmpty. Operand 12043 states and 28144 transitions. [2019-11-16 00:09:34,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-16 00:09:34,258 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:09:34,258 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:09:34,258 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:09:34,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:34,259 INFO L82 PathProgramCache]: Analyzing trace with hash 1185044362, now seen corresponding path program 1 times [2019-11-16 00:09:34,259 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:09:34,259 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144059976] [2019-11-16 00:09:34,259 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:34,259 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:34,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:09:34,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:34,341 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-16 00:09:34,341 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144059976] [2019-11-16 00:09:34,341 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:09:34,342 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:09:34,342 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870840399] [2019-11-16 00:09:34,344 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:09:34,344 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:09:34,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:09:34,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:09:34,344 INFO L87 Difference]: Start difference. First operand 12043 states and 28144 transitions. Second operand 5 states. [2019-11-16 00:09:34,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:09:34,812 INFO L93 Difference]: Finished difference Result 14534 states and 33893 transitions. [2019-11-16 00:09:34,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:09:34,813 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 101 [2019-11-16 00:09:34,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:09:34,825 INFO L225 Difference]: With dead ends: 14534 [2019-11-16 00:09:34,825 INFO L226 Difference]: Without dead ends: 14534 [2019-11-16 00:09:34,826 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:09:34,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14534 states. [2019-11-16 00:09:34,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14534 to 11617. [2019-11-16 00:09:34,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11617 states. [2019-11-16 00:09:34,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11617 states to 11617 states and 27142 transitions. [2019-11-16 00:09:34,953 INFO L78 Accepts]: Start accepts. Automaton has 11617 states and 27142 transitions. Word has length 101 [2019-11-16 00:09:34,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:09:34,953 INFO L462 AbstractCegarLoop]: Abstraction has 11617 states and 27142 transitions. [2019-11-16 00:09:34,953 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:09:34,953 INFO L276 IsEmpty]: Start isEmpty. Operand 11617 states and 27142 transitions. [2019-11-16 00:09:34,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-16 00:09:34,962 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:09:34,962 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:09:34,963 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:09:34,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:34,963 INFO L82 PathProgramCache]: Analyzing trace with hash 1272716882, now seen corresponding path program 2 times [2019-11-16 00:09:34,963 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:09:34,964 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183265005] [2019-11-16 00:09:34,964 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:34,964 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:34,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:09:34,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:35,041 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-16 00:09:35,041 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183265005] [2019-11-16 00:09:35,041 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:09:35,042 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:09:35,042 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210726407] [2019-11-16 00:09:35,042 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:09:35,042 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:09:35,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:09:35,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:09:35,043 INFO L87 Difference]: Start difference. First operand 11617 states and 27142 transitions. Second operand 5 states. [2019-11-16 00:09:35,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:09:35,393 INFO L93 Difference]: Finished difference Result 13407 states and 30861 transitions. [2019-11-16 00:09:35,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:09:35,394 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 101 [2019-11-16 00:09:35,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:09:35,405 INFO L225 Difference]: With dead ends: 13407 [2019-11-16 00:09:35,405 INFO L226 Difference]: Without dead ends: 13407 [2019-11-16 00:09:35,406 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:09:35,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13407 states. [2019-11-16 00:09:35,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13407 to 11775. [2019-11-16 00:09:35,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11775 states. [2019-11-16 00:09:35,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11775 states to 11775 states and 27480 transitions. [2019-11-16 00:09:35,532 INFO L78 Accepts]: Start accepts. Automaton has 11775 states and 27480 transitions. Word has length 101 [2019-11-16 00:09:35,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:09:35,532 INFO L462 AbstractCegarLoop]: Abstraction has 11775 states and 27480 transitions. [2019-11-16 00:09:35,532 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:09:35,533 INFO L276 IsEmpty]: Start isEmpty. Operand 11775 states and 27480 transitions. [2019-11-16 00:09:35,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-16 00:09:35,542 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:09:35,542 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:09:35,542 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:09:35,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:35,543 INFO L82 PathProgramCache]: Analyzing trace with hash 318534895, now seen corresponding path program 1 times [2019-11-16 00:09:35,543 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:09:35,543 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383264261] [2019-11-16 00:09:35,543 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:35,543 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:35,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:09:35,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:35,716 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-16 00:09:35,716 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383264261] [2019-11-16 00:09:35,716 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:09:35,717 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:09:35,717 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931889707] [2019-11-16 00:09:35,717 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:09:35,717 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:09:35,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:09:35,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:09:35,718 INFO L87 Difference]: Start difference. First operand 11775 states and 27480 transitions. Second operand 7 states. [2019-11-16 00:09:35,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:09:35,950 INFO L93 Difference]: Finished difference Result 14608 states and 34263 transitions. [2019-11-16 00:09:35,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:09:35,951 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 103 [2019-11-16 00:09:35,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:09:35,965 INFO L225 Difference]: With dead ends: 14608 [2019-11-16 00:09:35,965 INFO L226 Difference]: Without dead ends: 12902 [2019-11-16 00:09:35,966 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-11-16 00:09:35,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12902 states. [2019-11-16 00:09:36,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12902 to 10600. [2019-11-16 00:09:36,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10600 states. [2019-11-16 00:09:36,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10600 states to 10600 states and 24740 transitions. [2019-11-16 00:09:36,080 INFO L78 Accepts]: Start accepts. Automaton has 10600 states and 24740 transitions. Word has length 103 [2019-11-16 00:09:36,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:09:36,080 INFO L462 AbstractCegarLoop]: Abstraction has 10600 states and 24740 transitions. [2019-11-16 00:09:36,080 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:09:36,080 INFO L276 IsEmpty]: Start isEmpty. Operand 10600 states and 24740 transitions. [2019-11-16 00:09:36,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-16 00:09:36,088 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:09:36,088 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:09:36,088 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:09:36,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:36,089 INFO L82 PathProgramCache]: Analyzing trace with hash 653403301, now seen corresponding path program 2 times [2019-11-16 00:09:36,089 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:09:36,089 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870614205] [2019-11-16 00:09:36,089 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:36,089 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:36,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:09:36,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:36,128 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-16 00:09:36,128 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870614205] [2019-11-16 00:09:36,128 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:09:36,128 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:09:36,128 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044843321] [2019-11-16 00:09:36,129 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:09:36,129 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:09:36,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:09:36,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:09:36,129 INFO L87 Difference]: Start difference. First operand 10600 states and 24740 transitions. Second operand 3 states. [2019-11-16 00:09:36,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:09:36,175 INFO L93 Difference]: Finished difference Result 13008 states and 30518 transitions. [2019-11-16 00:09:36,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:09:36,176 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2019-11-16 00:09:36,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:09:36,191 INFO L225 Difference]: With dead ends: 13008 [2019-11-16 00:09:36,191 INFO L226 Difference]: Without dead ends: 13008 [2019-11-16 00:09:36,192 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-16 00:09:36,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13008 states. [2019-11-16 00:09:36,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13008 to 12955. [2019-11-16 00:09:36,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12955 states. [2019-11-16 00:09:36,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12955 states to 12955 states and 30400 transitions. [2019-11-16 00:09:36,378 INFO L78 Accepts]: Start accepts. Automaton has 12955 states and 30400 transitions. Word has length 103 [2019-11-16 00:09:36,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:09:36,379 INFO L462 AbstractCegarLoop]: Abstraction has 12955 states and 30400 transitions. [2019-11-16 00:09:36,379 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:09:36,379 INFO L276 IsEmpty]: Start isEmpty. Operand 12955 states and 30400 transitions. [2019-11-16 00:09:36,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-16 00:09:36,394 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:09:36,395 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:09:36,395 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:09:36,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:36,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1004203238, now seen corresponding path program 1 times [2019-11-16 00:09:36,397 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:09:36,397 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000869486] [2019-11-16 00:09:36,397 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:36,397 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:36,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:09:36,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:36,612 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-16 00:09:36,613 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000869486] [2019-11-16 00:09:36,613 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:09:36,613 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-16 00:09:36,613 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576619015] [2019-11-16 00:09:36,614 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-16 00:09:36,614 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:09:36,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-16 00:09:36,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:09:36,615 INFO L87 Difference]: Start difference. First operand 12955 states and 30400 transitions. Second operand 8 states. [2019-11-16 00:09:36,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:09:36,710 INFO L93 Difference]: Finished difference Result 13428 states and 31446 transitions. [2019-11-16 00:09:36,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:09:36,711 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 103 [2019-11-16 00:09:36,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:09:36,713 INFO L225 Difference]: With dead ends: 13428 [2019-11-16 00:09:36,713 INFO L226 Difference]: Without dead ends: 2994 [2019-11-16 00:09:36,713 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-11-16 00:09:36,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2994 states. [2019-11-16 00:09:36,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2994 to 2992. [2019-11-16 00:09:36,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2992 states. [2019-11-16 00:09:36,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2992 states to 2992 states and 7024 transitions. [2019-11-16 00:09:36,738 INFO L78 Accepts]: Start accepts. Automaton has 2992 states and 7024 transitions. Word has length 103 [2019-11-16 00:09:36,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:09:36,738 INFO L462 AbstractCegarLoop]: Abstraction has 2992 states and 7024 transitions. [2019-11-16 00:09:36,738 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-16 00:09:36,738 INFO L276 IsEmpty]: Start isEmpty. Operand 2992 states and 7024 transitions. [2019-11-16 00:09:36,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-16 00:09:36,740 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:09:36,740 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:09:36,740 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:09:36,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:36,741 INFO L82 PathProgramCache]: Analyzing trace with hash -1940939503, now seen corresponding path program 3 times [2019-11-16 00:09:36,741 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:09:36,741 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927054285] [2019-11-16 00:09:36,741 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:36,741 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:36,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:09:36,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:36,971 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-16 00:09:36,971 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927054285] [2019-11-16 00:09:36,971 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:09:36,971 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-16 00:09:36,971 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575017095] [2019-11-16 00:09:36,972 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-16 00:09:36,972 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:09:36,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-16 00:09:36,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-11-16 00:09:36,972 INFO L87 Difference]: Start difference. First operand 2992 states and 7024 transitions. Second operand 11 states. [2019-11-16 00:09:37,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:09:37,834 INFO L93 Difference]: Finished difference Result 6027 states and 13742 transitions. [2019-11-16 00:09:37,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-16 00:09:37,834 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 103 [2019-11-16 00:09:37,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:09:37,839 INFO L225 Difference]: With dead ends: 6027 [2019-11-16 00:09:37,839 INFO L226 Difference]: Without dead ends: 4279 [2019-11-16 00:09:37,839 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=113, Invalid=537, Unknown=0, NotChecked=0, Total=650 [2019-11-16 00:09:37,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4279 states. [2019-11-16 00:09:37,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4279 to 3028. [2019-11-16 00:09:37,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3028 states. [2019-11-16 00:09:37,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3028 states to 3028 states and 7048 transitions. [2019-11-16 00:09:37,886 INFO L78 Accepts]: Start accepts. Automaton has 3028 states and 7048 transitions. Word has length 103 [2019-11-16 00:09:37,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:09:37,886 INFO L462 AbstractCegarLoop]: Abstraction has 3028 states and 7048 transitions. [2019-11-16 00:09:37,886 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-16 00:09:37,887 INFO L276 IsEmpty]: Start isEmpty. Operand 3028 states and 7048 transitions. [2019-11-16 00:09:37,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-16 00:09:37,890 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:09:37,890 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:09:37,891 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:09:37,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:37,891 INFO L82 PathProgramCache]: Analyzing trace with hash 289540969, now seen corresponding path program 4 times [2019-11-16 00:09:37,891 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:09:37,892 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166698245] [2019-11-16 00:09:37,892 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:37,892 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:37,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:09:37,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:09:37,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:09:38,026 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:09:38,026 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-16 00:09:38,190 INFO L303 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-11-16 00:09:38,194 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:09:38 BasicIcfg [2019-11-16 00:09:38,194 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-16 00:09:38,194 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:09:38,194 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:09:38,195 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:09:38,195 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:08:05" (3/4) ... [2019-11-16 00:09:38,206 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-16 00:09:38,360 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_41273b15-5f1b-4935-8377-46d1271e3a18/bin/uautomizer/witness.graphml [2019-11-16 00:09:38,360 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:09:38,362 INFO L168 Benchmark]: Toolchain (without parser) took 94743.78 ms. Allocated memory was 1.0 GB in the beginning and 6.4 GB in the end (delta: 5.4 GB). Free memory was 946.1 MB in the beginning and 2.7 GB in the end (delta: -1.7 GB). Peak memory consumption was 3.6 GB. Max. memory is 11.5 GB. [2019-11-16 00:09:38,362 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:09:38,363 INFO L168 Benchmark]: CACSL2BoogieTranslator took 610.06 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 98.0 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -112.5 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-11-16 00:09:38,363 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.72 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2019-11-16 00:09:38,363 INFO L168 Benchmark]: Boogie Preprocessor took 42.83 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 11.5 GB. [2019-11-16 00:09:38,364 INFO L168 Benchmark]: RCFGBuilder took 853.52 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 992.4 MB in the end (delta: 57.3 MB). Peak memory consumption was 57.3 MB. Max. memory is 11.5 GB. [2019-11-16 00:09:38,364 INFO L168 Benchmark]: TraceAbstraction took 93011.74 ms. Allocated memory was 1.1 GB in the beginning and 6.4 GB in the end (delta: 5.3 GB). Free memory was 992.4 MB in the beginning and 2.7 GB in the end (delta: -1.8 GB). Peak memory consumption was 3.5 GB. Max. memory is 11.5 GB. [2019-11-16 00:09:38,365 INFO L168 Benchmark]: Witness Printer took 165.67 ms. Allocated memory is still 6.4 GB. Free memory was 2.7 GB in the beginning and 2.7 GB in the end (delta: 52.2 MB). Peak memory consumption was 52.2 MB. Max. memory is 11.5 GB. [2019-11-16 00:09:38,366 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.23 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 610.06 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 98.0 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -112.5 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 55.72 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 42.83 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 853.52 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 992.4 MB in the end (delta: 57.3 MB). Peak memory consumption was 57.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 93011.74 ms. Allocated memory was 1.1 GB in the beginning and 6.4 GB in the end (delta: 5.3 GB). Free memory was 992.4 MB in the beginning and 2.7 GB in the end (delta: -1.8 GB). Peak memory consumption was 3.5 GB. Max. memory is 11.5 GB. * Witness Printer took 165.67 ms. Allocated memory is still 6.4 GB. Free memory was 2.7 GB in the beginning and 2.7 GB in the end (delta: 52.2 MB). Peak memory consumption was 52.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L695] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L697] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L699] 0 int __unbuffered_p0_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0] [L701] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0] [L703] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L704] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L705] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L707] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L708] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L709] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L710] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L711] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L712] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L713] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L714] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L715] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L716] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L717] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L718] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L719] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L720] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L721] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L723] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L724] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L725] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L812] 0 pthread_t t0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L813] FCALL, FORK 0 pthread_create(&t0, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L814] 0 pthread_t t1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L815] FCALL, FORK 0 pthread_create(&t1, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L760] 2 x$w_buff1 = x$w_buff0 [L761] 2 x$w_buff0 = 1 [L762] 2 x$w_buff1_used = x$w_buff0_used [L763] 2 x$w_buff0_used = (_Bool)1 [L5] COND FALSE 2 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L765] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L766] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L767] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L768] 2 x$r_buff0_thd2 = (_Bool)1 [L771] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L772] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L773] 2 x$flush_delayed = weak$$choice2 [L774] 2 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L775] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L775] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L775] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L775] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L776] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L776] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L777] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L777] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L778] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L778] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L779] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L779] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L780] EXPR 2 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L780] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L781] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L781] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L782] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L783] EXPR 2 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L783] 2 x = x$flush_delayed ? x$mem_tmp : x [L784] 2 x$flush_delayed = (_Bool)0 [L787] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L729] 1 y = 1 [L732] 1 __unbuffered_p0_EAX = y [L735] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L736] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L737] 1 x$flush_delayed = weak$$choice2 [L738] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L739] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L739] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L740] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L740] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L741] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L741] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L742] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L742] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L743] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L743] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L790] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L744] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L744] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L745] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L745] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L746] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L747] EXPR 1 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$flush_delayed ? x$mem_tmp : x=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L790] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L791] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=1, x$flush_delayed ? x$mem_tmp : x=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L747] 1 x = x$flush_delayed ? x$mem_tmp : x [L748] 1 x$flush_delayed = (_Bool)0 [L753] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L791] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L792] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L792] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L793] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L793] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L794] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L794] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L817] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L821] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L821] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L821] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L821] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L822] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L822] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L823] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L823] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L824] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L824] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L825] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L825] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L828] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L5] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L5] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 280 locations, 3 error locations. Result: UNSAFE, OverallTime: 92.8s, OverallIterations: 29, TraceHistogramMax: 1, AutomataDifference: 28.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 10329 SDtfs, 11671 SDslu, 25533 SDs, 0 SdLazy, 9799 SolverSat, 563 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 283 GetRequests, 76 SyntacticMatches, 15 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=222093occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 52.2s AutomataMinimizationTime, 28 MinimizatonAttempts, 204596 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 2278 NumberOfCodeBlocks, 2278 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 2147 ConstructedInterpolants, 0 QuantifiedInterpolants, 517278 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 PerfectInterpolantSequences, 0/0 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 incorrect! Received shutdown request...