./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix052_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_09808314-1bc6-44dd-9c1d-0674402f8d32/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_09808314-1bc6-44dd-9c1d-0674402f8d32/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_09808314-1bc6-44dd-9c1d-0674402f8d32/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_09808314-1bc6-44dd-9c1d-0674402f8d32/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix052_tso.opt_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_09808314-1bc6-44dd-9c1d-0674402f8d32/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_09808314-1bc6-44dd-9c1d-0674402f8d32/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 f5d2b9fff434c5c9e398eac1a44a685c754dda56 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-01 10:01:06,574 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-01 10:01:06,575 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-01 10:01:06,581 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-01 10:01:06,581 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-01 10:01:06,581 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-01 10:01:06,582 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-01 10:01:06,584 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-01 10:01:06,585 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-01 10:01:06,585 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-01 10:01:06,586 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-01 10:01:06,586 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-01 10:01:06,587 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-01 10:01:06,587 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-01 10:01:06,588 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-01 10:01:06,589 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-01 10:01:06,589 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-01 10:01:06,590 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-01 10:01:06,592 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-01 10:01:06,593 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-01 10:01:06,594 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-01 10:01:06,594 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-01 10:01:06,596 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-01 10:01:06,596 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-01 10:01:06,596 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-01 10:01:06,597 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-01 10:01:06,597 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-01 10:01:06,598 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-01 10:01:06,598 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-01 10:01:06,599 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-01 10:01:06,599 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-01 10:01:06,600 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-01 10:01:06,600 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-01 10:01:06,600 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-01 10:01:06,601 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-01 10:01:06,601 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-01 10:01:06,601 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_09808314-1bc6-44dd-9c1d-0674402f8d32/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-01 10:01:06,608 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-01 10:01:06,609 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-01 10:01:06,609 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-01 10:01:06,609 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-01 10:01:06,610 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-01 10:01:06,610 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-01 10:01:06,610 INFO L133 SettingsManager]: * Use SBE=true [2018-12-01 10:01:06,610 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-01 10:01:06,610 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-01 10:01:06,610 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-01 10:01:06,610 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-01 10:01:06,610 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-01 10:01:06,610 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-01 10:01:06,610 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-01 10:01:06,610 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-01 10:01:06,611 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-01 10:01:06,611 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-01 10:01:06,611 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-01 10:01:06,611 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-01 10:01:06,611 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-01 10:01:06,611 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-01 10:01:06,611 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-01 10:01:06,611 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-01 10:01:06,611 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-01 10:01:06,611 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-01 10:01:06,612 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-01 10:01:06,612 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-01 10:01:06,612 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-01 10:01:06,612 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-01 10:01:06,612 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-01 10:01:06,612 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_09808314-1bc6-44dd-9c1d-0674402f8d32/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 -> f5d2b9fff434c5c9e398eac1a44a685c754dda56 [2018-12-01 10:01:06,635 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-01 10:01:06,642 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-01 10:01:06,644 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-01 10:01:06,645 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-01 10:01:06,645 INFO L276 PluginConnector]: CDTParser initialized [2018-12-01 10:01:06,646 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_09808314-1bc6-44dd-9c1d-0674402f8d32/bin-2019/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix052_tso.opt_false-unreach-call.i [2018-12-01 10:01:06,681 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_09808314-1bc6-44dd-9c1d-0674402f8d32/bin-2019/uautomizer/data/d7771105a/48c67263c77541ca998cfb62644f4237/FLAG418962e73 [2018-12-01 10:01:07,133 INFO L307 CDTParser]: Found 1 translation units. [2018-12-01 10:01:07,133 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_09808314-1bc6-44dd-9c1d-0674402f8d32/sv-benchmarks/c/pthread-wmm/mix052_tso.opt_false-unreach-call.i [2018-12-01 10:01:07,141 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_09808314-1bc6-44dd-9c1d-0674402f8d32/bin-2019/uautomizer/data/d7771105a/48c67263c77541ca998cfb62644f4237/FLAG418962e73 [2018-12-01 10:01:07,150 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_09808314-1bc6-44dd-9c1d-0674402f8d32/bin-2019/uautomizer/data/d7771105a/48c67263c77541ca998cfb62644f4237 [2018-12-01 10:01:07,152 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-01 10:01:07,153 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-01 10:01:07,153 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-01 10:01:07,153 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-01 10:01:07,155 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-01 10:01:07,156 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 10:01:07" (1/1) ... [2018-12-01 10:01:07,157 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ab2707f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:01:07, skipping insertion in model container [2018-12-01 10:01:07,158 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 10:01:07" (1/1) ... [2018-12-01 10:01:07,162 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-01 10:01:07,184 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-01 10:01:07,359 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 10:01:07,367 INFO L191 MainTranslator]: Completed pre-run [2018-12-01 10:01:07,453 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 10:01:07,484 INFO L195 MainTranslator]: Completed translation [2018-12-01 10:01:07,484 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:01:07 WrapperNode [2018-12-01 10:01:07,484 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-01 10:01:07,485 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-01 10:01:07,485 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-01 10:01:07,485 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-01 10:01:07,490 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:01:07" (1/1) ... [2018-12-01 10:01:07,502 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:01:07" (1/1) ... [2018-12-01 10:01:07,524 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-01 10:01:07,524 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-01 10:01:07,524 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-01 10:01:07,524 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-01 10:01:07,531 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:01:07" (1/1) ... [2018-12-01 10:01:07,531 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:01:07" (1/1) ... [2018-12-01 10:01:07,534 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:01:07" (1/1) ... [2018-12-01 10:01:07,535 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:01:07" (1/1) ... [2018-12-01 10:01:07,542 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:01:07" (1/1) ... [2018-12-01 10:01:07,545 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:01:07" (1/1) ... [2018-12-01 10:01:07,548 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:01:07" (1/1) ... [2018-12-01 10:01:07,551 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-01 10:01:07,551 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-01 10:01:07,551 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-01 10:01:07,551 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-01 10:01:07,552 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:01:07" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_09808314-1bc6-44dd-9c1d-0674402f8d32/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-01 10:01:07,586 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-01 10:01:07,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-01 10:01:07,587 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-01 10:01:07,587 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-01 10:01:07,587 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-01 10:01:07,587 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-01 10:01:07,587 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-01 10:01:07,587 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-01 10:01:07,588 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2018-12-01 10:01:07,588 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2018-12-01 10:01:07,588 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-01 10:01:07,588 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-01 10:01:07,588 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-01 10:01:07,589 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-01 10:01:07,867 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-01 10:01:07,868 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-01 10:01:07,868 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 10:01:07 BoogieIcfgContainer [2018-12-01 10:01:07,868 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-01 10:01:07,868 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-01 10:01:07,868 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-01 10:01:07,870 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-01 10:01:07,870 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.12 10:01:07" (1/3) ... [2018-12-01 10:01:07,871 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7909d80d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.12 10:01:07, skipping insertion in model container [2018-12-01 10:01:07,871 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:01:07" (2/3) ... [2018-12-01 10:01:07,871 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7909d80d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.12 10:01:07, skipping insertion in model container [2018-12-01 10:01:07,871 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 10:01:07" (3/3) ... [2018-12-01 10:01:07,872 INFO L112 eAbstractionObserver]: Analyzing ICFG mix052_tso.opt_false-unreach-call.i [2018-12-01 10:01:07,894 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,895 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,895 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,895 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,895 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,895 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,895 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,895 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,895 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,895 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,896 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet5.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,896 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,896 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,896 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,896 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,896 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet5.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,896 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,896 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,896 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet5.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,896 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,896 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,897 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet5.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,897 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,897 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,897 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,897 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,897 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,897 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,897 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,897 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,897 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,898 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,898 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,898 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,898 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,898 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,898 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,898 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,898 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,898 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,898 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,899 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,899 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,899 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,899 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,899 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,899 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,899 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,899 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,899 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,899 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,900 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,900 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,900 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,900 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,900 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,900 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,900 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,900 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,900 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,900 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,900 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,901 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,901 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,901 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,901 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,901 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,901 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,901 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,901 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,901 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,901 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,901 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,902 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,902 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,902 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,902 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,902 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,902 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,902 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,902 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,902 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,902 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,903 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,903 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,903 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,903 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,903 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,903 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,903 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,903 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,903 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,903 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,903 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,904 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,904 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,904 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,904 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,904 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,904 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,904 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,904 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,904 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,904 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,904 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,904 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,905 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,905 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,905 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,905 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,905 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,905 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,905 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,905 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,905 WARN L317 ript$VariableManager]: TermVariabe Thread2_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,906 WARN L317 ript$VariableManager]: TermVariabe Thread2_P2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,906 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,906 WARN L317 ript$VariableManager]: TermVariabe Thread2_P2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,906 WARN L317 ript$VariableManager]: TermVariabe Thread2_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,906 WARN L317 ript$VariableManager]: TermVariabe Thread2_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,906 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,906 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,906 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,906 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,906 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,906 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,907 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,907 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,907 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,907 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,907 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,907 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,907 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,907 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,907 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,907 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,907 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,908 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,908 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,908 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,908 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,908 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,908 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,908 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,908 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~nondet34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,908 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~nondet34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,908 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,908 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,909 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~nondet34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,909 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~nondet34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 10:01:07,913 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-01 10:01:07,913 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-01 10:01:07,918 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-01 10:01:07,927 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-01 10:01:07,941 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-01 10:01:07,942 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-01 10:01:07,942 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-01 10:01:07,942 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-01 10:01:07,942 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-01 10:01:07,942 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-01 10:01:07,942 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-01 10:01:07,942 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-01 10:01:07,942 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-01 10:01:07,949 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 144places, 175 transitions [2018-12-01 10:01:27,142 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 149043 states. [2018-12-01 10:01:27,144 INFO L276 IsEmpty]: Start isEmpty. Operand 149043 states. [2018-12-01 10:01:27,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-01 10:01:27,151 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 10:01:27,152 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] [2018-12-01 10:01:27,153 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 10:01:27,156 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 10:01:27,157 INFO L82 PathProgramCache]: Analyzing trace with hash -1052590070, now seen corresponding path program 1 times [2018-12-01 10:01:27,158 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 10:01:27,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 10:01:27,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 10:01:27,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 10:01:27,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 10:01:27,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 10:01:27,301 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-01 10:01:27,303 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 10:01:27,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 10:01:27,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 10:01:27,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 10:01:27,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 10:01:27,314 INFO L87 Difference]: Start difference. First operand 149043 states. Second operand 4 states. [2018-12-01 10:01:28,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 10:01:28,666 INFO L93 Difference]: Finished difference Result 257063 states and 1188602 transitions. [2018-12-01 10:01:28,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 10:01:28,668 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2018-12-01 10:01:28,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 10:01:31,200 INFO L225 Difference]: With dead ends: 257063 [2018-12-01 10:01:31,200 INFO L226 Difference]: Without dead ends: 174813 [2018-12-01 10:01:31,201 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-01 10:01:32,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174813 states. [2018-12-01 10:01:33,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174813 to 110553. [2018-12-01 10:01:33,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110553 states. [2018-12-01 10:01:34,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110553 states to 110553 states and 511484 transitions. [2018-12-01 10:01:34,301 INFO L78 Accepts]: Start accepts. Automaton has 110553 states and 511484 transitions. Word has length 44 [2018-12-01 10:01:34,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 10:01:34,302 INFO L480 AbstractCegarLoop]: Abstraction has 110553 states and 511484 transitions. [2018-12-01 10:01:34,303 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 10:01:34,303 INFO L276 IsEmpty]: Start isEmpty. Operand 110553 states and 511484 transitions. [2018-12-01 10:01:34,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-01 10:01:34,312 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 10:01:34,312 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 10:01:34,312 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 10:01:34,313 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 10:01:34,313 INFO L82 PathProgramCache]: Analyzing trace with hash 835996618, now seen corresponding path program 1 times [2018-12-01 10:01:34,313 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 10:01:34,313 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 10:01:34,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 10:01:34,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 10:01:34,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 10:01:34,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 10:01:34,360 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-01 10:01:34,361 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 10:01:34,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 10:01:34,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 10:01:34,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 10:01:34,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-01 10:01:34,362 INFO L87 Difference]: Start difference. First operand 110553 states and 511484 transitions. Second operand 5 states. [2018-12-01 10:01:35,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 10:01:35,587 INFO L93 Difference]: Finished difference Result 240603 states and 1068739 transitions. [2018-12-01 10:01:35,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-01 10:01:35,588 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2018-12-01 10:01:35,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 10:01:36,274 INFO L225 Difference]: With dead ends: 240603 [2018-12-01 10:01:36,274 INFO L226 Difference]: Without dead ends: 237053 [2018-12-01 10:01:36,274 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-01 10:01:39,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237053 states. [2018-12-01 10:01:41,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237053 to 160433. [2018-12-01 10:01:41,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160433 states. [2018-12-01 10:01:42,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160433 states to 160433 states and 716928 transitions. [2018-12-01 10:01:42,217 INFO L78 Accepts]: Start accepts. Automaton has 160433 states and 716928 transitions. Word has length 52 [2018-12-01 10:01:42,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 10:01:42,218 INFO L480 AbstractCegarLoop]: Abstraction has 160433 states and 716928 transitions. [2018-12-01 10:01:42,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 10:01:42,218 INFO L276 IsEmpty]: Start isEmpty. Operand 160433 states and 716928 transitions. [2018-12-01 10:01:42,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-01 10:01:42,226 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 10:01:42,226 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-01 10:01:42,227 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 10:01:42,227 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 10:01:42,227 INFO L82 PathProgramCache]: Analyzing trace with hash -1522037347, now seen corresponding path program 1 times [2018-12-01 10:01:42,227 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 10:01:42,227 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 10:01:42,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 10:01:42,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 10:01:42,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 10:01:42,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 10:01:42,278 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-01 10:01:42,278 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 10:01:42,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 10:01:42,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 10:01:42,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 10:01:42,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-01 10:01:42,279 INFO L87 Difference]: Start difference. First operand 160433 states and 716928 transitions. Second operand 5 states. [2018-12-01 10:01:43,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 10:01:43,854 INFO L93 Difference]: Finished difference Result 317173 states and 1405285 transitions. [2018-12-01 10:01:43,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-01 10:01:43,855 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2018-12-01 10:01:43,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 10:01:44,732 INFO L225 Difference]: With dead ends: 317173 [2018-12-01 10:01:44,732 INFO L226 Difference]: Without dead ends: 314273 [2018-12-01 10:01:44,732 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-01 10:01:46,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314273 states. [2018-12-01 10:01:49,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314273 to 178273. [2018-12-01 10:01:49,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178273 states. [2018-12-01 10:01:49,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178273 states to 178273 states and 791490 transitions. [2018-12-01 10:01:49,944 INFO L78 Accepts]: Start accepts. Automaton has 178273 states and 791490 transitions. Word has length 53 [2018-12-01 10:01:49,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 10:01:49,944 INFO L480 AbstractCegarLoop]: Abstraction has 178273 states and 791490 transitions. [2018-12-01 10:01:49,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 10:01:49,944 INFO L276 IsEmpty]: Start isEmpty. Operand 178273 states and 791490 transitions. [2018-12-01 10:01:49,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-01 10:01:49,957 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 10:01:49,957 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] [2018-12-01 10:01:49,957 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 10:01:49,957 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 10:01:49,957 INFO L82 PathProgramCache]: Analyzing trace with hash -1506436157, now seen corresponding path program 1 times [2018-12-01 10:01:49,957 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 10:01:49,957 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 10:01:49,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 10:01:49,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 10:01:49,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 10:01:49,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 10:01:49,984 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-01 10:01:49,984 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 10:01:49,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 10:01:49,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 10:01:49,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 10:01:49,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 10:01:49,985 INFO L87 Difference]: Start difference. First operand 178273 states and 791490 transitions. Second operand 3 states. [2018-12-01 10:01:53,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 10:01:53,299 INFO L93 Difference]: Finished difference Result 231653 states and 1011274 transitions. [2018-12-01 10:01:53,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 10:01:53,300 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2018-12-01 10:01:53,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 10:01:53,916 INFO L225 Difference]: With dead ends: 231653 [2018-12-01 10:01:53,916 INFO L226 Difference]: Without dead ends: 231653 [2018-12-01 10:01:53,917 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-01 10:01:54,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231653 states. [2018-12-01 10:01:57,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231653 to 202938. [2018-12-01 10:01:57,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202938 states. [2018-12-01 10:01:58,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202938 states to 202938 states and 893562 transitions. [2018-12-01 10:01:58,216 INFO L78 Accepts]: Start accepts. Automaton has 202938 states and 893562 transitions. Word has length 55 [2018-12-01 10:01:58,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 10:01:58,216 INFO L480 AbstractCegarLoop]: Abstraction has 202938 states and 893562 transitions. [2018-12-01 10:01:58,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 10:01:58,216 INFO L276 IsEmpty]: Start isEmpty. Operand 202938 states and 893562 transitions. [2018-12-01 10:01:58,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-01 10:01:58,248 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 10:01:58,248 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] [2018-12-01 10:01:58,248 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 10:01:58,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 10:01:58,248 INFO L82 PathProgramCache]: Analyzing trace with hash 420735980, now seen corresponding path program 1 times [2018-12-01 10:01:58,249 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 10:01:58,249 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 10:01:58,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 10:01:58,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 10:01:58,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 10:01:58,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 10:01:58,300 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-01 10:01:58,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 10:01:58,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-01 10:01:58,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 10:01:58,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 10:01:58,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-01 10:01:58,301 INFO L87 Difference]: Start difference. First operand 202938 states and 893562 transitions. Second operand 6 states. [2018-12-01 10:02:00,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 10:02:00,431 INFO L93 Difference]: Finished difference Result 356173 states and 1552270 transitions. [2018-12-01 10:02:00,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-01 10:02:00,431 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2018-12-01 10:02:00,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 10:02:01,335 INFO L225 Difference]: With dead ends: 356173 [2018-12-01 10:02:01,335 INFO L226 Difference]: Without dead ends: 352823 [2018-12-01 10:02:01,335 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-12-01 10:02:05,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352823 states. [2018-12-01 10:02:08,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352823 to 205743. [2018-12-01 10:02:08,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205743 states. [2018-12-01 10:02:09,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205743 states to 205743 states and 906781 transitions. [2018-12-01 10:02:09,456 INFO L78 Accepts]: Start accepts. Automaton has 205743 states and 906781 transitions. Word has length 59 [2018-12-01 10:02:09,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 10:02:09,457 INFO L480 AbstractCegarLoop]: Abstraction has 205743 states and 906781 transitions. [2018-12-01 10:02:09,457 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 10:02:09,457 INFO L276 IsEmpty]: Start isEmpty. Operand 205743 states and 906781 transitions. [2018-12-01 10:02:09,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-01 10:02:09,487 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 10:02:09,488 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] [2018-12-01 10:02:09,488 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 10:02:09,488 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 10:02:09,488 INFO L82 PathProgramCache]: Analyzing trace with hash -1962133569, now seen corresponding path program 1 times [2018-12-01 10:02:09,488 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 10:02:09,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 10:02:09,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 10:02:09,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 10:02:09,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 10:02:09,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 10:02:09,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-01 10:02:09,567 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 10:02:09,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-01 10:02:09,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 10:02:09,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 10:02:09,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-01 10:02:09,567 INFO L87 Difference]: Start difference. First operand 205743 states and 906781 transitions. Second operand 6 states. [2018-12-01 10:02:11,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 10:02:11,370 INFO L93 Difference]: Finished difference Result 284248 states and 1239485 transitions. [2018-12-01 10:02:11,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-01 10:02:11,370 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2018-12-01 10:02:11,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 10:02:12,104 INFO L225 Difference]: With dead ends: 284248 [2018-12-01 10:02:12,104 INFO L226 Difference]: Without dead ends: 278553 [2018-12-01 10:02:12,104 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-01 10:02:13,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278553 states. [2018-12-01 10:02:19,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278553 to 261028. [2018-12-01 10:02:19,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261028 states. [2018-12-01 10:02:20,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261028 states to 261028 states and 1142704 transitions. [2018-12-01 10:02:20,556 INFO L78 Accepts]: Start accepts. Automaton has 261028 states and 1142704 transitions. Word has length 59 [2018-12-01 10:02:20,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 10:02:20,556 INFO L480 AbstractCegarLoop]: Abstraction has 261028 states and 1142704 transitions. [2018-12-01 10:02:20,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 10:02:20,556 INFO L276 IsEmpty]: Start isEmpty. Operand 261028 states and 1142704 transitions. [2018-12-01 10:02:20,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-01 10:02:20,596 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 10:02:20,596 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] [2018-12-01 10:02:20,597 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 10:02:20,597 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 10:02:20,597 INFO L82 PathProgramCache]: Analyzing trace with hash 535882368, now seen corresponding path program 1 times [2018-12-01 10:02:20,597 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 10:02:20,597 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 10:02:20,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 10:02:20,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 10:02:20,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 10:02:20,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 10:02:20,656 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-01 10:02:20,656 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 10:02:20,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-01 10:02:20,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-01 10:02:20,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-01 10:02:20,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-01 10:02:20,656 INFO L87 Difference]: Start difference. First operand 261028 states and 1142704 transitions. Second operand 7 states. [2018-12-01 10:02:23,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 10:02:23,130 INFO L93 Difference]: Finished difference Result 379443 states and 1607921 transitions. [2018-12-01 10:02:23,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-01 10:02:23,130 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 59 [2018-12-01 10:02:23,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 10:02:24,088 INFO L225 Difference]: With dead ends: 379443 [2018-12-01 10:02:24,088 INFO L226 Difference]: Without dead ends: 379443 [2018-12-01 10:02:24,089 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-12-01 10:02:25,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379443 states. [2018-12-01 10:02:33,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379443 to 308618. [2018-12-01 10:02:33,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308618 states. [2018-12-01 10:02:34,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308618 states to 308618 states and 1326661 transitions. [2018-12-01 10:02:34,312 INFO L78 Accepts]: Start accepts. Automaton has 308618 states and 1326661 transitions. Word has length 59 [2018-12-01 10:02:34,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 10:02:34,312 INFO L480 AbstractCegarLoop]: Abstraction has 308618 states and 1326661 transitions. [2018-12-01 10:02:34,313 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-01 10:02:34,313 INFO L276 IsEmpty]: Start isEmpty. Operand 308618 states and 1326661 transitions. [2018-12-01 10:02:34,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-01 10:02:34,352 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 10:02:34,352 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] [2018-12-01 10:02:34,352 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 10:02:34,352 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 10:02:34,352 INFO L82 PathProgramCache]: Analyzing trace with hash 1423386049, now seen corresponding path program 1 times [2018-12-01 10:02:34,353 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 10:02:34,353 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 10:02:34,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 10:02:34,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 10:02:34,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 10:02:34,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 10:02:34,396 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-01 10:02:34,396 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 10:02:34,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 10:02:34,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 10:02:34,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 10:02:34,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 10:02:34,397 INFO L87 Difference]: Start difference. First operand 308618 states and 1326661 transitions. Second operand 4 states. [2018-12-01 10:02:35,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 10:02:35,613 INFO L93 Difference]: Finished difference Result 267151 states and 1127019 transitions. [2018-12-01 10:02:35,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-01 10:02:35,613 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2018-12-01 10:02:35,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 10:02:36,891 INFO L225 Difference]: With dead ends: 267151 [2018-12-01 10:02:36,891 INFO L226 Difference]: Without dead ends: 259066 [2018-12-01 10:02:36,892 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-01 10:02:37,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259066 states. [2018-12-01 10:02:41,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259066 to 259066. [2018-12-01 10:02:41,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259066 states. [2018-12-01 10:02:41,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259066 states to 259066 states and 1099297 transitions. [2018-12-01 10:02:41,877 INFO L78 Accepts]: Start accepts. Automaton has 259066 states and 1099297 transitions. Word has length 59 [2018-12-01 10:02:41,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 10:02:41,877 INFO L480 AbstractCegarLoop]: Abstraction has 259066 states and 1099297 transitions. [2018-12-01 10:02:41,877 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 10:02:41,877 INFO L276 IsEmpty]: Start isEmpty. Operand 259066 states and 1099297 transitions. [2018-12-01 10:02:41,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-01 10:02:41,911 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 10:02:41,911 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 10:02:41,911 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 10:02:41,911 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 10:02:41,912 INFO L82 PathProgramCache]: Analyzing trace with hash 954174819, now seen corresponding path program 1 times [2018-12-01 10:02:41,912 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 10:02:41,912 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 10:02:41,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 10:02:41,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 10:02:41,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 10:02:41,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 10:02:41,951 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-01 10:02:41,951 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 10:02:41,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 10:02:41,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 10:02:41,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 10:02:41,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-01 10:02:41,952 INFO L87 Difference]: Start difference. First operand 259066 states and 1099297 transitions. Second operand 5 states. [2018-12-01 10:02:42,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 10:02:42,167 INFO L93 Difference]: Finished difference Result 57898 states and 224521 transitions. [2018-12-01 10:02:42,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-01 10:02:42,167 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 60 [2018-12-01 10:02:42,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 10:02:42,266 INFO L225 Difference]: With dead ends: 57898 [2018-12-01 10:02:42,266 INFO L226 Difference]: Without dead ends: 50982 [2018-12-01 10:02:42,266 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-01 10:02:42,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50982 states. [2018-12-01 10:02:44,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50982 to 50742. [2018-12-01 10:02:44,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50742 states. [2018-12-01 10:02:45,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50742 states to 50742 states and 196308 transitions. [2018-12-01 10:02:45,105 INFO L78 Accepts]: Start accepts. Automaton has 50742 states and 196308 transitions. Word has length 60 [2018-12-01 10:02:45,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 10:02:45,106 INFO L480 AbstractCegarLoop]: Abstraction has 50742 states and 196308 transitions. [2018-12-01 10:02:45,106 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 10:02:45,106 INFO L276 IsEmpty]: Start isEmpty. Operand 50742 states and 196308 transitions. [2018-12-01 10:02:45,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-01 10:02:45,121 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 10:02:45,121 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-01 10:02:45,121 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 10:02:45,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 10:02:45,121 INFO L82 PathProgramCache]: Analyzing trace with hash 767048363, now seen corresponding path program 1 times [2018-12-01 10:02:45,121 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 10:02:45,122 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 10:02:45,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 10:02:45,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 10:02:45,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 10:02:45,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 10:02:45,172 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-01 10:02:45,172 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 10:02:45,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 10:02:45,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 10:02:45,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 10:02:45,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 10:02:45,173 INFO L87 Difference]: Start difference. First operand 50742 states and 196308 transitions. Second operand 4 states. [2018-12-01 10:02:45,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 10:02:45,448 INFO L93 Difference]: Finished difference Result 59861 states and 230927 transitions. [2018-12-01 10:02:45,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-01 10:02:45,448 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 70 [2018-12-01 10:02:45,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 10:02:45,565 INFO L225 Difference]: With dead ends: 59861 [2018-12-01 10:02:45,565 INFO L226 Difference]: Without dead ends: 59861 [2018-12-01 10:02:45,565 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-01 10:02:45,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59861 states. [2018-12-01 10:02:46,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59861 to 53957. [2018-12-01 10:02:46,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53957 states. [2018-12-01 10:02:46,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53957 states to 53957 states and 208375 transitions. [2018-12-01 10:02:46,380 INFO L78 Accepts]: Start accepts. Automaton has 53957 states and 208375 transitions. Word has length 70 [2018-12-01 10:02:46,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 10:02:46,380 INFO L480 AbstractCegarLoop]: Abstraction has 53957 states and 208375 transitions. [2018-12-01 10:02:46,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 10:02:46,380 INFO L276 IsEmpty]: Start isEmpty. Operand 53957 states and 208375 transitions. [2018-12-01 10:02:46,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-01 10:02:46,397 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 10:02:46,397 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-01 10:02:46,397 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 10:02:46,397 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 10:02:46,397 INFO L82 PathProgramCache]: Analyzing trace with hash -1785108598, now seen corresponding path program 1 times [2018-12-01 10:02:46,397 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 10:02:46,397 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 10:02:46,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 10:02:46,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 10:02:46,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 10:02:46,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 10:02:46,437 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-01 10:02:46,437 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 10:02:46,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-01 10:02:46,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 10:02:46,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 10:02:46,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-01 10:02:46,438 INFO L87 Difference]: Start difference. First operand 53957 states and 208375 transitions. Second operand 6 states. [2018-12-01 10:02:46,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 10:02:46,529 INFO L93 Difference]: Finished difference Result 14405 states and 48007 transitions. [2018-12-01 10:02:46,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-01 10:02:46,529 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2018-12-01 10:02:46,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 10:02:46,544 INFO L225 Difference]: With dead ends: 14405 [2018-12-01 10:02:46,544 INFO L226 Difference]: Without dead ends: 12149 [2018-12-01 10:02:46,544 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-01 10:02:46,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12149 states. [2018-12-01 10:02:46,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12149 to 11559. [2018-12-01 10:02:46,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11559 states. [2018-12-01 10:02:46,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11559 states to 11559 states and 37959 transitions. [2018-12-01 10:02:46,802 INFO L78 Accepts]: Start accepts. Automaton has 11559 states and 37959 transitions. Word has length 70 [2018-12-01 10:02:46,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 10:02:46,803 INFO L480 AbstractCegarLoop]: Abstraction has 11559 states and 37959 transitions. [2018-12-01 10:02:46,803 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 10:02:46,803 INFO L276 IsEmpty]: Start isEmpty. Operand 11559 states and 37959 transitions. [2018-12-01 10:02:46,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-01 10:02:46,813 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 10:02:46,813 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] [2018-12-01 10:02:46,813 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 10:02:46,813 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 10:02:46,814 INFO L82 PathProgramCache]: Analyzing trace with hash 2073877656, now seen corresponding path program 1 times [2018-12-01 10:02:46,814 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 10:02:46,814 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 10:02:46,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 10:02:46,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 10:02:46,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 10:02:46,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 10:02:46,856 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-01 10:02:46,856 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 10:02:46,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 10:02:46,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 10:02:46,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 10:02:46,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 10:02:46,857 INFO L87 Difference]: Start difference. First operand 11559 states and 37959 transitions. Second operand 4 states. [2018-12-01 10:02:46,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 10:02:46,983 INFO L93 Difference]: Finished difference Result 16004 states and 51605 transitions. [2018-12-01 10:02:46,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 10:02:46,983 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2018-12-01 10:02:46,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 10:02:47,001 INFO L225 Difference]: With dead ends: 16004 [2018-12-01 10:02:47,001 INFO L226 Difference]: Without dead ends: 16004 [2018-12-01 10:02:47,001 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-01 10:02:47,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16004 states. [2018-12-01 10:02:47,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16004 to 14021. [2018-12-01 10:02:47,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14021 states. [2018-12-01 10:02:47,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14021 states to 14021 states and 45458 transitions. [2018-12-01 10:02:47,156 INFO L78 Accepts]: Start accepts. Automaton has 14021 states and 45458 transitions. Word has length 89 [2018-12-01 10:02:47,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 10:02:47,156 INFO L480 AbstractCegarLoop]: Abstraction has 14021 states and 45458 transitions. [2018-12-01 10:02:47,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 10:02:47,156 INFO L276 IsEmpty]: Start isEmpty. Operand 14021 states and 45458 transitions. [2018-12-01 10:02:47,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-01 10:02:47,169 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 10:02:47,169 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] [2018-12-01 10:02:47,169 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 10:02:47,169 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 10:02:47,169 INFO L82 PathProgramCache]: Analyzing trace with hash -3331687, now seen corresponding path program 1 times [2018-12-01 10:02:47,169 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 10:02:47,169 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 10:02:47,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 10:02:47,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 10:02:47,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 10:02:47,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 10:02:47,229 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-01 10:02:47,229 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 10:02:47,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-01 10:02:47,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 10:02:47,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 10:02:47,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-01 10:02:47,230 INFO L87 Difference]: Start difference. First operand 14021 states and 45458 transitions. Second operand 6 states. [2018-12-01 10:02:47,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 10:02:47,438 INFO L93 Difference]: Finished difference Result 20726 states and 66747 transitions. [2018-12-01 10:02:47,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-01 10:02:47,439 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 89 [2018-12-01 10:02:47,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 10:02:47,461 INFO L225 Difference]: With dead ends: 20726 [2018-12-01 10:02:47,461 INFO L226 Difference]: Without dead ends: 20598 [2018-12-01 10:02:47,461 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-01 10:02:47,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20598 states. [2018-12-01 10:02:47,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20598 to 17591. [2018-12-01 10:02:47,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17591 states. [2018-12-01 10:02:47,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17591 states to 17591 states and 56905 transitions. [2018-12-01 10:02:47,651 INFO L78 Accepts]: Start accepts. Automaton has 17591 states and 56905 transitions. Word has length 89 [2018-12-01 10:02:47,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 10:02:47,652 INFO L480 AbstractCegarLoop]: Abstraction has 17591 states and 56905 transitions. [2018-12-01 10:02:47,652 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 10:02:47,652 INFO L276 IsEmpty]: Start isEmpty. Operand 17591 states and 56905 transitions. [2018-12-01 10:02:47,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-01 10:02:47,667 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 10:02:47,667 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] [2018-12-01 10:02:47,667 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 10:02:47,667 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 10:02:47,667 INFO L82 PathProgramCache]: Analyzing trace with hash -1800283046, now seen corresponding path program 1 times [2018-12-01 10:02:47,668 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 10:02:47,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 10:02:47,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 10:02:47,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 10:02:47,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 10:02:47,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 10:02:47,727 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-01 10:02:47,727 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 10:02:47,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-01 10:02:47,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-01 10:02:47,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-01 10:02:47,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-01 10:02:47,728 INFO L87 Difference]: Start difference. First operand 17591 states and 56905 transitions. Second operand 7 states. [2018-12-01 10:02:48,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 10:02:48,050 INFO L93 Difference]: Finished difference Result 33210 states and 107799 transitions. [2018-12-01 10:02:48,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-01 10:02:48,050 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 89 [2018-12-01 10:02:48,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 10:02:48,089 INFO L225 Difference]: With dead ends: 33210 [2018-12-01 10:02:48,089 INFO L226 Difference]: Without dead ends: 33210 [2018-12-01 10:02:48,089 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2018-12-01 10:02:48,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33210 states. [2018-12-01 10:02:48,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33210 to 21509. [2018-12-01 10:02:48,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21509 states. [2018-12-01 10:02:48,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21509 states to 21509 states and 70038 transitions. [2018-12-01 10:02:48,383 INFO L78 Accepts]: Start accepts. Automaton has 21509 states and 70038 transitions. Word has length 89 [2018-12-01 10:02:48,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 10:02:48,383 INFO L480 AbstractCegarLoop]: Abstraction has 21509 states and 70038 transitions. [2018-12-01 10:02:48,383 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-01 10:02:48,384 INFO L276 IsEmpty]: Start isEmpty. Operand 21509 states and 70038 transitions. [2018-12-01 10:02:48,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-01 10:02:48,403 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 10:02:48,403 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] [2018-12-01 10:02:48,403 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 10:02:48,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 10:02:48,403 INFO L82 PathProgramCache]: Analyzing trace with hash -912779365, now seen corresponding path program 1 times [2018-12-01 10:02:48,403 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 10:02:48,403 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 10:02:48,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 10:02:48,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 10:02:48,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 10:02:48,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 10:02:48,491 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-01 10:02:48,492 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 10:02:48,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-01 10:02:48,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 10:02:48,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 10:02:48,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-01 10:02:48,492 INFO L87 Difference]: Start difference. First operand 21509 states and 70038 transitions. Second operand 6 states. [2018-12-01 10:02:48,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 10:02:48,741 INFO L93 Difference]: Finished difference Result 23052 states and 74235 transitions. [2018-12-01 10:02:48,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-01 10:02:48,741 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 89 [2018-12-01 10:02:48,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 10:02:48,768 INFO L225 Difference]: With dead ends: 23052 [2018-12-01 10:02:48,768 INFO L226 Difference]: Without dead ends: 23052 [2018-12-01 10:02:48,768 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-01 10:02:48,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23052 states. [2018-12-01 10:02:49,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23052 to 18870. [2018-12-01 10:02:49,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18870 states. [2018-12-01 10:02:49,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18870 states to 18870 states and 60530 transitions. [2018-12-01 10:02:49,065 INFO L78 Accepts]: Start accepts. Automaton has 18870 states and 60530 transitions. Word has length 89 [2018-12-01 10:02:49,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 10:02:49,065 INFO L480 AbstractCegarLoop]: Abstraction has 18870 states and 60530 transitions. [2018-12-01 10:02:49,065 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 10:02:49,066 INFO L276 IsEmpty]: Start isEmpty. Operand 18870 states and 60530 transitions. [2018-12-01 10:02:49,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-01 10:02:49,081 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 10:02:49,082 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] [2018-12-01 10:02:49,082 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 10:02:49,082 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 10:02:49,082 INFO L82 PathProgramCache]: Analyzing trace with hash -2107753085, now seen corresponding path program 1 times [2018-12-01 10:02:49,082 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 10:02:49,082 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 10:02:49,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 10:02:49,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 10:02:49,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 10:02:49,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 10:02:49,135 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-01 10:02:49,135 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 10:02:49,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-01 10:02:49,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 10:02:49,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 10:02:49,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-01 10:02:49,136 INFO L87 Difference]: Start difference. First operand 18870 states and 60530 transitions. Second operand 6 states. [2018-12-01 10:02:49,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 10:02:49,469 INFO L93 Difference]: Finished difference Result 22355 states and 70798 transitions. [2018-12-01 10:02:49,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-01 10:02:49,469 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 89 [2018-12-01 10:02:49,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 10:02:49,492 INFO L225 Difference]: With dead ends: 22355 [2018-12-01 10:02:49,492 INFO L226 Difference]: Without dead ends: 21835 [2018-12-01 10:02:49,493 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-01 10:02:49,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21835 states. [2018-12-01 10:02:49,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21835 to 20560. [2018-12-01 10:02:49,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20560 states. [2018-12-01 10:02:49,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20560 states to 20560 states and 65697 transitions. [2018-12-01 10:02:49,689 INFO L78 Accepts]: Start accepts. Automaton has 20560 states and 65697 transitions. Word has length 89 [2018-12-01 10:02:49,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 10:02:49,690 INFO L480 AbstractCegarLoop]: Abstraction has 20560 states and 65697 transitions. [2018-12-01 10:02:49,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 10:02:49,690 INFO L276 IsEmpty]: Start isEmpty. Operand 20560 states and 65697 transitions. [2018-12-01 10:02:49,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-01 10:02:49,706 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 10:02:49,706 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] [2018-12-01 10:02:49,706 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 10:02:49,706 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 10:02:49,707 INFO L82 PathProgramCache]: Analyzing trace with hash -1863180538, now seen corresponding path program 2 times [2018-12-01 10:02:49,707 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 10:02:49,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 10:02:49,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 10:02:49,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 10:02:49,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 10:02:49,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 10:02:49,764 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-01 10:02:49,764 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 10:02:49,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-01 10:02:49,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-01 10:02:49,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-01 10:02:49,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-01 10:02:49,765 INFO L87 Difference]: Start difference. First operand 20560 states and 65697 transitions. Second operand 7 states. [2018-12-01 10:02:50,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 10:02:50,127 INFO L93 Difference]: Finished difference Result 23293 states and 74354 transitions. [2018-12-01 10:02:50,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-01 10:02:50,128 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 89 [2018-12-01 10:02:50,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 10:02:50,154 INFO L225 Difference]: With dead ends: 23293 [2018-12-01 10:02:50,154 INFO L226 Difference]: Without dead ends: 23293 [2018-12-01 10:02:50,155 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-01 10:02:50,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23293 states. [2018-12-01 10:02:50,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23293 to 20700. [2018-12-01 10:02:50,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20700 states. [2018-12-01 10:02:50,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20700 states to 20700 states and 66309 transitions. [2018-12-01 10:02:50,371 INFO L78 Accepts]: Start accepts. Automaton has 20700 states and 66309 transitions. Word has length 89 [2018-12-01 10:02:50,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 10:02:50,372 INFO L480 AbstractCegarLoop]: Abstraction has 20700 states and 66309 transitions. [2018-12-01 10:02:50,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-01 10:02:50,372 INFO L276 IsEmpty]: Start isEmpty. Operand 20700 states and 66309 transitions. [2018-12-01 10:02:50,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-01 10:02:50,389 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 10:02:50,389 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] [2018-12-01 10:02:50,389 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 10:02:50,389 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 10:02:50,389 INFO L82 PathProgramCache]: Analyzing trace with hash 177110370, now seen corresponding path program 1 times [2018-12-01 10:02:50,389 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 10:02:50,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 10:02:50,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 10:02:50,390 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 10:02:50,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 10:02:50,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 10:02:50,455 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-01 10:02:50,455 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 10:02:50,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-01 10:02:50,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 10:02:50,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 10:02:50,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-01 10:02:50,456 INFO L87 Difference]: Start difference. First operand 20700 states and 66309 transitions. Second operand 6 states. [2018-12-01 10:02:50,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 10:02:50,645 INFO L93 Difference]: Finished difference Result 22720 states and 71285 transitions. [2018-12-01 10:02:50,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-01 10:02:50,645 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 89 [2018-12-01 10:02:50,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 10:02:50,668 INFO L225 Difference]: With dead ends: 22720 [2018-12-01 10:02:50,668 INFO L226 Difference]: Without dead ends: 22720 [2018-12-01 10:02:50,669 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-01 10:02:50,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22720 states. [2018-12-01 10:02:50,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22720 to 21145. [2018-12-01 10:02:50,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21145 states. [2018-12-01 10:02:50,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21145 states to 21145 states and 66645 transitions. [2018-12-01 10:02:50,883 INFO L78 Accepts]: Start accepts. Automaton has 21145 states and 66645 transitions. Word has length 89 [2018-12-01 10:02:50,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 10:02:50,883 INFO L480 AbstractCegarLoop]: Abstraction has 21145 states and 66645 transitions. [2018-12-01 10:02:50,883 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 10:02:50,883 INFO L276 IsEmpty]: Start isEmpty. Operand 21145 states and 66645 transitions. [2018-12-01 10:02:50,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-01 10:02:50,900 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 10:02:50,900 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] [2018-12-01 10:02:50,900 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 10:02:50,901 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 10:02:50,901 INFO L82 PathProgramCache]: Analyzing trace with hash -77626175, now seen corresponding path program 1 times [2018-12-01 10:02:50,901 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 10:02:50,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 10:02:50,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 10:02:50,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 10:02:50,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 10:02:50,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 10:02:50,960 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-01 10:02:50,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 10:02:50,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-01 10:02:50,961 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 10:02:50,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 10:02:50,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-01 10:02:50,961 INFO L87 Difference]: Start difference. First operand 21145 states and 66645 transitions. Second operand 6 states. [2018-12-01 10:02:51,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 10:02:51,042 INFO L93 Difference]: Finished difference Result 19673 states and 60837 transitions. [2018-12-01 10:02:51,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-01 10:02:51,042 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 89 [2018-12-01 10:02:51,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 10:02:51,062 INFO L225 Difference]: With dead ends: 19673 [2018-12-01 10:02:51,062 INFO L226 Difference]: Without dead ends: 19673 [2018-12-01 10:02:51,062 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-01 10:02:51,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19673 states. [2018-12-01 10:02:51,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19673 to 12309. [2018-12-01 10:02:51,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12309 states. [2018-12-01 10:02:51,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12309 states to 12309 states and 38077 transitions. [2018-12-01 10:02:51,218 INFO L78 Accepts]: Start accepts. Automaton has 12309 states and 38077 transitions. Word has length 89 [2018-12-01 10:02:51,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 10:02:51,218 INFO L480 AbstractCegarLoop]: Abstraction has 12309 states and 38077 transitions. [2018-12-01 10:02:51,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 10:02:51,218 INFO L276 IsEmpty]: Start isEmpty. Operand 12309 states and 38077 transitions. [2018-12-01 10:02:51,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-01 10:02:51,227 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 10:02:51,227 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 10:02:51,227 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 10:02:51,227 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 10:02:51,227 INFO L82 PathProgramCache]: Analyzing trace with hash -1733272404, now seen corresponding path program 1 times [2018-12-01 10:02:51,227 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 10:02:51,228 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 10:02:51,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 10:02:51,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 10:02:51,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 10:02:51,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 10:02:51,377 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-01 10:02:51,377 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 10:02:51,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-01 10:02:51,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 10:02:51,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 10:02:51,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-01 10:02:51,378 INFO L87 Difference]: Start difference. First operand 12309 states and 38077 transitions. Second operand 6 states. [2018-12-01 10:02:51,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 10:02:51,507 INFO L93 Difference]: Finished difference Result 14239 states and 43686 transitions. [2018-12-01 10:02:51,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-01 10:02:51,508 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2018-12-01 10:02:51,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 10:02:51,522 INFO L225 Difference]: With dead ends: 14239 [2018-12-01 10:02:51,522 INFO L226 Difference]: Without dead ends: 13949 [2018-12-01 10:02:51,523 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-01 10:02:51,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13949 states. [2018-12-01 10:02:51,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13949 to 10824. [2018-12-01 10:02:51,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10824 states. [2018-12-01 10:02:51,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10824 states to 10824 states and 33204 transitions. [2018-12-01 10:02:51,645 INFO L78 Accepts]: Start accepts. Automaton has 10824 states and 33204 transitions. Word has length 91 [2018-12-01 10:02:51,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 10:02:51,646 INFO L480 AbstractCegarLoop]: Abstraction has 10824 states and 33204 transitions. [2018-12-01 10:02:51,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 10:02:51,646 INFO L276 IsEmpty]: Start isEmpty. Operand 10824 states and 33204 transitions. [2018-12-01 10:02:51,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-01 10:02:51,655 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 10:02:51,655 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 10:02:51,656 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 10:02:51,656 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 10:02:51,656 INFO L82 PathProgramCache]: Analyzing trace with hash 484485549, now seen corresponding path program 1 times [2018-12-01 10:02:51,656 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 10:02:51,656 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 10:02:51,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 10:02:51,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 10:02:51,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 10:02:51,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 10:02:51,730 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-01 10:02:51,730 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 10:02:51,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-01 10:02:51,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-01 10:02:51,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-01 10:02:51,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-01 10:02:51,731 INFO L87 Difference]: Start difference. First operand 10824 states and 33204 transitions. Second operand 7 states. [2018-12-01 10:02:51,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 10:02:51,888 INFO L93 Difference]: Finished difference Result 12851 states and 39348 transitions. [2018-12-01 10:02:51,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-01 10:02:51,888 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 91 [2018-12-01 10:02:51,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 10:02:51,902 INFO L225 Difference]: With dead ends: 12851 [2018-12-01 10:02:51,902 INFO L226 Difference]: Without dead ends: 12851 [2018-12-01 10:02:51,902 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2018-12-01 10:02:51,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12851 states. [2018-12-01 10:02:52,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12851 to 12787. [2018-12-01 10:02:52,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12787 states. [2018-12-01 10:02:52,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12787 states to 12787 states and 39140 transitions. [2018-12-01 10:02:52,032 INFO L78 Accepts]: Start accepts. Automaton has 12787 states and 39140 transitions. Word has length 91 [2018-12-01 10:02:52,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 10:02:52,033 INFO L480 AbstractCegarLoop]: Abstraction has 12787 states and 39140 transitions. [2018-12-01 10:02:52,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-01 10:02:52,033 INFO L276 IsEmpty]: Start isEmpty. Operand 12787 states and 39140 transitions. [2018-12-01 10:02:52,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-01 10:02:52,044 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 10:02:52,044 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 10:02:52,044 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 10:02:52,044 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 10:02:52,044 INFO L82 PathProgramCache]: Analyzing trace with hash 1371989230, now seen corresponding path program 1 times [2018-12-01 10:02:52,044 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 10:02:52,044 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 10:02:52,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 10:02:52,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 10:02:52,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 10:02:52,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 10:02:52,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 10:02:52,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 10:02:52,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-01 10:02:52,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-01 10:02:52,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-01 10:02:52,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-01 10:02:52,150 INFO L87 Difference]: Start difference. First operand 12787 states and 39140 transitions. Second operand 10 states. [2018-12-01 10:02:52,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 10:02:52,642 INFO L93 Difference]: Finished difference Result 22935 states and 70123 transitions. [2018-12-01 10:02:52,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-01 10:02:52,642 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 91 [2018-12-01 10:02:52,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 10:02:52,657 INFO L225 Difference]: With dead ends: 22935 [2018-12-01 10:02:52,658 INFO L226 Difference]: Without dead ends: 11023 [2018-12-01 10:02:52,658 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2018-12-01 10:02:52,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11023 states. [2018-12-01 10:02:52,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11023 to 11023. [2018-12-01 10:02:52,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11023 states. [2018-12-01 10:02:52,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11023 states to 11023 states and 33488 transitions. [2018-12-01 10:02:52,783 INFO L78 Accepts]: Start accepts. Automaton has 11023 states and 33488 transitions. Word has length 91 [2018-12-01 10:02:52,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 10:02:52,784 INFO L480 AbstractCegarLoop]: Abstraction has 11023 states and 33488 transitions. [2018-12-01 10:02:52,784 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-01 10:02:52,784 INFO L276 IsEmpty]: Start isEmpty. Operand 11023 states and 33488 transitions. [2018-12-01 10:02:52,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-01 10:02:52,793 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 10:02:52,793 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 10:02:52,793 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 10:02:52,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 10:02:52,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1481350526, now seen corresponding path program 2 times [2018-12-01 10:02:52,793 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 10:02:52,793 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 10:02:52,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 10:02:52,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 10:02:52,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 10:02:52,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 10:02:52,843 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-01 10:02:52,843 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 10:02:52,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-01 10:02:52,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-01 10:02:52,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-01 10:02:52,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-01 10:02:52,844 INFO L87 Difference]: Start difference. First operand 11023 states and 33488 transitions. Second operand 7 states. [2018-12-01 10:02:53,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 10:02:53,105 INFO L93 Difference]: Finished difference Result 19153 states and 58386 transitions. [2018-12-01 10:02:53,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-01 10:02:53,106 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 91 [2018-12-01 10:02:53,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 10:02:53,113 INFO L225 Difference]: With dead ends: 19153 [2018-12-01 10:02:53,113 INFO L226 Difference]: Without dead ends: 7778 [2018-12-01 10:02:53,113 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-12-01 10:02:53,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7778 states. [2018-12-01 10:02:53,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7778 to 7778. [2018-12-01 10:02:53,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7778 states. [2018-12-01 10:02:53,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7778 states to 7778 states and 23721 transitions. [2018-12-01 10:02:53,183 INFO L78 Accepts]: Start accepts. Automaton has 7778 states and 23721 transitions. Word has length 91 [2018-12-01 10:02:53,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 10:02:53,183 INFO L480 AbstractCegarLoop]: Abstraction has 7778 states and 23721 transitions. [2018-12-01 10:02:53,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-01 10:02:53,183 INFO L276 IsEmpty]: Start isEmpty. Operand 7778 states and 23721 transitions. [2018-12-01 10:02:53,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-01 10:02:53,189 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 10:02:53,189 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 10:02:53,189 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 10:02:53,189 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 10:02:53,189 INFO L82 PathProgramCache]: Analyzing trace with hash 309581898, now seen corresponding path program 3 times [2018-12-01 10:02:53,190 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 10:02:53,190 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 10:02:53,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 10:02:53,190 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 10:02:53,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 10:02:53,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 10:02:53,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 10:02:53,226 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-01 10:02:53,302 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-01 10:02:53,303 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.12 10:02:53 BasicIcfg [2018-12-01 10:02:53,303 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-01 10:02:53,304 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-01 10:02:53,304 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-01 10:02:53,304 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-01 10:02:53,304 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 10:01:07" (3/4) ... [2018-12-01 10:02:53,306 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-01 10:02:53,378 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_09808314-1bc6-44dd-9c1d-0674402f8d32/bin-2019/uautomizer/witness.graphml [2018-12-01 10:02:53,378 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-01 10:02:53,378 INFO L168 Benchmark]: Toolchain (without parser) took 106226.31 ms. Allocated memory was 1.0 GB in the beginning and 8.5 GB in the end (delta: 7.4 GB). Free memory was 951.7 MB in the beginning and 5.5 GB in the end (delta: -4.6 GB). Peak memory consumption was 2.9 GB. Max. memory is 11.5 GB. [2018-12-01 10:02:53,379 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 10:02:53,379 INFO L168 Benchmark]: CACSL2BoogieTranslator took 331.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.3 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -149.5 MB). Peak memory consumption was 31.4 MB. Max. memory is 11.5 GB. [2018-12-01 10:02:53,380 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.47 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2018-12-01 10:02:53,380 INFO L168 Benchmark]: Boogie Preprocessor took 26.75 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 10:02:53,380 INFO L168 Benchmark]: RCFGBuilder took 316.64 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 48.3 MB). Peak memory consumption was 48.3 MB. Max. memory is 11.5 GB. [2018-12-01 10:02:53,380 INFO L168 Benchmark]: TraceAbstraction took 105435.21 ms. Allocated memory was 1.2 GB in the beginning and 8.5 GB in the end (delta: 7.3 GB). Free memory was 1.0 GB in the beginning and 5.5 GB in the end (delta: -4.5 GB). Peak memory consumption was 2.8 GB. Max. memory is 11.5 GB. [2018-12-01 10:02:53,380 INFO L168 Benchmark]: Witness Printer took 74.20 ms. Allocated memory is still 8.5 GB. Free memory was 5.5 GB in the beginning and 5.5 GB in the end (delta: 30.2 MB). Peak memory consumption was 30.2 MB. Max. memory is 11.5 GB. [2018-12-01 10:02:53,381 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 331.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.3 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -149.5 MB). Peak memory consumption was 31.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 39.47 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.75 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 316.64 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 48.3 MB). Peak memory consumption was 48.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 105435.21 ms. Allocated memory was 1.2 GB in the beginning and 8.5 GB in the end (delta: 7.3 GB). Free memory was 1.0 GB in the beginning and 5.5 GB in the end (delta: -4.5 GB). Peak memory consumption was 2.8 GB. Max. memory is 11.5 GB. * Witness Printer took 74.20 ms. Allocated memory is still 8.5 GB. Free memory was 5.5 GB in the beginning and 5.5 GB in the end (delta: 30.2 MB). Peak memory consumption was 30.2 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_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L676] -1 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0] [L677] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0] [L678] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L680] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L682] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L683] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L684] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L685] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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] [L686] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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] [L687] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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] [L688] -1 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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] [L689] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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] [L690] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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] [L691] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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] [L692] -1 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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] [L693] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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] [L694] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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}] [L695] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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] [L696] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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] [L697] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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] [L698] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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] [L700] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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] [L701] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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] [L702] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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] [L786] -1 pthread_t t1408; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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] [L787] FCALL, FORK -1 pthread_create(&t1408, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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] [L788] -1 pthread_t t1409; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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] [L789] FCALL, FORK -1 pthread_create(&t1409, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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] [L790] -1 pthread_t t1410; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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] [L791] FCALL, FORK -1 pthread_create(&t1410, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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] [L749] 0 y$w_buff1 = y$w_buff0 [L750] 0 y$w_buff0 = 1 [L751] 0 y$w_buff1_used = y$w_buff0_used [L752] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L754] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L755] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L756] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L757] 0 y$r_buff1_thd3 = y$r_buff0_thd3 [L758] 0 y$r_buff0_thd3 = (_Bool)1 [L761] 0 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L706] 1 z = 1 [L709] 1 x = 1 [L714] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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=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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L721] 2 x = 2 [L724] 2 weak$$choice0 = __VERIFIER_nondet_pointer() [L725] 2 weak$$choice2 = __VERIFIER_nondet_pointer() [L726] 2 y$flush_delayed = weak$$choice2 [L727] 2 y$mem_tmp = y VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L728] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L728] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L729] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=2, y=0, y$flush_delayed=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L729] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L730] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=2, y=0, y$flush_delayed=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L730] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L731] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=1, x=2, y=0, y$flush_delayed=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L764] 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=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=1, x=2, y=0, y$flush_delayed=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L731] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L732] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L732] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L733] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=2, y=0, y$flush_delayed=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L733] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L734] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L734] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L735] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L736] EXPR 2 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L736] 2 y = y$flush_delayed ? y$mem_tmp : y [L737] 2 y$flush_delayed = (_Bool)0 [L742] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L764] 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) [L765] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L765] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L766] 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=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L766] 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 [L767] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L767] 0 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L768] 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=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L768] 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 [L771] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L793] -1 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, 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=2, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L797] 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_p1_EAX=0, __unbuffered_p2_EAX=0, 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=2, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L797] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, 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=2, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L797] 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_p1_EAX=0, __unbuffered_p2_EAX=0, 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=2, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L797] -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) [L798] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, 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=2, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L798] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L799] 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_p1_EAX=0, __unbuffered_p2_EAX=0, 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=2, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L799] -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 [L800] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, 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=2, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L800] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L801] 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_p1_EAX=0, __unbuffered_p2_EAX=0, 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=2, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L801] -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 [L804] -1 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, 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=2, 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=1, 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_p1_EAX=0, __unbuffered_p2_EAX=0, 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=2, 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=1, 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_p1_EAX=0, __unbuffered_p2_EAX=0, 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=2, 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=1, 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, 217 locations, 3 error locations. UNSAFE Result, 105.3s OverallTime, 24 OverallIterations, 1 TraceHistogramMax, 27.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6242 SDtfs, 8397 SDslu, 14534 SDs, 0 SdLazy, 5567 SolverSat, 357 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 210 GetRequests, 57 SyntacticMatches, 9 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=308618occurred in iteration=7, 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: 56.4s AutomataMinimizationTime, 23 MinimizatonAttempts, 584628 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 1807 NumberOfCodeBlocks, 1807 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 1693 ConstructedInterpolants, 0 QuantifiedInterpolants, 359565 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 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...