./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix042_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_8736eee2-3fd9-4e7e-833c-c80181fb8228/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_8736eee2-3fd9-4e7e-833c-c80181fb8228/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_8736eee2-3fd9-4e7e-833c-c80181fb8228/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_8736eee2-3fd9-4e7e-833c-c80181fb8228/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix042_tso.opt_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_8736eee2-3fd9-4e7e-833c-c80181fb8228/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_8736eee2-3fd9-4e7e-833c-c80181fb8228/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 5e09268fb712cd64b95667f17ecc6d5ef1ed6f24 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-08 12:43:27,147 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 12:43:27,148 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 12:43:27,154 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 12:43:27,154 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 12:43:27,155 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 12:43:27,155 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 12:43:27,156 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 12:43:27,157 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 12:43:27,157 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 12:43:27,158 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 12:43:27,158 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 12:43:27,158 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 12:43:27,159 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 12:43:27,159 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 12:43:27,160 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 12:43:27,160 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 12:43:27,161 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 12:43:27,162 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 12:43:27,162 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 12:43:27,163 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 12:43:27,163 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 12:43:27,164 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 12:43:27,164 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 12:43:27,165 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 12:43:27,165 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 12:43:27,166 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 12:43:27,166 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 12:43:27,166 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 12:43:27,167 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 12:43:27,167 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 12:43:27,167 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 12:43:27,167 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 12:43:27,168 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 12:43:27,168 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 12:43:27,168 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 12:43:27,169 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_8736eee2-3fd9-4e7e-833c-c80181fb8228/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-08 12:43:27,176 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 12:43:27,176 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 12:43:27,176 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-08 12:43:27,176 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-08 12:43:27,177 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-08 12:43:27,177 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-08 12:43:27,177 INFO L133 SettingsManager]: * Use SBE=true [2018-12-08 12:43:27,177 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 12:43:27,177 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 12:43:27,177 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 12:43:27,177 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 12:43:27,177 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 12:43:27,177 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-08 12:43:27,177 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-08 12:43:27,178 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-08 12:43:27,178 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 12:43:27,178 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 12:43:27,178 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-08 12:43:27,178 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-08 12:43:27,178 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 12:43:27,178 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 12:43:27,178 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-08 12:43:27,178 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-08 12:43:27,178 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 12:43:27,178 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 12:43:27,179 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-08 12:43:27,179 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-08 12:43:27,179 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-08 12:43:27,179 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-08 12:43:27,179 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-08 12:43:27,179 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_8736eee2-3fd9-4e7e-833c-c80181fb8228/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 -> 5e09268fb712cd64b95667f17ecc6d5ef1ed6f24 [2018-12-08 12:43:27,196 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 12:43:27,203 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 12:43:27,205 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 12:43:27,205 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 12:43:27,206 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 12:43:27,206 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_8736eee2-3fd9-4e7e-833c-c80181fb8228/bin-2019/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix042_tso.opt_false-unreach-call.i [2018-12-08 12:43:27,242 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8736eee2-3fd9-4e7e-833c-c80181fb8228/bin-2019/uautomizer/data/172bc2c0f/92d5e098dfbc41e08b0c0c6bd829f909/FLAG04eb4a9d0 [2018-12-08 12:43:27,603 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 12:43:27,603 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_8736eee2-3fd9-4e7e-833c-c80181fb8228/sv-benchmarks/c/pthread-wmm/mix042_tso.opt_false-unreach-call.i [2018-12-08 12:43:27,611 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8736eee2-3fd9-4e7e-833c-c80181fb8228/bin-2019/uautomizer/data/172bc2c0f/92d5e098dfbc41e08b0c0c6bd829f909/FLAG04eb4a9d0 [2018-12-08 12:43:27,975 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_8736eee2-3fd9-4e7e-833c-c80181fb8228/bin-2019/uautomizer/data/172bc2c0f/92d5e098dfbc41e08b0c0c6bd829f909 [2018-12-08 12:43:27,978 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 12:43:27,979 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 12:43:27,980 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 12:43:27,980 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 12:43:27,984 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 12:43:27,985 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 12:43:27" (1/1) ... [2018-12-08 12:43:27,988 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56412a8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:43:27, skipping insertion in model container [2018-12-08 12:43:27,988 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 12:43:27" (1/1) ... [2018-12-08 12:43:27,996 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 12:43:28,021 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 12:43:28,199 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 12:43:28,207 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 12:43:28,297 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 12:43:28,334 INFO L195 MainTranslator]: Completed translation [2018-12-08 12:43:28,335 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:43:28 WrapperNode [2018-12-08 12:43:28,335 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 12:43:28,335 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 12:43:28,335 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 12:43:28,336 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 12:43:28,341 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:43:28" (1/1) ... [2018-12-08 12:43:28,351 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:43:28" (1/1) ... [2018-12-08 12:43:28,370 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 12:43:28,370 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 12:43:28,370 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 12:43:28,370 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 12:43:28,376 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:43:28" (1/1) ... [2018-12-08 12:43:28,376 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:43:28" (1/1) ... [2018-12-08 12:43:28,378 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:43:28" (1/1) ... [2018-12-08 12:43:28,378 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:43:28" (1/1) ... [2018-12-08 12:43:28,384 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:43:28" (1/1) ... [2018-12-08 12:43:28,386 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:43:28" (1/1) ... [2018-12-08 12:43:28,388 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:43:28" (1/1) ... [2018-12-08 12:43:28,390 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 12:43:28,390 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 12:43:28,391 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 12:43:28,391 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 12:43:28,391 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:43:28" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8736eee2-3fd9-4e7e-833c-c80181fb8228/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-08 12:43:28,423 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-08 12:43:28,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-08 12:43:28,423 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-08 12:43:28,424 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-08 12:43:28,424 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-08 12:43:28,424 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-08 12:43:28,424 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-08 12:43:28,424 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-08 12:43:28,424 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2018-12-08 12:43:28,424 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2018-12-08 12:43:28,424 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-08 12:43:28,424 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 12:43:28,424 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 12:43:28,425 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-08 12:43:28,727 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 12:43:28,727 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-08 12:43:28,727 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 12:43:28 BoogieIcfgContainer [2018-12-08 12:43:28,727 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 12:43:28,728 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-08 12:43:28,728 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-08 12:43:28,730 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-08 12:43:28,730 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.12 12:43:27" (1/3) ... [2018-12-08 12:43:28,730 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b774975 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 12:43:28, skipping insertion in model container [2018-12-08 12:43:28,730 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:43:28" (2/3) ... [2018-12-08 12:43:28,730 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b774975 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 12:43:28, skipping insertion in model container [2018-12-08 12:43:28,731 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 12:43:28" (3/3) ... [2018-12-08 12:43:28,731 INFO L112 eAbstractionObserver]: Analyzing ICFG mix042_tso.opt_false-unreach-call.i [2018-12-08 12:43:28,753 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:43:28,753 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:43:28,753 WARN L317 ript$VariableManager]: TermVariabe Thread2_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:43:28,753 WARN L317 ript$VariableManager]: TermVariabe Thread2_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:43:28,754 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:43:28,754 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:43:28,754 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:43:28,754 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:43:28,754 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:43:28,754 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:43:28,754 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:43:28,754 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:43:28,754 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:43:28,754 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:43:28,755 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:43:28,755 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:43:28,755 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:43:28,755 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:43:28,755 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:43:28,755 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:43:28,755 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:43:28,755 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:43:28,755 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:43:28,755 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:43:28,755 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:43:28,756 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:43:28,756 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:43:28,756 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:43:28,756 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:43:28,756 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:43:28,756 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:43:28,756 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:43:28,756 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:43:28,756 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:43:28,756 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:43:28,756 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:43:28,757 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:43:28,757 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:43:28,757 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:43:28,757 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:43:28,757 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:43:28,757 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:43:28,757 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:43:28,757 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:43:28,757 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:43:28,758 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:43:28,758 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:43:28,758 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:43:28,758 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:43:28,758 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:43:28,758 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:43:28,758 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:43:28,758 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:43:28,758 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:43:28,758 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:43:28,758 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:43:28,759 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:43:28,759 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:43:28,759 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:43:28,759 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:43:28,759 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:43:28,759 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:43:28,759 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:43:28,759 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:43:28,759 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:43:28,759 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:43:28,760 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:43:28,760 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:43:28,760 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:43:28,760 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:43:28,760 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:43:28,760 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:43:28,760 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:43:28,760 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:43:28,760 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:43:28,760 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:43:28,760 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet17.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:43:28,760 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet17.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:43:28,761 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:43:28,761 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:43:28,761 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet17.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:43:28,761 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet17.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:43:28,765 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-08 12:43:28,765 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-08 12:43:28,770 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-08 12:43:28,779 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-08 12:43:28,794 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-08 12:43:28,794 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-08 12:43:28,794 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-08 12:43:28,794 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-08 12:43:28,794 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 12:43:28,794 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 12:43:28,794 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-08 12:43:28,794 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 12:43:28,794 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-08 12:43:28,801 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 158places, 195 transitions [2018-12-08 12:43:41,756 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 128915 states. [2018-12-08 12:43:41,758 INFO L276 IsEmpty]: Start isEmpty. Operand 128915 states. [2018-12-08 12:43:41,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-08 12:43:41,765 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 12:43:41,765 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 12:43:41,767 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 12:43:41,770 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:43:41,771 INFO L82 PathProgramCache]: Analyzing trace with hash -1862294190, now seen corresponding path program 1 times [2018-12-08 12:43:41,772 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:43:41,772 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:43:41,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:43:41,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:43:41,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:43:41,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:43:41,916 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-08 12:43:41,918 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 12:43:41,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 12:43:41,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 12:43:41,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 12:43:41,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 12:43:41,930 INFO L87 Difference]: Start difference. First operand 128915 states. Second operand 4 states. [2018-12-08 12:43:43,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 12:43:43,311 INFO L93 Difference]: Finished difference Result 233475 states and 1098327 transitions. [2018-12-08 12:43:43,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 12:43:43,312 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2018-12-08 12:43:43,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 12:43:44,022 INFO L225 Difference]: With dead ends: 233475 [2018-12-08 12:43:44,023 INFO L226 Difference]: Without dead ends: 203725 [2018-12-08 12:43:44,024 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-08 12:43:46,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203725 states. [2018-12-08 12:43:48,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203725 to 118895. [2018-12-08 12:43:48,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118895 states. [2018-12-08 12:43:49,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118895 states to 118895 states and 559778 transitions. [2018-12-08 12:43:49,153 INFO L78 Accepts]: Start accepts. Automaton has 118895 states and 559778 transitions. Word has length 46 [2018-12-08 12:43:49,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 12:43:49,154 INFO L480 AbstractCegarLoop]: Abstraction has 118895 states and 559778 transitions. [2018-12-08 12:43:49,154 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 12:43:49,154 INFO L276 IsEmpty]: Start isEmpty. Operand 118895 states and 559778 transitions. [2018-12-08 12:43:49,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-08 12:43:49,160 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 12:43:49,160 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] [2018-12-08 12:43:49,160 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 12:43:49,161 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:43:49,161 INFO L82 PathProgramCache]: Analyzing trace with hash -1986059105, now seen corresponding path program 1 times [2018-12-08 12:43:49,161 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:43:49,161 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:43:49,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:43:49,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:43:49,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:43:49,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:43:49,205 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-08 12:43:49,205 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 12:43:49,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 12:43:49,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 12:43:49,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 12:43:49,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 12:43:49,207 INFO L87 Difference]: Start difference. First operand 118895 states and 559778 transitions. Second operand 3 states. [2018-12-08 12:43:49,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 12:43:49,745 INFO L93 Difference]: Finished difference Result 118895 states and 557818 transitions. [2018-12-08 12:43:49,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 12:43:49,746 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2018-12-08 12:43:49,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 12:43:50,070 INFO L225 Difference]: With dead ends: 118895 [2018-12-08 12:43:50,070 INFO L226 Difference]: Without dead ends: 118895 [2018-12-08 12:43:50,071 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-08 12:43:51,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118895 states. [2018-12-08 12:43:52,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118895 to 118895. [2018-12-08 12:43:52,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118895 states. [2018-12-08 12:43:55,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118895 states to 118895 states and 557818 transitions. [2018-12-08 12:43:55,070 INFO L78 Accepts]: Start accepts. Automaton has 118895 states and 557818 transitions. Word has length 53 [2018-12-08 12:43:55,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 12:43:55,070 INFO L480 AbstractCegarLoop]: Abstraction has 118895 states and 557818 transitions. [2018-12-08 12:43:55,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 12:43:55,070 INFO L276 IsEmpty]: Start isEmpty. Operand 118895 states and 557818 transitions. [2018-12-08 12:43:55,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-08 12:43:55,073 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 12:43:55,074 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] [2018-12-08 12:43:55,074 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 12:43:55,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:43:55,074 INFO L82 PathProgramCache]: Analyzing trace with hash -1856976386, now seen corresponding path program 1 times [2018-12-08 12:43:55,074 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:43:55,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:43:55,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:43:55,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:43:55,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:43:55,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:43:55,129 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-08 12:43:55,130 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 12:43:55,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 12:43:55,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 12:43:55,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 12:43:55,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 12:43:55,130 INFO L87 Difference]: Start difference. First operand 118895 states and 557818 transitions. Second operand 5 states. [2018-12-08 12:43:56,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 12:43:56,796 INFO L93 Difference]: Finished difference Result 325275 states and 1468252 transitions. [2018-12-08 12:43:56,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 12:43:56,796 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2018-12-08 12:43:56,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 12:43:57,686 INFO L225 Difference]: With dead ends: 325275 [2018-12-08 12:43:57,686 INFO L226 Difference]: Without dead ends: 324275 [2018-12-08 12:43:57,686 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-08 12:43:59,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324275 states. [2018-12-08 12:44:02,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324275 to 186425. [2018-12-08 12:44:02,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186425 states. [2018-12-08 12:44:02,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186425 states to 186425 states and 840917 transitions. [2018-12-08 12:44:02,774 INFO L78 Accepts]: Start accepts. Automaton has 186425 states and 840917 transitions. Word has length 53 [2018-12-08 12:44:02,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 12:44:02,775 INFO L480 AbstractCegarLoop]: Abstraction has 186425 states and 840917 transitions. [2018-12-08 12:44:02,775 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 12:44:02,775 INFO L276 IsEmpty]: Start isEmpty. Operand 186425 states and 840917 transitions. [2018-12-08 12:44:02,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-08 12:44:02,780 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 12:44:02,780 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-08 12:44:02,780 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 12:44:02,780 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:44:02,780 INFO L82 PathProgramCache]: Analyzing trace with hash 713101365, now seen corresponding path program 1 times [2018-12-08 12:44:02,780 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:44:02,780 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:44:02,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:44:02,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:44:02,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:44:02,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:44:02,841 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-08 12:44:02,842 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 12:44:02,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 12:44:02,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 12:44:02,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 12:44:02,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 12:44:02,842 INFO L87 Difference]: Start difference. First operand 186425 states and 840917 transitions. Second operand 5 states. [2018-12-08 12:44:04,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 12:44:04,502 INFO L93 Difference]: Finished difference Result 334055 states and 1500996 transitions. [2018-12-08 12:44:04,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 12:44:04,503 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2018-12-08 12:44:04,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 12:44:08,288 INFO L225 Difference]: With dead ends: 334055 [2018-12-08 12:44:08,289 INFO L226 Difference]: Without dead ends: 333005 [2018-12-08 12:44:08,289 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-08 12:44:09,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333005 states. [2018-12-08 12:44:12,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333005 to 194885. [2018-12-08 12:44:12,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194885 states. [2018-12-08 12:44:12,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194885 states to 194885 states and 876475 transitions. [2018-12-08 12:44:12,872 INFO L78 Accepts]: Start accepts. Automaton has 194885 states and 876475 transitions. Word has length 54 [2018-12-08 12:44:12,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 12:44:12,873 INFO L480 AbstractCegarLoop]: Abstraction has 194885 states and 876475 transitions. [2018-12-08 12:44:12,873 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 12:44:12,873 INFO L276 IsEmpty]: Start isEmpty. Operand 194885 states and 876475 transitions. [2018-12-08 12:44:13,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-08 12:44:13,216 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 12:44:13,216 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] [2018-12-08 12:44:13,216 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 12:44:13,216 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:44:13,217 INFO L82 PathProgramCache]: Analyzing trace with hash -1926060511, now seen corresponding path program 1 times [2018-12-08 12:44:13,217 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:44:13,217 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:44:13,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:44:13,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:44:13,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:44:13,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:44:13,251 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-08 12:44:13,252 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 12:44:13,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 12:44:13,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 12:44:13,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 12:44:13,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 12:44:13,252 INFO L87 Difference]: Start difference. First operand 194885 states and 876475 transitions. Second operand 3 states. [2018-12-08 12:44:14,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 12:44:14,089 INFO L93 Difference]: Finished difference Result 194885 states and 876430 transitions. [2018-12-08 12:44:14,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 12:44:14,090 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2018-12-08 12:44:14,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 12:44:14,577 INFO L225 Difference]: With dead ends: 194885 [2018-12-08 12:44:14,577 INFO L226 Difference]: Without dead ends: 194885 [2018-12-08 12:44:14,577 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-08 12:44:15,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194885 states. [2018-12-08 12:44:20,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194885 to 194885. [2018-12-08 12:44:20,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194885 states. [2018-12-08 12:44:20,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194885 states to 194885 states and 876430 transitions. [2018-12-08 12:44:20,796 INFO L78 Accepts]: Start accepts. Automaton has 194885 states and 876430 transitions. Word has length 61 [2018-12-08 12:44:20,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 12:44:20,796 INFO L480 AbstractCegarLoop]: Abstraction has 194885 states and 876430 transitions. [2018-12-08 12:44:20,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 12:44:20,797 INFO L276 IsEmpty]: Start isEmpty. Operand 194885 states and 876430 transitions. [2018-12-08 12:44:20,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-08 12:44:20,818 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 12:44:20,818 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] [2018-12-08 12:44:20,818 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 12:44:20,819 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:44:20,819 INFO L82 PathProgramCache]: Analyzing trace with hash -183250176, now seen corresponding path program 1 times [2018-12-08 12:44:20,819 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:44:20,819 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:44:20,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:44:20,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:44:20,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:44:20,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:44:20,869 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-08 12:44:20,869 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 12:44:20,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 12:44:20,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 12:44:20,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 12:44:20,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 12:44:20,870 INFO L87 Difference]: Start difference. First operand 194885 states and 876430 transitions. Second operand 6 states. [2018-12-08 12:44:23,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 12:44:23,084 INFO L93 Difference]: Finished difference Result 342295 states and 1509933 transitions. [2018-12-08 12:44:23,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-08 12:44:23,085 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2018-12-08 12:44:23,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 12:44:24,433 INFO L225 Difference]: With dead ends: 342295 [2018-12-08 12:44:24,433 INFO L226 Difference]: Without dead ends: 341295 [2018-12-08 12:44:24,434 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2018-12-08 12:44:25,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341295 states. [2018-12-08 12:44:28,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341295 to 189135. [2018-12-08 12:44:28,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189135 states. [2018-12-08 12:44:29,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189135 states to 189135 states and 850630 transitions. [2018-12-08 12:44:29,208 INFO L78 Accepts]: Start accepts. Automaton has 189135 states and 850630 transitions. Word has length 61 [2018-12-08 12:44:29,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 12:44:29,208 INFO L480 AbstractCegarLoop]: Abstraction has 189135 states and 850630 transitions. [2018-12-08 12:44:29,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 12:44:29,208 INFO L276 IsEmpty]: Start isEmpty. Operand 189135 states and 850630 transitions. [2018-12-08 12:44:29,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-08 12:44:29,274 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 12:44:29,274 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] [2018-12-08 12:44:29,274 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 12:44:29,274 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:44:29,274 INFO L82 PathProgramCache]: Analyzing trace with hash 1250958823, now seen corresponding path program 1 times [2018-12-08 12:44:29,274 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:44:29,274 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:44:29,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:44:29,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:44:29,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:44:29,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:44:29,321 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-08 12:44:29,321 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 12:44:29,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 12:44:29,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 12:44:29,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 12:44:29,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 12:44:29,322 INFO L87 Difference]: Start difference. First operand 189135 states and 850630 transitions. Second operand 6 states. [2018-12-08 12:44:33,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 12:44:33,068 INFO L93 Difference]: Finished difference Result 402825 states and 1786032 transitions. [2018-12-08 12:44:33,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-08 12:44:33,069 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2018-12-08 12:44:33,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 12:44:34,422 INFO L225 Difference]: With dead ends: 402825 [2018-12-08 12:44:34,422 INFO L226 Difference]: Without dead ends: 401225 [2018-12-08 12:44:34,422 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-12-08 12:44:35,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401225 states. [2018-12-08 12:44:39,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401225 to 224570. [2018-12-08 12:44:39,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224570 states. [2018-12-08 12:44:40,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224570 states to 224570 states and 1000348 transitions. [2018-12-08 12:44:40,484 INFO L78 Accepts]: Start accepts. Automaton has 224570 states and 1000348 transitions. Word has length 68 [2018-12-08 12:44:40,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 12:44:40,484 INFO L480 AbstractCegarLoop]: Abstraction has 224570 states and 1000348 transitions. [2018-12-08 12:44:40,484 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 12:44:40,484 INFO L276 IsEmpty]: Start isEmpty. Operand 224570 states and 1000348 transitions. [2018-12-08 12:44:40,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-08 12:44:40,582 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 12:44:40,582 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-08 12:44:40,582 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 12:44:40,583 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:44:40,583 INFO L82 PathProgramCache]: Analyzing trace with hash 587746263, now seen corresponding path program 1 times [2018-12-08 12:44:40,583 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:44:40,583 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:44:40,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:44:40,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:44:40,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:44:40,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:44:40,609 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-08 12:44:40,610 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 12:44:40,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 12:44:40,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 12:44:40,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 12:44:40,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 12:44:40,610 INFO L87 Difference]: Start difference. First operand 224570 states and 1000348 transitions. Second operand 3 states. [2018-12-08 12:44:42,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 12:44:42,337 INFO L93 Difference]: Finished difference Result 283190 states and 1243374 transitions. [2018-12-08 12:44:42,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 12:44:42,338 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2018-12-08 12:44:42,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 12:44:43,056 INFO L225 Difference]: With dead ends: 283190 [2018-12-08 12:44:43,056 INFO L226 Difference]: Without dead ends: 283190 [2018-12-08 12:44:43,056 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-08 12:44:44,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283190 states. [2018-12-08 12:44:50,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283190 to 245735. [2018-12-08 12:44:50,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245735 states. [2018-12-08 12:44:51,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245735 states to 245735 states and 1089140 transitions. [2018-12-08 12:44:51,232 INFO L78 Accepts]: Start accepts. Automaton has 245735 states and 1089140 transitions. Word has length 70 [2018-12-08 12:44:51,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 12:44:51,232 INFO L480 AbstractCegarLoop]: Abstraction has 245735 states and 1089140 transitions. [2018-12-08 12:44:51,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 12:44:51,233 INFO L276 IsEmpty]: Start isEmpty. Operand 245735 states and 1089140 transitions. [2018-12-08 12:44:51,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-08 12:44:51,373 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 12:44:51,374 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] [2018-12-08 12:44:51,374 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 12:44:51,374 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:44:51,374 INFO L82 PathProgramCache]: Analyzing trace with hash -1385046795, now seen corresponding path program 1 times [2018-12-08 12:44:51,374 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:44:51,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:44:51,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:44:51,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:44:51,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:44:51,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:44:51,421 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-08 12:44:51,421 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 12:44:51,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 12:44:51,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 12:44:51,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 12:44:51,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-08 12:44:51,422 INFO L87 Difference]: Start difference. First operand 245735 states and 1089140 transitions. Second operand 7 states. [2018-12-08 12:44:54,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 12:44:54,335 INFO L93 Difference]: Finished difference Result 448855 states and 1963116 transitions. [2018-12-08 12:44:54,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-08 12:44:54,336 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2018-12-08 12:44:54,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 12:44:55,649 INFO L225 Difference]: With dead ends: 448855 [2018-12-08 12:44:55,649 INFO L226 Difference]: Without dead ends: 447255 [2018-12-08 12:44:55,649 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2018-12-08 12:44:57,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447255 states. [2018-12-08 12:45:01,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447255 to 253355. [2018-12-08 12:45:01,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253355 states. [2018-12-08 12:45:02,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253355 states to 253355 states and 1121646 transitions. [2018-12-08 12:45:02,800 INFO L78 Accepts]: Start accepts. Automaton has 253355 states and 1121646 transitions. Word has length 74 [2018-12-08 12:45:02,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 12:45:02,800 INFO L480 AbstractCegarLoop]: Abstraction has 253355 states and 1121646 transitions. [2018-12-08 12:45:02,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 12:45:02,800 INFO L276 IsEmpty]: Start isEmpty. Operand 253355 states and 1121646 transitions. [2018-12-08 12:45:02,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-08 12:45:02,954 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 12:45:02,954 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] [2018-12-08 12:45:02,954 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 12:45:02,955 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:45:02,955 INFO L82 PathProgramCache]: Analyzing trace with hash 782165715, now seen corresponding path program 1 times [2018-12-08 12:45:02,955 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:45:02,955 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:45:02,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:45:02,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:45:02,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:45:02,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:45:02,996 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-08 12:45:02,996 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 12:45:02,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 12:45:02,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 12:45:02,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 12:45:02,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 12:45:02,997 INFO L87 Difference]: Start difference. First operand 253355 states and 1121646 transitions. Second operand 4 states. [2018-12-08 12:45:07,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 12:45:07,716 INFO L93 Difference]: Finished difference Result 378280 states and 1665596 transitions. [2018-12-08 12:45:07,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 12:45:07,717 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2018-12-08 12:45:07,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 12:45:08,737 INFO L225 Difference]: With dead ends: 378280 [2018-12-08 12:45:08,737 INFO L226 Difference]: Without dead ends: 375320 [2018-12-08 12:45:08,737 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 12:45:10,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375320 states. [2018-12-08 12:45:14,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375320 to 317205. [2018-12-08 12:45:14,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317205 states. [2018-12-08 12:45:15,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317205 states to 317205 states and 1406261 transitions. [2018-12-08 12:45:15,875 INFO L78 Accepts]: Start accepts. Automaton has 317205 states and 1406261 transitions. Word has length 75 [2018-12-08 12:45:15,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 12:45:15,875 INFO L480 AbstractCegarLoop]: Abstraction has 317205 states and 1406261 transitions. [2018-12-08 12:45:15,875 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 12:45:15,875 INFO L276 IsEmpty]: Start isEmpty. Operand 317205 states and 1406261 transitions. [2018-12-08 12:45:16,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-08 12:45:16,106 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 12:45:16,106 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] [2018-12-08 12:45:16,106 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 12:45:16,106 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:45:16,106 INFO L82 PathProgramCache]: Analyzing trace with hash 2135475412, now seen corresponding path program 1 times [2018-12-08 12:45:16,106 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:45:16,106 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:45:16,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:45:16,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:45:16,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:45:16,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:45:16,154 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-08 12:45:16,154 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 12:45:16,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 12:45:16,155 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 12:45:16,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 12:45:16,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-08 12:45:16,155 INFO L87 Difference]: Start difference. First operand 317205 states and 1406261 transitions. Second operand 7 states. [2018-12-08 12:45:19,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 12:45:19,386 INFO L93 Difference]: Finished difference Result 455310 states and 2000550 transitions. [2018-12-08 12:45:19,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-08 12:45:19,386 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 75 [2018-12-08 12:45:19,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 12:45:21,091 INFO L225 Difference]: With dead ends: 455310 [2018-12-08 12:45:21,091 INFO L226 Difference]: Without dead ends: 453960 [2018-12-08 12:45:21,091 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=356, Unknown=0, NotChecked=0, Total=462 [2018-12-08 12:45:22,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453960 states. [2018-12-08 12:45:31,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453960 to 321680. [2018-12-08 12:45:31,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321680 states. [2018-12-08 12:45:32,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321680 states to 321680 states and 1424261 transitions. [2018-12-08 12:45:32,768 INFO L78 Accepts]: Start accepts. Automaton has 321680 states and 1424261 transitions. Word has length 75 [2018-12-08 12:45:32,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 12:45:32,768 INFO L480 AbstractCegarLoop]: Abstraction has 321680 states and 1424261 transitions. [2018-12-08 12:45:32,768 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 12:45:32,768 INFO L276 IsEmpty]: Start isEmpty. Operand 321680 states and 1424261 transitions. [2018-12-08 12:45:33,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-08 12:45:33,032 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 12:45:33,032 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] [2018-12-08 12:45:33,033 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 12:45:33,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:45:33,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1218293327, now seen corresponding path program 1 times [2018-12-08 12:45:33,033 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:45:33,033 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:45:33,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:45:33,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:45:33,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:45:33,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:45:33,085 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-08 12:45:33,086 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 12:45:33,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 12:45:33,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 12:45:33,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 12:45:33,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-08 12:45:33,086 INFO L87 Difference]: Start difference. First operand 321680 states and 1424261 transitions. Second operand 6 states. [2018-12-08 12:45:35,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 12:45:35,719 INFO L93 Difference]: Finished difference Result 397725 states and 1743892 transitions. [2018-12-08 12:45:35,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 12:45:35,720 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 77 [2018-12-08 12:45:35,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 12:45:36,835 INFO L225 Difference]: With dead ends: 397725 [2018-12-08 12:45:36,835 INFO L226 Difference]: Without dead ends: 393715 [2018-12-08 12:45:36,836 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-08 12:45:38,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393715 states. [2018-12-08 12:45:42,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393715 to 326395. [2018-12-08 12:45:42,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326395 states. [2018-12-08 12:45:44,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326395 states to 326395 states and 1442053 transitions. [2018-12-08 12:45:44,085 INFO L78 Accepts]: Start accepts. Automaton has 326395 states and 1442053 transitions. Word has length 77 [2018-12-08 12:45:44,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 12:45:44,085 INFO L480 AbstractCegarLoop]: Abstraction has 326395 states and 1442053 transitions. [2018-12-08 12:45:44,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 12:45:44,085 INFO L276 IsEmpty]: Start isEmpty. Operand 326395 states and 1442053 transitions. [2018-12-08 12:45:44,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-08 12:45:44,362 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 12:45:44,362 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] [2018-12-08 12:45:44,362 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 12:45:44,362 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:45:44,363 INFO L82 PathProgramCache]: Analyzing trace with hash -2115059952, now seen corresponding path program 1 times [2018-12-08 12:45:44,363 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:45:44,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:45:44,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:45:44,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:45:44,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:45:44,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:45:44,431 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-08 12:45:44,431 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 12:45:44,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 12:45:44,431 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 12:45:44,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 12:45:44,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-08 12:45:44,432 INFO L87 Difference]: Start difference. First operand 326395 states and 1442053 transitions. Second operand 7 states. [2018-12-08 12:45:49,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 12:45:49,913 INFO L93 Difference]: Finished difference Result 477435 states and 2056850 transitions. [2018-12-08 12:45:49,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-08 12:45:49,913 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 77 [2018-12-08 12:45:49,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 12:45:51,515 INFO L225 Difference]: With dead ends: 477435 [2018-12-08 12:45:51,515 INFO L226 Difference]: Without dead ends: 477435 [2018-12-08 12:45:51,516 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-12-08 12:45:53,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477435 states. [2018-12-08 12:45:59,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477435 to 435770. [2018-12-08 12:45:59,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435770 states. [2018-12-08 12:46:00,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435770 states to 435770 states and 1891113 transitions. [2018-12-08 12:46:00,647 INFO L78 Accepts]: Start accepts. Automaton has 435770 states and 1891113 transitions. Word has length 77 [2018-12-08 12:46:00,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 12:46:00,647 INFO L480 AbstractCegarLoop]: Abstraction has 435770 states and 1891113 transitions. [2018-12-08 12:46:00,647 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 12:46:00,647 INFO L276 IsEmpty]: Start isEmpty. Operand 435770 states and 1891113 transitions. [2018-12-08 12:46:01,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-08 12:46:01,632 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 12:46:01,632 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] [2018-12-08 12:46:01,633 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 12:46:01,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:46:01,633 INFO L82 PathProgramCache]: Analyzing trace with hash -870295471, now seen corresponding path program 1 times [2018-12-08 12:46:01,633 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:46:01,633 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:46:01,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:46:01,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:46:01,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:46:01,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:46:01,660 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-08 12:46:01,661 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 12:46:01,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 12:46:01,661 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 12:46:01,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 12:46:01,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 12:46:01,661 INFO L87 Difference]: Start difference. First operand 435770 states and 1891113 transitions. Second operand 4 states. [2018-12-08 12:46:03,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 12:46:03,806 INFO L93 Difference]: Finished difference Result 376005 states and 1609116 transitions. [2018-12-08 12:46:03,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 12:46:03,807 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2018-12-08 12:46:03,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 12:46:04,765 INFO L225 Difference]: With dead ends: 376005 [2018-12-08 12:46:04,765 INFO L226 Difference]: Without dead ends: 373300 [2018-12-08 12:46:04,765 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-08 12:46:06,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373300 states. [2018-12-08 12:46:14,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373300 to 373300. [2018-12-08 12:46:14,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373300 states. [2018-12-08 12:46:16,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373300 states to 373300 states and 1600154 transitions. [2018-12-08 12:46:16,091 INFO L78 Accepts]: Start accepts. Automaton has 373300 states and 1600154 transitions. Word has length 77 [2018-12-08 12:46:16,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 12:46:16,091 INFO L480 AbstractCegarLoop]: Abstraction has 373300 states and 1600154 transitions. [2018-12-08 12:46:16,091 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 12:46:16,091 INFO L276 IsEmpty]: Start isEmpty. Operand 373300 states and 1600154 transitions. [2018-12-08 12:46:16,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-08 12:46:16,439 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 12:46:16,439 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] [2018-12-08 12:46:16,439 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 12:46:16,439 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:46:16,439 INFO L82 PathProgramCache]: Analyzing trace with hash -1063574811, now seen corresponding path program 1 times [2018-12-08 12:46:16,439 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:46:16,439 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:46:16,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:46:16,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:46:16,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:46:16,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:46:16,483 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-08 12:46:16,484 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 12:46:16,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 12:46:16,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 12:46:16,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 12:46:16,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-08 12:46:16,484 INFO L87 Difference]: Start difference. First operand 373300 states and 1600154 transitions. Second operand 5 states. [2018-12-08 12:46:16,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 12:46:16,913 INFO L93 Difference]: Finished difference Result 104404 states and 415166 transitions. [2018-12-08 12:46:16,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 12:46:16,914 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2018-12-08 12:46:16,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 12:46:17,136 INFO L225 Difference]: With dead ends: 104404 [2018-12-08 12:46:17,136 INFO L226 Difference]: Without dead ends: 102012 [2018-12-08 12:46:17,137 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-08 12:46:17,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102012 states. [2018-12-08 12:46:18,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102012 to 101952. [2018-12-08 12:46:18,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101952 states. [2018-12-08 12:46:19,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101952 states to 101952 states and 406002 transitions. [2018-12-08 12:46:19,124 INFO L78 Accepts]: Start accepts. Automaton has 101952 states and 406002 transitions. Word has length 78 [2018-12-08 12:46:19,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 12:46:19,125 INFO L480 AbstractCegarLoop]: Abstraction has 101952 states and 406002 transitions. [2018-12-08 12:46:19,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 12:46:19,125 INFO L276 IsEmpty]: Start isEmpty. Operand 101952 states and 406002 transitions. [2018-12-08 12:46:19,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-12-08 12:46:19,214 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 12:46:19,214 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] [2018-12-08 12:46:19,214 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 12:46:19,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:46:19,214 INFO L82 PathProgramCache]: Analyzing trace with hash 326154353, now seen corresponding path program 1 times [2018-12-08 12:46:19,214 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:46:19,215 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:46:19,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:46:19,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:46:19,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:46:19,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:46:19,259 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-08 12:46:19,259 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 12:46:19,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 12:46:19,260 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 12:46:19,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 12:46:19,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 12:46:19,260 INFO L87 Difference]: Start difference. First operand 101952 states and 406002 transitions. Second operand 4 states. [2018-12-08 12:46:20,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 12:46:20,135 INFO L93 Difference]: Finished difference Result 137720 states and 542591 transitions. [2018-12-08 12:46:20,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 12:46:20,135 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2018-12-08 12:46:20,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 12:46:20,415 INFO L225 Difference]: With dead ends: 137720 [2018-12-08 12:46:20,415 INFO L226 Difference]: Without dead ends: 137720 [2018-12-08 12:46:20,415 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 12:46:20,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137720 states. [2018-12-08 12:46:21,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137720 to 107480. [2018-12-08 12:46:21,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107480 states. [2018-12-08 12:46:22,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107480 states to 107480 states and 426735 transitions. [2018-12-08 12:46:22,436 INFO L78 Accepts]: Start accepts. Automaton has 107480 states and 426735 transitions. Word has length 88 [2018-12-08 12:46:22,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 12:46:22,436 INFO L480 AbstractCegarLoop]: Abstraction has 107480 states and 426735 transitions. [2018-12-08 12:46:22,436 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 12:46:22,436 INFO L276 IsEmpty]: Start isEmpty. Operand 107480 states and 426735 transitions. [2018-12-08 12:46:22,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-12-08 12:46:22,526 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 12:46:22,526 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 12:46:22,526 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 12:46:22,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:46:22,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1316182289, now seen corresponding path program 1 times [2018-12-08 12:46:22,527 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:46:22,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:46:22,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:46:22,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:46:22,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:46:22,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:46:22,566 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-08 12:46:22,566 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 12:46:22,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 12:46:22,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 12:46:22,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 12:46:22,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 12:46:22,566 INFO L87 Difference]: Start difference. First operand 107480 states and 426735 transitions. Second operand 4 states. [2018-12-08 12:46:23,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 12:46:23,441 INFO L93 Difference]: Finished difference Result 147543 states and 578741 transitions. [2018-12-08 12:46:23,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 12:46:23,441 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2018-12-08 12:46:23,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 12:46:23,764 INFO L225 Difference]: With dead ends: 147543 [2018-12-08 12:46:23,764 INFO L226 Difference]: Without dead ends: 147543 [2018-12-08 12:46:23,764 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 12:46:24,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147543 states. [2018-12-08 12:46:25,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147543 to 134136. [2018-12-08 12:46:25,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134136 states. [2018-12-08 12:46:26,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134136 states to 134136 states and 529007 transitions. [2018-12-08 12:46:26,012 INFO L78 Accepts]: Start accepts. Automaton has 134136 states and 529007 transitions. Word has length 88 [2018-12-08 12:46:26,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 12:46:26,012 INFO L480 AbstractCegarLoop]: Abstraction has 134136 states and 529007 transitions. [2018-12-08 12:46:26,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 12:46:26,012 INFO L276 IsEmpty]: Start isEmpty. Operand 134136 states and 529007 transitions. [2018-12-08 12:46:26,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-12-08 12:46:26,335 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 12:46:26,335 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] [2018-12-08 12:46:26,335 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 12:46:26,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:46:26,335 INFO L82 PathProgramCache]: Analyzing trace with hash 1645948050, now seen corresponding path program 1 times [2018-12-08 12:46:26,336 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:46:26,336 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:46:26,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:46:26,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:46:26,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:46:26,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:46:26,413 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-08 12:46:26,413 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 12:46:26,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-08 12:46:26,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-08 12:46:26,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-08 12:46:26,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-08 12:46:26,414 INFO L87 Difference]: Start difference. First operand 134136 states and 529007 transitions. Second operand 8 states. [2018-12-08 12:46:28,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 12:46:28,053 INFO L93 Difference]: Finished difference Result 196170 states and 756695 transitions. [2018-12-08 12:46:28,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-08 12:46:28,054 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 88 [2018-12-08 12:46:28,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 12:46:28,462 INFO L225 Difference]: With dead ends: 196170 [2018-12-08 12:46:28,462 INFO L226 Difference]: Without dead ends: 194570 [2018-12-08 12:46:28,462 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2018-12-08 12:46:28,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194570 states. [2018-12-08 12:46:30,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194570 to 145961. [2018-12-08 12:46:30,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145961 states. [2018-12-08 12:46:31,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145961 states to 145961 states and 572957 transitions. [2018-12-08 12:46:31,339 INFO L78 Accepts]: Start accepts. Automaton has 145961 states and 572957 transitions. Word has length 88 [2018-12-08 12:46:31,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 12:46:31,339 INFO L480 AbstractCegarLoop]: Abstraction has 145961 states and 572957 transitions. [2018-12-08 12:46:31,340 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-08 12:46:31,340 INFO L276 IsEmpty]: Start isEmpty. Operand 145961 states and 572957 transitions. [2018-12-08 12:46:31,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-12-08 12:46:31,471 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 12:46:31,471 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] [2018-12-08 12:46:31,471 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 12:46:31,471 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:46:31,471 INFO L82 PathProgramCache]: Analyzing trace with hash 801476179, now seen corresponding path program 1 times [2018-12-08 12:46:31,471 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:46:31,471 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:46:31,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:46:31,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:46:31,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:46:31,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:46:31,511 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-08 12:46:31,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 12:46:31,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 12:46:31,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 12:46:31,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 12:46:31,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-08 12:46:31,512 INFO L87 Difference]: Start difference. First operand 145961 states and 572957 transitions. Second operand 6 states. [2018-12-08 12:46:31,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 12:46:31,588 INFO L93 Difference]: Finished difference Result 22153 states and 74477 transitions. [2018-12-08 12:46:31,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 12:46:31,588 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 88 [2018-12-08 12:46:31,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 12:46:31,611 INFO L225 Difference]: With dead ends: 22153 [2018-12-08 12:46:31,611 INFO L226 Difference]: Without dead ends: 19123 [2018-12-08 12:46:31,612 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-12-08 12:46:31,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19123 states. [2018-12-08 12:46:31,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19123 to 17883. [2018-12-08 12:46:31,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17883 states. [2018-12-08 12:46:31,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17883 states to 17883 states and 60376 transitions. [2018-12-08 12:46:31,801 INFO L78 Accepts]: Start accepts. Automaton has 17883 states and 60376 transitions. Word has length 88 [2018-12-08 12:46:31,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 12:46:31,802 INFO L480 AbstractCegarLoop]: Abstraction has 17883 states and 60376 transitions. [2018-12-08 12:46:31,802 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 12:46:31,802 INFO L276 IsEmpty]: Start isEmpty. Operand 17883 states and 60376 transitions. [2018-12-08 12:46:31,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-08 12:46:31,815 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 12:46:31,816 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-08 12:46:31,816 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 12:46:31,816 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:46:31,816 INFO L82 PathProgramCache]: Analyzing trace with hash 632352529, now seen corresponding path program 1 times [2018-12-08 12:46:31,816 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:46:31,816 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:46:31,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:46:31,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:46:31,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:46:31,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:46:31,851 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-08 12:46:31,852 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 12:46:31,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 12:46:31,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 12:46:31,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 12:46:31,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 12:46:31,852 INFO L87 Difference]: Start difference. First operand 17883 states and 60376 transitions. Second operand 4 states. [2018-12-08 12:46:31,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 12:46:31,997 INFO L93 Difference]: Finished difference Result 20589 states and 68728 transitions. [2018-12-08 12:46:31,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 12:46:31,998 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2018-12-08 12:46:31,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 12:46:32,021 INFO L225 Difference]: With dead ends: 20589 [2018-12-08 12:46:32,022 INFO L226 Difference]: Without dead ends: 20449 [2018-12-08 12:46:32,022 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-08 12:46:32,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20449 states. [2018-12-08 12:46:32,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20449 to 20216. [2018-12-08 12:46:32,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20216 states. [2018-12-08 12:46:32,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20216 states to 20216 states and 67696 transitions. [2018-12-08 12:46:32,229 INFO L78 Accepts]: Start accepts. Automaton has 20216 states and 67696 transitions. Word has length 101 [2018-12-08 12:46:32,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 12:46:32,229 INFO L480 AbstractCegarLoop]: Abstraction has 20216 states and 67696 transitions. [2018-12-08 12:46:32,229 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 12:46:32,229 INFO L276 IsEmpty]: Start isEmpty. Operand 20216 states and 67696 transitions. [2018-12-08 12:46:32,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-08 12:46:32,244 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 12:46:32,245 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-08 12:46:32,245 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 12:46:32,245 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:46:32,245 INFO L82 PathProgramCache]: Analyzing trace with hash 1601933552, now seen corresponding path program 1 times [2018-12-08 12:46:32,245 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:46:32,245 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:46:32,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:46:32,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:46:32,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:46:32,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:46:32,289 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-08 12:46:32,289 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 12:46:32,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 12:46:32,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 12:46:32,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 12:46:32,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-08 12:46:32,290 INFO L87 Difference]: Start difference. First operand 20216 states and 67696 transitions. Second operand 4 states. [2018-12-08 12:46:32,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 12:46:32,481 INFO L93 Difference]: Finished difference Result 24660 states and 82838 transitions. [2018-12-08 12:46:32,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 12:46:32,481 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2018-12-08 12:46:32,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 12:46:32,512 INFO L225 Difference]: With dead ends: 24660 [2018-12-08 12:46:32,512 INFO L226 Difference]: Without dead ends: 24660 [2018-12-08 12:46:32,512 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-08 12:46:32,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24660 states. [2018-12-08 12:46:32,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24660 to 19541. [2018-12-08 12:46:32,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19541 states. [2018-12-08 12:46:32,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19541 states to 19541 states and 65261 transitions. [2018-12-08 12:46:32,737 INFO L78 Accepts]: Start accepts. Automaton has 19541 states and 65261 transitions. Word has length 101 [2018-12-08 12:46:32,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 12:46:32,737 INFO L480 AbstractCegarLoop]: Abstraction has 19541 states and 65261 transitions. [2018-12-08 12:46:32,737 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 12:46:32,737 INFO L276 IsEmpty]: Start isEmpty. Operand 19541 states and 65261 transitions. [2018-12-08 12:46:32,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-08 12:46:32,752 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 12:46:32,752 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-08 12:46:32,752 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 12:46:32,752 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:46:32,752 INFO L82 PathProgramCache]: Analyzing trace with hash 866090626, now seen corresponding path program 2 times [2018-12-08 12:46:32,753 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:46:32,753 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:46:32,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:46:32,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:46:32,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:46:32,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:46:32,789 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-08 12:46:32,790 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 12:46:32,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 12:46:32,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 12:46:32,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 12:46:32,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 12:46:32,791 INFO L87 Difference]: Start difference. First operand 19541 states and 65261 transitions. Second operand 5 states. [2018-12-08 12:46:32,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 12:46:32,947 INFO L93 Difference]: Finished difference Result 21587 states and 71630 transitions. [2018-12-08 12:46:32,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 12:46:32,948 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 101 [2018-12-08 12:46:32,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 12:46:32,973 INFO L225 Difference]: With dead ends: 21587 [2018-12-08 12:46:32,973 INFO L226 Difference]: Without dead ends: 21447 [2018-12-08 12:46:32,973 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 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-08 12:46:32,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21447 states. [2018-12-08 12:46:33,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21447 to 19566. [2018-12-08 12:46:33,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19566 states. [2018-12-08 12:46:33,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19566 states to 19566 states and 65291 transitions. [2018-12-08 12:46:33,218 INFO L78 Accepts]: Start accepts. Automaton has 19566 states and 65291 transitions. Word has length 101 [2018-12-08 12:46:33,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 12:46:33,218 INFO L480 AbstractCegarLoop]: Abstraction has 19566 states and 65291 transitions. [2018-12-08 12:46:33,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 12:46:33,218 INFO L276 IsEmpty]: Start isEmpty. Operand 19566 states and 65291 transitions. [2018-12-08 12:46:33,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-08 12:46:33,232 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 12:46:33,232 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-08 12:46:33,233 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 12:46:33,233 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:46:33,233 INFO L82 PathProgramCache]: Analyzing trace with hash 1977214670, now seen corresponding path program 1 times [2018-12-08 12:46:33,233 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:46:33,233 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:46:33,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:46:33,234 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 12:46:33,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:46:33,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:46:33,263 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-08 12:46:33,264 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 12:46:33,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 12:46:33,264 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 12:46:33,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 12:46:33,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-08 12:46:33,264 INFO L87 Difference]: Start difference. First operand 19566 states and 65291 transitions. Second operand 4 states. [2018-12-08 12:46:33,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 12:46:33,421 INFO L93 Difference]: Finished difference Result 34741 states and 116437 transitions. [2018-12-08 12:46:33,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 12:46:33,421 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2018-12-08 12:46:33,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 12:46:33,464 INFO L225 Difference]: With dead ends: 34741 [2018-12-08 12:46:33,464 INFO L226 Difference]: Without dead ends: 34601 [2018-12-08 12:46:33,464 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-08 12:46:33,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34601 states. [2018-12-08 12:46:33,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34601 to 19176. [2018-12-08 12:46:33,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19176 states. [2018-12-08 12:46:33,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19176 states to 19176 states and 63809 transitions. [2018-12-08 12:46:33,714 INFO L78 Accepts]: Start accepts. Automaton has 19176 states and 63809 transitions. Word has length 103 [2018-12-08 12:46:33,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 12:46:33,714 INFO L480 AbstractCegarLoop]: Abstraction has 19176 states and 63809 transitions. [2018-12-08 12:46:33,714 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 12:46:33,715 INFO L276 IsEmpty]: Start isEmpty. Operand 19176 states and 63809 transitions. [2018-12-08 12:46:33,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-08 12:46:33,729 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 12:46:33,729 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-08 12:46:33,729 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 12:46:33,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:46:33,729 INFO L82 PathProgramCache]: Analyzing trace with hash -1987986865, now seen corresponding path program 1 times [2018-12-08 12:46:33,729 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:46:33,729 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:46:33,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:46:33,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:46:33,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:46:33,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:46:33,802 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-08 12:46:33,802 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 12:46:33,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 12:46:33,802 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 12:46:33,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 12:46:33,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-08 12:46:33,803 INFO L87 Difference]: Start difference. First operand 19176 states and 63809 transitions. Second operand 7 states. [2018-12-08 12:46:33,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 12:46:33,976 INFO L93 Difference]: Finished difference Result 21055 states and 69635 transitions. [2018-12-08 12:46:33,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 12:46:33,976 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 103 [2018-12-08 12:46:33,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 12:46:34,000 INFO L225 Difference]: With dead ends: 21055 [2018-12-08 12:46:34,000 INFO L226 Difference]: Without dead ends: 21055 [2018-12-08 12:46:34,001 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-08 12:46:34,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21055 states. [2018-12-08 12:46:34,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21055 to 19631. [2018-12-08 12:46:34,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19631 states. [2018-12-08 12:46:34,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19631 states to 19631 states and 65043 transitions. [2018-12-08 12:46:34,199 INFO L78 Accepts]: Start accepts. Automaton has 19631 states and 65043 transitions. Word has length 103 [2018-12-08 12:46:34,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 12:46:34,199 INFO L480 AbstractCegarLoop]: Abstraction has 19631 states and 65043 transitions. [2018-12-08 12:46:34,199 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 12:46:34,199 INFO L276 IsEmpty]: Start isEmpty. Operand 19631 states and 65043 transitions. [2018-12-08 12:46:34,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-08 12:46:34,214 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 12:46:34,214 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-08 12:46:34,214 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 12:46:34,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:46:34,214 INFO L82 PathProgramCache]: Analyzing trace with hash 1123633134, now seen corresponding path program 1 times [2018-12-08 12:46:34,214 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:46:34,214 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:46:34,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:46:34,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:46:34,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:46:34,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:46:34,268 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-08 12:46:34,268 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 12:46:34,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 12:46:34,268 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 12:46:34,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 12:46:34,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-08 12:46:34,269 INFO L87 Difference]: Start difference. First operand 19631 states and 65043 transitions. Second operand 5 states. [2018-12-08 12:46:34,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 12:46:34,401 INFO L93 Difference]: Finished difference Result 17370 states and 57797 transitions. [2018-12-08 12:46:34,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 12:46:34,402 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2018-12-08 12:46:34,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 12:46:34,430 INFO L225 Difference]: With dead ends: 17370 [2018-12-08 12:46:34,430 INFO L226 Difference]: Without dead ends: 17370 [2018-12-08 12:46:34,431 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-08 12:46:34,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17370 states. [2018-12-08 12:46:34,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17370 to 16910. [2018-12-08 12:46:34,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16910 states. [2018-12-08 12:46:34,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16910 states to 16910 states and 56484 transitions. [2018-12-08 12:46:34,611 INFO L78 Accepts]: Start accepts. Automaton has 16910 states and 56484 transitions. Word has length 103 [2018-12-08 12:46:34,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 12:46:34,611 INFO L480 AbstractCegarLoop]: Abstraction has 16910 states and 56484 transitions. [2018-12-08 12:46:34,612 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 12:46:34,612 INFO L276 IsEmpty]: Start isEmpty. Operand 16910 states and 56484 transitions. [2018-12-08 12:46:34,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-08 12:46:34,625 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 12:46:34,625 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-08 12:46:34,625 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 12:46:34,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:46:34,626 INFO L82 PathProgramCache]: Analyzing trace with hash 200949551, now seen corresponding path program 1 times [2018-12-08 12:46:34,626 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:46:34,626 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:46:34,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:46:34,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:46:34,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:46:34,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:46:34,709 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-08 12:46:34,710 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 12:46:34,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 12:46:34,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 12:46:34,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 12:46:34,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-08 12:46:34,710 INFO L87 Difference]: Start difference. First operand 16910 states and 56484 transitions. Second operand 6 states. [2018-12-08 12:46:34,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 12:46:34,831 INFO L93 Difference]: Finished difference Result 13838 states and 45284 transitions. [2018-12-08 12:46:34,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 12:46:34,831 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 103 [2018-12-08 12:46:34,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 12:46:34,846 INFO L225 Difference]: With dead ends: 13838 [2018-12-08 12:46:34,847 INFO L226 Difference]: Without dead ends: 13838 [2018-12-08 12:46:34,847 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-08 12:46:34,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13838 states. [2018-12-08 12:46:34,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13838 to 12349. [2018-12-08 12:46:34,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12349 states. [2018-12-08 12:46:34,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12349 states to 12349 states and 40670 transitions. [2018-12-08 12:46:34,972 INFO L78 Accepts]: Start accepts. Automaton has 12349 states and 40670 transitions. Word has length 103 [2018-12-08 12:46:34,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 12:46:34,973 INFO L480 AbstractCegarLoop]: Abstraction has 12349 states and 40670 transitions. [2018-12-08 12:46:34,973 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 12:46:34,973 INFO L276 IsEmpty]: Start isEmpty. Operand 12349 states and 40670 transitions. [2018-12-08 12:46:34,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-08 12:46:34,982 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 12:46:34,982 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, 1, 1] [2018-12-08 12:46:34,982 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 12:46:34,982 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:46:34,983 INFO L82 PathProgramCache]: Analyzing trace with hash 1076412754, now seen corresponding path program 1 times [2018-12-08 12:46:34,983 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:46:34,983 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:46:34,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:46:34,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:46:34,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:46:34,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:46:35,036 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-08 12:46:35,036 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 12:46:35,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 12:46:35,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 12:46:35,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 12:46:35,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-08 12:46:35,037 INFO L87 Difference]: Start difference. First operand 12349 states and 40670 transitions. Second operand 6 states. [2018-12-08 12:46:35,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 12:46:35,108 INFO L93 Difference]: Finished difference Result 13074 states and 42480 transitions. [2018-12-08 12:46:35,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 12:46:35,109 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 105 [2018-12-08 12:46:35,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 12:46:35,123 INFO L225 Difference]: With dead ends: 13074 [2018-12-08 12:46:35,123 INFO L226 Difference]: Without dead ends: 12849 [2018-12-08 12:46:35,123 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-08 12:46:35,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12849 states. [2018-12-08 12:46:35,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12849 to 12214. [2018-12-08 12:46:35,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12214 states. [2018-12-08 12:46:35,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12214 states to 12214 states and 40137 transitions. [2018-12-08 12:46:35,276 INFO L78 Accepts]: Start accepts. Automaton has 12214 states and 40137 transitions. Word has length 105 [2018-12-08 12:46:35,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 12:46:35,276 INFO L480 AbstractCegarLoop]: Abstraction has 12214 states and 40137 transitions. [2018-12-08 12:46:35,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 12:46:35,276 INFO L276 IsEmpty]: Start isEmpty. Operand 12214 states and 40137 transitions. [2018-12-08 12:46:35,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-08 12:46:35,285 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 12:46:35,285 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, 1, 1] [2018-12-08 12:46:35,285 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 12:46:35,285 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:46:35,285 INFO L82 PathProgramCache]: Analyzing trace with hash -859247533, now seen corresponding path program 1 times [2018-12-08 12:46:35,285 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:46:35,285 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:46:35,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:46:35,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:46:35,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:46:35,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:46:35,322 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-08 12:46:35,323 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 12:46:35,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 12:46:35,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 12:46:35,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 12:46:35,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 12:46:35,323 INFO L87 Difference]: Start difference. First operand 12214 states and 40137 transitions. Second operand 5 states. [2018-12-08 12:46:35,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 12:46:35,452 INFO L93 Difference]: Finished difference Result 14006 states and 45897 transitions. [2018-12-08 12:46:35,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 12:46:35,452 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2018-12-08 12:46:35,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 12:46:35,468 INFO L225 Difference]: With dead ends: 14006 [2018-12-08 12:46:35,468 INFO L226 Difference]: Without dead ends: 13878 [2018-12-08 12:46:35,468 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-08 12:46:35,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13878 states. [2018-12-08 12:46:35,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13878 to 11363. [2018-12-08 12:46:35,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11363 states. [2018-12-08 12:46:35,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11363 states to 11363 states and 37397 transitions. [2018-12-08 12:46:35,592 INFO L78 Accepts]: Start accepts. Automaton has 11363 states and 37397 transitions. Word has length 105 [2018-12-08 12:46:35,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 12:46:35,592 INFO L480 AbstractCegarLoop]: Abstraction has 11363 states and 37397 transitions. [2018-12-08 12:46:35,592 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 12:46:35,592 INFO L276 IsEmpty]: Start isEmpty. Operand 11363 states and 37397 transitions. [2018-12-08 12:46:35,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-08 12:46:35,601 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 12:46:35,601 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, 1, 1] [2018-12-08 12:46:35,601 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 12:46:35,602 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:46:35,602 INFO L82 PathProgramCache]: Analyzing trace with hash 385516948, now seen corresponding path program 1 times [2018-12-08 12:46:35,602 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:46:35,602 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:46:35,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:46:35,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:46:35,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:46:35,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:46:35,660 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-08 12:46:35,660 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 12:46:35,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 12:46:35,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 12:46:35,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 12:46:35,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-08 12:46:35,661 INFO L87 Difference]: Start difference. First operand 11363 states and 37397 transitions. Second operand 5 states. [2018-12-08 12:46:35,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 12:46:35,717 INFO L93 Difference]: Finished difference Result 18171 states and 60562 transitions. [2018-12-08 12:46:35,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 12:46:35,718 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2018-12-08 12:46:35,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 12:46:35,739 INFO L225 Difference]: With dead ends: 18171 [2018-12-08 12:46:35,739 INFO L226 Difference]: Without dead ends: 18171 [2018-12-08 12:46:35,739 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-08 12:46:35,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18171 states. [2018-12-08 12:46:35,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18171 to 11243. [2018-12-08 12:46:35,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11243 states. [2018-12-08 12:46:35,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11243 states to 11243 states and 36776 transitions. [2018-12-08 12:46:35,883 INFO L78 Accepts]: Start accepts. Automaton has 11243 states and 36776 transitions. Word has length 105 [2018-12-08 12:46:35,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 12:46:35,883 INFO L480 AbstractCegarLoop]: Abstraction has 11243 states and 36776 transitions. [2018-12-08 12:46:35,883 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 12:46:35,883 INFO L276 IsEmpty]: Start isEmpty. Operand 11243 states and 36776 transitions. [2018-12-08 12:46:35,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-08 12:46:35,892 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 12:46:35,892 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, 1, 1] [2018-12-08 12:46:35,892 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 12:46:35,892 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:46:35,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1355097971, now seen corresponding path program 1 times [2018-12-08 12:46:35,893 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:46:35,893 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:46:35,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:46:35,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:46:35,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:46:35,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:46:35,957 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-08 12:46:35,957 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 12:46:35,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-08 12:46:35,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-08 12:46:35,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-08 12:46:35,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-08 12:46:35,958 INFO L87 Difference]: Start difference. First operand 11243 states and 36776 transitions. Second operand 9 states. [2018-12-08 12:46:36,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 12:46:36,087 INFO L93 Difference]: Finished difference Result 20983 states and 69321 transitions. [2018-12-08 12:46:36,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 12:46:36,087 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 105 [2018-12-08 12:46:36,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 12:46:36,099 INFO L225 Difference]: With dead ends: 20983 [2018-12-08 12:46:36,099 INFO L226 Difference]: Without dead ends: 10583 [2018-12-08 12:46:36,099 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2018-12-08 12:46:36,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10583 states. [2018-12-08 12:46:36,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10583 to 10583. [2018-12-08 12:46:36,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10583 states. [2018-12-08 12:46:36,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10583 states to 10583 states and 34856 transitions. [2018-12-08 12:46:36,208 INFO L78 Accepts]: Start accepts. Automaton has 10583 states and 34856 transitions. Word has length 105 [2018-12-08 12:46:36,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 12:46:36,208 INFO L480 AbstractCegarLoop]: Abstraction has 10583 states and 34856 transitions. [2018-12-08 12:46:36,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-08 12:46:36,208 INFO L276 IsEmpty]: Start isEmpty. Operand 10583 states and 34856 transitions. [2018-12-08 12:46:36,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-08 12:46:36,216 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 12:46:36,216 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, 1, 1] [2018-12-08 12:46:36,217 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 12:46:36,217 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:46:36,217 INFO L82 PathProgramCache]: Analyzing trace with hash -1863121905, now seen corresponding path program 2 times [2018-12-08 12:46:36,217 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:46:36,217 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:46:36,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:46:36,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:46:36,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:46:36,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:46:36,292 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-08 12:46:36,292 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 12:46:36,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-08 12:46:36,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-08 12:46:36,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-08 12:46:36,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-08 12:46:36,293 INFO L87 Difference]: Start difference. First operand 10583 states and 34856 transitions. Second operand 9 states. [2018-12-08 12:46:36,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 12:46:36,415 INFO L93 Difference]: Finished difference Result 17971 states and 59941 transitions. [2018-12-08 12:46:36,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 12:46:36,416 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 105 [2018-12-08 12:46:36,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 12:46:36,425 INFO L225 Difference]: With dead ends: 17971 [2018-12-08 12:46:36,425 INFO L226 Difference]: Without dead ends: 7632 [2018-12-08 12:46:36,425 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2018-12-08 12:46:36,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7632 states. [2018-12-08 12:46:36,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7632 to 7632. [2018-12-08 12:46:36,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7632 states. [2018-12-08 12:46:36,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7632 states to 7632 states and 25729 transitions. [2018-12-08 12:46:36,496 INFO L78 Accepts]: Start accepts. Automaton has 7632 states and 25729 transitions. Word has length 105 [2018-12-08 12:46:36,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 12:46:36,496 INFO L480 AbstractCegarLoop]: Abstraction has 7632 states and 25729 transitions. [2018-12-08 12:46:36,496 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-08 12:46:36,496 INFO L276 IsEmpty]: Start isEmpty. Operand 7632 states and 25729 transitions. [2018-12-08 12:46:36,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-08 12:46:36,501 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 12:46:36,501 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, 1, 1] [2018-12-08 12:46:36,502 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 12:46:36,502 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:46:36,502 INFO L82 PathProgramCache]: Analyzing trace with hash -486297935, now seen corresponding path program 3 times [2018-12-08 12:46:36,502 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:46:36,502 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:46:36,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:46:36,503 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 12:46:36,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:46:36,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:46:36,582 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-08 12:46:36,583 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 12:46:36,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-08 12:46:36,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-08 12:46:36,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-08 12:46:36,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-08 12:46:36,583 INFO L87 Difference]: Start difference. First operand 7632 states and 25729 transitions. Second operand 12 states. [2018-12-08 12:46:36,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 12:46:36,911 INFO L93 Difference]: Finished difference Result 14700 states and 49790 transitions. [2018-12-08 12:46:36,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-08 12:46:36,911 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 105 [2018-12-08 12:46:36,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 12:46:36,922 INFO L225 Difference]: With dead ends: 14700 [2018-12-08 12:46:36,922 INFO L226 Difference]: Without dead ends: 10156 [2018-12-08 12:46:36,923 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2018-12-08 12:46:36,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10156 states. [2018-12-08 12:46:37,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10156 to 9548. [2018-12-08 12:46:37,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9548 states. [2018-12-08 12:46:37,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9548 states to 9548 states and 31622 transitions. [2018-12-08 12:46:37,017 INFO L78 Accepts]: Start accepts. Automaton has 9548 states and 31622 transitions. Word has length 105 [2018-12-08 12:46:37,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 12:46:37,017 INFO L480 AbstractCegarLoop]: Abstraction has 9548 states and 31622 transitions. [2018-12-08 12:46:37,017 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-08 12:46:37,017 INFO L276 IsEmpty]: Start isEmpty. Operand 9548 states and 31622 transitions. [2018-12-08 12:46:37,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-08 12:46:37,024 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 12:46:37,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 12:46:37,024 INFO L423 AbstractCegarLoop]: === Iteration 33 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 12:46:37,024 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:46:37,024 INFO L82 PathProgramCache]: Analyzing trace with hash -1610066251, now seen corresponding path program 4 times [2018-12-08 12:46:37,024 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:46:37,025 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:46:37,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:46:37,025 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 12:46:37,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:46:37,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:46:37,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:46:37,071 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-08 12:46:37,146 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-08 12:46:37,147 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.12 12:46:37 BasicIcfg [2018-12-08 12:46:37,147 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-08 12:46:37,147 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 12:46:37,147 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 12:46:37,147 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 12:46:37,148 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 12:43:28" (3/4) ... [2018-12-08 12:46:37,150 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-08 12:46:37,225 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_8736eee2-3fd9-4e7e-833c-c80181fb8228/bin-2019/uautomizer/witness.graphml [2018-12-08 12:46:37,225 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 12:46:37,225 INFO L168 Benchmark]: Toolchain (without parser) took 189247.06 ms. Allocated memory was 1.0 GB in the beginning and 11.6 GB in the end (delta: 10.5 GB). Free memory was 950.6 MB in the beginning and 3.6 GB in the end (delta: -2.6 GB). Peak memory consumption was 7.9 GB. Max. memory is 11.5 GB. [2018-12-08 12:46:37,226 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 12:46:37,226 INFO L168 Benchmark]: CACSL2BoogieTranslator took 354.86 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.4 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -142.7 MB). Peak memory consumption was 28.7 MB. Max. memory is 11.5 GB. [2018-12-08 12:46:37,226 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.28 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-08 12:46:37,227 INFO L168 Benchmark]: Boogie Preprocessor took 20.46 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-08 12:46:37,227 INFO L168 Benchmark]: RCFGBuilder took 336.94 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 49.3 MB). Peak memory consumption was 49.3 MB. Max. memory is 11.5 GB. [2018-12-08 12:46:37,227 INFO L168 Benchmark]: TraceAbstraction took 188419.35 ms. Allocated memory was 1.1 GB in the beginning and 11.6 GB in the end (delta: 10.4 GB). Free memory was 1.0 GB in the beginning and 3.6 GB in the end (delta: -2.6 GB). Peak memory consumption was 7.9 GB. Max. memory is 11.5 GB. [2018-12-08 12:46:37,227 INFO L168 Benchmark]: Witness Printer took 77.41 ms. Allocated memory is still 11.6 GB. Free memory was 3.6 GB in the beginning and 3.6 GB in the end (delta: 34.1 MB). Peak memory consumption was 34.1 MB. Max. memory is 11.5 GB. [2018-12-08 12:46:37,228 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 354.86 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.4 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -142.7 MB). Peak memory consumption was 28.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 34.28 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.46 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 336.94 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 49.3 MB). Peak memory consumption was 49.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 188419.35 ms. Allocated memory was 1.1 GB in the beginning and 11.6 GB in the end (delta: 10.4 GB). Free memory was 1.0 GB in the beginning and 3.6 GB in the end (delta: -2.6 GB). Peak memory consumption was 7.9 GB. Max. memory is 11.5 GB. * Witness Printer took 77.41 ms. Allocated memory is still 11.6 GB. Free memory was 3.6 GB in the beginning and 3.6 GB in the end (delta: 34.1 MB). Peak memory consumption was 34.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [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_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0] [L678] -1 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L680] -1 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0] [L681] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0] [L682] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L684] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L686] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L687] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L688] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L689] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L690] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L691] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L692] -1 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L693] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0] [L694] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L695] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L696] -1 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L697] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L698] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L699] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L700] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L701] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L702] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L704] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L705] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L706] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L788] -1 pthread_t t1128; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L789] FCALL, FORK -1 pthread_create(&t1128, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L790] -1 pthread_t t1129; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L791] FCALL, FORK -1 pthread_create(&t1129, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L792] -1 pthread_t t1130; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L793] FCALL, FORK -1 pthread_create(&t1130, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L745] 0 y$w_buff1 = y$w_buff0 [L746] 0 y$w_buff0 = 2 [L747] 0 y$w_buff1_used = y$w_buff0_used [L748] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L750] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L751] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L752] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L753] 0 y$r_buff1_thd3 = y$r_buff0_thd3 [L754] 0 y$r_buff0_thd3 = (_Bool)1 [L757] 0 z = 1 [L760] 0 __unbuffered_p2_EAX = z [L763] 0 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L766] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L710] 1 a = 1 [L713] 1 __unbuffered_p0_EAX = x [L718] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L725] 2 x = 1 [L728] 2 y = 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L766] 0 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L767] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L731] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L767] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L731] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2, z=1] [L768] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2, z=1] [L768] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L731] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2, z=1] [L731] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L732] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L732] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L769] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L769] 0 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L770] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L770] 0 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L773] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L733] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L733] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L734] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L734] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L735] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L735] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L738] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L795] -1 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L799] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L799] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L799] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L799] -1 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L800] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L800] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L801] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L801] -1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L802] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L802] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L803] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L803] -1 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L806] -1 weak$$choice0 = __VERIFIER_nondet_pointer() [L807] -1 weak$$choice2 = __VERIFIER_nondet_pointer() [L808] -1 y$flush_delayed = weak$$choice2 [L809] -1 y$mem_tmp = y VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L810] EXPR -1 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L810] -1 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L811] EXPR -1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L811] -1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L812] EXPR -1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L812] -1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L813] EXPR -1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L813] -1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L814] EXPR -1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L814] -1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L815] EXPR -1 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L815] -1 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L816] EXPR -1 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L816] -1 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] -1 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L818] EXPR -1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L818] -1 y = y$flush_delayed ? y$mem_tmp : y [L819] -1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 201 locations, 3 error locations. UNSAFE Result, 188.3s OverallTime, 33 OverallIterations, 1 TraceHistogramMax, 59.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 9016 SDtfs, 10467 SDslu, 21333 SDs, 0 SdLazy, 7660 SolverSat, 511 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 327 GetRequests, 92 SyntacticMatches, 20 SemanticMatches, 215 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=435770occurred in iteration=13, 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: 110.1s AutomataMinimizationTime, 32 MinimizatonAttempts, 1350623 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 2801 NumberOfCodeBlocks, 2801 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 2664 ConstructedInterpolants, 0 QuantifiedInterpolants, 542729 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 32 InterpolantComputations, 32 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...