./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix000_tso.opt_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_588723ea-32f4-4bed-9f54-9a6b2a129de6/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_588723ea-32f4-4bed-9f54-9a6b2a129de6/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_588723ea-32f4-4bed-9f54-9a6b2a129de6/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_588723ea-32f4-4bed-9f54-9a6b2a129de6/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix000_tso.opt_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_588723ea-32f4-4bed-9f54-9a6b2a129de6/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_588723ea-32f4-4bed-9f54-9a6b2a129de6/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 a4dc61dcc3100553026c0b6a76926752a014539d ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 09:04:20,287 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 09:04:20,288 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 09:04:20,293 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 09:04:20,294 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 09:04:20,294 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 09:04:20,295 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 09:04:20,296 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 09:04:20,296 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 09:04:20,297 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 09:04:20,297 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 09:04:20,297 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 09:04:20,298 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 09:04:20,298 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 09:04:20,299 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 09:04:20,299 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 09:04:20,300 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 09:04:20,300 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 09:04:20,301 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 09:04:20,302 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 09:04:20,303 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 09:04:20,303 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 09:04:20,304 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 09:04:20,304 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 09:04:20,304 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 09:04:20,305 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 09:04:20,305 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 09:04:20,306 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 09:04:20,306 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 09:04:20,307 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 09:04:20,307 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 09:04:20,307 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 09:04:20,307 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 09:04:20,307 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 09:04:20,308 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 09:04:20,308 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 09:04:20,308 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_588723ea-32f4-4bed-9f54-9a6b2a129de6/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-09 09:04:20,315 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 09:04:20,315 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 09:04:20,316 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 09:04:20,316 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 09:04:20,316 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 09:04:20,316 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 09:04:20,316 INFO L133 SettingsManager]: * Use SBE=true [2018-12-09 09:04:20,316 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 09:04:20,317 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 09:04:20,317 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 09:04:20,317 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 09:04:20,317 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 09:04:20,317 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 09:04:20,317 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 09:04:20,317 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 09:04:20,317 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 09:04:20,317 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 09:04:20,317 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 09:04:20,317 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 09:04:20,318 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 09:04:20,318 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 09:04:20,318 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 09:04:20,318 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 09:04:20,318 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 09:04:20,318 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 09:04:20,318 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 09:04:20,318 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 09:04:20,318 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-09 09:04:20,318 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 09:04:20,319 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 09:04:20,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_588723ea-32f4-4bed-9f54-9a6b2a129de6/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 -> a4dc61dcc3100553026c0b6a76926752a014539d [2018-12-09 09:04:20,336 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 09:04:20,345 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 09:04:20,347 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 09:04:20,349 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 09:04:20,349 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 09:04:20,349 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_588723ea-32f4-4bed-9f54-9a6b2a129de6/bin-2019/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix000_tso.opt_false-unreach-call.i [2018-12-09 09:04:20,390 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_588723ea-32f4-4bed-9f54-9a6b2a129de6/bin-2019/uautomizer/data/d0681e12a/18a77559bb8048fdb4f2e26a4130b3bc/FLAGbd3327bae [2018-12-09 09:04:20,817 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 09:04:20,818 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_588723ea-32f4-4bed-9f54-9a6b2a129de6/sv-benchmarks/c/pthread-wmm/mix000_tso.opt_false-unreach-call.i [2018-12-09 09:04:20,825 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_588723ea-32f4-4bed-9f54-9a6b2a129de6/bin-2019/uautomizer/data/d0681e12a/18a77559bb8048fdb4f2e26a4130b3bc/FLAGbd3327bae [2018-12-09 09:04:20,834 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_588723ea-32f4-4bed-9f54-9a6b2a129de6/bin-2019/uautomizer/data/d0681e12a/18a77559bb8048fdb4f2e26a4130b3bc [2018-12-09 09:04:20,835 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 09:04:20,836 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 09:04:20,837 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 09:04:20,837 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 09:04:20,839 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 09:04:20,839 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 09:04:20" (1/1) ... [2018-12-09 09:04:20,841 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ca176b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:04:20, skipping insertion in model container [2018-12-09 09:04:20,841 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 09:04:20" (1/1) ... [2018-12-09 09:04:20,845 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 09:04:20,865 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 09:04:21,044 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 09:04:21,052 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 09:04:21,120 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 09:04:21,151 INFO L195 MainTranslator]: Completed translation [2018-12-09 09:04:21,151 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:04:21 WrapperNode [2018-12-09 09:04:21,151 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 09:04:21,151 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 09:04:21,151 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 09:04:21,152 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 09:04:21,157 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:04:21" (1/1) ... [2018-12-09 09:04:21,167 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:04:21" (1/1) ... [2018-12-09 09:04:21,185 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 09:04:21,185 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 09:04:21,185 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 09:04:21,185 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 09:04:21,191 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:04:21" (1/1) ... [2018-12-09 09:04:21,191 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:04:21" (1/1) ... [2018-12-09 09:04:21,194 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:04:21" (1/1) ... [2018-12-09 09:04:21,194 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:04:21" (1/1) ... [2018-12-09 09:04:21,199 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:04:21" (1/1) ... [2018-12-09 09:04:21,201 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:04:21" (1/1) ... [2018-12-09 09:04:21,203 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:04:21" (1/1) ... [2018-12-09 09:04:21,205 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 09:04:21,205 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 09:04:21,205 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 09:04:21,206 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 09:04:21,206 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:04:21" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_588723ea-32f4-4bed-9f54-9a6b2a129de6/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 09:04:21,239 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 09:04:21,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 09:04:21,239 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-09 09:04:21,239 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 09:04:21,239 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-09 09:04:21,239 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-09 09:04:21,240 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-09 09:04:21,240 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-09 09:04:21,240 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-09 09:04:21,240 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 09:04:21,240 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 09:04:21,241 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 09:04:21,592 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 09:04:21,592 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-09 09:04:21,592 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 09:04:21 BoogieIcfgContainer [2018-12-09 09:04:21,592 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 09:04:21,593 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 09:04:21,593 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 09:04:21,595 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 09:04:21,596 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 09:04:20" (1/3) ... [2018-12-09 09:04:21,596 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@384a1aee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 09:04:21, skipping insertion in model container [2018-12-09 09:04:21,596 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:04:21" (2/3) ... [2018-12-09 09:04:21,597 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@384a1aee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 09:04:21, skipping insertion in model container [2018-12-09 09:04:21,597 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 09:04:21" (3/3) ... [2018-12-09 09:04:21,598 INFO L112 eAbstractionObserver]: Analyzing ICFG mix000_tso.opt_false-unreach-call.i [2018-12-09 09:04:21,625 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,625 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,626 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,626 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,626 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,626 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,626 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,626 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,627 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,627 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,627 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,627 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,627 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,627 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,628 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,628 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,628 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,628 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,628 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,628 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,628 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,629 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,629 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,629 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,629 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,629 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,630 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,630 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,630 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,630 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,630 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,630 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,630 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,631 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,631 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,631 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,631 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,631 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,631 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,632 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,632 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,632 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,632 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,632 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,632 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,632 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,633 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,633 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,633 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,633 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,633 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,633 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,634 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,634 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,634 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,634 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,634 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,634 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,634 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,635 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,635 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,635 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,635 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,635 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,635 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,635 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,635 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,636 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,636 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,636 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,636 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,636 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,636 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,637 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,637 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,637 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,637 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,637 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,637 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,637 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,638 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,638 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,638 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,638 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,638 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,638 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,638 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,639 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,639 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,639 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,639 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,639 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,639 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,639 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,640 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,640 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,640 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,640 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,641 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,641 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,641 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,641 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,641 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,641 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,643 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,643 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,643 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,643 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,643 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,643 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,643 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,644 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,644 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,644 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,644 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,644 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,644 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,645 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,645 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,645 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,645 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,645 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,645 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,645 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,646 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,646 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,646 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,646 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,646 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,647 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,647 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,647 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,647 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,647 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,647 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,648 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,648 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,648 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,648 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,648 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,648 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,649 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,649 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,649 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,649 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,649 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,649 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,650 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,650 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,650 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,650 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,650 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,650 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,651 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,651 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,651 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,651 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,651 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,651 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,651 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,651 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,652 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,652 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,652 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,652 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,652 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,652 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,652 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,652 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,653 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,653 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,653 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,653 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,653 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,654 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,654 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,654 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,654 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,654 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,654 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,654 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,655 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,655 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,655 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,655 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,655 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,656 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,656 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,656 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,656 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,657 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,657 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,657 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,657 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,657 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,657 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,657 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,658 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,658 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,658 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,658 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,658 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,658 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,658 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,659 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,659 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,659 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,659 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,659 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,659 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,659 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,659 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,660 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,660 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,660 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,660 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,660 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,660 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,660 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet56.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,660 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet56.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,661 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,661 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,661 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet56.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,661 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet56.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:04:21,665 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-09 09:04:21,665 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 09:04:21,672 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-09 09:04:21,685 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-09 09:04:21,703 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 09:04:21,703 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 09:04:21,703 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 09:04:21,703 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 09:04:21,703 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 09:04:21,703 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 09:04:21,703 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 09:04:21,703 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 09:04:21,704 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 09:04:21,712 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 174places, 227 transitions [2018-12-09 09:04:27,436 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 83128 states. [2018-12-09 09:04:27,438 INFO L276 IsEmpty]: Start isEmpty. Operand 83128 states. [2018-12-09 09:04:27,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-09 09:04:27,443 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:04:27,444 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] [2018-12-09 09:04:27,445 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:04:27,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:04:27,449 INFO L82 PathProgramCache]: Analyzing trace with hash 164866570, now seen corresponding path program 1 times [2018-12-09 09:04:27,450 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:04:27,451 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:04:27,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:04:27,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:04:27,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:04:27,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:04:27,633 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 09:04:27,635 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:04:27,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 09:04:27,637 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 09:04:27,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 09:04:27,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 09:04:27,647 INFO L87 Difference]: Start difference. First operand 83128 states. Second operand 4 states. [2018-12-09 09:04:28,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:04:28,475 INFO L93 Difference]: Finished difference Result 150584 states and 603161 transitions. [2018-12-09 09:04:28,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 09:04:28,476 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2018-12-09 09:04:28,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:04:28,846 INFO L225 Difference]: With dead ends: 150584 [2018-12-09 09:04:28,846 INFO L226 Difference]: Without dead ends: 105840 [2018-12-09 09:04:28,848 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 09:04:29,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105840 states. [2018-12-09 09:04:30,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105840 to 61236. [2018-12-09 09:04:30,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61236 states. [2018-12-09 09:04:31,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61236 states to 61236 states and 248291 transitions. [2018-12-09 09:04:31,061 INFO L78 Accepts]: Start accepts. Automaton has 61236 states and 248291 transitions. Word has length 39 [2018-12-09 09:04:31,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:04:31,061 INFO L480 AbstractCegarLoop]: Abstraction has 61236 states and 248291 transitions. [2018-12-09 09:04:31,061 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 09:04:31,061 INFO L276 IsEmpty]: Start isEmpty. Operand 61236 states and 248291 transitions. [2018-12-09 09:04:31,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-09 09:04:31,066 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:04:31,066 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] [2018-12-09 09:04:31,066 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:04:31,067 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:04:31,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1121119524, now seen corresponding path program 1 times [2018-12-09 09:04:31,067 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:04:31,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:04:31,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:04:31,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:04:31,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:04:31,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:04:31,116 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 09:04:31,116 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:04:31,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 09:04:31,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 09:04:31,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 09:04:31,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 09:04:31,117 INFO L87 Difference]: Start difference. First operand 61236 states and 248291 transitions. Second operand 4 states. [2018-12-09 09:04:31,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:04:31,196 INFO L93 Difference]: Finished difference Result 14310 states and 48364 transitions. [2018-12-09 09:04:31,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 09:04:31,196 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2018-12-09 09:04:31,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:04:31,214 INFO L225 Difference]: With dead ends: 14310 [2018-12-09 09:04:31,214 INFO L226 Difference]: Without dead ends: 11490 [2018-12-09 09:04:31,214 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 09:04:31,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11490 states. [2018-12-09 09:04:31,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11490 to 11490. [2018-12-09 09:04:31,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11490 states. [2018-12-09 09:04:31,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11490 states to 11490 states and 37855 transitions. [2018-12-09 09:04:31,340 INFO L78 Accepts]: Start accepts. Automaton has 11490 states and 37855 transitions. Word has length 47 [2018-12-09 09:04:31,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:04:31,340 INFO L480 AbstractCegarLoop]: Abstraction has 11490 states and 37855 transitions. [2018-12-09 09:04:31,340 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 09:04:31,340 INFO L276 IsEmpty]: Start isEmpty. Operand 11490 states and 37855 transitions. [2018-12-09 09:04:31,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-09 09:04:31,341 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:04:31,341 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 09:04:31,341 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:04:31,341 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:04:31,341 INFO L82 PathProgramCache]: Analyzing trace with hash -1095203171, now seen corresponding path program 1 times [2018-12-09 09:04:31,341 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:04:31,341 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:04:31,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:04:31,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:04:31,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:04:31,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:04:31,388 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 09:04:31,388 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:04:31,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 09:04:31,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 09:04:31,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 09:04:31,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 09:04:31,389 INFO L87 Difference]: Start difference. First operand 11490 states and 37855 transitions. Second operand 5 states. [2018-12-09 09:04:31,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:04:31,676 INFO L93 Difference]: Finished difference Result 23360 states and 75856 transitions. [2018-12-09 09:04:31,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 09:04:31,677 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2018-12-09 09:04:31,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:04:31,714 INFO L225 Difference]: With dead ends: 23360 [2018-12-09 09:04:31,714 INFO L226 Difference]: Without dead ends: 23285 [2018-12-09 09:04:31,714 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 09:04:31,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23285 states. [2018-12-09 09:04:32,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23285 to 15417. [2018-12-09 09:04:32,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15417 states. [2018-12-09 09:04:32,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15417 states to 15417 states and 49310 transitions. [2018-12-09 09:04:32,022 INFO L78 Accepts]: Start accepts. Automaton has 15417 states and 49310 transitions. Word has length 48 [2018-12-09 09:04:32,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:04:32,023 INFO L480 AbstractCegarLoop]: Abstraction has 15417 states and 49310 transitions. [2018-12-09 09:04:32,023 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 09:04:32,023 INFO L276 IsEmpty]: Start isEmpty. Operand 15417 states and 49310 transitions. [2018-12-09 09:04:32,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-09 09:04:32,024 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:04:32,024 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] [2018-12-09 09:04:32,025 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:04:32,025 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:04:32,025 INFO L82 PathProgramCache]: Analyzing trace with hash 659319747, now seen corresponding path program 1 times [2018-12-09 09:04:32,025 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:04:32,025 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:04:32,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:04:32,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:04:32,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:04:32,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:04:32,047 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 09:04:32,047 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:04:32,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 09:04:32,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 09:04:32,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 09:04:32,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 09:04:32,048 INFO L87 Difference]: Start difference. First operand 15417 states and 49310 transitions. Second operand 3 states. [2018-12-09 09:04:32,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:04:32,158 INFO L93 Difference]: Finished difference Result 28677 states and 90548 transitions. [2018-12-09 09:04:32,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 09:04:32,158 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-12-09 09:04:32,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:04:32,196 INFO L225 Difference]: With dead ends: 28677 [2018-12-09 09:04:32,196 INFO L226 Difference]: Without dead ends: 28673 [2018-12-09 09:04:32,196 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 09:04:32,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28673 states. [2018-12-09 09:04:32,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28673 to 24152. [2018-12-09 09:04:32,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24152 states. [2018-12-09 09:04:32,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24152 states to 24152 states and 76316 transitions. [2018-12-09 09:04:32,490 INFO L78 Accepts]: Start accepts. Automaton has 24152 states and 76316 transitions. Word has length 50 [2018-12-09 09:04:32,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:04:32,490 INFO L480 AbstractCegarLoop]: Abstraction has 24152 states and 76316 transitions. [2018-12-09 09:04:32,490 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 09:04:32,491 INFO L276 IsEmpty]: Start isEmpty. Operand 24152 states and 76316 transitions. [2018-12-09 09:04:32,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-09 09:04:32,493 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:04:32,493 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] [2018-12-09 09:04:32,493 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:04:32,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:04:32,493 INFO L82 PathProgramCache]: Analyzing trace with hash 669168142, now seen corresponding path program 1 times [2018-12-09 09:04:32,493 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:04:32,493 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:04:32,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:04:32,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:04:32,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:04:32,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:04:32,553 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 09:04:32,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:04:32,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 09:04:32,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 09:04:32,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 09:04:32,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 09:04:32,554 INFO L87 Difference]: Start difference. First operand 24152 states and 76316 transitions. Second operand 6 states. [2018-12-09 09:04:32,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:04:32,985 INFO L93 Difference]: Finished difference Result 33838 states and 105314 transitions. [2018-12-09 09:04:32,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 09:04:32,985 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2018-12-09 09:04:32,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:04:33,027 INFO L225 Difference]: With dead ends: 33838 [2018-12-09 09:04:33,027 INFO L226 Difference]: Without dead ends: 33741 [2018-12-09 09:04:33,028 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-12-09 09:04:33,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33741 states. [2018-12-09 09:04:33,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33741 to 23973. [2018-12-09 09:04:33,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23973 states. [2018-12-09 09:04:33,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23973 states to 23973 states and 75822 transitions. [2018-12-09 09:04:33,322 INFO L78 Accepts]: Start accepts. Automaton has 23973 states and 75822 transitions. Word has length 54 [2018-12-09 09:04:33,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:04:33,322 INFO L480 AbstractCegarLoop]: Abstraction has 23973 states and 75822 transitions. [2018-12-09 09:04:33,322 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 09:04:33,322 INFO L276 IsEmpty]: Start isEmpty. Operand 23973 states and 75822 transitions. [2018-12-09 09:04:33,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-09 09:04:33,327 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:04:33,327 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 09:04:33,327 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:04:33,327 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:04:33,327 INFO L82 PathProgramCache]: Analyzing trace with hash -494140957, now seen corresponding path program 1 times [2018-12-09 09:04:33,327 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:04:33,327 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:04:33,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:04:33,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:04:33,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:04:33,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:04:33,359 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 09:04:33,359 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:04:33,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 09:04:33,359 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 09:04:33,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 09:04:33,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 09:04:33,360 INFO L87 Difference]: Start difference. First operand 23973 states and 75822 transitions. Second operand 4 states. [2018-12-09 09:04:33,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:04:33,576 INFO L93 Difference]: Finished difference Result 30737 states and 97932 transitions. [2018-12-09 09:04:33,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 09:04:33,576 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2018-12-09 09:04:33,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:04:33,620 INFO L225 Difference]: With dead ends: 30737 [2018-12-09 09:04:33,620 INFO L226 Difference]: Without dead ends: 30737 [2018-12-09 09:04:33,621 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 09:04:33,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30737 states. [2018-12-09 09:04:33,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30737 to 27609. [2018-12-09 09:04:33,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27609 states. [2018-12-09 09:04:34,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27609 states to 27609 states and 87450 transitions. [2018-12-09 09:04:34,014 INFO L78 Accepts]: Start accepts. Automaton has 27609 states and 87450 transitions. Word has length 64 [2018-12-09 09:04:34,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:04:34,015 INFO L480 AbstractCegarLoop]: Abstraction has 27609 states and 87450 transitions. [2018-12-09 09:04:34,015 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 09:04:34,015 INFO L276 IsEmpty]: Start isEmpty. Operand 27609 states and 87450 transitions. [2018-12-09 09:04:34,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-09 09:04:34,020 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:04:34,020 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 09:04:34,020 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:04:34,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:04:34,020 INFO L82 PathProgramCache]: Analyzing trace with hash 1248669378, now seen corresponding path program 1 times [2018-12-09 09:04:34,020 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:04:34,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:04:34,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:04:34,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:04:34,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:04:34,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:04:34,079 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 09:04:34,080 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:04:34,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 09:04:34,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 09:04:34,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 09:04:34,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 09:04:34,080 INFO L87 Difference]: Start difference. First operand 27609 states and 87450 transitions. Second operand 6 states. [2018-12-09 09:04:34,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:04:34,648 INFO L93 Difference]: Finished difference Result 65702 states and 204771 transitions. [2018-12-09 09:04:34,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 09:04:34,649 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2018-12-09 09:04:34,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:04:34,738 INFO L225 Difference]: With dead ends: 65702 [2018-12-09 09:04:34,738 INFO L226 Difference]: Without dead ends: 65638 [2018-12-09 09:04:34,739 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-12-09 09:04:34,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65638 states. [2018-12-09 09:04:35,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65638 to 39277. [2018-12-09 09:04:35,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39277 states. [2018-12-09 09:04:35,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39277 states to 39277 states and 121531 transitions. [2018-12-09 09:04:35,309 INFO L78 Accepts]: Start accepts. Automaton has 39277 states and 121531 transitions. Word has length 64 [2018-12-09 09:04:35,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:04:35,309 INFO L480 AbstractCegarLoop]: Abstraction has 39277 states and 121531 transitions. [2018-12-09 09:04:35,309 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 09:04:35,309 INFO L276 IsEmpty]: Start isEmpty. Operand 39277 states and 121531 transitions. [2018-12-09 09:04:35,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-09 09:04:35,319 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:04:35,319 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] [2018-12-09 09:04:35,319 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:04:35,320 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:04:35,320 INFO L82 PathProgramCache]: Analyzing trace with hash 1121736755, now seen corresponding path program 1 times [2018-12-09 09:04:35,320 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:04:35,320 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:04:35,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:04:35,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:04:35,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:04:35,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:04:35,346 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 09:04:35,346 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:04:35,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 09:04:35,347 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 09:04:35,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 09:04:35,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 09:04:35,347 INFO L87 Difference]: Start difference. First operand 39277 states and 121531 transitions. Second operand 3 states. [2018-12-09 09:04:35,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:04:35,514 INFO L93 Difference]: Finished difference Result 44930 states and 137016 transitions. [2018-12-09 09:04:35,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 09:04:35,515 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2018-12-09 09:04:35,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:04:35,571 INFO L225 Difference]: With dead ends: 44930 [2018-12-09 09:04:35,571 INFO L226 Difference]: Without dead ends: 44930 [2018-12-09 09:04:35,571 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 09:04:35,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44930 states. [2018-12-09 09:04:36,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44930 to 38917. [2018-12-09 09:04:36,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38917 states. [2018-12-09 09:04:36,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38917 states to 38917 states and 117881 transitions. [2018-12-09 09:04:36,097 INFO L78 Accepts]: Start accepts. Automaton has 38917 states and 117881 transitions. Word has length 70 [2018-12-09 09:04:36,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:04:36,098 INFO L480 AbstractCegarLoop]: Abstraction has 38917 states and 117881 transitions. [2018-12-09 09:04:36,098 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 09:04:36,098 INFO L276 IsEmpty]: Start isEmpty. Operand 38917 states and 117881 transitions. [2018-12-09 09:04:36,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-09 09:04:36,107 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:04:36,108 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] [2018-12-09 09:04:36,108 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:04:36,108 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:04:36,108 INFO L82 PathProgramCache]: Analyzing trace with hash -730730463, now seen corresponding path program 1 times [2018-12-09 09:04:36,108 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:04:36,108 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:04:36,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:04:36,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:04:36,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:04:36,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:04:36,180 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 09:04:36,180 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:04:36,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 09:04:36,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 09:04:36,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 09:04:36,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 09:04:36,181 INFO L87 Difference]: Start difference. First operand 38917 states and 117881 transitions. Second operand 7 states. [2018-12-09 09:04:36,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:04:36,862 INFO L93 Difference]: Finished difference Result 48545 states and 147167 transitions. [2018-12-09 09:04:36,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 09:04:36,862 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 71 [2018-12-09 09:04:36,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:04:36,921 INFO L225 Difference]: With dead ends: 48545 [2018-12-09 09:04:36,921 INFO L226 Difference]: Without dead ends: 48545 [2018-12-09 09:04:36,921 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-12-09 09:04:36,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48545 states. [2018-12-09 09:04:37,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48545 to 45065. [2018-12-09 09:04:37,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45065 states. [2018-12-09 09:04:37,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45065 states to 45065 states and 136967 transitions. [2018-12-09 09:04:37,423 INFO L78 Accepts]: Start accepts. Automaton has 45065 states and 136967 transitions. Word has length 71 [2018-12-09 09:04:37,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:04:37,423 INFO L480 AbstractCegarLoop]: Abstraction has 45065 states and 136967 transitions. [2018-12-09 09:04:37,423 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 09:04:37,423 INFO L276 IsEmpty]: Start isEmpty. Operand 45065 states and 136967 transitions. [2018-12-09 09:04:37,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-09 09:04:37,436 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:04:37,436 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] [2018-12-09 09:04:37,436 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:04:37,436 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:04:37,436 INFO L82 PathProgramCache]: Analyzing trace with hash 1767285474, now seen corresponding path program 1 times [2018-12-09 09:04:37,437 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:04:37,437 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:04:37,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:04:37,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:04:37,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:04:37,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:04:37,477 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 09:04:37,477 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:04:37,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 09:04:37,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 09:04:37,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 09:04:37,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 09:04:37,478 INFO L87 Difference]: Start difference. First operand 45065 states and 136967 transitions. Second operand 5 states. [2018-12-09 09:04:37,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:04:37,535 INFO L93 Difference]: Finished difference Result 13109 states and 33092 transitions. [2018-12-09 09:04:37,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 09:04:37,535 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2018-12-09 09:04:37,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:04:37,543 INFO L225 Difference]: With dead ends: 13109 [2018-12-09 09:04:37,543 INFO L226 Difference]: Without dead ends: 10985 [2018-12-09 09:04:37,543 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 09:04:37,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10985 states. [2018-12-09 09:04:37,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10985 to 8180. [2018-12-09 09:04:37,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8180 states. [2018-12-09 09:04:37,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8180 states to 8180 states and 20398 transitions. [2018-12-09 09:04:37,617 INFO L78 Accepts]: Start accepts. Automaton has 8180 states and 20398 transitions. Word has length 71 [2018-12-09 09:04:37,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:04:37,617 INFO L480 AbstractCegarLoop]: Abstraction has 8180 states and 20398 transitions. [2018-12-09 09:04:37,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 09:04:37,617 INFO L276 IsEmpty]: Start isEmpty. Operand 8180 states and 20398 transitions. [2018-12-09 09:04:37,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-09 09:04:37,624 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:04:37,624 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, 1, 1, 1, 1] [2018-12-09 09:04:37,624 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:04:37,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:04:37,624 INFO L82 PathProgramCache]: Analyzing trace with hash -771267100, now seen corresponding path program 1 times [2018-12-09 09:04:37,624 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:04:37,625 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:04:37,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:04:37,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:04:37,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:04:37,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:04:37,662 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 09:04:37,662 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:04:37,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 09:04:37,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 09:04:37,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 09:04:37,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 09:04:37,662 INFO L87 Difference]: Start difference. First operand 8180 states and 20398 transitions. Second operand 4 states. [2018-12-09 09:04:37,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:04:37,785 INFO L93 Difference]: Finished difference Result 9531 states and 23362 transitions. [2018-12-09 09:04:37,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 09:04:37,786 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2018-12-09 09:04:37,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:04:37,792 INFO L225 Difference]: With dead ends: 9531 [2018-12-09 09:04:37,792 INFO L226 Difference]: Without dead ends: 9531 [2018-12-09 09:04:37,792 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 09:04:37,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9531 states. [2018-12-09 09:04:37,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9531 to 9028. [2018-12-09 09:04:37,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9028 states. [2018-12-09 09:04:37,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9028 states to 9028 states and 22245 transitions. [2018-12-09 09:04:37,875 INFO L78 Accepts]: Start accepts. Automaton has 9028 states and 22245 transitions. Word has length 99 [2018-12-09 09:04:37,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:04:37,875 INFO L480 AbstractCegarLoop]: Abstraction has 9028 states and 22245 transitions. [2018-12-09 09:04:37,875 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 09:04:37,875 INFO L276 IsEmpty]: Start isEmpty. Operand 9028 states and 22245 transitions. [2018-12-09 09:04:37,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-09 09:04:37,884 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:04:37,884 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, 1, 1, 1, 1] [2018-12-09 09:04:37,884 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:04:37,885 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:04:37,885 INFO L82 PathProgramCache]: Analyzing trace with hash 1446490853, now seen corresponding path program 1 times [2018-12-09 09:04:37,885 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:04:37,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:04:37,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:04:37,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:04:37,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:04:37,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:04:37,920 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 09:04:37,920 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:04:37,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 09:04:37,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 09:04:37,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 09:04:37,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 09:04:37,921 INFO L87 Difference]: Start difference. First operand 9028 states and 22245 transitions. Second operand 3 states. [2018-12-09 09:04:38,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:04:38,049 INFO L93 Difference]: Finished difference Result 12279 states and 29754 transitions. [2018-12-09 09:04:38,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 09:04:38,050 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2018-12-09 09:04:38,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:04:38,058 INFO L225 Difference]: With dead ends: 12279 [2018-12-09 09:04:38,058 INFO L226 Difference]: Without dead ends: 12279 [2018-12-09 09:04:38,058 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 09:04:38,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12279 states. [2018-12-09 09:04:38,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12279 to 11108. [2018-12-09 09:04:38,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11108 states. [2018-12-09 09:04:38,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11108 states to 11108 states and 27145 transitions. [2018-12-09 09:04:38,149 INFO L78 Accepts]: Start accepts. Automaton has 11108 states and 27145 transitions. Word has length 99 [2018-12-09 09:04:38,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:04:38,149 INFO L480 AbstractCegarLoop]: Abstraction has 11108 states and 27145 transitions. [2018-12-09 09:04:38,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 09:04:38,149 INFO L276 IsEmpty]: Start isEmpty. Operand 11108 states and 27145 transitions. [2018-12-09 09:04:38,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-09 09:04:38,157 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:04:38,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, 1, 1, 1, 1, 1, 1] [2018-12-09 09:04:38,157 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:04:38,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:04:38,157 INFO L82 PathProgramCache]: Analyzing trace with hash -289893531, now seen corresponding path program 2 times [2018-12-09 09:04:38,157 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:04:38,157 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:04:38,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:04:38,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:04:38,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:04:38,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:04:38,208 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 09:04:38,208 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:04:38,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 09:04:38,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 09:04:38,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 09:04:38,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 09:04:38,209 INFO L87 Difference]: Start difference. First operand 11108 states and 27145 transitions. Second operand 5 states. [2018-12-09 09:04:38,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:04:38,459 INFO L93 Difference]: Finished difference Result 13175 states and 31571 transitions. [2018-12-09 09:04:38,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 09:04:38,459 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2018-12-09 09:04:38,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:04:38,468 INFO L225 Difference]: With dead ends: 13175 [2018-12-09 09:04:38,468 INFO L226 Difference]: Without dead ends: 13175 [2018-12-09 09:04:38,468 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 3 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 09:04:38,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13175 states. [2018-12-09 09:04:38,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13175 to 11735. [2018-12-09 09:04:38,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11735 states. [2018-12-09 09:04:38,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11735 states to 11735 states and 28445 transitions. [2018-12-09 09:04:38,563 INFO L78 Accepts]: Start accepts. Automaton has 11735 states and 28445 transitions. Word has length 99 [2018-12-09 09:04:38,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:04:38,563 INFO L480 AbstractCegarLoop]: Abstraction has 11735 states and 28445 transitions. [2018-12-09 09:04:38,563 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 09:04:38,563 INFO L276 IsEmpty]: Start isEmpty. Operand 11735 states and 28445 transitions. [2018-12-09 09:04:38,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-09 09:04:38,572 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:04:38,572 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, 1, 1, 1, 1] [2018-12-09 09:04:38,572 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:04:38,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:04:38,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1812175831, now seen corresponding path program 3 times [2018-12-09 09:04:38,572 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:04:38,572 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:04:38,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:04:38,574 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 09:04:38,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:04:38,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:04:38,632 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 09:04:38,632 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:04:38,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 09:04:38,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 09:04:38,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 09:04:38,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 09:04:38,633 INFO L87 Difference]: Start difference. First operand 11735 states and 28445 transitions. Second operand 6 states. [2018-12-09 09:04:38,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:04:38,901 INFO L93 Difference]: Finished difference Result 14380 states and 34262 transitions. [2018-12-09 09:04:38,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 09:04:38,901 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2018-12-09 09:04:38,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:04:38,912 INFO L225 Difference]: With dead ends: 14380 [2018-12-09 09:04:38,912 INFO L226 Difference]: Without dead ends: 14380 [2018-12-09 09:04:38,912 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-09 09:04:38,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14380 states. [2018-12-09 09:04:38,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14380 to 11533. [2018-12-09 09:04:38,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11533 states. [2018-12-09 09:04:39,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11533 states to 11533 states and 27501 transitions. [2018-12-09 09:04:39,012 INFO L78 Accepts]: Start accepts. Automaton has 11533 states and 27501 transitions. Word has length 99 [2018-12-09 09:04:39,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:04:39,012 INFO L480 AbstractCegarLoop]: Abstraction has 11533 states and 27501 transitions. [2018-12-09 09:04:39,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 09:04:39,013 INFO L276 IsEmpty]: Start isEmpty. Operand 11533 states and 27501 transitions. [2018-12-09 09:04:39,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-09 09:04:39,020 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:04:39,020 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, 1, 1, 1, 1, 1, 1] [2018-12-09 09:04:39,021 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:04:39,021 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:04:39,021 INFO L82 PathProgramCache]: Analyzing trace with hash 1965891788, now seen corresponding path program 1 times [2018-12-09 09:04:39,021 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:04:39,021 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:04:39,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:04:39,022 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 09:04:39,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:04:39,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:04:39,064 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 09:04:39,064 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:04:39,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 09:04:39,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 09:04:39,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 09:04:39,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 09:04:39,064 INFO L87 Difference]: Start difference. First operand 11533 states and 27501 transitions. Second operand 5 states. [2018-12-09 09:04:39,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:04:39,239 INFO L93 Difference]: Finished difference Result 12356 states and 29202 transitions. [2018-12-09 09:04:39,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 09:04:39,240 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 101 [2018-12-09 09:04:39,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:04:39,248 INFO L225 Difference]: With dead ends: 12356 [2018-12-09 09:04:39,248 INFO L226 Difference]: Without dead ends: 12356 [2018-12-09 09:04:39,249 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 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 09:04:39,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12356 states. [2018-12-09 09:04:39,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12356 to 11700. [2018-12-09 09:04:39,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11700 states. [2018-12-09 09:04:39,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11700 states to 11700 states and 27858 transitions. [2018-12-09 09:04:39,343 INFO L78 Accepts]: Start accepts. Automaton has 11700 states and 27858 transitions. Word has length 101 [2018-12-09 09:04:39,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:04:39,343 INFO L480 AbstractCegarLoop]: Abstraction has 11700 states and 27858 transitions. [2018-12-09 09:04:39,344 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 09:04:39,344 INFO L276 IsEmpty]: Start isEmpty. Operand 11700 states and 27858 transitions. [2018-12-09 09:04:39,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-09 09:04:39,353 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:04:39,353 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, 1, 1, 1, 1, 1, 1] [2018-12-09 09:04:39,353 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:04:39,353 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:04:39,353 INFO L82 PathProgramCache]: Analyzing trace with hash -1281428036, now seen corresponding path program 1 times [2018-12-09 09:04:39,353 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:04:39,353 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:04:39,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:04:39,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:04:39,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:04:39,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:04:39,420 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 09:04:39,420 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:04:39,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 09:04:39,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 09:04:39,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 09:04:39,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 09:04:39,421 INFO L87 Difference]: Start difference. First operand 11700 states and 27858 transitions. Second operand 5 states. [2018-12-09 09:04:39,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:04:39,597 INFO L93 Difference]: Finished difference Result 14260 states and 34245 transitions. [2018-12-09 09:04:39,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 09:04:39,597 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 101 [2018-12-09 09:04:39,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:04:39,607 INFO L225 Difference]: With dead ends: 14260 [2018-12-09 09:04:39,608 INFO L226 Difference]: Without dead ends: 14260 [2018-12-09 09:04:39,608 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 09:04:39,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14260 states. [2018-12-09 09:04:39,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14260 to 12757. [2018-12-09 09:04:39,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12757 states. [2018-12-09 09:04:39,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12757 states to 12757 states and 30522 transitions. [2018-12-09 09:04:39,717 INFO L78 Accepts]: Start accepts. Automaton has 12757 states and 30522 transitions. Word has length 101 [2018-12-09 09:04:39,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:04:39,717 INFO L480 AbstractCegarLoop]: Abstraction has 12757 states and 30522 transitions. [2018-12-09 09:04:39,717 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 09:04:39,717 INFO L276 IsEmpty]: Start isEmpty. Operand 12757 states and 30522 transitions. [2018-12-09 09:04:39,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-09 09:04:39,727 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:04:39,727 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, 1, 1, 1, 1, 1, 1] [2018-12-09 09:04:39,727 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:04:39,727 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:04:39,727 INFO L82 PathProgramCache]: Analyzing trace with hash 444052861, now seen corresponding path program 1 times [2018-12-09 09:04:39,727 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:04:39,727 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:04:39,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:04:39,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:04:39,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:04:39,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:04:39,765 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 09:04:39,766 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:04:39,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 09:04:39,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 09:04:39,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 09:04:39,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 09:04:39,766 INFO L87 Difference]: Start difference. First operand 12757 states and 30522 transitions. Second operand 6 states. [2018-12-09 09:04:40,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:04:40,010 INFO L93 Difference]: Finished difference Result 14167 states and 33586 transitions. [2018-12-09 09:04:40,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 09:04:40,011 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 101 [2018-12-09 09:04:40,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:04:40,020 INFO L225 Difference]: With dead ends: 14167 [2018-12-09 09:04:40,020 INFO L226 Difference]: Without dead ends: 14167 [2018-12-09 09:04:40,020 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-12-09 09:04:40,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14167 states. [2018-12-09 09:04:40,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14167 to 12757. [2018-12-09 09:04:40,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12757 states. [2018-12-09 09:04:40,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12757 states to 12757 states and 30522 transitions. [2018-12-09 09:04:40,130 INFO L78 Accepts]: Start accepts. Automaton has 12757 states and 30522 transitions. Word has length 101 [2018-12-09 09:04:40,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:04:40,131 INFO L480 AbstractCegarLoop]: Abstraction has 12757 states and 30522 transitions. [2018-12-09 09:04:40,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 09:04:40,131 INFO L276 IsEmpty]: Start isEmpty. Operand 12757 states and 30522 transitions. [2018-12-09 09:04:40,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-09 09:04:40,140 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:04:40,140 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, 1, 1, 1, 1, 1, 1] [2018-12-09 09:04:40,140 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:04:40,140 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:04:40,141 INFO L82 PathProgramCache]: Analyzing trace with hash -1499262491, now seen corresponding path program 1 times [2018-12-09 09:04:40,141 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:04:40,141 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:04:40,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:04:40,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:04:40,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:04:40,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:04:40,194 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 09:04:40,194 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:04:40,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 09:04:40,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 09:04:40,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 09:04:40,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-09 09:04:40,194 INFO L87 Difference]: Start difference. First operand 12757 states and 30522 transitions. Second operand 6 states. [2018-12-09 09:04:40,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:04:40,452 INFO L93 Difference]: Finished difference Result 15212 states and 36201 transitions. [2018-12-09 09:04:40,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 09:04:40,453 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 101 [2018-12-09 09:04:40,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:04:40,470 INFO L225 Difference]: With dead ends: 15212 [2018-12-09 09:04:40,470 INFO L226 Difference]: Without dead ends: 15180 [2018-12-09 09:04:40,471 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 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 09:04:40,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15180 states. [2018-12-09 09:04:40,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15180 to 13974. [2018-12-09 09:04:40,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13974 states. [2018-12-09 09:04:40,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13974 states to 13974 states and 33373 transitions. [2018-12-09 09:04:40,595 INFO L78 Accepts]: Start accepts. Automaton has 13974 states and 33373 transitions. Word has length 101 [2018-12-09 09:04:40,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:04:40,596 INFO L480 AbstractCegarLoop]: Abstraction has 13974 states and 33373 transitions. [2018-12-09 09:04:40,596 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 09:04:40,596 INFO L276 IsEmpty]: Start isEmpty. Operand 13974 states and 33373 transitions. [2018-12-09 09:04:40,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-09 09:04:40,606 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:04:40,606 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, 1, 1, 1, 1, 1, 1] [2018-12-09 09:04:40,606 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:04:40,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:04:40,606 INFO L82 PathProgramCache]: Analyzing trace with hash 998753446, now seen corresponding path program 1 times [2018-12-09 09:04:40,606 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:04:40,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:04:40,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:04:40,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:04:40,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:04:40,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:04:40,638 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 09:04:40,639 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:04:40,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 09:04:40,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 09:04:40,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 09:04:40,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 09:04:40,639 INFO L87 Difference]: Start difference. First operand 13974 states and 33373 transitions. Second operand 3 states. [2018-12-09 09:04:40,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:04:40,674 INFO L93 Difference]: Finished difference Result 13910 states and 33101 transitions. [2018-12-09 09:04:40,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 09:04:40,675 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2018-12-09 09:04:40,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:04:40,685 INFO L225 Difference]: With dead ends: 13910 [2018-12-09 09:04:40,685 INFO L226 Difference]: Without dead ends: 13878 [2018-12-09 09:04:40,686 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 09:04:40,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13878 states. [2018-12-09 09:04:40,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13878 to 12528. [2018-12-09 09:04:40,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12528 states. [2018-12-09 09:04:40,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12528 states to 12528 states and 29900 transitions. [2018-12-09 09:04:40,798 INFO L78 Accepts]: Start accepts. Automaton has 12528 states and 29900 transitions. Word has length 101 [2018-12-09 09:04:40,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:04:40,798 INFO L480 AbstractCegarLoop]: Abstraction has 12528 states and 29900 transitions. [2018-12-09 09:04:40,798 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 09:04:40,798 INFO L276 IsEmpty]: Start isEmpty. Operand 12528 states and 29900 transitions. [2018-12-09 09:04:40,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-09 09:04:40,807 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:04:40,807 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:04:40,807 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:04:40,807 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:04:40,807 INFO L82 PathProgramCache]: Analyzing trace with hash -134795596, now seen corresponding path program 1 times [2018-12-09 09:04:40,807 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:04:40,807 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:04:40,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:04:40,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:04:40,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:04:40,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:04:40,896 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 09:04:40,896 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:04:40,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 09:04:40,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 09:04:40,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 09:04:40,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-09 09:04:40,897 INFO L87 Difference]: Start difference. First operand 12528 states and 29900 transitions. Second operand 7 states. [2018-12-09 09:04:41,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:04:41,153 INFO L93 Difference]: Finished difference Result 17686 states and 41280 transitions. [2018-12-09 09:04:41,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 09:04:41,154 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 103 [2018-12-09 09:04:41,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:04:41,166 INFO L225 Difference]: With dead ends: 17686 [2018-12-09 09:04:41,166 INFO L226 Difference]: Without dead ends: 17583 [2018-12-09 09:04:41,166 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-12-09 09:04:41,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17583 states. [2018-12-09 09:04:41,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17583 to 13092. [2018-12-09 09:04:41,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13092 states. [2018-12-09 09:04:41,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13092 states to 13092 states and 31015 transitions. [2018-12-09 09:04:41,315 INFO L78 Accepts]: Start accepts. Automaton has 13092 states and 31015 transitions. Word has length 103 [2018-12-09 09:04:41,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:04:41,315 INFO L480 AbstractCegarLoop]: Abstraction has 13092 states and 31015 transitions. [2018-12-09 09:04:41,315 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 09:04:41,315 INFO L276 IsEmpty]: Start isEmpty. Operand 13092 states and 31015 transitions. [2018-12-09 09:04:41,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-09 09:04:41,324 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:04:41,324 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:04:41,324 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:04:41,324 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:04:41,324 INFO L82 PathProgramCache]: Analyzing trace with hash 95480597, now seen corresponding path program 1 times [2018-12-09 09:04:41,324 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:04:41,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:04:41,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:04:41,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:04:41,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:04:41,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:04:41,387 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 09:04:41,388 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:04:41,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 09:04:41,388 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 09:04:41,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 09:04:41,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 09:04:41,388 INFO L87 Difference]: Start difference. First operand 13092 states and 31015 transitions. Second operand 7 states. [2018-12-09 09:04:41,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:04:41,768 INFO L93 Difference]: Finished difference Result 17076 states and 39231 transitions. [2018-12-09 09:04:41,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 09:04:41,768 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 103 [2018-12-09 09:04:41,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:04:41,785 INFO L225 Difference]: With dead ends: 17076 [2018-12-09 09:04:41,785 INFO L226 Difference]: Without dead ends: 17076 [2018-12-09 09:04:41,786 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2018-12-09 09:04:41,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17076 states. [2018-12-09 09:04:41,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17076 to 14369. [2018-12-09 09:04:41,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14369 states. [2018-12-09 09:04:41,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14369 states to 14369 states and 33433 transitions. [2018-12-09 09:04:41,928 INFO L78 Accepts]: Start accepts. Automaton has 14369 states and 33433 transitions. Word has length 103 [2018-12-09 09:04:41,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:04:41,929 INFO L480 AbstractCegarLoop]: Abstraction has 14369 states and 33433 transitions. [2018-12-09 09:04:41,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 09:04:41,929 INFO L276 IsEmpty]: Start isEmpty. Operand 14369 states and 33433 transitions. [2018-12-09 09:04:41,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-09 09:04:41,938 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:04:41,939 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:04:41,939 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:04:41,939 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:04:41,939 INFO L82 PathProgramCache]: Analyzing trace with hash 306831510, now seen corresponding path program 1 times [2018-12-09 09:04:41,939 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:04:41,939 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:04:41,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:04:41,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:04:41,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:04:41,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:04:42,004 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 09:04:42,005 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:04:42,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 09:04:42,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 09:04:42,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 09:04:42,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 09:04:42,005 INFO L87 Difference]: Start difference. First operand 14369 states and 33433 transitions. Second operand 7 states. [2018-12-09 09:04:42,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:04:42,498 INFO L93 Difference]: Finished difference Result 20521 states and 47293 transitions. [2018-12-09 09:04:42,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-09 09:04:42,499 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 103 [2018-12-09 09:04:42,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:04:42,514 INFO L225 Difference]: With dead ends: 20521 [2018-12-09 09:04:42,514 INFO L226 Difference]: Without dead ends: 20521 [2018-12-09 09:04:42,514 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2018-12-09 09:04:42,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20521 states. [2018-12-09 09:04:42,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20521 to 16693. [2018-12-09 09:04:42,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16693 states. [2018-12-09 09:04:42,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16693 states to 16693 states and 38839 transitions. [2018-12-09 09:04:42,677 INFO L78 Accepts]: Start accepts. Automaton has 16693 states and 38839 transitions. Word has length 103 [2018-12-09 09:04:42,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:04:42,677 INFO L480 AbstractCegarLoop]: Abstraction has 16693 states and 38839 transitions. [2018-12-09 09:04:42,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 09:04:42,678 INFO L276 IsEmpty]: Start isEmpty. Operand 16693 states and 38839 transitions. [2018-12-09 09:04:42,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-09 09:04:42,689 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:04:42,689 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:04:42,690 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:04:42,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:04:42,690 INFO L82 PathProgramCache]: Analyzing trace with hash -203702667, now seen corresponding path program 1 times [2018-12-09 09:04:42,690 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:04:42,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:04:42,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:04:42,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:04:42,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:04:42,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:04:42,737 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 09:04:42,737 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:04:42,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 09:04:42,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 09:04:42,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 09:04:42,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 09:04:42,738 INFO L87 Difference]: Start difference. First operand 16693 states and 38839 transitions. Second operand 4 states. [2018-12-09 09:04:42,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:04:42,865 INFO L93 Difference]: Finished difference Result 16837 states and 39199 transitions. [2018-12-09 09:04:42,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 09:04:42,865 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2018-12-09 09:04:42,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:04:42,878 INFO L225 Difference]: With dead ends: 16837 [2018-12-09 09:04:42,878 INFO L226 Difference]: Without dead ends: 16805 [2018-12-09 09:04:42,878 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 09:04:42,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16805 states. [2018-12-09 09:04:42,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16805 to 16104. [2018-12-09 09:04:42,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16104 states. [2018-12-09 09:04:43,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16104 states to 16104 states and 37520 transitions. [2018-12-09 09:04:43,016 INFO L78 Accepts]: Start accepts. Automaton has 16104 states and 37520 transitions. Word has length 103 [2018-12-09 09:04:43,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:04:43,016 INFO L480 AbstractCegarLoop]: Abstraction has 16104 states and 37520 transitions. [2018-12-09 09:04:43,016 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 09:04:43,016 INFO L276 IsEmpty]: Start isEmpty. Operand 16104 states and 37520 transitions. [2018-12-09 09:04:43,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-09 09:04:43,027 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:04:43,027 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:04:43,027 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:04:43,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:04:43,027 INFO L82 PathProgramCache]: Analyzing trace with hash -2000654026, now seen corresponding path program 1 times [2018-12-09 09:04:43,027 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:04:43,027 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:04:43,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:04:43,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:04:43,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:04:43,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:04:43,124 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 09:04:43,124 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:04:43,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-09 09:04:43,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 09:04:43,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 09:04:43,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-12-09 09:04:43,125 INFO L87 Difference]: Start difference. First operand 16104 states and 37520 transitions. Second operand 10 states. [2018-12-09 09:04:43,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:04:43,488 INFO L93 Difference]: Finished difference Result 21319 states and 49908 transitions. [2018-12-09 09:04:43,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 09:04:43,488 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 103 [2018-12-09 09:04:43,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:04:43,491 INFO L225 Difference]: With dead ends: 21319 [2018-12-09 09:04:43,491 INFO L226 Difference]: Without dead ends: 3813 [2018-12-09 09:04:43,492 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2018-12-09 09:04:43,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3813 states. [2018-12-09 09:04:43,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3813 to 3811. [2018-12-09 09:04:43,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3811 states. [2018-12-09 09:04:43,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3811 states to 3811 states and 8988 transitions. [2018-12-09 09:04:43,518 INFO L78 Accepts]: Start accepts. Automaton has 3811 states and 8988 transitions. Word has length 103 [2018-12-09 09:04:43,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:04:43,518 INFO L480 AbstractCegarLoop]: Abstraction has 3811 states and 8988 transitions. [2018-12-09 09:04:43,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 09:04:43,518 INFO L276 IsEmpty]: Start isEmpty. Operand 3811 states and 8988 transitions. [2018-12-09 09:04:43,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-09 09:04:43,520 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:04:43,520 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:04:43,520 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:04:43,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:04:43,520 INFO L82 PathProgramCache]: Analyzing trace with hash 1143740007, now seen corresponding path program 1 times [2018-12-09 09:04:43,520 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:04:43,521 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:04:43,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:04:43,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:04:43,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:04:43,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:04:43,577 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 09:04:43,578 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:04:43,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 09:04:43,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 09:04:43,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 09:04:43,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-09 09:04:43,578 INFO L87 Difference]: Start difference. First operand 3811 states and 8988 transitions. Second operand 7 states. [2018-12-09 09:04:43,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:04:43,735 INFO L93 Difference]: Finished difference Result 4502 states and 10474 transitions. [2018-12-09 09:04:43,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 09:04:43,736 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 103 [2018-12-09 09:04:43,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:04:43,739 INFO L225 Difference]: With dead ends: 4502 [2018-12-09 09:04:43,739 INFO L226 Difference]: Without dead ends: 4502 [2018-12-09 09:04:43,739 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-12-09 09:04:43,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4502 states. [2018-12-09 09:04:43,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4502 to 3753. [2018-12-09 09:04:43,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3753 states. [2018-12-09 09:04:43,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3753 states to 3753 states and 8870 transitions. [2018-12-09 09:04:43,766 INFO L78 Accepts]: Start accepts. Automaton has 3753 states and 8870 transitions. Word has length 103 [2018-12-09 09:04:43,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:04:43,767 INFO L480 AbstractCegarLoop]: Abstraction has 3753 states and 8870 transitions. [2018-12-09 09:04:43,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 09:04:43,767 INFO L276 IsEmpty]: Start isEmpty. Operand 3753 states and 8870 transitions. [2018-12-09 09:04:43,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-09 09:04:43,769 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:04:43,769 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:04:43,770 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:04:43,770 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:04:43,770 INFO L82 PathProgramCache]: Analyzing trace with hash -1689647290, now seen corresponding path program 2 times [2018-12-09 09:04:43,770 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:04:43,770 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:04:43,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:04:43,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:04:43,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:04:43,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:04:43,882 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 09:04:43,882 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:04:43,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-09 09:04:43,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-09 09:04:43,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-09 09:04:43,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-12-09 09:04:43,883 INFO L87 Difference]: Start difference. First operand 3753 states and 8870 transitions. Second operand 13 states. [2018-12-09 09:04:44,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:04:44,431 INFO L93 Difference]: Finished difference Result 6059 states and 14121 transitions. [2018-12-09 09:04:44,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-09 09:04:44,431 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 103 [2018-12-09 09:04:44,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:04:44,436 INFO L225 Difference]: With dead ends: 6059 [2018-12-09 09:04:44,436 INFO L226 Difference]: Without dead ends: 4316 [2018-12-09 09:04:44,437 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=387, Unknown=0, NotChecked=0, Total=462 [2018-12-09 09:04:44,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4316 states. [2018-12-09 09:04:44,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4316 to 3804. [2018-12-09 09:04:44,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3804 states. [2018-12-09 09:04:44,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3804 states to 3804 states and 8925 transitions. [2018-12-09 09:04:44,473 INFO L78 Accepts]: Start accepts. Automaton has 3804 states and 8925 transitions. Word has length 103 [2018-12-09 09:04:44,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:04:44,473 INFO L480 AbstractCegarLoop]: Abstraction has 3804 states and 8925 transitions. [2018-12-09 09:04:44,473 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-09 09:04:44,473 INFO L276 IsEmpty]: Start isEmpty. Operand 3804 states and 8925 transitions. [2018-12-09 09:04:44,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-09 09:04:44,475 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:04:44,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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:04:44,475 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:04:44,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:04:44,475 INFO L82 PathProgramCache]: Analyzing trace with hash -1276794876, now seen corresponding path program 3 times [2018-12-09 09:04:44,475 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:04:44,475 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:04:44,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:04:44,476 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 09:04:44,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:04:44,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 09:04:44,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 09:04:44,522 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 09:04:44,587 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-09 09:04:44,588 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 09:04:44 BasicIcfg [2018-12-09 09:04:44,588 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 09:04:44,588 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 09:04:44,588 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 09:04:44,588 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 09:04:44,588 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 09:04:21" (3/4) ... [2018-12-09 09:04:44,590 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-09 09:04:44,664 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_588723ea-32f4-4bed-9f54-9a6b2a129de6/bin-2019/uautomizer/witness.graphml [2018-12-09 09:04:44,664 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 09:04:44,664 INFO L168 Benchmark]: Toolchain (without parser) took 23828.77 ms. Allocated memory was 1.0 GB in the beginning and 3.3 GB in the end (delta: 2.3 GB). Free memory was 957.1 MB in the beginning and 1.2 GB in the end (delta: -239.6 MB). Peak memory consumption was 2.0 GB. Max. memory is 11.5 GB. [2018-12-09 09:04:44,665 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 09:04:44,665 INFO L168 Benchmark]: CACSL2BoogieTranslator took 314.68 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.3 MB). Free memory was 957.1 MB in the beginning and 1.1 GB in the end (delta: -144.4 MB). Peak memory consumption was 37.1 MB. Max. memory is 11.5 GB. [2018-12-09 09:04:44,665 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.40 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.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2018-12-09 09:04:44,666 INFO L168 Benchmark]: Boogie Preprocessor took 20.20 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 09:04:44,666 INFO L168 Benchmark]: RCFGBuilder took 387.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 56.7 MB). Peak memory consumption was 56.7 MB. Max. memory is 11.5 GB. [2018-12-09 09:04:44,666 INFO L168 Benchmark]: TraceAbstraction took 22994.90 ms. Allocated memory was 1.2 GB in the beginning and 3.3 GB in the end (delta: 2.2 GB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -204.4 MB). Peak memory consumption was 2.0 GB. Max. memory is 11.5 GB. [2018-12-09 09:04:44,666 INFO L168 Benchmark]: Witness Printer took 75.87 ms. Allocated memory is still 3.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 45.5 MB). Peak memory consumption was 45.5 MB. Max. memory is 11.5 GB. [2018-12-09 09:04:44,667 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 314.68 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.3 MB). Free memory was 957.1 MB in the beginning and 1.1 GB in the end (delta: -144.4 MB). Peak memory consumption was 37.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 33.40 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.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.20 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 387.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 56.7 MB). Peak memory consumption was 56.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 22994.90 ms. Allocated memory was 1.2 GB in the beginning and 3.3 GB in the end (delta: 2.2 GB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -204.4 MB). Peak memory consumption was 2.0 GB. Max. memory is 11.5 GB. * Witness Printer took 75.87 ms. Allocated memory is still 3.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 45.5 MB). Peak memory consumption was 45.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L672] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L674] -1 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L676] -1 int __unbuffered_p0_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0] [L678] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0] [L680] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L681] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L682] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L684] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L685] -1 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L686] -1 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L687] -1 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L688] -1 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L689] -1 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L690] -1 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L691] -1 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L692] -1 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L693] -1 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L694] -1 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L695] -1 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L696] -1 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L697] -1 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L698] -1 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L700] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L701] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L702] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L789] -1 pthread_t t14; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L790] FCALL, FORK -1 pthread_create(&t14, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L791] -1 pthread_t t15; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L792] FCALL, FORK -1 pthread_create(&t15, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L737] 0 x$w_buff1 = x$w_buff0 [L738] 0 x$w_buff0 = 1 [L739] 0 x$w_buff1_used = x$w_buff0_used [L740] 0 x$w_buff0_used = (_Bool)1 [L5] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L742] 0 x$r_buff1_thd0 = x$r_buff0_thd0 [L743] 0 x$r_buff1_thd1 = x$r_buff0_thd1 [L744] 0 x$r_buff1_thd2 = x$r_buff0_thd2 [L745] 0 x$r_buff0_thd2 = (_Bool)1 [L748] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L749] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L750] 0 x$flush_delayed = weak$$choice2 [L751] 0 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L752] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L752] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L752] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L752] 0 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L753] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L753] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L754] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L754] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L755] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L755] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L756] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L756] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L757] EXPR 0 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L757] 0 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L758] EXPR 0 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L758] 0 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L759] 0 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L760] EXPR 0 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L760] 0 x = x$flush_delayed ? x$mem_tmp : x [L761] 0 x$flush_delayed = (_Bool)0 [L764] 0 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L767] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L706] 1 y = 1 [L709] 1 __unbuffered_p0_EAX = y [L712] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L713] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L714] 1 x$flush_delayed = weak$$choice2 [L715] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L716] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L767] 0 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L768] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L768] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L769] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L716] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L717] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L717] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L718] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L718] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L719] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L719] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L720] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L720] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L721] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L721] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L722] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L722] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L723] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L724] EXPR 1 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$flush_delayed ? x$mem_tmp : x=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L724] 1 x = x$flush_delayed ? x$mem_tmp : x [L725] 1 x$flush_delayed = (_Bool)0 [L730] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L769] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L770] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L770] 0 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L771] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L771] 0 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L774] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L794] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L798] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L798] EXPR -1 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L798] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L798] -1 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L799] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L799] -1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L800] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L800] -1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L801] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L801] -1 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L802] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L802] -1 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L805] -1 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L5] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L5] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 284 locations, 3 error locations. UNSAFE Result, 22.8s OverallTime, 27 OverallIterations, 1 TraceHistogramMax, 8.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 9279 SDtfs, 9462 SDslu, 21821 SDs, 0 SdLazy, 7615 SolverSat, 437 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 259 GetRequests, 65 SyntacticMatches, 25 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=83128occurred 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: 6.8s AutomataMinimizationTime, 26 MinimizatonAttempts, 133624 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 2303 NumberOfCodeBlocks, 2303 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 2174 ConstructedInterpolants, 0 QuantifiedInterpolants, 444234 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 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...