./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix028_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_e762b88a-bea6-4b28-a7ab-83bdc2787644/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_e762b88a-bea6-4b28-a7ab-83bdc2787644/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_e762b88a-bea6-4b28-a7ab-83bdc2787644/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_e762b88a-bea6-4b28-a7ab-83bdc2787644/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix028_tso.opt_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_e762b88a-bea6-4b28-a7ab-83bdc2787644/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_e762b88a-bea6-4b28-a7ab-83bdc2787644/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 bdc38a1b791b964a5d3ebef146a28040d23c9f7b ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 12:49:02,944 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 12:49:02,945 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 12:49:02,951 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 12:49:02,952 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 12:49:02,952 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 12:49:02,953 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 12:49:02,955 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 12:49:02,956 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 12:49:02,956 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 12:49:02,957 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 12:49:02,957 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 12:49:02,958 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 12:49:02,959 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 12:49:02,959 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 12:49:02,960 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 12:49:02,961 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 12:49:02,962 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 12:49:02,963 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 12:49:02,964 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 12:49:02,965 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 12:49:02,966 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 12:49:02,968 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 12:49:02,968 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 12:49:02,968 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 12:49:02,969 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 12:49:02,969 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 12:49:02,970 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 12:49:02,971 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 12:49:02,971 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 12:49:02,972 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 12:49:02,972 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 12:49:02,972 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 12:49:02,972 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 12:49:02,973 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 12:49:02,974 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 12:49:02,974 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_e762b88a-bea6-4b28-a7ab-83bdc2787644/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-09 12:49:02,984 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 12:49:02,984 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 12:49:02,985 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 12:49:02,985 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 12:49:02,986 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 12:49:02,986 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 12:49:02,986 INFO L133 SettingsManager]: * Use SBE=true [2018-12-09 12:49:02,986 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 12:49:02,986 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 12:49:02,986 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 12:49:02,986 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 12:49:02,986 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 12:49:02,986 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 12:49:02,986 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 12:49:02,987 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 12:49:02,987 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 12:49:02,987 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 12:49:02,987 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 12:49:02,987 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 12:49:02,987 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 12:49:02,987 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 12:49:02,987 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 12:49:02,987 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 12:49:02,987 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 12:49:02,988 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 12:49:02,988 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 12:49:02,988 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 12:49:02,988 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-09 12:49:02,988 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 12:49:02,988 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 12:49:02,988 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_e762b88a-bea6-4b28-a7ab-83bdc2787644/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 -> bdc38a1b791b964a5d3ebef146a28040d23c9f7b [2018-12-09 12:49:03,005 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 12:49:03,012 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 12:49:03,014 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 12:49:03,015 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 12:49:03,015 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 12:49:03,015 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_e762b88a-bea6-4b28-a7ab-83bdc2787644/bin-2019/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix028_tso.opt_false-unreach-call.i [2018-12-09 12:49:03,053 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e762b88a-bea6-4b28-a7ab-83bdc2787644/bin-2019/uautomizer/data/c0c831acd/54e78cb11fd44c5b818344a1e33fbd7a/FLAG1a3ce15ee [2018-12-09 12:49:03,509 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 12:49:03,509 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_e762b88a-bea6-4b28-a7ab-83bdc2787644/sv-benchmarks/c/pthread-wmm/mix028_tso.opt_false-unreach-call.i [2018-12-09 12:49:03,517 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e762b88a-bea6-4b28-a7ab-83bdc2787644/bin-2019/uautomizer/data/c0c831acd/54e78cb11fd44c5b818344a1e33fbd7a/FLAG1a3ce15ee [2018-12-09 12:49:03,526 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_e762b88a-bea6-4b28-a7ab-83bdc2787644/bin-2019/uautomizer/data/c0c831acd/54e78cb11fd44c5b818344a1e33fbd7a [2018-12-09 12:49:03,528 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 12:49:03,529 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 12:49:03,530 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 12:49:03,530 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 12:49:03,532 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 12:49:03,532 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:49:03" (1/1) ... [2018-12-09 12:49:03,534 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ca176b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:49:03, skipping insertion in model container [2018-12-09 12:49:03,534 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:49:03" (1/1) ... [2018-12-09 12:49:03,538 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 12:49:03,560 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 12:49:03,745 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 12:49:03,753 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 12:49:03,834 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 12:49:03,867 INFO L195 MainTranslator]: Completed translation [2018-12-09 12:49:03,867 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:49:03 WrapperNode [2018-12-09 12:49:03,867 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 12:49:03,868 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 12:49:03,868 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 12:49:03,868 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 12:49:03,874 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:49:03" (1/1) ... [2018-12-09 12:49:03,886 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:49:03" (1/1) ... [2018-12-09 12:49:03,908 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 12:49:03,909 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 12:49:03,909 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 12:49:03,909 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 12:49:03,915 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:49:03" (1/1) ... [2018-12-09 12:49:03,916 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:49:03" (1/1) ... [2018-12-09 12:49:03,919 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:49:03" (1/1) ... [2018-12-09 12:49:03,919 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:49:03" (1/1) ... [2018-12-09 12:49:03,926 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:49:03" (1/1) ... [2018-12-09 12:49:03,928 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:49:03" (1/1) ... [2018-12-09 12:49:03,930 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:49:03" (1/1) ... [2018-12-09 12:49:03,933 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 12:49:03,933 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 12:49:03,934 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 12:49:03,934 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 12:49:03,934 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:49:03" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e762b88a-bea6-4b28-a7ab-83bdc2787644/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 12:49:03,969 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 12:49:03,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 12:49:03,970 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-09 12:49:03,970 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 12:49:03,970 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-09 12:49:03,970 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-09 12:49:03,970 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-09 12:49:03,970 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-09 12:49:03,970 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2018-12-09 12:49:03,970 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2018-12-09 12:49:03,970 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-09 12:49:03,970 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 12:49:03,970 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 12:49:03,971 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-09 12:49:04,335 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 12:49:04,336 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-09 12:49:04,336 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:49:04 BoogieIcfgContainer [2018-12-09 12:49:04,336 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 12:49:04,336 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 12:49:04,336 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 12:49:04,338 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 12:49:04,338 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 12:49:03" (1/3) ... [2018-12-09 12:49:04,339 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c7d2986 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 12:49:04, skipping insertion in model container [2018-12-09 12:49:04,339 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:49:03" (2/3) ... [2018-12-09 12:49:04,339 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c7d2986 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 12:49:04, skipping insertion in model container [2018-12-09 12:49:04,340 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:49:04" (3/3) ... [2018-12-09 12:49:04,341 INFO L112 eAbstractionObserver]: Analyzing ICFG mix028_tso.opt_false-unreach-call.i [2018-12-09 12:49:04,367 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,367 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,367 WARN L317 ript$VariableManager]: TermVariabe Thread2_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,367 WARN L317 ript$VariableManager]: TermVariabe Thread2_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,367 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,367 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,368 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,368 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,368 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,368 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,368 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,368 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,368 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,369 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,369 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,369 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,369 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,369 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,370 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,370 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,370 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,370 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,370 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,370 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,371 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,371 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,371 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,371 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,371 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,372 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,372 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,372 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,372 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,372 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,372 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,373 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,373 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,373 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,373 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,374 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,374 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,374 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,374 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,374 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,375 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,375 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,375 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,375 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,375 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,375 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,376 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,376 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,376 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet12.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,376 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,376 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet12.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,376 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,376 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet12.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,377 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet12.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,377 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,377 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,377 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,377 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,377 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,378 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,378 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,378 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,378 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,378 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,379 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,379 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,379 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,379 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,379 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,379 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,380 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,380 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,380 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,380 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,380 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,380 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,380 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,381 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,381 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,381 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,381 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,381 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,381 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,382 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,382 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,382 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,382 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,382 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,382 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,382 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,382 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,383 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,383 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,383 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,383 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,383 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,383 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,383 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,384 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,384 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,384 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,384 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,384 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,384 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,384 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,385 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,385 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,385 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,385 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,385 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,385 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,385 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,385 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,386 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,386 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,386 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,386 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,386 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,386 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,386 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,387 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,387 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,387 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,387 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,387 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,387 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,387 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,387 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,388 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,388 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,388 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,388 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,388 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,388 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,388 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,389 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,389 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,389 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,389 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,389 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,389 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,389 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,389 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,390 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,390 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,390 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,390 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,390 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,390 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,390 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,391 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,391 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,391 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,391 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,391 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,391 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,391 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,391 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,392 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,392 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,392 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,392 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,392 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,392 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,392 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet40.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,392 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet40.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,392 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,393 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,393 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet40.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,393 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet40.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:49:04,397 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-09 12:49:04,398 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 12:49:04,404 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-09 12:49:04,418 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-09 12:49:04,439 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 12:49:04,440 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 12:49:04,440 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 12:49:04,440 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 12:49:04,440 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 12:49:04,440 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 12:49:04,440 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 12:49:04,440 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 12:49:04,440 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 12:49:04,451 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 198places, 256 transitions [2018-12-09 12:50:51,981 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 385953 states. [2018-12-09 12:50:51,983 INFO L276 IsEmpty]: Start isEmpty. Operand 385953 states. [2018-12-09 12:50:51,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-09 12:50:51,990 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:50:51,991 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-09 12:50:51,992 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:50:51,996 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:50:51,996 INFO L82 PathProgramCache]: Analyzing trace with hash 654477059, now seen corresponding path program 1 times [2018-12-09 12:50:51,998 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:50:51,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:50:52,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:50:52,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:50:52,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:50:52,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:50:52,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:50:52,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:50:52,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 12:50:52,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 12:50:52,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 12:50:52,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 12:50:52,161 INFO L87 Difference]: Start difference. First operand 385953 states. Second operand 4 states. [2018-12-09 12:50:59,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:50:59,692 INFO L93 Difference]: Finished difference Result 735793 states and 3585691 transitions. [2018-12-09 12:50:59,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 12:50:59,693 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2018-12-09 12:50:59,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:51:01,767 INFO L225 Difference]: With dead ends: 735793 [2018-12-09 12:51:01,767 INFO L226 Difference]: Without dead ends: 634643 [2018-12-09 12:51:01,768 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 12:51:12,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634643 states. [2018-12-09 12:51:24,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634643 to 340233. [2018-12-09 12:51:24,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340233 states. [2018-12-09 12:51:32,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340233 states to 340233 states and 1669458 transitions. [2018-12-09 12:51:32,904 INFO L78 Accepts]: Start accepts. Automaton has 340233 states and 1669458 transitions. Word has length 44 [2018-12-09 12:51:32,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:51:32,905 INFO L480 AbstractCegarLoop]: Abstraction has 340233 states and 1669458 transitions. [2018-12-09 12:51:32,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 12:51:32,906 INFO L276 IsEmpty]: Start isEmpty. Operand 340233 states and 1669458 transitions. [2018-12-09 12:51:32,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-09 12:51:32,913 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:51:32,913 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] [2018-12-09 12:51:32,914 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:51:32,914 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:51:32,914 INFO L82 PathProgramCache]: Analyzing trace with hash -1909790898, now seen corresponding path program 1 times [2018-12-09 12:51:32,914 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:51:32,915 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:51:32,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:51:32,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:51:32,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:51:32,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:51:32,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:51:32,979 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:51:32,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 12:51:32,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 12:51:32,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 12:51:32,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 12:51:32,980 INFO L87 Difference]: Start difference. First operand 340233 states and 1669458 transitions. Second operand 5 states. [2018-12-09 12:51:46,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:51:46,215 INFO L93 Difference]: Finished difference Result 1007353 states and 4689304 transitions. [2018-12-09 12:51:46,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 12:51:46,216 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2018-12-09 12:51:46,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:51:49,516 INFO L225 Difference]: With dead ends: 1007353 [2018-12-09 12:51:49,516 INFO L226 Difference]: Without dead ends: 1006353 [2018-12-09 12:51:49,517 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-09 12:52:01,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1006353 states. [2018-12-09 12:52:11,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1006353 to 549408. [2018-12-09 12:52:11,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 549408 states. [2018-12-09 12:52:28,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549408 states to 549408 states and 2556398 transitions. [2018-12-09 12:52:28,205 INFO L78 Accepts]: Start accepts. Automaton has 549408 states and 2556398 transitions. Word has length 51 [2018-12-09 12:52:28,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:52:28,205 INFO L480 AbstractCegarLoop]: Abstraction has 549408 states and 2556398 transitions. [2018-12-09 12:52:28,205 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 12:52:28,205 INFO L276 IsEmpty]: Start isEmpty. Operand 549408 states and 2556398 transitions. [2018-12-09 12:52:28,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-09 12:52:28,212 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:52:28,212 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:52:28,213 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:52:28,213 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:52:28,213 INFO L82 PathProgramCache]: Analyzing trace with hash -988308488, now seen corresponding path program 1 times [2018-12-09 12:52:28,213 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:52:28,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:52:28,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:52:28,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:52:28,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:52:28,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:52:28,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:52:28,243 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:52:28,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 12:52:28,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 12:52:28,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 12:52:28,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 12:52:28,243 INFO L87 Difference]: Start difference. First operand 549408 states and 2556398 transitions. Second operand 3 states. [2018-12-09 12:52:35,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:52:35,941 INFO L93 Difference]: Finished difference Result 549408 states and 2556033 transitions. [2018-12-09 12:52:35,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 12:52:35,942 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2018-12-09 12:52:35,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:52:37,827 INFO L225 Difference]: With dead ends: 549408 [2018-12-09 12:52:37,827 INFO L226 Difference]: Without dead ends: 549408 [2018-12-09 12:52:37,828 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 12:52:46,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549408 states. [2018-12-09 12:52:53,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549408 to 549408. [2018-12-09 12:52:53,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 549408 states. [2018-12-09 12:52:55,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549408 states to 549408 states and 2556033 transitions. [2018-12-09 12:52:55,885 INFO L78 Accepts]: Start accepts. Automaton has 549408 states and 2556033 transitions. Word has length 52 [2018-12-09 12:52:55,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:52:55,886 INFO L480 AbstractCegarLoop]: Abstraction has 549408 states and 2556033 transitions. [2018-12-09 12:52:55,886 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 12:52:55,886 INFO L276 IsEmpty]: Start isEmpty. Operand 549408 states and 2556033 transitions. [2018-12-09 12:52:55,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-09 12:52:55,892 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:52:55,892 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:52:55,892 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:52:55,892 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:52:55,892 INFO L82 PathProgramCache]: Analyzing trace with hash 754501847, now seen corresponding path program 1 times [2018-12-09 12:52:55,892 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:52:55,892 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:52:55,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:52:55,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:52:55,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:52:55,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:52:55,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:52:55,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:52:55,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 12:52:55,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 12:52:55,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 12:52:55,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 12:52:55,946 INFO L87 Difference]: Start difference. First operand 549408 states and 2556033 transitions. Second operand 4 states. [2018-12-09 12:53:03,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:53:03,065 INFO L93 Difference]: Finished difference Result 472455 states and 2161069 transitions. [2018-12-09 12:53:03,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 12:53:03,065 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2018-12-09 12:53:03,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:53:04,347 INFO L225 Difference]: With dead ends: 472455 [2018-12-09 12:53:04,347 INFO L226 Difference]: Without dead ends: 463970 [2018-12-09 12:53:04,347 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 12:53:12,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463970 states. [2018-12-09 12:53:17,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463970 to 463970. [2018-12-09 12:53:17,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 463970 states. [2018-12-09 12:53:19,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463970 states to 463970 states and 2131578 transitions. [2018-12-09 12:53:19,576 INFO L78 Accepts]: Start accepts. Automaton has 463970 states and 2131578 transitions. Word has length 52 [2018-12-09 12:53:19,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:53:19,576 INFO L480 AbstractCegarLoop]: Abstraction has 463970 states and 2131578 transitions. [2018-12-09 12:53:19,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 12:53:19,577 INFO L276 IsEmpty]: Start isEmpty. Operand 463970 states and 2131578 transitions. [2018-12-09 12:53:19,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-09 12:53:19,582 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:53:19,582 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:53:19,582 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:53:19,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:53:19,583 INFO L82 PathProgramCache]: Analyzing trace with hash -1302071129, now seen corresponding path program 1 times [2018-12-09 12:53:19,583 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:53:19,583 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:53:19,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:53:19,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:53:19,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:53:19,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:53:19,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:53:19,632 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:53:19,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 12:53:19,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 12:53:19,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 12:53:19,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 12:53:19,633 INFO L87 Difference]: Start difference. First operand 463970 states and 2131578 transitions. Second operand 5 states. [2018-12-09 12:53:20,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:53:20,675 INFO L93 Difference]: Finished difference Result 107974 states and 450057 transitions. [2018-12-09 12:53:20,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 12:53:20,675 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2018-12-09 12:53:20,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:53:20,897 INFO L225 Difference]: With dead ends: 107974 [2018-12-09 12:53:20,897 INFO L226 Difference]: Without dead ends: 100622 [2018-12-09 12:53:20,897 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-09 12:53:21,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100622 states. [2018-12-09 12:53:26,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100622 to 100622. [2018-12-09 12:53:26,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100622 states. [2018-12-09 12:53:26,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100622 states to 100622 states and 420923 transitions. [2018-12-09 12:53:26,610 INFO L78 Accepts]: Start accepts. Automaton has 100622 states and 420923 transitions. Word has length 53 [2018-12-09 12:53:26,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:53:26,610 INFO L480 AbstractCegarLoop]: Abstraction has 100622 states and 420923 transitions. [2018-12-09 12:53:26,610 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 12:53:26,610 INFO L276 IsEmpty]: Start isEmpty. Operand 100622 states and 420923 transitions. [2018-12-09 12:53:26,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-09 12:53:26,623 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:53:26,623 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:53:26,623 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:53:26,623 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:53:26,623 INFO L82 PathProgramCache]: Analyzing trace with hash 728190523, now seen corresponding path program 1 times [2018-12-09 12:53:26,624 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:53:26,624 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:53:26,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:53:26,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:53:26,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:53:26,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:53:26,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:53:26,684 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:53:26,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 12:53:26,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 12:53:26,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 12:53:26,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 12:53:26,685 INFO L87 Difference]: Start difference. First operand 100622 states and 420923 transitions. Second operand 6 states. [2018-12-09 12:53:26,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:53:26,752 INFO L93 Difference]: Finished difference Result 15454 states and 53779 transitions. [2018-12-09 12:53:26,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 12:53:26,753 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2018-12-09 12:53:26,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:53:26,770 INFO L225 Difference]: With dead ends: 15454 [2018-12-09 12:53:26,770 INFO L226 Difference]: Without dead ends: 13166 [2018-12-09 12:53:26,770 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-09 12:53:26,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13166 states. [2018-12-09 12:53:26,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13166 to 13026. [2018-12-09 12:53:26,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13026 states. [2018-12-09 12:53:26,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13026 states to 13026 states and 44819 transitions. [2018-12-09 12:53:26,924 INFO L78 Accepts]: Start accepts. Automaton has 13026 states and 44819 transitions. Word has length 66 [2018-12-09 12:53:26,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:53:26,925 INFO L480 AbstractCegarLoop]: Abstraction has 13026 states and 44819 transitions. [2018-12-09 12:53:26,925 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 12:53:26,925 INFO L276 IsEmpty]: Start isEmpty. Operand 13026 states and 44819 transitions. [2018-12-09 12:53:26,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-09 12:53:26,940 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:53:26,941 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:53:26,941 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:53:26,941 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:53:26,941 INFO L82 PathProgramCache]: Analyzing trace with hash -567034914, now seen corresponding path program 1 times [2018-12-09 12:53:26,941 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:53:26,941 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:53:26,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:53:26,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:53:26,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:53:26,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:53:26,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:53:26,991 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:53:26,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 12:53:26,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 12:53:26,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 12:53:26,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 12:53:26,991 INFO L87 Difference]: Start difference. First operand 13026 states and 44819 transitions. Second operand 4 states. [2018-12-09 12:53:27,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:53:27,227 INFO L93 Difference]: Finished difference Result 17361 states and 59227 transitions. [2018-12-09 12:53:27,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 12:53:27,228 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2018-12-09 12:53:27,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:53:27,249 INFO L225 Difference]: With dead ends: 17361 [2018-12-09 12:53:27,249 INFO L226 Difference]: Without dead ends: 17361 [2018-12-09 12:53:27,249 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 12:53:27,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17361 states. [2018-12-09 12:53:27,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17361 to 15901. [2018-12-09 12:53:27,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15901 states. [2018-12-09 12:53:27,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15901 states to 15901 states and 54609 transitions. [2018-12-09 12:53:27,449 INFO L78 Accepts]: Start accepts. Automaton has 15901 states and 54609 transitions. Word has length 115 [2018-12-09 12:53:27,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:53:27,450 INFO L480 AbstractCegarLoop]: Abstraction has 15901 states and 54609 transitions. [2018-12-09 12:53:27,450 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 12:53:27,450 INFO L276 IsEmpty]: Start isEmpty. Operand 15901 states and 54609 transitions. [2018-12-09 12:53:27,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-09 12:53:27,468 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:53:27,468 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:53:27,468 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:53:27,468 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:53:27,468 INFO L82 PathProgramCache]: Analyzing trace with hash 616312383, now seen corresponding path program 1 times [2018-12-09 12:53:27,468 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:53:27,469 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:53:27,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:53:27,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:53:27,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:53:27,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:53:27,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:53:27,564 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:53:27,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 12:53:27,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 12:53:27,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 12:53:27,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-12-09 12:53:27,564 INFO L87 Difference]: Start difference. First operand 15901 states and 54609 transitions. Second operand 7 states. [2018-12-09 12:53:27,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:53:27,877 INFO L93 Difference]: Finished difference Result 18856 states and 63983 transitions. [2018-12-09 12:53:27,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 12:53:27,878 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 115 [2018-12-09 12:53:27,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:53:27,901 INFO L225 Difference]: With dead ends: 18856 [2018-12-09 12:53:27,901 INFO L226 Difference]: Without dead ends: 18856 [2018-12-09 12:53:27,901 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-12-09 12:53:27,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18856 states. [2018-12-09 12:53:28,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18856 to 16191. [2018-12-09 12:53:28,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16191 states. [2018-12-09 12:53:28,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16191 states to 16191 states and 55511 transitions. [2018-12-09 12:53:28,269 INFO L78 Accepts]: Start accepts. Automaton has 16191 states and 55511 transitions. Word has length 115 [2018-12-09 12:53:28,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:53:28,270 INFO L480 AbstractCegarLoop]: Abstraction has 16191 states and 55511 transitions. [2018-12-09 12:53:28,270 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 12:53:28,270 INFO L276 IsEmpty]: Start isEmpty. Operand 16191 states and 55511 transitions. [2018-12-09 12:53:28,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-09 12:53:28,288 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:53:28,288 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:53:28,288 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:53:28,288 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:53:28,289 INFO L82 PathProgramCache]: Analyzing trace with hash 8235520, now seen corresponding path program 1 times [2018-12-09 12:53:28,289 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:53:28,289 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:53:28,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:53:28,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:53:28,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:53:28,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:53:28,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:53:28,359 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:53:28,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 12:53:28,359 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 12:53:28,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 12:53:28,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 12:53:28,359 INFO L87 Difference]: Start difference. First operand 16191 states and 55511 transitions. Second operand 5 states. [2018-12-09 12:53:28,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:53:28,563 INFO L93 Difference]: Finished difference Result 17730 states and 60384 transitions. [2018-12-09 12:53:28,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 12:53:28,564 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 115 [2018-12-09 12:53:28,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:53:28,585 INFO L225 Difference]: With dead ends: 17730 [2018-12-09 12:53:28,585 INFO L226 Difference]: Without dead ends: 17730 [2018-12-09 12:53:28,586 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-09 12:53:28,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17730 states. [2018-12-09 12:53:28,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17730 to 16261. [2018-12-09 12:53:28,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16261 states. [2018-12-09 12:53:28,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16261 states to 16261 states and 55717 transitions. [2018-12-09 12:53:28,786 INFO L78 Accepts]: Start accepts. Automaton has 16261 states and 55717 transitions. Word has length 115 [2018-12-09 12:53:28,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:53:28,786 INFO L480 AbstractCegarLoop]: Abstraction has 16261 states and 55717 transitions. [2018-12-09 12:53:28,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 12:53:28,786 INFO L276 IsEmpty]: Start isEmpty. Operand 16261 states and 55717 transitions. [2018-12-09 12:53:28,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-09 12:53:28,804 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:53:28,804 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:53:28,804 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:53:28,804 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:53:28,804 INFO L82 PathProgramCache]: Analyzing trace with hash 117787103, now seen corresponding path program 1 times [2018-12-09 12:53:28,804 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:53:28,804 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:53:28,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:53:28,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:53:28,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:53:28,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:53:28,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:53:28,893 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:53:28,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 12:53:28,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 12:53:28,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 12:53:28,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 12:53:28,893 INFO L87 Difference]: Start difference. First operand 16261 states and 55717 transitions. Second operand 5 states. [2018-12-09 12:53:28,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:53:28,941 INFO L93 Difference]: Finished difference Result 13076 states and 44064 transitions. [2018-12-09 12:53:28,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 12:53:28,942 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 115 [2018-12-09 12:53:28,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:53:28,959 INFO L225 Difference]: With dead ends: 13076 [2018-12-09 12:53:28,959 INFO L226 Difference]: Without dead ends: 13076 [2018-12-09 12:53:28,960 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 12:53:28,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13076 states. [2018-12-09 12:53:29,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13076 to 13016. [2018-12-09 12:53:29,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13016 states. [2018-12-09 12:53:29,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13016 states to 13016 states and 43876 transitions. [2018-12-09 12:53:29,114 INFO L78 Accepts]: Start accepts. Automaton has 13016 states and 43876 transitions. Word has length 115 [2018-12-09 12:53:29,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:53:29,115 INFO L480 AbstractCegarLoop]: Abstraction has 13016 states and 43876 transitions. [2018-12-09 12:53:29,115 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 12:53:29,115 INFO L276 IsEmpty]: Start isEmpty. Operand 13016 states and 43876 transitions. [2018-12-09 12:53:29,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-12-09 12:53:29,128 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:53:29,128 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:53:29,128 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:53:29,128 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:53:29,128 INFO L82 PathProgramCache]: Analyzing trace with hash 1515313044, now seen corresponding path program 1 times [2018-12-09 12:53:29,128 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:53:29,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:53:29,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:53:29,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:53:29,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:53:29,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:53:29,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:53:29,186 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:53:29,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 12:53:29,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 12:53:29,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 12:53:29,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 12:53:29,187 INFO L87 Difference]: Start difference. First operand 13016 states and 43876 transitions. Second operand 4 states. [2018-12-09 12:53:29,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:53:29,322 INFO L93 Difference]: Finished difference Result 14454 states and 48432 transitions. [2018-12-09 12:53:29,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 12:53:29,322 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 117 [2018-12-09 12:53:29,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:53:29,340 INFO L225 Difference]: With dead ends: 14454 [2018-12-09 12:53:29,340 INFO L226 Difference]: Without dead ends: 14454 [2018-12-09 12:53:29,340 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 12:53:29,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14454 states. [2018-12-09 12:53:29,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14454 to 13226. [2018-12-09 12:53:29,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13226 states. [2018-12-09 12:53:29,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13226 states to 13226 states and 44529 transitions. [2018-12-09 12:53:29,494 INFO L78 Accepts]: Start accepts. Automaton has 13226 states and 44529 transitions. Word has length 117 [2018-12-09 12:53:29,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:53:29,495 INFO L480 AbstractCegarLoop]: Abstraction has 13226 states and 44529 transitions. [2018-12-09 12:53:29,495 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 12:53:29,495 INFO L276 IsEmpty]: Start isEmpty. Operand 13226 states and 44529 transitions. [2018-12-09 12:53:29,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-12-09 12:53:29,508 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:53:29,508 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:53:29,508 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:53:29,509 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:53:29,509 INFO L82 PathProgramCache]: Analyzing trace with hash -420347243, now seen corresponding path program 1 times [2018-12-09 12:53:29,509 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:53:29,509 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:53:29,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:53:29,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:53:29,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:53:29,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:53:29,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:53:29,544 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:53:29,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 12:53:29,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 12:53:29,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 12:53:29,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 12:53:29,545 INFO L87 Difference]: Start difference. First operand 13226 states and 44529 transitions. Second operand 3 states. [2018-12-09 12:53:29,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:53:29,731 INFO L93 Difference]: Finished difference Result 16696 states and 55080 transitions. [2018-12-09 12:53:29,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 12:53:29,732 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 117 [2018-12-09 12:53:29,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:53:29,756 INFO L225 Difference]: With dead ends: 16696 [2018-12-09 12:53:29,756 INFO L226 Difference]: Without dead ends: 16696 [2018-12-09 12:53:29,757 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 12:53:29,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16696 states. [2018-12-09 12:53:29,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16696 to 16016. [2018-12-09 12:53:29,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16016 states. [2018-12-09 12:53:29,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16016 states to 16016 states and 53101 transitions. [2018-12-09 12:53:29,951 INFO L78 Accepts]: Start accepts. Automaton has 16016 states and 53101 transitions. Word has length 117 [2018-12-09 12:53:29,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:53:29,952 INFO L480 AbstractCegarLoop]: Abstraction has 16016 states and 53101 transitions. [2018-12-09 12:53:29,952 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 12:53:29,952 INFO L276 IsEmpty]: Start isEmpty. Operand 16016 states and 53101 transitions. [2018-12-09 12:53:29,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-12-09 12:53:29,968 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:53:29,968 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:53:29,968 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:53:29,968 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:53:29,969 INFO L82 PathProgramCache]: Analyzing trace with hash -2094832235, now seen corresponding path program 2 times [2018-12-09 12:53:29,969 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:53:29,969 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:53:29,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:53:29,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:53:29,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:53:29,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:53:30,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:53:30,049 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:53:30,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 12:53:30,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 12:53:30,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 12:53:30,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 12:53:30,049 INFO L87 Difference]: Start difference. First operand 16016 states and 53101 transitions. Second operand 6 states. [2018-12-09 12:53:30,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:53:30,337 INFO L93 Difference]: Finished difference Result 19359 states and 63114 transitions. [2018-12-09 12:53:30,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 12:53:30,337 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 117 [2018-12-09 12:53:30,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:53:30,358 INFO L225 Difference]: With dead ends: 19359 [2018-12-09 12:53:30,358 INFO L226 Difference]: Without dead ends: 19359 [2018-12-09 12:53:30,359 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-09 12:53:30,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19359 states. [2018-12-09 12:53:30,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19359 to 15001. [2018-12-09 12:53:30,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15001 states. [2018-12-09 12:53:30,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15001 states to 15001 states and 49259 transitions. [2018-12-09 12:53:30,670 INFO L78 Accepts]: Start accepts. Automaton has 15001 states and 49259 transitions. Word has length 117 [2018-12-09 12:53:30,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:53:30,670 INFO L480 AbstractCegarLoop]: Abstraction has 15001 states and 49259 transitions. [2018-12-09 12:53:30,670 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 12:53:30,670 INFO L276 IsEmpty]: Start isEmpty. Operand 15001 states and 49259 transitions. [2018-12-09 12:53:30,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-12-09 12:53:30,684 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:53:30,684 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:53:30,684 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:53:30,684 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:53:30,684 INFO L82 PathProgramCache]: Analyzing trace with hash -753714556, now seen corresponding path program 1 times [2018-12-09 12:53:30,684 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:53:30,684 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:53:30,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:53:30,685 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 12:53:30,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:53:30,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:53:30,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:53:30,755 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:53:30,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 12:53:30,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 12:53:30,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 12:53:30,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-09 12:53:30,756 INFO L87 Difference]: Start difference. First operand 15001 states and 49259 transitions. Second operand 7 states. [2018-12-09 12:53:30,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:53:30,937 INFO L93 Difference]: Finished difference Result 21351 states and 68614 transitions. [2018-12-09 12:53:30,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 12:53:30,938 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 119 [2018-12-09 12:53:30,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:53:30,962 INFO L225 Difference]: With dead ends: 21351 [2018-12-09 12:53:30,962 INFO L226 Difference]: Without dead ends: 21251 [2018-12-09 12:53:30,963 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-12-09 12:53:31,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21251 states. [2018-12-09 12:53:31,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21251 to 16806. [2018-12-09 12:53:31,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16806 states. [2018-12-09 12:53:31,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16806 states to 16806 states and 54793 transitions. [2018-12-09 12:53:31,182 INFO L78 Accepts]: Start accepts. Automaton has 16806 states and 54793 transitions. Word has length 119 [2018-12-09 12:53:31,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:53:31,183 INFO L480 AbstractCegarLoop]: Abstraction has 16806 states and 54793 transitions. [2018-12-09 12:53:31,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 12:53:31,183 INFO L276 IsEmpty]: Start isEmpty. Operand 16806 states and 54793 transitions. [2018-12-09 12:53:31,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-12-09 12:53:31,198 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:53:31,199 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:53:31,199 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:53:31,199 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:53:31,199 INFO L82 PathProgramCache]: Analyzing trace with hash 2026450529, now seen corresponding path program 1 times [2018-12-09 12:53:31,199 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:53:31,199 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:53:31,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:53:31,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:53:31,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:53:31,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:53:31,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:53:31,275 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:53:31,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 12:53:31,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 12:53:31,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 12:53:31,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-12-09 12:53:31,276 INFO L87 Difference]: Start difference. First operand 16806 states and 54793 transitions. Second operand 6 states. [2018-12-09 12:53:31,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:53:31,573 INFO L93 Difference]: Finished difference Result 30711 states and 99103 transitions. [2018-12-09 12:53:31,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 12:53:31,573 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 119 [2018-12-09 12:53:31,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:53:31,607 INFO L225 Difference]: With dead ends: 30711 [2018-12-09 12:53:31,607 INFO L226 Difference]: Without dead ends: 30711 [2018-12-09 12:53:31,607 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-12-09 12:53:31,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30711 states. [2018-12-09 12:53:31,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30711 to 21140. [2018-12-09 12:53:31,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21140 states. [2018-12-09 12:53:31,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21140 states to 21140 states and 67623 transitions. [2018-12-09 12:53:31,882 INFO L78 Accepts]: Start accepts. Automaton has 21140 states and 67623 transitions. Word has length 119 [2018-12-09 12:53:31,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:53:31,882 INFO L480 AbstractCegarLoop]: Abstraction has 21140 states and 67623 transitions. [2018-12-09 12:53:31,882 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 12:53:31,883 INFO L276 IsEmpty]: Start isEmpty. Operand 21140 states and 67623 transitions. [2018-12-09 12:53:31,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-12-09 12:53:31,900 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:53:31,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:53:31,900 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:53:31,900 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:53:31,900 INFO L82 PathProgramCache]: Analyzing trace with hash 301878431, now seen corresponding path program 1 times [2018-12-09 12:53:31,900 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:53:31,900 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:53:31,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:53:31,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:53:31,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:53:31,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:53:31,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:53:31,931 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:53:31,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 12:53:31,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 12:53:31,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 12:53:31,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 12:53:31,932 INFO L87 Difference]: Start difference. First operand 21140 states and 67623 transitions. Second operand 4 states. [2018-12-09 12:53:32,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:53:32,071 INFO L93 Difference]: Finished difference Result 22484 states and 72311 transitions. [2018-12-09 12:53:32,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 12:53:32,071 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 119 [2018-12-09 12:53:32,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:53:32,098 INFO L225 Difference]: With dead ends: 22484 [2018-12-09 12:53:32,098 INFO L226 Difference]: Without dead ends: 22484 [2018-12-09 12:53:32,098 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 12:53:32,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22484 states. [2018-12-09 12:53:32,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22484 to 22356. [2018-12-09 12:53:32,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22356 states. [2018-12-09 12:53:32,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22356 states to 22356 states and 71895 transitions. [2018-12-09 12:53:32,337 INFO L78 Accepts]: Start accepts. Automaton has 22356 states and 71895 transitions. Word has length 119 [2018-12-09 12:53:32,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:53:32,338 INFO L480 AbstractCegarLoop]: Abstraction has 22356 states and 71895 transitions. [2018-12-09 12:53:32,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 12:53:32,338 INFO L276 IsEmpty]: Start isEmpty. Operand 22356 states and 71895 transitions. [2018-12-09 12:53:32,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-12-09 12:53:32,358 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:53:32,358 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:53:32,359 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:53:32,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:53:32,359 INFO L82 PathProgramCache]: Analyzing trace with hash -1775330912, now seen corresponding path program 1 times [2018-12-09 12:53:32,359 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:53:32,359 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:53:32,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:53:32,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:53:32,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:53:32,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:53:32,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:53:32,446 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:53:32,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 12:53:32,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 12:53:32,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 12:53:32,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 12:53:32,447 INFO L87 Difference]: Start difference. First operand 22356 states and 71895 transitions. Second operand 7 states. [2018-12-09 12:53:32,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:53:32,922 INFO L93 Difference]: Finished difference Result 37229 states and 117820 transitions. [2018-12-09 12:53:32,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 12:53:32,923 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 119 [2018-12-09 12:53:32,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:53:32,971 INFO L225 Difference]: With dead ends: 37229 [2018-12-09 12:53:32,971 INFO L226 Difference]: Without dead ends: 37101 [2018-12-09 12:53:32,971 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-12-09 12:53:33,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37101 states. [2018-12-09 12:53:33,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37101 to 26127. [2018-12-09 12:53:33,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26127 states. [2018-12-09 12:53:33,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26127 states to 26127 states and 84696 transitions. [2018-12-09 12:53:33,330 INFO L78 Accepts]: Start accepts. Automaton has 26127 states and 84696 transitions. Word has length 119 [2018-12-09 12:53:33,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:53:33,330 INFO L480 AbstractCegarLoop]: Abstraction has 26127 states and 84696 transitions. [2018-12-09 12:53:33,330 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 12:53:33,330 INFO L276 IsEmpty]: Start isEmpty. Operand 26127 states and 84696 transitions. [2018-12-09 12:53:33,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-12-09 12:53:33,358 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:53:33,358 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:53:33,358 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:53:33,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:53:33,358 INFO L82 PathProgramCache]: Analyzing trace with hash -813716895, now seen corresponding path program 1 times [2018-12-09 12:53:33,358 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:53:33,358 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:53:33,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:53:33,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:53:33,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:53:33,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:53:33,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:53:33,431 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:53:33,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 12:53:33,431 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 12:53:33,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 12:53:33,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 12:53:33,432 INFO L87 Difference]: Start difference. First operand 26127 states and 84696 transitions. Second operand 7 states. [2018-12-09 12:53:33,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:53:33,839 INFO L93 Difference]: Finished difference Result 39483 states and 125907 transitions. [2018-12-09 12:53:33,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 12:53:33,840 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 119 [2018-12-09 12:53:33,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:53:33,883 INFO L225 Difference]: With dead ends: 39483 [2018-12-09 12:53:33,883 INFO L226 Difference]: Without dead ends: 39483 [2018-12-09 12:53:33,884 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-12-09 12:53:33,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39483 states. [2018-12-09 12:53:34,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39483 to 28113. [2018-12-09 12:53:34,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28113 states. [2018-12-09 12:53:34,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28113 states to 28113 states and 91420 transitions. [2018-12-09 12:53:34,238 INFO L78 Accepts]: Start accepts. Automaton has 28113 states and 91420 transitions. Word has length 119 [2018-12-09 12:53:34,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:53:34,239 INFO L480 AbstractCegarLoop]: Abstraction has 28113 states and 91420 transitions. [2018-12-09 12:53:34,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 12:53:34,239 INFO L276 IsEmpty]: Start isEmpty. Operand 28113 states and 91420 transitions. [2018-12-09 12:53:34,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-12-09 12:53:34,264 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:53:34,264 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:53:34,264 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:53:34,264 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:53:34,264 INFO L82 PathProgramCache]: Analyzing trace with hash 431047586, now seen corresponding path program 1 times [2018-12-09 12:53:34,264 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:53:34,264 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:53:34,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:53:34,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:53:34,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:53:34,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:53:34,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:53:34,346 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:53:34,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 12:53:34,347 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 12:53:34,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 12:53:34,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-09 12:53:34,347 INFO L87 Difference]: Start difference. First operand 28113 states and 91420 transitions. Second operand 7 states. [2018-12-09 12:53:34,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:53:34,512 INFO L93 Difference]: Finished difference Result 42168 states and 138752 transitions. [2018-12-09 12:53:34,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 12:53:34,512 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 119 [2018-12-09 12:53:34,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:53:34,562 INFO L225 Difference]: With dead ends: 42168 [2018-12-09 12:53:34,562 INFO L226 Difference]: Without dead ends: 42168 [2018-12-09 12:53:34,563 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-12-09 12:53:34,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42168 states. [2018-12-09 12:53:34,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42168 to 29508. [2018-12-09 12:53:34,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29508 states. [2018-12-09 12:53:34,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29508 states to 29508 states and 95561 transitions. [2018-12-09 12:53:34,999 INFO L78 Accepts]: Start accepts. Automaton has 29508 states and 95561 transitions. Word has length 119 [2018-12-09 12:53:34,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:53:34,999 INFO L480 AbstractCegarLoop]: Abstraction has 29508 states and 95561 transitions. [2018-12-09 12:53:34,999 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 12:53:34,999 INFO L276 IsEmpty]: Start isEmpty. Operand 29508 states and 95561 transitions. [2018-12-09 12:53:35,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-12-09 12:53:35,027 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:53:35,027 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:53:35,027 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:53:35,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:53:35,027 INFO L82 PathProgramCache]: Analyzing trace with hash -1504612701, now seen corresponding path program 1 times [2018-12-09 12:53:35,027 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:53:35,027 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:53:35,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:53:35,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:53:35,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:53:35,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:53:35,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:53:35,091 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:53:35,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 12:53:35,091 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 12:53:35,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 12:53:35,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 12:53:35,092 INFO L87 Difference]: Start difference. First operand 29508 states and 95561 transitions. Second operand 7 states. [2018-12-09 12:53:35,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:53:35,315 INFO L93 Difference]: Finished difference Result 31238 states and 100765 transitions. [2018-12-09 12:53:35,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 12:53:35,316 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 119 [2018-12-09 12:53:35,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:53:35,354 INFO L225 Difference]: With dead ends: 31238 [2018-12-09 12:53:35,354 INFO L226 Difference]: Without dead ends: 31238 [2018-12-09 12:53:35,355 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-12-09 12:53:35,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31238 states. [2018-12-09 12:53:35,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31238 to 29793. [2018-12-09 12:53:35,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29793 states. [2018-12-09 12:53:35,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29793 states to 29793 states and 96379 transitions. [2018-12-09 12:53:35,718 INFO L78 Accepts]: Start accepts. Automaton has 29793 states and 96379 transitions. Word has length 119 [2018-12-09 12:53:35,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:53:35,718 INFO L480 AbstractCegarLoop]: Abstraction has 29793 states and 96379 transitions. [2018-12-09 12:53:35,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 12:53:35,718 INFO L276 IsEmpty]: Start isEmpty. Operand 29793 states and 96379 transitions. [2018-12-09 12:53:35,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-12-09 12:53:35,748 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:53:35,748 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:53:35,748 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:53:35,748 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:53:35,748 INFO L82 PathProgramCache]: Analyzing trace with hash -699077499, now seen corresponding path program 1 times [2018-12-09 12:53:35,748 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:53:35,748 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:53:35,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:53:35,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:53:35,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:53:35,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:53:35,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:53:35,816 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:53:35,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 12:53:35,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 12:53:35,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 12:53:35,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 12:53:35,816 INFO L87 Difference]: Start difference. First operand 29793 states and 96379 transitions. Second operand 5 states. [2018-12-09 12:53:36,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:53:36,017 INFO L93 Difference]: Finished difference Result 28208 states and 90246 transitions. [2018-12-09 12:53:36,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 12:53:36,018 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 119 [2018-12-09 12:53:36,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:53:36,053 INFO L225 Difference]: With dead ends: 28208 [2018-12-09 12:53:36,053 INFO L226 Difference]: Without dead ends: 28208 [2018-12-09 12:53:36,053 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-09 12:53:36,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28208 states. [2018-12-09 12:53:36,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28208 to 28208. [2018-12-09 12:53:36,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28208 states. [2018-12-09 12:53:36,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28208 states to 28208 states and 90246 transitions. [2018-12-09 12:53:36,371 INFO L78 Accepts]: Start accepts. Automaton has 28208 states and 90246 transitions. Word has length 119 [2018-12-09 12:53:36,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:53:36,371 INFO L480 AbstractCegarLoop]: Abstraction has 28208 states and 90246 transitions. [2018-12-09 12:53:36,371 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 12:53:36,371 INFO L276 IsEmpty]: Start isEmpty. Operand 28208 states and 90246 transitions. [2018-12-09 12:53:36,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-12-09 12:53:36,398 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:53:36,399 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:53:36,399 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:53:36,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:53:36,399 INFO L82 PathProgramCache]: Analyzing trace with hash -1443875998, now seen corresponding path program 1 times [2018-12-09 12:53:36,399 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:53:36,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:53:36,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:53:36,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:53:36,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:53:36,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:53:36,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:53:36,484 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:53:36,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 12:53:36,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 12:53:36,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 12:53:36,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 12:53:36,485 INFO L87 Difference]: Start difference. First operand 28208 states and 90246 transitions. Second operand 6 states. [2018-12-09 12:53:36,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:53:36,610 INFO L93 Difference]: Finished difference Result 25776 states and 81062 transitions. [2018-12-09 12:53:36,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 12:53:36,611 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 119 [2018-12-09 12:53:36,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:53:36,641 INFO L225 Difference]: With dead ends: 25776 [2018-12-09 12:53:36,642 INFO L226 Difference]: Without dead ends: 25776 [2018-12-09 12:53:36,642 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-09 12:53:36,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25776 states. [2018-12-09 12:53:36,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25776 to 19109. [2018-12-09 12:53:36,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19109 states. [2018-12-09 12:53:36,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19109 states to 19109 states and 60654 transitions. [2018-12-09 12:53:36,941 INFO L78 Accepts]: Start accepts. Automaton has 19109 states and 60654 transitions. Word has length 119 [2018-12-09 12:53:36,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:53:36,941 INFO L480 AbstractCegarLoop]: Abstraction has 19109 states and 60654 transitions. [2018-12-09 12:53:36,941 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 12:53:36,941 INFO L276 IsEmpty]: Start isEmpty. Operand 19109 states and 60654 transitions. [2018-12-09 12:53:36,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-12-09 12:53:36,958 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:53:36,958 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:53:36,958 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:53:36,958 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:53:36,958 INFO L82 PathProgramCache]: Analyzing trace with hash 950530693, now seen corresponding path program 1 times [2018-12-09 12:53:36,958 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:53:36,959 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:53:36,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:53:36,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:53:36,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:53:36,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:53:37,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:53:37,010 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:53:37,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 12:53:37,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 12:53:37,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 12:53:37,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 12:53:37,011 INFO L87 Difference]: Start difference. First operand 19109 states and 60654 transitions. Second operand 5 states. [2018-12-09 12:53:37,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:53:37,187 INFO L93 Difference]: Finished difference Result 20389 states and 64814 transitions. [2018-12-09 12:53:37,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 12:53:37,188 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 121 [2018-12-09 12:53:37,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:53:37,210 INFO L225 Difference]: With dead ends: 20389 [2018-12-09 12:53:37,210 INFO L226 Difference]: Without dead ends: 20389 [2018-12-09 12:53:37,211 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-09 12:53:37,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20389 states. [2018-12-09 12:53:37,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20389 to 19301. [2018-12-09 12:53:37,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19301 states. [2018-12-09 12:53:37,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19301 states to 19301 states and 61278 transitions. [2018-12-09 12:53:37,425 INFO L78 Accepts]: Start accepts. Automaton has 19301 states and 61278 transitions. Word has length 121 [2018-12-09 12:53:37,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:53:37,425 INFO L480 AbstractCegarLoop]: Abstraction has 19301 states and 61278 transitions. [2018-12-09 12:53:37,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 12:53:37,425 INFO L276 IsEmpty]: Start isEmpty. Operand 19301 states and 61278 transitions. [2018-12-09 12:53:37,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-12-09 12:53:37,442 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:53:37,442 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:53:37,442 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:53:37,442 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:53:37,442 INFO L82 PathProgramCache]: Analyzing trace with hash -2099672122, now seen corresponding path program 1 times [2018-12-09 12:53:37,442 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:53:37,443 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:53:37,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:53:37,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:53:37,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:53:37,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:53:37,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:53:37,482 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:53:37,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 12:53:37,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 12:53:37,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 12:53:37,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 12:53:37,483 INFO L87 Difference]: Start difference. First operand 19301 states and 61278 transitions. Second operand 5 states. [2018-12-09 12:53:37,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:53:37,556 INFO L93 Difference]: Finished difference Result 27569 states and 87638 transitions. [2018-12-09 12:53:37,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 12:53:37,557 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 121 [2018-12-09 12:53:37,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:53:37,591 INFO L225 Difference]: With dead ends: 27569 [2018-12-09 12:53:37,591 INFO L226 Difference]: Without dead ends: 27569 [2018-12-09 12:53:37,591 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-09 12:53:37,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27569 states. [2018-12-09 12:53:37,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27569 to 19301. [2018-12-09 12:53:37,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19301 states. [2018-12-09 12:53:37,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19301 states to 19301 states and 60353 transitions. [2018-12-09 12:53:37,840 INFO L78 Accepts]: Start accepts. Automaton has 19301 states and 60353 transitions. Word has length 121 [2018-12-09 12:53:37,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:53:37,840 INFO L480 AbstractCegarLoop]: Abstraction has 19301 states and 60353 transitions. [2018-12-09 12:53:37,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 12:53:37,840 INFO L276 IsEmpty]: Start isEmpty. Operand 19301 states and 60353 transitions. [2018-12-09 12:53:37,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-12-09 12:53:37,857 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:53:37,857 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:53:37,857 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:53:37,857 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:53:37,857 INFO L82 PathProgramCache]: Analyzing trace with hash -795278393, now seen corresponding path program 1 times [2018-12-09 12:53:37,858 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:53:37,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:53:37,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:53:37,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:53:37,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:53:37,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:53:37,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:53:37,912 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:53:37,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 12:53:37,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 12:53:37,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 12:53:37,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 12:53:37,913 INFO L87 Difference]: Start difference. First operand 19301 states and 60353 transitions. Second operand 4 states. [2018-12-09 12:53:38,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:53:38,012 INFO L93 Difference]: Finished difference Result 28852 states and 90594 transitions. [2018-12-09 12:53:38,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 12:53:38,012 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2018-12-09 12:53:38,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:53:38,046 INFO L225 Difference]: With dead ends: 28852 [2018-12-09 12:53:38,046 INFO L226 Difference]: Without dead ends: 28852 [2018-12-09 12:53:38,046 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 12:53:38,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28852 states. [2018-12-09 12:53:38,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28852 to 28503. [2018-12-09 12:53:38,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28503 states. [2018-12-09 12:53:38,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28503 states to 28503 states and 89608 transitions. [2018-12-09 12:53:38,383 INFO L78 Accepts]: Start accepts. Automaton has 28503 states and 89608 transitions. Word has length 121 [2018-12-09 12:53:38,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:53:38,383 INFO L480 AbstractCegarLoop]: Abstraction has 28503 states and 89608 transitions. [2018-12-09 12:53:38,383 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 12:53:38,383 INFO L276 IsEmpty]: Start isEmpty. Operand 28503 states and 89608 transitions. [2018-12-09 12:53:38,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-12-09 12:53:38,409 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:53:38,409 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:53:38,410 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:53:38,410 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:53:38,410 INFO L82 PathProgramCache]: Analyzing trace with hash -1682782074, now seen corresponding path program 1 times [2018-12-09 12:53:38,410 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:53:38,410 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:53:38,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:53:38,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:53:38,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:53:38,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:53:38,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:53:38,475 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:53:38,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 12:53:38,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 12:53:38,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 12:53:38,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-09 12:53:38,475 INFO L87 Difference]: Start difference. First operand 28503 states and 89608 transitions. Second operand 8 states. [2018-12-09 12:53:38,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:53:38,777 INFO L93 Difference]: Finished difference Result 71933 states and 222888 transitions. [2018-12-09 12:53:38,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 12:53:38,777 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 121 [2018-12-09 12:53:38,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:53:38,811 INFO L225 Difference]: With dead ends: 71933 [2018-12-09 12:53:38,811 INFO L226 Difference]: Without dead ends: 28740 [2018-12-09 12:53:38,812 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2018-12-09 12:53:38,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28740 states. [2018-12-09 12:53:39,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28740 to 24684. [2018-12-09 12:53:39,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24684 states. [2018-12-09 12:53:39,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24684 states to 24684 states and 77404 transitions. [2018-12-09 12:53:39,151 INFO L78 Accepts]: Start accepts. Automaton has 24684 states and 77404 transitions. Word has length 121 [2018-12-09 12:53:39,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:53:39,151 INFO L480 AbstractCegarLoop]: Abstraction has 24684 states and 77404 transitions. [2018-12-09 12:53:39,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 12:53:39,152 INFO L276 IsEmpty]: Start isEmpty. Operand 24684 states and 77404 transitions. [2018-12-09 12:53:39,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-12-09 12:53:39,172 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:53:39,172 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:53:39,172 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:53:39,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:53:39,172 INFO L82 PathProgramCache]: Analyzing trace with hash 920726836, now seen corresponding path program 2 times [2018-12-09 12:53:39,173 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:53:39,173 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:53:39,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:53:39,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:53:39,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:53:39,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:53:39,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:53:39,219 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:53:39,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 12:53:39,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 12:53:39,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 12:53:39,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 12:53:39,219 INFO L87 Difference]: Start difference. First operand 24684 states and 77404 transitions. Second operand 7 states. [2018-12-09 12:53:39,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:53:39,350 INFO L93 Difference]: Finished difference Result 36068 states and 116298 transitions. [2018-12-09 12:53:39,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 12:53:39,351 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 121 [2018-12-09 12:53:39,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:53:39,367 INFO L225 Difference]: With dead ends: 36068 [2018-12-09 12:53:39,367 INFO L226 Difference]: Without dead ends: 11692 [2018-12-09 12:53:39,367 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2018-12-09 12:53:39,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11692 states. [2018-12-09 12:53:39,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11692 to 11692. [2018-12-09 12:53:39,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11692 states. [2018-12-09 12:53:39,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11692 states to 11692 states and 39565 transitions. [2018-12-09 12:53:39,497 INFO L78 Accepts]: Start accepts. Automaton has 11692 states and 39565 transitions. Word has length 121 [2018-12-09 12:53:39,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:53:39,497 INFO L480 AbstractCegarLoop]: Abstraction has 11692 states and 39565 transitions. [2018-12-09 12:53:39,498 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 12:53:39,498 INFO L276 IsEmpty]: Start isEmpty. Operand 11692 states and 39565 transitions. [2018-12-09 12:53:39,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-12-09 12:53:39,508 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:53:39,508 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:53:39,509 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:53:39,509 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:53:39,509 INFO L82 PathProgramCache]: Analyzing trace with hash -608268126, now seen corresponding path program 3 times [2018-12-09 12:53:39,509 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:53:39,509 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:53:39,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:53:39,510 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 12:53:39,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:53:39,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:53:39,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:53:39,557 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 12:53:39,647 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-09 12:53:39,648 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 12:53:39 BasicIcfg [2018-12-09 12:53:39,648 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 12:53:39,648 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 12:53:39,648 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 12:53:39,648 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 12:53:39,649 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:49:04" (3/4) ... [2018-12-09 12:53:39,650 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-09 12:53:39,737 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_e762b88a-bea6-4b28-a7ab-83bdc2787644/bin-2019/uautomizer/witness.graphml [2018-12-09 12:53:39,737 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 12:53:39,738 INFO L168 Benchmark]: Toolchain (without parser) took 276209.24 ms. Allocated memory was 1.0 GB in the beginning and 9.7 GB in the end (delta: 8.7 GB). Free memory was 957.1 MB in the beginning and 4.9 GB in the end (delta: -4.0 GB). Peak memory consumption was 4.7 GB. Max. memory is 11.5 GB. [2018-12-09 12:53:39,739 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 12:53:39,739 INFO L168 Benchmark]: CACSL2BoogieTranslator took 337.98 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 98.6 MB). Free memory was 957.1 MB in the beginning and 1.1 GB in the end (delta: -116.6 MB). Peak memory consumption was 37.2 MB. Max. memory is 11.5 GB. [2018-12-09 12:53:39,739 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.64 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.2 MB). Peak memory consumption was 7.2 MB. Max. memory is 11.5 GB. [2018-12-09 12:53:39,739 INFO L168 Benchmark]: Boogie Preprocessor took 24.56 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 12:53:39,739 INFO L168 Benchmark]: RCFGBuilder took 402.46 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 63.5 MB). Peak memory consumption was 63.5 MB. Max. memory is 11.5 GB. [2018-12-09 12:53:39,739 INFO L168 Benchmark]: TraceAbstraction took 275311.50 ms. Allocated memory was 1.1 GB in the beginning and 9.7 GB in the end (delta: 8.6 GB). Free memory was 1.0 GB in the beginning and 5.0 GB in the end (delta: -4.0 GB). Peak memory consumption was 4.6 GB. Max. memory is 11.5 GB. [2018-12-09 12:53:39,740 INFO L168 Benchmark]: Witness Printer took 89.24 ms. Allocated memory is still 9.7 GB. Free memory was 5.0 GB in the beginning and 4.9 GB in the end (delta: 59.3 MB). Peak memory consumption was 59.3 MB. Max. memory is 11.5 GB. [2018-12-09 12:53:39,741 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 337.98 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 98.6 MB). Free memory was 957.1 MB in the beginning and 1.1 GB in the end (delta: -116.6 MB). Peak memory consumption was 37.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 40.64 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.2 MB). Peak memory consumption was 7.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.56 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 402.46 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 63.5 MB). Peak memory consumption was 63.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 275311.50 ms. Allocated memory was 1.1 GB in the beginning and 9.7 GB in the end (delta: 8.6 GB). Free memory was 1.0 GB in the beginning and 5.0 GB in the end (delta: -4.0 GB). Peak memory consumption was 4.6 GB. Max. memory is 11.5 GB. * Witness Printer took 89.24 ms. Allocated memory is still 9.7 GB. Free memory was 5.0 GB in the beginning and 4.9 GB in the end (delta: 59.3 MB). Peak memory consumption was 59.3 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_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0] [L676] -1 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L677] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0] [L678] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L680] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L682] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L683] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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_p2_EAX=0, __unbuffered_p2_EBX=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_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L686] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L687] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L688] -1 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L689] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0] [L690] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_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_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_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_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_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_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_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_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_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_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_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_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_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_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_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_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_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_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_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_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_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_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_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] [L794] -1 pthread_t t768; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_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] [L795] FCALL, FORK -1 pthread_create(&t768, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_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] [L796] -1 pthread_t t769; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_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] [L797] FCALL, FORK -1 pthread_create(&t769, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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] [L798] -1 pthread_t t770; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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] [L799] FCALL, FORK -1 pthread_create(&t770, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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] [L741] 0 y$w_buff1 = y$w_buff0 [L742] 0 y$w_buff0 = 2 [L743] 0 y$w_buff1_used = y$w_buff0_used [L744] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L746] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L747] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L748] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L749] 0 y$r_buff1_thd3 = y$r_buff0_thd3 [L750] 0 y$r_buff0_thd3 = (_Bool)1 [L753] 0 weak$$choice0 = __VERIFIER_nondet_pointer() [L754] 0 weak$$choice2 = __VERIFIER_nondet_pointer() [L755] 0 y$flush_delayed = weak$$choice2 [L756] 0 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L757] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L757] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L757] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L757] 0 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L758] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y=2, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L758] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L759] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y=2, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L759] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L760] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y=2, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L760] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L761] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y=2, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L761] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L762] EXPR 0 weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y=2, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L762] 0 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L763] EXPR 0 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y=2, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L763] 0 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L764] 0 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y=2, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L765] EXPR 0 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y=2, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L765] 0 y = y$flush_delayed ? y$mem_tmp : y [L766] 0 y$flush_delayed = (_Bool)0 [L769] 0 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L772] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L706] 1 z = 1 [L709] 1 x = 1 [L714] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L721] 2 x = 2 [L724] 2 y = 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L727] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L727] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=1, z=1] [L727] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=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=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=1, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=1, z=1] [L727] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L728] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=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=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L728] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L729] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=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=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L729] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L730] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=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=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L730] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L731] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=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=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L731] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L734] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L772] 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) [L773] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L773] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L774] 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_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L774] 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 [L775] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L775] 0 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L776] 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_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L776] 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 [L779] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L801] -1 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L805] 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_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L805] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L805] 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_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L805] -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) [L806] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L806] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L807] 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_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L807] -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 [L808] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L808] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L809] 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_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L809] -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 [L812] -1 weak$$choice0 = __VERIFIER_nondet_pointer() [L813] -1 weak$$choice2 = __VERIFIER_nondet_pointer() [L814] -1 y$flush_delayed = weak$$choice2 [L815] -1 y$mem_tmp = y VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L816] EXPR -1 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L816] -1 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L817] EXPR -1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L817] -1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L818] EXPR -1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L818] -1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L819] EXPR -1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L819] -1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L820] EXPR -1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L820] -1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L821] EXPR -1 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L821] -1 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L822] EXPR -1 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L822] -1 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L823] -1 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L824] EXPR -1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L824] -1 y = y$flush_delayed ? y$mem_tmp : y [L825] -1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 283 locations, 3 error locations. UNSAFE Result, 275.2s OverallTime, 28 OverallIterations, 1 TraceHistogramMax, 50.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 8573 SDtfs, 9264 SDslu, 18389 SDs, 0 SdLazy, 4435 SolverSat, 352 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 228 GetRequests, 63 SyntacticMatches, 28 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=549408occurred in iteration=2, 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: 114.6s AutomataMinimizationTime, 27 MinimizatonAttempts, 834436 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 2926 NumberOfCodeBlocks, 2926 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 2778 ConstructedInterpolants, 0 QuantifiedInterpolants, 736782 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 27 InterpolantComputations, 27 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...