./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe022_power.oepc_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_22920a94-48bc-48d0-99c2-c9fdfdfd66ac/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_22920a94-48bc-48d0-99c2-c9fdfdfd66ac/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_22920a94-48bc-48d0-99c2-c9fdfdfd66ac/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_22920a94-48bc-48d0-99c2-c9fdfdfd66ac/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe022_power.oepc_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_22920a94-48bc-48d0-99c2-c9fdfdfd66ac/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_22920a94-48bc-48d0-99c2-c9fdfdfd66ac/bin-2019/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 2c781ced31e7ecf4ae985dd855ce7e99e9e35cd2 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.23-635dfa2 [2018-12-09 00:25:32,284 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 00:25:32,285 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 00:25:32,291 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 00:25:32,291 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 00:25:32,292 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 00:25:32,293 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 00:25:32,293 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 00:25:32,294 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 00:25:32,295 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 00:25:32,295 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 00:25:32,295 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 00:25:32,296 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 00:25:32,296 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 00:25:32,297 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 00:25:32,298 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 00:25:32,298 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 00:25:32,299 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 00:25:32,300 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 00:25:32,301 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 00:25:32,301 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 00:25:32,302 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 00:25:32,303 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 00:25:32,303 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 00:25:32,303 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 00:25:32,304 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 00:25:32,304 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 00:25:32,305 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 00:25:32,305 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 00:25:32,306 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 00:25:32,306 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 00:25:32,306 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 00:25:32,306 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 00:25:32,306 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 00:25:32,307 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 00:25:32,307 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 00:25:32,307 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_22920a94-48bc-48d0-99c2-c9fdfdfd66ac/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-09 00:25:32,314 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 00:25:32,315 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 00:25:32,315 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 00:25:32,315 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 00:25:32,316 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 00:25:32,316 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 00:25:32,316 INFO L133 SettingsManager]: * Use SBE=true [2018-12-09 00:25:32,316 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 00:25:32,316 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 00:25:32,316 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 00:25:32,316 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 00:25:32,316 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 00:25:32,316 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 00:25:32,317 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 00:25:32,317 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 00:25:32,317 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 00:25:32,317 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 00:25:32,317 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 00:25:32,317 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 00:25:32,317 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 00:25:32,317 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 00:25:32,318 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 00:25:32,318 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 00:25:32,318 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 00:25:32,318 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 00:25:32,318 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 00:25:32,318 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 00:25:32,318 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-09 00:25:32,318 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 00:25:32,318 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 00:25:32,319 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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/working_dir_22920a94-48bc-48d0-99c2-c9fdfdfd66ac/bin-2019/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 -> 2c781ced31e7ecf4ae985dd855ce7e99e9e35cd2 [2018-12-09 00:25:32,337 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 00:25:32,346 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 00:25:32,349 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 00:25:32,350 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 00:25:32,350 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 00:25:32,351 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_22920a94-48bc-48d0-99c2-c9fdfdfd66ac/bin-2019/uautomizer/../../sv-benchmarks/c/pthread-wmm/safe022_power.oepc_false-unreach-call.i [2018-12-09 00:25:32,390 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_22920a94-48bc-48d0-99c2-c9fdfdfd66ac/bin-2019/uautomizer/data/ff5fb965f/a165fc1f63e741a282a857dbeebe0d6d/FLAG006447965 [2018-12-09 00:25:32,780 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 00:25:32,780 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_22920a94-48bc-48d0-99c2-c9fdfdfd66ac/sv-benchmarks/c/pthread-wmm/safe022_power.oepc_false-unreach-call.i [2018-12-09 00:25:32,787 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_22920a94-48bc-48d0-99c2-c9fdfdfd66ac/bin-2019/uautomizer/data/ff5fb965f/a165fc1f63e741a282a857dbeebe0d6d/FLAG006447965 [2018-12-09 00:25:33,128 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_22920a94-48bc-48d0-99c2-c9fdfdfd66ac/bin-2019/uautomizer/data/ff5fb965f/a165fc1f63e741a282a857dbeebe0d6d [2018-12-09 00:25:33,129 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 00:25:33,130 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 00:25:33,131 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 00:25:33,131 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 00:25:33,133 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 00:25:33,133 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:25:33" (1/1) ... [2018-12-09 00:25:33,135 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a04c23c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:25:33, skipping insertion in model container [2018-12-09 00:25:33,135 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:25:33" (1/1) ... [2018-12-09 00:25:33,139 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 00:25:33,159 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 00:25:33,335 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 00:25:33,343 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 00:25:33,428 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 00:25:33,474 INFO L195 MainTranslator]: Completed translation [2018-12-09 00:25:33,475 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:25:33 WrapperNode [2018-12-09 00:25:33,475 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 00:25:33,475 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 00:25:33,475 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 00:25:33,475 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 00:25:33,481 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:25:33" (1/1) ... [2018-12-09 00:25:33,491 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:25:33" (1/1) ... [2018-12-09 00:25:33,506 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 00:25:33,506 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 00:25:33,506 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 00:25:33,506 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 00:25:33,512 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:25:33" (1/1) ... [2018-12-09 00:25:33,513 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:25:33" (1/1) ... [2018-12-09 00:25:33,515 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:25:33" (1/1) ... [2018-12-09 00:25:33,515 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:25:33" (1/1) ... [2018-12-09 00:25:33,520 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:25:33" (1/1) ... [2018-12-09 00:25:33,523 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:25:33" (1/1) ... [2018-12-09 00:25:33,524 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:25:33" (1/1) ... [2018-12-09 00:25:33,526 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 00:25:33,527 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 00:25:33,527 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 00:25:33,527 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 00:25:33,527 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:25:33" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_22920a94-48bc-48d0-99c2-c9fdfdfd66ac/bin-2019/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 [2018-12-09 00:25:33,560 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 00:25:33,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 00:25:33,560 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-09 00:25:33,560 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 00:25:33,560 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-09 00:25:33,560 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-09 00:25:33,560 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-09 00:25:33,560 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-09 00:25:33,560 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-09 00:25:33,560 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 00:25:33,561 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 00:25:33,562 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-09 00:25:33,855 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 00:25:33,855 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-09 00:25:33,855 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:25:33 BoogieIcfgContainer [2018-12-09 00:25:33,855 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 00:25:33,856 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 00:25:33,856 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 00:25:33,858 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 00:25:33,858 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 12:25:33" (1/3) ... [2018-12-09 00:25:33,858 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7abaf3f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 12:25:33, skipping insertion in model container [2018-12-09 00:25:33,858 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:25:33" (2/3) ... [2018-12-09 00:25:33,859 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7abaf3f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 12:25:33, skipping insertion in model container [2018-12-09 00:25:33,859 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:25:33" (3/3) ... [2018-12-09 00:25:33,860 INFO L112 eAbstractionObserver]: Analyzing ICFG safe022_power.oepc_false-unreach-call.i [2018-12-09 00:25:33,882 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,882 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,883 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,883 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,883 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,883 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,883 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,883 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,883 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,883 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,883 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,884 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,884 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,884 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,884 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,884 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,884 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,884 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,884 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,884 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,884 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,885 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,885 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,885 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,885 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,885 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,885 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,885 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,885 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,885 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,885 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,886 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,886 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,886 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,886 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,886 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,886 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,886 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,886 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,887 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,887 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,887 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,887 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,887 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,887 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,887 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,887 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,887 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,887 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,887 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,887 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,888 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,888 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,888 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,888 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,888 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,888 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,888 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,888 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,888 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,888 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,889 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,889 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,889 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,889 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,889 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,889 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,889 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,889 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,889 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,890 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,890 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,890 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,890 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,890 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,890 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,890 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,890 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,890 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,890 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,890 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,891 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,891 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,891 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,891 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,891 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,891 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,891 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,891 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,891 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,891 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,891 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,891 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,892 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,892 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,892 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,892 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,892 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,892 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,892 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,892 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,892 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,892 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,892 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,893 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,893 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,893 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,893 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,893 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,893 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,893 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,893 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,893 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,893 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,893 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,894 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,894 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,894 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,894 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,894 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,894 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,894 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,894 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,894 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,894 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,894 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,894 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,895 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,895 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,895 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,895 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,895 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,895 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,895 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,895 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,895 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,895 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,895 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,895 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,896 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,896 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,896 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,896 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,896 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,896 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,896 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,896 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,896 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,896 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,896 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,897 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,897 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,897 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,897 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,897 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,897 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,897 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,897 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,897 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,897 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,897 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,897 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,898 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,898 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:25:33,901 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-09 00:25:33,901 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 00:25:33,907 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-09 00:25:33,916 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-09 00:25:33,931 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 00:25:33,931 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 00:25:33,931 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 00:25:33,931 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 00:25:33,932 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 00:25:33,932 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 00:25:33,932 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 00:25:33,932 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 00:25:33,932 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 00:25:33,938 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 142places, 180 transitions [2018-12-09 00:25:35,467 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 34806 states. [2018-12-09 00:25:35,469 INFO L276 IsEmpty]: Start isEmpty. Operand 34806 states. [2018-12-09 00:25:35,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-09 00:25:35,473 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:25:35,474 INFO L402 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] [2018-12-09 00:25:35,475 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:25:35,478 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:25:35,479 INFO L82 PathProgramCache]: Analyzing trace with hash -454041356, now seen corresponding path program 1 times [2018-12-09 00:25:35,480 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:25:35,480 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:25:35,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:25:35,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:25:35,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:25:35,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:25:35,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:25:35,613 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:25:35,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 00:25:35,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 00:25:35,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 00:25:35,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 00:25:35,626 INFO L87 Difference]: Start difference. First operand 34806 states. Second operand 4 states. [2018-12-09 00:25:36,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:25:36,072 INFO L93 Difference]: Finished difference Result 60790 states and 234493 transitions. [2018-12-09 00:25:36,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 00:25:36,074 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2018-12-09 00:25:36,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:25:36,234 INFO L225 Difference]: With dead ends: 60790 [2018-12-09 00:25:36,234 INFO L226 Difference]: Without dead ends: 44270 [2018-12-09 00:25:36,235 INFO L631 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 [2018-12-09 00:25:36,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44270 states. [2018-12-09 00:25:36,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44270 to 27338. [2018-12-09 00:25:36,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27338 states. [2018-12-09 00:25:36,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27338 states to 27338 states and 105499 transitions. [2018-12-09 00:25:36,981 INFO L78 Accepts]: Start accepts. Automaton has 27338 states and 105499 transitions. Word has length 33 [2018-12-09 00:25:36,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:25:36,981 INFO L480 AbstractCegarLoop]: Abstraction has 27338 states and 105499 transitions. [2018-12-09 00:25:36,981 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 00:25:36,981 INFO L276 IsEmpty]: Start isEmpty. Operand 27338 states and 105499 transitions. [2018-12-09 00:25:36,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-09 00:25:36,985 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:25:36,985 INFO L402 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] [2018-12-09 00:25:36,986 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:25:36,986 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:25:36,986 INFO L82 PathProgramCache]: Analyzing trace with hash 1863363909, now seen corresponding path program 1 times [2018-12-09 00:25:36,986 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:25:36,986 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:25:36,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:25:36,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:25:36,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:25:36,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:25:37,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:25:37,035 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:25:37,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 00:25:37,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 00:25:37,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 00:25:37,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 00:25:37,036 INFO L87 Difference]: Start difference. First operand 27338 states and 105499 transitions. Second operand 4 states. [2018-12-09 00:25:37,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:25:37,108 INFO L93 Difference]: Finished difference Result 8528 states and 28344 transitions. [2018-12-09 00:25:37,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 00:25:37,108 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2018-12-09 00:25:37,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:25:37,121 INFO L225 Difference]: With dead ends: 8528 [2018-12-09 00:25:37,122 INFO L226 Difference]: Without dead ends: 7466 [2018-12-09 00:25:37,122 INFO L631 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 [2018-12-09 00:25:37,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7466 states. [2018-12-09 00:25:37,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7466 to 7466. [2018-12-09 00:25:37,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7466 states. [2018-12-09 00:25:37,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7466 states to 7466 states and 24636 transitions. [2018-12-09 00:25:37,207 INFO L78 Accepts]: Start accepts. Automaton has 7466 states and 24636 transitions. Word has length 45 [2018-12-09 00:25:37,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:25:37,207 INFO L480 AbstractCegarLoop]: Abstraction has 7466 states and 24636 transitions. [2018-12-09 00:25:37,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 00:25:37,208 INFO L276 IsEmpty]: Start isEmpty. Operand 7466 states and 24636 transitions. [2018-12-09 00:25:37,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-09 00:25:37,208 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:25:37,208 INFO L402 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] [2018-12-09 00:25:37,209 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:25:37,209 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:25:37,209 INFO L82 PathProgramCache]: Analyzing trace with hash 591681941, now seen corresponding path program 1 times [2018-12-09 00:25:37,209 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:25:37,209 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:25:37,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:25:37,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:25:37,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:25:37,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:25:37,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:25:37,256 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:25:37,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 00:25:37,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 00:25:37,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 00:25:37,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 00:25:37,256 INFO L87 Difference]: Start difference. First operand 7466 states and 24636 transitions. Second operand 5 states. [2018-12-09 00:25:37,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:25:37,456 INFO L93 Difference]: Finished difference Result 13998 states and 45805 transitions. [2018-12-09 00:25:37,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 00:25:37,456 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2018-12-09 00:25:37,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:25:37,482 INFO L225 Difference]: With dead ends: 13998 [2018-12-09 00:25:37,482 INFO L226 Difference]: Without dead ends: 13930 [2018-12-09 00:25:37,483 INFO L631 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 [2018-12-09 00:25:37,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13930 states. [2018-12-09 00:25:37,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13930 to 9441. [2018-12-09 00:25:37,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9441 states. [2018-12-09 00:25:37,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9441 states to 9441 states and 30542 transitions. [2018-12-09 00:25:37,671 INFO L78 Accepts]: Start accepts. Automaton has 9441 states and 30542 transitions. Word has length 46 [2018-12-09 00:25:37,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:25:37,672 INFO L480 AbstractCegarLoop]: Abstraction has 9441 states and 30542 transitions. [2018-12-09 00:25:37,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 00:25:37,672 INFO L276 IsEmpty]: Start isEmpty. Operand 9441 states and 30542 transitions. [2018-12-09 00:25:37,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-09 00:25:37,673 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:25:37,673 INFO L402 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] [2018-12-09 00:25:37,673 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:25:37,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:25:37,673 INFO L82 PathProgramCache]: Analyzing trace with hash -1652121253, now seen corresponding path program 1 times [2018-12-09 00:25:37,673 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:25:37,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:25:37,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:25:37,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:25:37,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:25:37,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:25:37,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:25:37,699 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:25:37,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:25:37,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:25:37,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:25:37,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:25:37,699 INFO L87 Difference]: Start difference. First operand 9441 states and 30542 transitions. Second operand 3 states. [2018-12-09 00:25:37,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:25:37,752 INFO L93 Difference]: Finished difference Result 13279 states and 42641 transitions. [2018-12-09 00:25:37,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:25:37,752 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2018-12-09 00:25:37,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:25:37,774 INFO L225 Difference]: With dead ends: 13279 [2018-12-09 00:25:37,774 INFO L226 Difference]: Without dead ends: 13279 [2018-12-09 00:25:37,774 INFO L631 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 [2018-12-09 00:25:37,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13279 states. [2018-12-09 00:25:37,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13279 to 9845. [2018-12-09 00:25:37,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9845 states. [2018-12-09 00:25:37,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9845 states to 9845 states and 31508 transitions. [2018-12-09 00:25:37,897 INFO L78 Accepts]: Start accepts. Automaton has 9845 states and 31508 transitions. Word has length 48 [2018-12-09 00:25:37,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:25:37,897 INFO L480 AbstractCegarLoop]: Abstraction has 9845 states and 31508 transitions. [2018-12-09 00:25:37,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:25:37,897 INFO L276 IsEmpty]: Start isEmpty. Operand 9845 states and 31508 transitions. [2018-12-09 00:25:37,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-09 00:25:37,898 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:25:37,898 INFO L402 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] [2018-12-09 00:25:37,898 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:25:37,899 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:25:37,899 INFO L82 PathProgramCache]: Analyzing trace with hash -164023066, now seen corresponding path program 1 times [2018-12-09 00:25:37,899 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:25:37,899 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:25:37,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:25:37,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:25:37,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:25:37,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:25:37,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:25:37,969 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:25:37,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 00:25:37,969 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 00:25:37,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 00:25:37,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 00:25:37,969 INFO L87 Difference]: Start difference. First operand 9845 states and 31508 transitions. Second operand 7 states. [2018-12-09 00:25:38,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:25:38,363 INFO L93 Difference]: Finished difference Result 12285 states and 38673 transitions. [2018-12-09 00:25:38,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 00:25:38,364 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2018-12-09 00:25:38,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:25:38,377 INFO L225 Difference]: With dead ends: 12285 [2018-12-09 00:25:38,377 INFO L226 Difference]: Without dead ends: 12213 [2018-12-09 00:25:38,377 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2018-12-09 00:25:38,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12213 states. [2018-12-09 00:25:38,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12213 to 10849. [2018-12-09 00:25:38,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10849 states. [2018-12-09 00:25:38,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10849 states to 10849 states and 34563 transitions. [2018-12-09 00:25:38,488 INFO L78 Accepts]: Start accepts. Automaton has 10849 states and 34563 transitions. Word has length 52 [2018-12-09 00:25:38,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:25:38,488 INFO L480 AbstractCegarLoop]: Abstraction has 10849 states and 34563 transitions. [2018-12-09 00:25:38,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 00:25:38,489 INFO L276 IsEmpty]: Start isEmpty. Operand 10849 states and 34563 transitions. [2018-12-09 00:25:38,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-09 00:25:38,491 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:25:38,491 INFO L402 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] [2018-12-09 00:25:38,492 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:25:38,492 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:25:38,492 INFO L82 PathProgramCache]: Analyzing trace with hash 317195842, now seen corresponding path program 1 times [2018-12-09 00:25:38,492 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:25:38,492 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:25:38,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:25:38,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:25:38,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:25:38,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:25:38,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:25:38,526 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:25:38,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 00:25:38,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 00:25:38,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 00:25:38,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 00:25:38,526 INFO L87 Difference]: Start difference. First operand 10849 states and 34563 transitions. Second operand 4 states. [2018-12-09 00:25:38,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:25:38,605 INFO L93 Difference]: Finished difference Result 12396 states and 39572 transitions. [2018-12-09 00:25:38,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 00:25:38,605 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2018-12-09 00:25:38,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:25:38,619 INFO L225 Difference]: With dead ends: 12396 [2018-12-09 00:25:38,619 INFO L226 Difference]: Without dead ends: 12396 [2018-12-09 00:25:38,619 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 00:25:38,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12396 states. [2018-12-09 00:25:38,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12396 to 11369. [2018-12-09 00:25:38,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11369 states. [2018-12-09 00:25:38,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11369 states to 11369 states and 36236 transitions. [2018-12-09 00:25:38,759 INFO L78 Accepts]: Start accepts. Automaton has 11369 states and 36236 transitions. Word has length 60 [2018-12-09 00:25:38,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:25:38,760 INFO L480 AbstractCegarLoop]: Abstraction has 11369 states and 36236 transitions. [2018-12-09 00:25:38,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 00:25:38,760 INFO L276 IsEmpty]: Start isEmpty. Operand 11369 states and 36236 transitions. [2018-12-09 00:25:38,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-09 00:25:38,763 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:25:38,763 INFO L402 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] [2018-12-09 00:25:38,763 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:25:38,764 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:25:38,764 INFO L82 PathProgramCache]: Analyzing trace with hash 2060006177, now seen corresponding path program 1 times [2018-12-09 00:25:38,764 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:25:38,764 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:25:38,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:25:38,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:25:38,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:25:38,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:25:38,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:25:38,813 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:25:38,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 00:25:38,813 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 00:25:38,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 00:25:38,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 00:25:38,814 INFO L87 Difference]: Start difference. First operand 11369 states and 36236 transitions. Second operand 6 states. [2018-12-09 00:25:39,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:25:39,149 INFO L93 Difference]: Finished difference Result 20969 states and 66486 transitions. [2018-12-09 00:25:39,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 00:25:39,149 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2018-12-09 00:25:39,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:25:39,170 INFO L225 Difference]: With dead ends: 20969 [2018-12-09 00:25:39,170 INFO L226 Difference]: Without dead ends: 20898 [2018-12-09 00:25:39,171 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-12-09 00:25:39,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20898 states. [2018-12-09 00:25:39,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20898 to 13755. [2018-12-09 00:25:39,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13755 states. [2018-12-09 00:25:39,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13755 states to 13755 states and 43280 transitions. [2018-12-09 00:25:39,345 INFO L78 Accepts]: Start accepts. Automaton has 13755 states and 43280 transitions. Word has length 60 [2018-12-09 00:25:39,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:25:39,345 INFO L480 AbstractCegarLoop]: Abstraction has 13755 states and 43280 transitions. [2018-12-09 00:25:39,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 00:25:39,345 INFO L276 IsEmpty]: Start isEmpty. Operand 13755 states and 43280 transitions. [2018-12-09 00:25:39,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-09 00:25:39,349 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:25:39,349 INFO L402 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] [2018-12-09 00:25:39,349 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:25:39,349 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:25:39,349 INFO L82 PathProgramCache]: Analyzing trace with hash 1699576415, now seen corresponding path program 1 times [2018-12-09 00:25:39,350 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:25:39,350 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:25:39,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:25:39,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:25:39,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:25:39,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:25:39,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:25:39,402 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:25:39,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 00:25:39,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 00:25:39,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 00:25:39,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 00:25:39,403 INFO L87 Difference]: Start difference. First operand 13755 states and 43280 transitions. Second operand 4 states. [2018-12-09 00:25:39,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:25:39,581 INFO L93 Difference]: Finished difference Result 17635 states and 54585 transitions. [2018-12-09 00:25:39,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 00:25:39,581 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2018-12-09 00:25:39,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:25:39,600 INFO L225 Difference]: With dead ends: 17635 [2018-12-09 00:25:39,600 INFO L226 Difference]: Without dead ends: 17635 [2018-12-09 00:25:39,600 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 00:25:39,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17635 states. [2018-12-09 00:25:39,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17635 to 15793. [2018-12-09 00:25:39,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15793 states. [2018-12-09 00:25:39,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15793 states to 15793 states and 49131 transitions. [2018-12-09 00:25:39,767 INFO L78 Accepts]: Start accepts. Automaton has 15793 states and 49131 transitions. Word has length 64 [2018-12-09 00:25:39,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:25:39,767 INFO L480 AbstractCegarLoop]: Abstraction has 15793 states and 49131 transitions. [2018-12-09 00:25:39,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 00:25:39,767 INFO L276 IsEmpty]: Start isEmpty. Operand 15793 states and 49131 transitions. [2018-12-09 00:25:39,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-09 00:25:39,772 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:25:39,772 INFO L402 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] [2018-12-09 00:25:39,772 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:25:39,772 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:25:39,772 INFO L82 PathProgramCache]: Analyzing trace with hash -377632928, now seen corresponding path program 1 times [2018-12-09 00:25:39,772 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:25:39,772 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:25:39,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:25:39,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:25:39,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:25:39,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:25:39,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:25:39,798 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:25:39,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:25:39,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:25:39,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:25:39,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:25:39,799 INFO L87 Difference]: Start difference. First operand 15793 states and 49131 transitions. Second operand 3 states. [2018-12-09 00:25:39,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:25:39,943 INFO L93 Difference]: Finished difference Result 16385 states and 50738 transitions. [2018-12-09 00:25:39,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:25:39,943 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2018-12-09 00:25:39,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:25:39,962 INFO L225 Difference]: With dead ends: 16385 [2018-12-09 00:25:39,962 INFO L226 Difference]: Without dead ends: 16385 [2018-12-09 00:25:39,962 INFO L631 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 [2018-12-09 00:25:39,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16385 states. [2018-12-09 00:25:40,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16385 to 16109. [2018-12-09 00:25:40,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16109 states. [2018-12-09 00:25:40,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16109 states to 16109 states and 49981 transitions. [2018-12-09 00:25:40,131 INFO L78 Accepts]: Start accepts. Automaton has 16109 states and 49981 transitions. Word has length 64 [2018-12-09 00:25:40,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:25:40,132 INFO L480 AbstractCegarLoop]: Abstraction has 16109 states and 49981 transitions. [2018-12-09 00:25:40,132 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:25:40,132 INFO L276 IsEmpty]: Start isEmpty. Operand 16109 states and 49981 transitions. [2018-12-09 00:25:40,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-09 00:25:40,137 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:25:40,137 INFO L402 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] [2018-12-09 00:25:40,137 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:25:40,138 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:25:40,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1938632710, now seen corresponding path program 1 times [2018-12-09 00:25:40,138 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:25:40,138 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:25:40,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:25:40,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:25:40,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:25:40,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:25:40,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:25:40,287 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:25:40,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 00:25:40,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 00:25:40,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 00:25:40,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 00:25:40,288 INFO L87 Difference]: Start difference. First operand 16109 states and 49981 transitions. Second operand 6 states. [2018-12-09 00:25:40,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:25:40,847 INFO L93 Difference]: Finished difference Result 19821 states and 60437 transitions. [2018-12-09 00:25:40,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 00:25:40,847 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2018-12-09 00:25:40,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:25:40,867 INFO L225 Difference]: With dead ends: 19821 [2018-12-09 00:25:40,867 INFO L226 Difference]: Without dead ends: 19821 [2018-12-09 00:25:40,867 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-09 00:25:40,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19821 states. [2018-12-09 00:25:41,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19821 to 18617. [2018-12-09 00:25:41,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18617 states. [2018-12-09 00:25:41,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18617 states to 18617 states and 57217 transitions. [2018-12-09 00:25:41,054 INFO L78 Accepts]: Start accepts. Automaton has 18617 states and 57217 transitions. Word has length 66 [2018-12-09 00:25:41,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:25:41,054 INFO L480 AbstractCegarLoop]: Abstraction has 18617 states and 57217 transitions. [2018-12-09 00:25:41,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 00:25:41,054 INFO L276 IsEmpty]: Start isEmpty. Operand 18617 states and 57217 transitions. [2018-12-09 00:25:41,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-09 00:25:41,060 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:25:41,060 INFO L402 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] [2018-12-09 00:25:41,061 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:25:41,061 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:25:41,061 INFO L82 PathProgramCache]: Analyzing trace with hash -138576633, now seen corresponding path program 1 times [2018-12-09 00:25:41,061 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:25:41,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:25:41,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:25:41,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:25:41,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:25:41,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:25:41,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:25:41,131 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:25:41,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 00:25:41,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 00:25:41,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 00:25:41,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 00:25:41,132 INFO L87 Difference]: Start difference. First operand 18617 states and 57217 transitions. Second operand 6 states. [2018-12-09 00:25:41,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:25:41,418 INFO L93 Difference]: Finished difference Result 21449 states and 63626 transitions. [2018-12-09 00:25:41,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 00:25:41,419 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2018-12-09 00:25:41,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:25:41,446 INFO L225 Difference]: With dead ends: 21449 [2018-12-09 00:25:41,446 INFO L226 Difference]: Without dead ends: 21449 [2018-12-09 00:25:41,446 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-09 00:25:41,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21449 states. [2018-12-09 00:25:41,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21449 to 19133. [2018-12-09 00:25:41,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19133 states. [2018-12-09 00:25:41,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19133 states to 19133 states and 57764 transitions. [2018-12-09 00:25:41,644 INFO L78 Accepts]: Start accepts. Automaton has 19133 states and 57764 transitions. Word has length 66 [2018-12-09 00:25:41,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:25:41,644 INFO L480 AbstractCegarLoop]: Abstraction has 19133 states and 57764 transitions. [2018-12-09 00:25:41,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 00:25:41,644 INFO L276 IsEmpty]: Start isEmpty. Operand 19133 states and 57764 transitions. [2018-12-09 00:25:41,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-09 00:25:41,651 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:25:41,651 INFO L402 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] [2018-12-09 00:25:41,651 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:25:41,651 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:25:41,651 INFO L82 PathProgramCache]: Analyzing trace with hash 72774280, now seen corresponding path program 1 times [2018-12-09 00:25:41,651 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:25:41,651 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:25:41,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:25:41,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:25:41,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:25:41,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:25:41,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:25:41,683 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:25:41,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 00:25:41,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 00:25:41,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 00:25:41,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 00:25:41,684 INFO L87 Difference]: Start difference. First operand 19133 states and 57764 transitions. Second operand 5 states. [2018-12-09 00:25:41,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:25:41,914 INFO L93 Difference]: Finished difference Result 25024 states and 75018 transitions. [2018-12-09 00:25:41,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 00:25:41,914 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2018-12-09 00:25:41,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:25:41,941 INFO L225 Difference]: With dead ends: 25024 [2018-12-09 00:25:41,941 INFO L226 Difference]: Without dead ends: 25024 [2018-12-09 00:25:41,942 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-09 00:25:41,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25024 states. [2018-12-09 00:25:42,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25024 to 22709. [2018-12-09 00:25:42,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22709 states. [2018-12-09 00:25:42,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22709 states to 22709 states and 68032 transitions. [2018-12-09 00:25:42,193 INFO L78 Accepts]: Start accepts. Automaton has 22709 states and 68032 transitions. Word has length 66 [2018-12-09 00:25:42,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:25:42,194 INFO L480 AbstractCegarLoop]: Abstraction has 22709 states and 68032 transitions. [2018-12-09 00:25:42,194 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 00:25:42,194 INFO L276 IsEmpty]: Start isEmpty. Operand 22709 states and 68032 transitions. [2018-12-09 00:25:42,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-09 00:25:42,201 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:25:42,201 INFO L402 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] [2018-12-09 00:25:42,201 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:25:42,201 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:25:42,201 INFO L82 PathProgramCache]: Analyzing trace with hash -437759897, now seen corresponding path program 1 times [2018-12-09 00:25:42,201 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:25:42,201 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:25:42,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:25:42,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:25:42,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:25:42,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:25:42,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:25:42,247 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:25:42,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 00:25:42,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 00:25:42,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 00:25:42,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 00:25:42,248 INFO L87 Difference]: Start difference. First operand 22709 states and 68032 transitions. Second operand 5 states. [2018-12-09 00:25:42,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:25:42,297 INFO L93 Difference]: Finished difference Result 7837 states and 18946 transitions. [2018-12-09 00:25:42,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 00:25:42,297 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2018-12-09 00:25:42,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:25:42,303 INFO L225 Difference]: With dead ends: 7837 [2018-12-09 00:25:42,303 INFO L226 Difference]: Without dead ends: 6355 [2018-12-09 00:25:42,303 INFO L631 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 [2018-12-09 00:25:42,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6355 states. [2018-12-09 00:25:42,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6355 to 5703. [2018-12-09 00:25:42,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5703 states. [2018-12-09 00:25:42,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5703 states to 5703 states and 13364 transitions. [2018-12-09 00:25:42,363 INFO L78 Accepts]: Start accepts. Automaton has 5703 states and 13364 transitions. Word has length 66 [2018-12-09 00:25:42,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:25:42,363 INFO L480 AbstractCegarLoop]: Abstraction has 5703 states and 13364 transitions. [2018-12-09 00:25:42,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 00:25:42,363 INFO L276 IsEmpty]: Start isEmpty. Operand 5703 states and 13364 transitions. [2018-12-09 00:25:42,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-09 00:25:42,367 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:25:42,367 INFO L402 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] [2018-12-09 00:25:42,368 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:25:42,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:25:42,368 INFO L82 PathProgramCache]: Analyzing trace with hash 890203314, now seen corresponding path program 1 times [2018-12-09 00:25:42,368 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:25:42,368 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:25:42,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:25:42,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:25:42,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:25:42,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:25:42,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:25:42,385 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:25:42,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:25:42,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:25:42,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:25:42,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:25:42,386 INFO L87 Difference]: Start difference. First operand 5703 states and 13364 transitions. Second operand 3 states. [2018-12-09 00:25:42,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:25:42,473 INFO L93 Difference]: Finished difference Result 7505 states and 17450 transitions. [2018-12-09 00:25:42,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:25:42,474 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-12-09 00:25:42,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:25:42,478 INFO L225 Difference]: With dead ends: 7505 [2018-12-09 00:25:42,478 INFO L226 Difference]: Without dead ends: 7505 [2018-12-09 00:25:42,479 INFO L631 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 [2018-12-09 00:25:42,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7505 states. [2018-12-09 00:25:42,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7505 to 5642. [2018-12-09 00:25:42,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5642 states. [2018-12-09 00:25:42,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5642 states to 5642 states and 12904 transitions. [2018-12-09 00:25:42,522 INFO L78 Accepts]: Start accepts. Automaton has 5642 states and 12904 transitions. Word has length 66 [2018-12-09 00:25:42,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:25:42,522 INFO L480 AbstractCegarLoop]: Abstraction has 5642 states and 12904 transitions. [2018-12-09 00:25:42,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:25:42,522 INFO L276 IsEmpty]: Start isEmpty. Operand 5642 states and 12904 transitions. [2018-12-09 00:25:42,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-09 00:25:42,526 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:25:42,526 INFO L402 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] [2018-12-09 00:25:42,526 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:25:42,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:25:42,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1181781029, now seen corresponding path program 1 times [2018-12-09 00:25:42,527 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:25:42,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:25:42,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:25:42,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:25:42,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:25:42,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:25:42,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:25:42,564 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:25:42,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 00:25:42,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 00:25:42,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 00:25:42,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 00:25:42,565 INFO L87 Difference]: Start difference. First operand 5642 states and 12904 transitions. Second operand 5 states. [2018-12-09 00:25:42,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:25:42,674 INFO L93 Difference]: Finished difference Result 6806 states and 15528 transitions. [2018-12-09 00:25:42,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 00:25:42,674 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2018-12-09 00:25:42,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:25:42,678 INFO L225 Difference]: With dead ends: 6806 [2018-12-09 00:25:42,678 INFO L226 Difference]: Without dead ends: 6806 [2018-12-09 00:25:42,679 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-09 00:25:42,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6806 states. [2018-12-09 00:25:42,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6806 to 6086. [2018-12-09 00:25:42,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6086 states. [2018-12-09 00:25:42,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6086 states to 6086 states and 13908 transitions. [2018-12-09 00:25:42,723 INFO L78 Accepts]: Start accepts. Automaton has 6086 states and 13908 transitions. Word has length 72 [2018-12-09 00:25:42,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:25:42,723 INFO L480 AbstractCegarLoop]: Abstraction has 6086 states and 13908 transitions. [2018-12-09 00:25:42,723 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 00:25:42,723 INFO L276 IsEmpty]: Start isEmpty. Operand 6086 states and 13908 transitions. [2018-12-09 00:25:42,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-09 00:25:42,728 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:25:42,728 INFO L402 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] [2018-12-09 00:25:42,728 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:25:42,728 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:25:42,728 INFO L82 PathProgramCache]: Analyzing trace with hash -1370375932, now seen corresponding path program 1 times [2018-12-09 00:25:42,728 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:25:42,728 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:25:42,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:25:42,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:25:42,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:25:42,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:25:42,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:25:42,830 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:25:42,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-09 00:25:42,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 00:25:42,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 00:25:42,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-12-09 00:25:42,831 INFO L87 Difference]: Start difference. First operand 6086 states and 13908 transitions. Second operand 9 states. [2018-12-09 00:25:43,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:25:43,119 INFO L93 Difference]: Finished difference Result 8112 states and 18389 transitions. [2018-12-09 00:25:43,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-09 00:25:43,119 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 72 [2018-12-09 00:25:43,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:25:43,124 INFO L225 Difference]: With dead ends: 8112 [2018-12-09 00:25:43,124 INFO L226 Difference]: Without dead ends: 7993 [2018-12-09 00:25:43,125 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-12-09 00:25:43,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7993 states. [2018-12-09 00:25:43,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7993 to 6183. [2018-12-09 00:25:43,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6183 states. [2018-12-09 00:25:43,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6183 states to 6183 states and 14001 transitions. [2018-12-09 00:25:43,172 INFO L78 Accepts]: Start accepts. Automaton has 6183 states and 14001 transitions. Word has length 72 [2018-12-09 00:25:43,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:25:43,172 INFO L480 AbstractCegarLoop]: Abstraction has 6183 states and 14001 transitions. [2018-12-09 00:25:43,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 00:25:43,172 INFO L276 IsEmpty]: Start isEmpty. Operand 6183 states and 14001 transitions. [2018-12-09 00:25:43,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-09 00:25:43,177 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:25:43,177 INFO L402 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] [2018-12-09 00:25:43,177 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:25:43,177 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:25:43,177 INFO L82 PathProgramCache]: Analyzing trace with hash 1174333635, now seen corresponding path program 1 times [2018-12-09 00:25:43,177 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:25:43,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:25:43,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:25:43,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:25:43,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:25:43,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:25:43,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:25:43,224 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:25:43,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 00:25:43,224 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 00:25:43,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 00:25:43,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 00:25:43,225 INFO L87 Difference]: Start difference. First operand 6183 states and 14001 transitions. Second operand 4 states. [2018-12-09 00:25:43,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:25:43,383 INFO L93 Difference]: Finished difference Result 9854 states and 22232 transitions. [2018-12-09 00:25:43,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 00:25:43,383 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2018-12-09 00:25:43,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:25:43,389 INFO L225 Difference]: With dead ends: 9854 [2018-12-09 00:25:43,389 INFO L226 Difference]: Without dead ends: 9854 [2018-12-09 00:25:43,389 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 00:25:43,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9854 states. [2018-12-09 00:25:43,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9854 to 7303. [2018-12-09 00:25:43,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7303 states. [2018-12-09 00:25:43,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7303 states to 7303 states and 16335 transitions. [2018-12-09 00:25:43,448 INFO L78 Accepts]: Start accepts. Automaton has 7303 states and 16335 transitions. Word has length 91 [2018-12-09 00:25:43,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:25:43,448 INFO L480 AbstractCegarLoop]: Abstraction has 7303 states and 16335 transitions. [2018-12-09 00:25:43,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 00:25:43,448 INFO L276 IsEmpty]: Start isEmpty. Operand 7303 states and 16335 transitions. [2018-12-09 00:25:43,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-09 00:25:43,453 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:25:43,453 INFO L402 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] [2018-12-09 00:25:43,454 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:25:43,454 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:25:43,454 INFO L82 PathProgramCache]: Analyzing trace with hash 39095599, now seen corresponding path program 1 times [2018-12-09 00:25:43,454 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:25:43,454 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:25:43,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:25:43,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:25:43,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:25:43,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:25:43,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:25:43,501 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:25:43,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 00:25:43,501 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 00:25:43,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 00:25:43,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 00:25:43,501 INFO L87 Difference]: Start difference. First operand 7303 states and 16335 transitions. Second operand 4 states. [2018-12-09 00:25:43,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:25:43,557 INFO L93 Difference]: Finished difference Result 7805 states and 17493 transitions. [2018-12-09 00:25:43,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 00:25:43,557 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2018-12-09 00:25:43,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:25:43,561 INFO L225 Difference]: With dead ends: 7805 [2018-12-09 00:25:43,562 INFO L226 Difference]: Without dead ends: 7805 [2018-12-09 00:25:43,562 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 00:25:43,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7805 states. [2018-12-09 00:25:43,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7805 to 7209. [2018-12-09 00:25:43,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7209 states. [2018-12-09 00:25:43,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7209 states to 7209 states and 16230 transitions. [2018-12-09 00:25:43,611 INFO L78 Accepts]: Start accepts. Automaton has 7209 states and 16230 transitions. Word has length 91 [2018-12-09 00:25:43,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:25:43,612 INFO L480 AbstractCegarLoop]: Abstraction has 7209 states and 16230 transitions. [2018-12-09 00:25:43,612 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 00:25:43,612 INFO L276 IsEmpty]: Start isEmpty. Operand 7209 states and 16230 transitions. [2018-12-09 00:25:43,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-09 00:25:43,616 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:25:43,616 INFO L402 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] [2018-12-09 00:25:43,616 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:25:43,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:25:43,617 INFO L82 PathProgramCache]: Analyzing trace with hash -1715163703, now seen corresponding path program 1 times [2018-12-09 00:25:43,617 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:25:43,617 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:25:43,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:25:43,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:25:43,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:25:43,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:25:43,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:25:43,681 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:25:43,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 00:25:43,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 00:25:43,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 00:25:43,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-09 00:25:43,681 INFO L87 Difference]: Start difference. First operand 7209 states and 16230 transitions. Second operand 7 states. [2018-12-09 00:25:44,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:25:44,040 INFO L93 Difference]: Finished difference Result 8986 states and 20184 transitions. [2018-12-09 00:25:44,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 00:25:44,040 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2018-12-09 00:25:44,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:25:44,045 INFO L225 Difference]: With dead ends: 8986 [2018-12-09 00:25:44,046 INFO L226 Difference]: Without dead ends: 8986 [2018-12-09 00:25:44,046 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-09 00:25:44,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8986 states. [2018-12-09 00:25:44,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8986 to 7321. [2018-12-09 00:25:44,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7321 states. [2018-12-09 00:25:44,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7321 states to 7321 states and 16550 transitions. [2018-12-09 00:25:44,099 INFO L78 Accepts]: Start accepts. Automaton has 7321 states and 16550 transitions. Word has length 93 [2018-12-09 00:25:44,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:25:44,100 INFO L480 AbstractCegarLoop]: Abstraction has 7321 states and 16550 transitions. [2018-12-09 00:25:44,100 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 00:25:44,100 INFO L276 IsEmpty]: Start isEmpty. Operand 7321 states and 16550 transitions. [2018-12-09 00:25:44,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-09 00:25:44,104 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:25:44,104 INFO L402 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] [2018-12-09 00:25:44,104 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:25:44,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:25:44,105 INFO L82 PathProgramCache]: Analyzing trace with hash 1745561198, now seen corresponding path program 1 times [2018-12-09 00:25:44,105 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:25:44,105 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:25:44,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:25:44,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:25:44,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:25:44,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:25:44,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:25:44,150 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:25:44,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 00:25:44,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 00:25:44,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 00:25:44,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 00:25:44,150 INFO L87 Difference]: Start difference. First operand 7321 states and 16550 transitions. Second operand 5 states. [2018-12-09 00:25:44,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:25:44,209 INFO L93 Difference]: Finished difference Result 8130 states and 18286 transitions. [2018-12-09 00:25:44,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 00:25:44,210 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2018-12-09 00:25:44,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:25:44,215 INFO L225 Difference]: With dead ends: 8130 [2018-12-09 00:25:44,215 INFO L226 Difference]: Without dead ends: 8130 [2018-12-09 00:25:44,215 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-09 00:25:44,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8130 states. [2018-12-09 00:25:44,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8130 to 6217. [2018-12-09 00:25:44,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6217 states. [2018-12-09 00:25:44,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6217 states to 6217 states and 14069 transitions. [2018-12-09 00:25:44,263 INFO L78 Accepts]: Start accepts. Automaton has 6217 states and 14069 transitions. Word has length 93 [2018-12-09 00:25:44,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:25:44,263 INFO L480 AbstractCegarLoop]: Abstraction has 6217 states and 14069 transitions. [2018-12-09 00:25:44,263 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 00:25:44,263 INFO L276 IsEmpty]: Start isEmpty. Operand 6217 states and 14069 transitions. [2018-12-09 00:25:44,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-09 00:25:44,267 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:25:44,267 INFO L402 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] [2018-12-09 00:25:44,268 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:25:44,268 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:25:44,268 INFO L82 PathProgramCache]: Analyzing trace with hash 1490824653, now seen corresponding path program 1 times [2018-12-09 00:25:44,268 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:25:44,268 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:25:44,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:25:44,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:25:44,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:25:44,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:25:44,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:25:44,309 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:25:44,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 00:25:44,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 00:25:44,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 00:25:44,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 00:25:44,309 INFO L87 Difference]: Start difference. First operand 6217 states and 14069 transitions. Second operand 5 states. [2018-12-09 00:25:44,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:25:44,547 INFO L93 Difference]: Finished difference Result 9852 states and 22424 transitions. [2018-12-09 00:25:44,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 00:25:44,547 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2018-12-09 00:25:44,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:25:44,553 INFO L225 Difference]: With dead ends: 9852 [2018-12-09 00:25:44,553 INFO L226 Difference]: Without dead ends: 9774 [2018-12-09 00:25:44,553 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-09 00:25:44,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9774 states. [2018-12-09 00:25:44,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9774 to 7358. [2018-12-09 00:25:44,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7358 states. [2018-12-09 00:25:44,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7358 states to 7358 states and 16716 transitions. [2018-12-09 00:25:44,612 INFO L78 Accepts]: Start accepts. Automaton has 7358 states and 16716 transitions. Word has length 93 [2018-12-09 00:25:44,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:25:44,612 INFO L480 AbstractCegarLoop]: Abstraction has 7358 states and 16716 transitions. [2018-12-09 00:25:44,612 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 00:25:44,612 INFO L276 IsEmpty]: Start isEmpty. Operand 7358 states and 16716 transitions. [2018-12-09 00:25:44,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-09 00:25:44,617 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:25:44,618 INFO L402 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] [2018-12-09 00:25:44,618 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:25:44,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:25:44,618 INFO L82 PathProgramCache]: Analyzing trace with hash -1559378162, now seen corresponding path program 1 times [2018-12-09 00:25:44,618 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:25:44,618 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:25:44,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:25:44,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:25:44,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:25:44,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:25:44,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:25:44,652 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:25:44,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 00:25:44,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 00:25:44,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 00:25:44,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 00:25:44,653 INFO L87 Difference]: Start difference. First operand 7358 states and 16716 transitions. Second operand 6 states. [2018-12-09 00:25:44,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:25:44,867 INFO L93 Difference]: Finished difference Result 9349 states and 21078 transitions. [2018-12-09 00:25:44,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 00:25:44,868 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2018-12-09 00:25:44,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:25:44,874 INFO L225 Difference]: With dead ends: 9349 [2018-12-09 00:25:44,874 INFO L226 Difference]: Without dead ends: 9270 [2018-12-09 00:25:44,874 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-12-09 00:25:44,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9270 states. [2018-12-09 00:25:44,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9270 to 6928. [2018-12-09 00:25:44,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6928 states. [2018-12-09 00:25:44,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6928 states to 6928 states and 15763 transitions. [2018-12-09 00:25:44,934 INFO L78 Accepts]: Start accepts. Automaton has 6928 states and 15763 transitions. Word has length 93 [2018-12-09 00:25:44,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:25:44,934 INFO L480 AbstractCegarLoop]: Abstraction has 6928 states and 15763 transitions. [2018-12-09 00:25:44,934 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 00:25:44,934 INFO L276 IsEmpty]: Start isEmpty. Operand 6928 states and 15763 transitions. [2018-12-09 00:25:44,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-09 00:25:44,938 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:25:44,938 INFO L402 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] [2018-12-09 00:25:44,938 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:25:44,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:25:44,938 INFO L82 PathProgramCache]: Analyzing trace with hash 1497612213, now seen corresponding path program 1 times [2018-12-09 00:25:44,938 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:25:44,939 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:25:44,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:25:44,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:25:44,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:25:44,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:25:45,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:25:45,025 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:25:45,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-09 00:25:45,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 00:25:45,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 00:25:45,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-09 00:25:45,026 INFO L87 Difference]: Start difference. First operand 6928 states and 15763 transitions. Second operand 9 states. [2018-12-09 00:25:45,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:25:45,426 INFO L93 Difference]: Finished difference Result 9639 states and 21910 transitions. [2018-12-09 00:25:45,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-09 00:25:45,426 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 93 [2018-12-09 00:25:45,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:25:45,432 INFO L225 Difference]: With dead ends: 9639 [2018-12-09 00:25:45,432 INFO L226 Difference]: Without dead ends: 9639 [2018-12-09 00:25:45,432 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2018-12-09 00:25:45,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9639 states. [2018-12-09 00:25:45,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9639 to 8631. [2018-12-09 00:25:45,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8631 states. [2018-12-09 00:25:45,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8631 states to 8631 states and 19631 transitions. [2018-12-09 00:25:45,501 INFO L78 Accepts]: Start accepts. Automaton has 8631 states and 19631 transitions. Word has length 93 [2018-12-09 00:25:45,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:25:45,501 INFO L480 AbstractCegarLoop]: Abstraction has 8631 states and 19631 transitions. [2018-12-09 00:25:45,501 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 00:25:45,501 INFO L276 IsEmpty]: Start isEmpty. Operand 8631 states and 19631 transitions. [2018-12-09 00:25:45,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-09 00:25:45,507 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:25:45,507 INFO L402 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] [2018-12-09 00:25:45,507 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:25:45,507 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:25:45,507 INFO L82 PathProgramCache]: Analyzing trace with hash -989900620, now seen corresponding path program 1 times [2018-12-09 00:25:45,507 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:25:45,507 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:25:45,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:25:45,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:25:45,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:25:45,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:25:45,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:25:45,534 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:25:45,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 00:25:45,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 00:25:45,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 00:25:45,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 00:25:45,535 INFO L87 Difference]: Start difference. First operand 8631 states and 19631 transitions. Second operand 4 states. [2018-12-09 00:25:45,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:25:45,607 INFO L93 Difference]: Finished difference Result 8903 states and 20327 transitions. [2018-12-09 00:25:45,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 00:25:45,607 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2018-12-09 00:25:45,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:25:45,615 INFO L225 Difference]: With dead ends: 8903 [2018-12-09 00:25:45,615 INFO L226 Difference]: Without dead ends: 8871 [2018-12-09 00:25:45,616 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 00:25:45,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8871 states. [2018-12-09 00:25:45,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8871 to 8727. [2018-12-09 00:25:45,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8727 states. [2018-12-09 00:25:45,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8727 states to 8727 states and 19887 transitions. [2018-12-09 00:25:45,702 INFO L78 Accepts]: Start accepts. Automaton has 8727 states and 19887 transitions. Word has length 93 [2018-12-09 00:25:45,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:25:45,703 INFO L480 AbstractCegarLoop]: Abstraction has 8727 states and 19887 transitions. [2018-12-09 00:25:45,703 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 00:25:45,703 INFO L276 IsEmpty]: Start isEmpty. Operand 8727 states and 19887 transitions. [2018-12-09 00:25:45,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-09 00:25:45,709 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:25:45,709 INFO L402 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] [2018-12-09 00:25:45,710 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:25:45,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:25:45,710 INFO L82 PathProgramCache]: Analyzing trace with hash -299339146, now seen corresponding path program 1 times [2018-12-09 00:25:45,710 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:25:45,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:25:45,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:25:45,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:25:45,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:25:45,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:25:45,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:25:45,777 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:25:45,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 00:25:45,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 00:25:45,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 00:25:45,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-09 00:25:45,778 INFO L87 Difference]: Start difference. First operand 8727 states and 19887 transitions. Second operand 8 states. [2018-12-09 00:25:46,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:25:46,052 INFO L93 Difference]: Finished difference Result 13198 states and 30502 transitions. [2018-12-09 00:25:46,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 00:25:46,053 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 93 [2018-12-09 00:25:46,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:25:46,064 INFO L225 Difference]: With dead ends: 13198 [2018-12-09 00:25:46,064 INFO L226 Difference]: Without dead ends: 13198 [2018-12-09 00:25:46,065 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-12-09 00:25:46,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13198 states. [2018-12-09 00:25:46,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13198 to 9365. [2018-12-09 00:25:46,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9365 states. [2018-12-09 00:25:46,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9365 states to 9365 states and 21554 transitions. [2018-12-09 00:25:46,150 INFO L78 Accepts]: Start accepts. Automaton has 9365 states and 21554 transitions. Word has length 93 [2018-12-09 00:25:46,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:25:46,150 INFO L480 AbstractCegarLoop]: Abstraction has 9365 states and 21554 transitions. [2018-12-09 00:25:46,150 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 00:25:46,150 INFO L276 IsEmpty]: Start isEmpty. Operand 9365 states and 21554 transitions. [2018-12-09 00:25:46,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-09 00:25:46,157 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:25:46,157 INFO L402 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] [2018-12-09 00:25:46,157 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:25:46,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:25:46,157 INFO L82 PathProgramCache]: Analyzing trace with hash 588164535, now seen corresponding path program 1 times [2018-12-09 00:25:46,157 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:25:46,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:25:46,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:25:46,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:25:46,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:25:46,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:25:46,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:25:46,227 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:25:46,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 00:25:46,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 00:25:46,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 00:25:46,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 00:25:46,228 INFO L87 Difference]: Start difference. First operand 9365 states and 21554 transitions. Second operand 7 states. [2018-12-09 00:25:46,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:25:46,324 INFO L93 Difference]: Finished difference Result 12601 states and 29247 transitions. [2018-12-09 00:25:46,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 00:25:46,324 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2018-12-09 00:25:46,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:25:46,332 INFO L225 Difference]: With dead ends: 12601 [2018-12-09 00:25:46,332 INFO L226 Difference]: Without dead ends: 12601 [2018-12-09 00:25:46,332 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-12-09 00:25:46,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12601 states. [2018-12-09 00:25:46,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12601 to 9333. [2018-12-09 00:25:46,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9333 states. [2018-12-09 00:25:46,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9333 states to 9333 states and 21266 transitions. [2018-12-09 00:25:46,408 INFO L78 Accepts]: Start accepts. Automaton has 9333 states and 21266 transitions. Word has length 93 [2018-12-09 00:25:46,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:25:46,408 INFO L480 AbstractCegarLoop]: Abstraction has 9333 states and 21266 transitions. [2018-12-09 00:25:46,408 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 00:25:46,408 INFO L276 IsEmpty]: Start isEmpty. Operand 9333 states and 21266 transitions. [2018-12-09 00:25:46,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-09 00:25:46,413 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:25:46,413 INFO L402 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] [2018-12-09 00:25:46,414 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:25:46,414 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:25:46,414 INFO L82 PathProgramCache]: Analyzing trace with hash -1143811017, now seen corresponding path program 1 times [2018-12-09 00:25:46,414 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:25:46,414 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:25:46,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:25:46,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:25:46,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:25:46,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:25:46,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:25:46,465 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:25:46,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 00:25:46,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 00:25:46,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 00:25:46,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 00:25:46,466 INFO L87 Difference]: Start difference. First operand 9333 states and 21266 transitions. Second operand 6 states. [2018-12-09 00:25:46,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:25:46,541 INFO L93 Difference]: Finished difference Result 8965 states and 20090 transitions. [2018-12-09 00:25:46,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 00:25:46,541 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2018-12-09 00:25:46,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:25:46,546 INFO L225 Difference]: With dead ends: 8965 [2018-12-09 00:25:46,547 INFO L226 Difference]: Without dead ends: 8965 [2018-12-09 00:25:46,547 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-09 00:25:46,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8965 states. [2018-12-09 00:25:46,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8965 to 5822. [2018-12-09 00:25:46,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5822 states. [2018-12-09 00:25:46,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5822 states to 5822 states and 13049 transitions. [2018-12-09 00:25:46,599 INFO L78 Accepts]: Start accepts. Automaton has 5822 states and 13049 transitions. Word has length 93 [2018-12-09 00:25:46,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:25:46,599 INFO L480 AbstractCegarLoop]: Abstraction has 5822 states and 13049 transitions. [2018-12-09 00:25:46,599 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 00:25:46,599 INFO L276 IsEmpty]: Start isEmpty. Operand 5822 states and 13049 transitions. [2018-12-09 00:25:46,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-09 00:25:46,602 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:25:46,602 INFO L402 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] [2018-12-09 00:25:46,602 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:25:46,603 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:25:46,603 INFO L82 PathProgramCache]: Analyzing trace with hash 2068511189, now seen corresponding path program 1 times [2018-12-09 00:25:46,603 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:25:46,603 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:25:46,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:25:46,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:25:46,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:25:46,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:25:46,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:25:46,692 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:25:46,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-09 00:25:46,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 00:25:46,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 00:25:46,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-12-09 00:25:46,693 INFO L87 Difference]: Start difference. First operand 5822 states and 13049 transitions. Second operand 9 states. [2018-12-09 00:25:46,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:25:46,941 INFO L93 Difference]: Finished difference Result 6967 states and 15489 transitions. [2018-12-09 00:25:46,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-09 00:25:46,941 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 95 [2018-12-09 00:25:46,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:25:46,945 INFO L225 Difference]: With dead ends: 6967 [2018-12-09 00:25:46,946 INFO L226 Difference]: Without dead ends: 6967 [2018-12-09 00:25:46,946 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2018-12-09 00:25:46,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6967 states. [2018-12-09 00:25:46,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6967 to 6728. [2018-12-09 00:25:46,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6728 states. [2018-12-09 00:25:46,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6728 states to 6728 states and 15020 transitions. [2018-12-09 00:25:46,991 INFO L78 Accepts]: Start accepts. Automaton has 6728 states and 15020 transitions. Word has length 95 [2018-12-09 00:25:46,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:25:46,991 INFO L480 AbstractCegarLoop]: Abstraction has 6728 states and 15020 transitions. [2018-12-09 00:25:46,991 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 00:25:46,991 INFO L276 IsEmpty]: Start isEmpty. Operand 6728 states and 15020 transitions. [2018-12-09 00:25:46,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-09 00:25:46,995 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:25:46,995 INFO L402 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] [2018-12-09 00:25:46,995 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:25:46,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:25:46,995 INFO L82 PathProgramCache]: Analyzing trace with hash -1338952426, now seen corresponding path program 1 times [2018-12-09 00:25:46,995 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:25:46,995 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:25:46,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:25:46,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:25:46,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:25:47,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:25:47,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:25:47,100 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:25:47,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-09 00:25:47,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 00:25:47,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 00:25:47,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-09 00:25:47,101 INFO L87 Difference]: Start difference. First operand 6728 states and 15020 transitions. Second operand 11 states. [2018-12-09 00:25:48,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:25:48,935 INFO L93 Difference]: Finished difference Result 12989 states and 29182 transitions. [2018-12-09 00:25:48,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-09 00:25:48,936 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 95 [2018-12-09 00:25:48,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:25:48,942 INFO L225 Difference]: With dead ends: 12989 [2018-12-09 00:25:48,942 INFO L226 Difference]: Without dead ends: 8863 [2018-12-09 00:25:48,942 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2018-12-09 00:25:48,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8863 states. [2018-12-09 00:25:49,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8863 to 6571. [2018-12-09 00:25:49,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6571 states. [2018-12-09 00:25:49,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6571 states to 6571 states and 14627 transitions. [2018-12-09 00:25:49,006 INFO L78 Accepts]: Start accepts. Automaton has 6571 states and 14627 transitions. Word has length 95 [2018-12-09 00:25:49,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:25:49,007 INFO L480 AbstractCegarLoop]: Abstraction has 6571 states and 14627 transitions. [2018-12-09 00:25:49,007 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 00:25:49,007 INFO L276 IsEmpty]: Start isEmpty. Operand 6571 states and 14627 transitions. [2018-12-09 00:25:49,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-09 00:25:49,011 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:25:49,011 INFO L402 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] [2018-12-09 00:25:49,011 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:25:49,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:25:49,011 INFO L82 PathProgramCache]: Analyzing trace with hash -860395469, now seen corresponding path program 1 times [2018-12-09 00:25:49,011 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:25:49,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:25:49,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:25:49,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:25:49,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:25:49,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:25:49,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:25:49,081 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:25:49,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 00:25:49,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 00:25:49,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 00:25:49,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 00:25:49,081 INFO L87 Difference]: Start difference. First operand 6571 states and 14627 transitions. Second operand 6 states. [2018-12-09 00:25:49,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:25:49,202 INFO L93 Difference]: Finished difference Result 7458 states and 16373 transitions. [2018-12-09 00:25:49,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 00:25:49,202 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2018-12-09 00:25:49,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:25:49,207 INFO L225 Difference]: With dead ends: 7458 [2018-12-09 00:25:49,207 INFO L226 Difference]: Without dead ends: 7408 [2018-12-09 00:25:49,208 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-09 00:25:49,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7408 states. [2018-12-09 00:25:49,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7408 to 6567. [2018-12-09 00:25:49,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6567 states. [2018-12-09 00:25:49,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6567 states to 6567 states and 14473 transitions. [2018-12-09 00:25:49,259 INFO L78 Accepts]: Start accepts. Automaton has 6567 states and 14473 transitions. Word has length 95 [2018-12-09 00:25:49,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:25:49,259 INFO L480 AbstractCegarLoop]: Abstraction has 6567 states and 14473 transitions. [2018-12-09 00:25:49,259 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 00:25:49,259 INFO L276 IsEmpty]: Start isEmpty. Operand 6567 states and 14473 transitions. [2018-12-09 00:25:49,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-09 00:25:49,278 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:25:49,278 INFO L402 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] [2018-12-09 00:25:49,278 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:25:49,279 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:25:49,279 INFO L82 PathProgramCache]: Analyzing trace with hash -1196866221, now seen corresponding path program 2 times [2018-12-09 00:25:49,279 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:25:49,279 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:25:49,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:25:49,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:25:49,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:25:49,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:25:49,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:25:49,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:25:49,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 00:25:49,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 00:25:49,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 00:25:49,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 00:25:49,327 INFO L87 Difference]: Start difference. First operand 6567 states and 14473 transitions. Second operand 6 states. [2018-12-09 00:25:49,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:25:49,421 INFO L93 Difference]: Finished difference Result 6769 states and 14882 transitions. [2018-12-09 00:25:49,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 00:25:49,422 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2018-12-09 00:25:49,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:25:49,426 INFO L225 Difference]: With dead ends: 6769 [2018-12-09 00:25:49,426 INFO L226 Difference]: Without dead ends: 6769 [2018-12-09 00:25:49,426 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-09 00:25:49,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6769 states. [2018-12-09 00:25:49,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6769 to 6421. [2018-12-09 00:25:49,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6421 states. [2018-12-09 00:25:49,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6421 states to 6421 states and 14156 transitions. [2018-12-09 00:25:49,471 INFO L78 Accepts]: Start accepts. Automaton has 6421 states and 14156 transitions. Word has length 95 [2018-12-09 00:25:49,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:25:49,471 INFO L480 AbstractCegarLoop]: Abstraction has 6421 states and 14156 transitions. [2018-12-09 00:25:49,471 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 00:25:49,471 INFO L276 IsEmpty]: Start isEmpty. Operand 6421 states and 14156 transitions. [2018-12-09 00:25:49,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-09 00:25:49,475 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:25:49,475 INFO L402 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] [2018-12-09 00:25:49,475 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:25:49,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:25:49,475 INFO L82 PathProgramCache]: Analyzing trace with hash -530629708, now seen corresponding path program 2 times [2018-12-09 00:25:49,475 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:25:49,475 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:25:49,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:25:49,476 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:25:49,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:25:49,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:25:49,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:25:49,510 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 00:25:49,571 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-09 00:25:49,571 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 12:25:49 BasicIcfg [2018-12-09 00:25:49,572 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 00:25:49,572 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 00:25:49,572 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 00:25:49,572 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 00:25:49,572 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:25:33" (3/4) ... [2018-12-09 00:25:49,574 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-09 00:25:49,640 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_22920a94-48bc-48d0-99c2-c9fdfdfd66ac/bin-2019/uautomizer/witness.graphml [2018-12-09 00:25:49,640 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 00:25:49,641 INFO L168 Benchmark]: Toolchain (without parser) took 16511.03 ms. Allocated memory was 1.0 GB in the beginning and 2.6 GB in the end (delta: 1.6 GB). Free memory was 950.6 MB in the beginning and 2.1 GB in the end (delta: -1.1 GB). Peak memory consumption was 473.0 MB. Max. memory is 11.5 GB. [2018-12-09 00:25:49,641 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 00:25:49,642 INFO L168 Benchmark]: CACSL2BoogieTranslator took 344.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -167.1 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. [2018-12-09 00:25:49,642 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2018-12-09 00:25:49,642 INFO L168 Benchmark]: Boogie Preprocessor took 20.05 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 00:25:49,642 INFO L168 Benchmark]: RCFGBuilder took 328.92 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 48.0 MB). Peak memory consumption was 48.0 MB. Max. memory is 11.5 GB. [2018-12-09 00:25:49,642 INFO L168 Benchmark]: TraceAbstraction took 15715.78 ms. Allocated memory was 1.2 GB in the beginning and 2.6 GB in the end (delta: 1.5 GB). Free memory was 1.1 GB in the beginning and 2.1 GB in the end (delta: -1.1 GB). Peak memory consumption was 412.2 MB. Max. memory is 11.5 GB. [2018-12-09 00:25:49,642 INFO L168 Benchmark]: Witness Printer took 68.32 ms. Allocated memory is still 2.6 GB. Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 31.5 MB). Peak memory consumption was 31.5 MB. Max. memory is 11.5 GB. [2018-12-09 00:25:49,643 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 344.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -167.1 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 30.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.05 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 328.92 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 48.0 MB). Peak memory consumption was 48.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 15715.78 ms. Allocated memory was 1.2 GB in the beginning and 2.6 GB in the end (delta: 1.5 GB). Free memory was 1.1 GB in the beginning and 2.1 GB in the end (delta: -1.1 GB). Peak memory consumption was 412.2 MB. Max. memory is 11.5 GB. * Witness Printer took 68.32 ms. Allocated memory is still 2.6 GB. Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 31.5 MB). Peak memory consumption was 31.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L671] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L673] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L675] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L676] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L677] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L679] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L681] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L682] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L683] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L684] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L685] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L686] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L687] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L688] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L689] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L690] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L691] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L692] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L693] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L694] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L695] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L696] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L697] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L770] -1 pthread_t t2307; VAL [__unbuffered_cnt=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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L771] FCALL, FORK -1 pthread_create(&t2307, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L701] 0 y$w_buff1 = y$w_buff0 [L702] 0 y$w_buff0 = 1 [L703] 0 y$w_buff1_used = y$w_buff0_used [L704] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L772] -1 pthread_t t2308; VAL [__unbuffered_cnt=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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L773] FCALL, FORK -1 pthread_create(&t2308, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L706] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L707] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L708] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L709] 0 y$r_buff0_thd1 = (_Bool)1 [L712] 0 x = 1 VAL [__unbuffered_cnt=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=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L715] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=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=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L729] 1 __unbuffered_p1_EAX = x [L732] 1 weak$$choice0 = __VERIFIER_nondet_pointer() [L733] 1 weak$$choice2 = __VERIFIER_nondet_pointer() [L734] 1 y$flush_delayed = weak$$choice2 [L735] 1 y$mem_tmp = y VAL [__unbuffered_cnt=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=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=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=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] 1 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L737] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=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=1, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L737] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L738] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=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=1, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L739] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=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=1, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L739] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L740] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=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=1, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L740] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L741] EXPR 1 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=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=1, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L741] 1 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L742] EXPR 1 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=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=1, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L742] 1 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L743] 1 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=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=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L744] EXPR 1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=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=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L715] 0 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L744] 1 y = y$flush_delayed ? y$mem_tmp : y [L745] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=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=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L716] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=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=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L716] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L717] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=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=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L717] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L718] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [__unbuffered_cnt=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=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L718] 0 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L719] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=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=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L719] 0 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L722] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L748] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L748] EXPR 1 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L748] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L748] 1 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L749] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L749] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L750] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0] [L750] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L751] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L751] 1 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L752] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L752] 1 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L755] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L775] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L779] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L779] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L779] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L779] -1 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L780] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L780] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L781] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L781] -1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L782] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L782] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L783] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L783] -1 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L786] -1 main$tmp_guard1 = !(__unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 222 locations, 3 error locations. UNSAFE Result, 15.6s OverallTime, 32 OverallIterations, 1 TraceHistogramMax, 8.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 7911 SDtfs, 8957 SDslu, 19078 SDs, 0 SdLazy, 8002 SolverSat, 427 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 328 GetRequests, 83 SyntacticMatches, 31 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34806occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 3.6s AutomataMinimizationTime, 31 MinimizatonAttempts, 73986 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 2440 NumberOfCodeBlocks, 2440 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 2314 ConstructedInterpolants, 0 QuantifiedInterpolants, 511587 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...