./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix000_power.opt_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_a5a0257f-bd04-402e-ad03-0fa103836382/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a5a0257f-bd04-402e-ad03-0fa103836382/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a5a0257f-bd04-402e-ad03-0fa103836382/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a5a0257f-bd04-402e-ad03-0fa103836382/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix000_power.opt_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_a5a0257f-bd04-402e-ad03-0fa103836382/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a5a0257f-bd04-402e-ad03-0fa103836382/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 e7c439df793427977bd458e6ff02653e28ab85ea .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-0cd3be1 [2018-11-28 13:35:16,991 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 13:35:16,992 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 13:35:17,000 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 13:35:17,000 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 13:35:17,001 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 13:35:17,001 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 13:35:17,002 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 13:35:17,003 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 13:35:17,004 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 13:35:17,005 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 13:35:17,005 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 13:35:17,005 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 13:35:17,006 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 13:35:17,007 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 13:35:17,007 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 13:35:17,008 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 13:35:17,009 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 13:35:17,010 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 13:35:17,011 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 13:35:17,011 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 13:35:17,012 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 13:35:17,014 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 13:35:17,014 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 13:35:17,014 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 13:35:17,015 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 13:35:17,016 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 13:35:17,016 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 13:35:17,016 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 13:35:17,017 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 13:35:17,017 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 13:35:17,018 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 13:35:17,018 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 13:35:17,018 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 13:35:17,019 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 13:35:17,019 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 13:35:17,019 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a5a0257f-bd04-402e-ad03-0fa103836382/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-28 13:35:17,027 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 13:35:17,027 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 13:35:17,028 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 13:35:17,028 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 13:35:17,028 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 13:35:17,029 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 13:35:17,029 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 13:35:17,029 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 13:35:17,029 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 13:35:17,029 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 13:35:17,029 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 13:35:17,030 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 13:35:17,030 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 13:35:17,030 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 13:35:17,030 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 13:35:17,030 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 13:35:17,030 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 13:35:17,031 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 13:35:17,031 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 13:35:17,031 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 13:35:17,031 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 13:35:17,031 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 13:35:17,031 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 13:35:17,031 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 13:35:17,032 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 13:35:17,032 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 13:35:17,032 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 13:35:17,032 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 13:35:17,032 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 13:35:17,032 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 13:35:17,033 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_a5a0257f-bd04-402e-ad03-0fa103836382/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 -> e7c439df793427977bd458e6ff02653e28ab85ea [2018-11-28 13:35:17,058 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 13:35:17,067 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 13:35:17,069 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 13:35:17,070 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 13:35:17,070 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 13:35:17,071 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a5a0257f-bd04-402e-ad03-0fa103836382/bin-2019/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix000_power.opt_false-unreach-call.i [2018-11-28 13:35:17,118 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a5a0257f-bd04-402e-ad03-0fa103836382/bin-2019/uautomizer/data/803e1683a/bd3906201eab4cc4833bb8214e8f9a73/FLAG4925667e9 [2018-11-28 13:35:17,499 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 13:35:17,500 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a5a0257f-bd04-402e-ad03-0fa103836382/sv-benchmarks/c/pthread-wmm/mix000_power.opt_false-unreach-call.i [2018-11-28 13:35:17,511 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a5a0257f-bd04-402e-ad03-0fa103836382/bin-2019/uautomizer/data/803e1683a/bd3906201eab4cc4833bb8214e8f9a73/FLAG4925667e9 [2018-11-28 13:35:17,876 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a5a0257f-bd04-402e-ad03-0fa103836382/bin-2019/uautomizer/data/803e1683a/bd3906201eab4cc4833bb8214e8f9a73 [2018-11-28 13:35:17,877 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 13:35:17,878 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 13:35:17,879 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 13:35:17,879 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 13:35:17,882 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 13:35:17,882 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 01:35:17" (1/1) ... [2018-11-28 13:35:17,884 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d8d89f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:35:17, skipping insertion in model container [2018-11-28 13:35:17,884 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 01:35:17" (1/1) ... [2018-11-28 13:35:17,889 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 13:35:17,917 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 13:35:18,157 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 13:35:18,167 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 13:35:18,270 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 13:35:18,311 INFO L195 MainTranslator]: Completed translation [2018-11-28 13:35:18,312 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:35:18 WrapperNode [2018-11-28 13:35:18,312 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 13:35:18,312 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 13:35:18,312 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 13:35:18,312 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 13:35:18,320 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:35:18" (1/1) ... [2018-11-28 13:35:18,335 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:35:18" (1/1) ... [2018-11-28 13:35:18,359 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 13:35:18,359 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 13:35:18,359 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 13:35:18,359 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 13:35:18,368 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:35:18" (1/1) ... [2018-11-28 13:35:18,368 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:35:18" (1/1) ... [2018-11-28 13:35:18,373 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:35:18" (1/1) ... [2018-11-28 13:35:18,373 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:35:18" (1/1) ... [2018-11-28 13:35:18,386 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:35:18" (1/1) ... [2018-11-28 13:35:18,390 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:35:18" (1/1) ... [2018-11-28 13:35:18,392 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:35:18" (1/1) ... [2018-11-28 13:35:18,396 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 13:35:18,396 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 13:35:18,397 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 13:35:18,397 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 13:35:18,398 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:35:18" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a5a0257f-bd04-402e-ad03-0fa103836382/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-11-28 13:35:18,458 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 13:35:18,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 13:35:18,458 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-11-28 13:35:18,458 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 13:35:18,458 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-11-28 13:35:18,458 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-11-28 13:35:18,458 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-11-28 13:35:18,458 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-11-28 13:35:18,459 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-11-28 13:35:18,459 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 13:35:18,459 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 13:35:18,460 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-11-28 13:35:19,072 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 13:35:19,072 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-28 13:35:19,072 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:35:19 BoogieIcfgContainer [2018-11-28 13:35:19,072 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 13:35:19,073 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 13:35:19,073 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 13:35:19,076 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 13:35:19,076 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 01:35:17" (1/3) ... [2018-11-28 13:35:19,076 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a9ee716 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 01:35:19, skipping insertion in model container [2018-11-28 13:35:19,076 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:35:18" (2/3) ... [2018-11-28 13:35:19,077 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a9ee716 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 01:35:19, skipping insertion in model container [2018-11-28 13:35:19,077 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:35:19" (3/3) ... [2018-11-28 13:35:19,080 INFO L112 eAbstractionObserver]: Analyzing ICFG mix000_power.opt_false-unreach-call.i [2018-11-28 13:35:19,114 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,114 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,114 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,114 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,115 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,115 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,115 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,115 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,115 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,116 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,116 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,116 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,116 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,116 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,116 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,117 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,117 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,117 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,117 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,117 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,117 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,118 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,118 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,118 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,118 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,118 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,118 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,119 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,119 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,119 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,119 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,119 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,119 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,119 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,120 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,120 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,120 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,120 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,120 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,120 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,121 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,121 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,121 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,121 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,121 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,121 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,121 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,122 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,122 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,122 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,122 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,122 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,122 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,123 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,123 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,123 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,123 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,123 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,123 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,124 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,124 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,124 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,124 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,124 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,125 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,125 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,125 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,125 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,125 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,125 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,126 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,126 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,126 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,126 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,126 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,127 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,127 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,127 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,127 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,127 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,127 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,128 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,128 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,128 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,128 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,128 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,129 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,129 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,129 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,129 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,129 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,129 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,130 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,130 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,130 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,130 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,130 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,130 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,131 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,131 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,131 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,134 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,134 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,134 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,135 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,135 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,136 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,136 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,136 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,136 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,136 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,136 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,137 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,137 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,137 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,137 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,137 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,140 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,140 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,140 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,140 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,140 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,140 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,141 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,141 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,141 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,141 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,141 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,141 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,142 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,142 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,142 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,142 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,142 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,142 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,143 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,143 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,143 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,143 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,143 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,143 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,144 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,144 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,144 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,144 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,144 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,144 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,145 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,145 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,145 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,145 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,145 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,145 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,146 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,146 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,146 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,146 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,146 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,146 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,146 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,147 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,147 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,147 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,147 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,147 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,147 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,147 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,147 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,148 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,148 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,148 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,148 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,148 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,148 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,148 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,149 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,149 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,149 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,149 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,149 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,149 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,149 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,149 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,150 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,150 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,150 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,150 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,150 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,151 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,151 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,151 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,151 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,151 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,151 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,151 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,152 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,152 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,152 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,152 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,152 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,152 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,152 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,152 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,153 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,153 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,153 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,153 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,153 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,153 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,153 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,153 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,154 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,154 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,154 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,154 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,154 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,154 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,154 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,155 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet56.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,155 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet56.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,155 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,155 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,155 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet56.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,155 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet56.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:19,164 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-11-28 13:35:19,164 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 13:35:19,171 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-11-28 13:35:19,182 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-11-28 13:35:19,200 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 13:35:19,200 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 13:35:19,200 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 13:35:19,200 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 13:35:19,201 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 13:35:19,201 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 13:35:19,201 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 13:35:19,201 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 13:35:19,201 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 13:35:19,209 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 174places, 227 transitions [2018-11-28 13:35:26,333 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 83128 states. [2018-11-28 13:35:26,334 INFO L276 IsEmpty]: Start isEmpty. Operand 83128 states. [2018-11-28 13:35:26,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-28 13:35:26,341 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:35:26,342 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:35:26,343 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:35:26,349 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:35:26,349 INFO L82 PathProgramCache]: Analyzing trace with hash 164866570, now seen corresponding path program 1 times [2018-11-28 13:35:26,351 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:35:26,352 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:35:26,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:35:26,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:35:26,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:35:26,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:35:26,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:35:26,528 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:35:26,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 13:35:26,531 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 13:35:26,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 13:35:26,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:35:26,542 INFO L87 Difference]: Start difference. First operand 83128 states. Second operand 4 states. [2018-11-28 13:35:27,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:35:27,863 INFO L93 Difference]: Finished difference Result 150584 states and 603161 transitions. [2018-11-28 13:35:27,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 13:35:27,864 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2018-11-28 13:35:27,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:35:28,781 INFO L225 Difference]: With dead ends: 150584 [2018-11-28 13:35:28,781 INFO L226 Difference]: Without dead ends: 105840 [2018-11-28 13:35:28,783 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-11-28 13:35:30,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105840 states. [2018-11-28 13:35:31,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105840 to 61236. [2018-11-28 13:35:31,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61236 states. [2018-11-28 13:35:31,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61236 states to 61236 states and 248291 transitions. [2018-11-28 13:35:31,469 INFO L78 Accepts]: Start accepts. Automaton has 61236 states and 248291 transitions. Word has length 39 [2018-11-28 13:35:31,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:35:31,470 INFO L480 AbstractCegarLoop]: Abstraction has 61236 states and 248291 transitions. [2018-11-28 13:35:31,470 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 13:35:31,470 INFO L276 IsEmpty]: Start isEmpty. Operand 61236 states and 248291 transitions. [2018-11-28 13:35:31,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-28 13:35:31,479 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:35:31,479 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:35:31,480 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:35:31,480 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:35:31,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1121119524, now seen corresponding path program 1 times [2018-11-28 13:35:31,480 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:35:31,480 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:35:31,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:35:31,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:35:31,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:35:31,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:35:31,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:35:31,556 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:35:31,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 13:35:31,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 13:35:31,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 13:35:31,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:35:31,558 INFO L87 Difference]: Start difference. First operand 61236 states and 248291 transitions. Second operand 4 states. [2018-11-28 13:35:31,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:35:31,735 INFO L93 Difference]: Finished difference Result 14310 states and 48364 transitions. [2018-11-28 13:35:31,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 13:35:31,736 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2018-11-28 13:35:31,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:35:31,780 INFO L225 Difference]: With dead ends: 14310 [2018-11-28 13:35:31,780 INFO L226 Difference]: Without dead ends: 11490 [2018-11-28 13:35:31,781 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-11-28 13:35:31,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11490 states. [2018-11-28 13:35:31,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11490 to 11490. [2018-11-28 13:35:31,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11490 states. [2018-11-28 13:35:31,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11490 states to 11490 states and 37855 transitions. [2018-11-28 13:35:31,995 INFO L78 Accepts]: Start accepts. Automaton has 11490 states and 37855 transitions. Word has length 47 [2018-11-28 13:35:31,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:35:31,995 INFO L480 AbstractCegarLoop]: Abstraction has 11490 states and 37855 transitions. [2018-11-28 13:35:31,995 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 13:35:31,995 INFO L276 IsEmpty]: Start isEmpty. Operand 11490 states and 37855 transitions. [2018-11-28 13:35:31,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-28 13:35:31,997 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:35:31,997 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:35:31,997 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:35:31,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:35:31,997 INFO L82 PathProgramCache]: Analyzing trace with hash -1095203171, now seen corresponding path program 1 times [2018-11-28 13:35:31,997 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:35:31,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:35:32,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:35:32,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:35:32,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:35:32,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:35:32,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:35:32,056 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:35:32,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:35:32,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:35:32,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:35:32,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:35:32,057 INFO L87 Difference]: Start difference. First operand 11490 states and 37855 transitions. Second operand 5 states. [2018-11-28 13:35:32,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:35:32,410 INFO L93 Difference]: Finished difference Result 23360 states and 75856 transitions. [2018-11-28 13:35:32,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 13:35:32,411 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2018-11-28 13:35:32,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:35:32,452 INFO L225 Difference]: With dead ends: 23360 [2018-11-28 13:35:32,452 INFO L226 Difference]: Without dead ends: 23285 [2018-11-28 13:35:32,452 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-11-28 13:35:32,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23285 states. [2018-11-28 13:35:32,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23285 to 15417. [2018-11-28 13:35:32,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15417 states. [2018-11-28 13:35:32,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15417 states to 15417 states and 49310 transitions. [2018-11-28 13:35:32,700 INFO L78 Accepts]: Start accepts. Automaton has 15417 states and 49310 transitions. Word has length 48 [2018-11-28 13:35:32,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:35:32,701 INFO L480 AbstractCegarLoop]: Abstraction has 15417 states and 49310 transitions. [2018-11-28 13:35:32,701 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:35:32,701 INFO L276 IsEmpty]: Start isEmpty. Operand 15417 states and 49310 transitions. [2018-11-28 13:35:32,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-28 13:35:32,703 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:35:32,704 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:35:32,704 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:35:32,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:35:32,704 INFO L82 PathProgramCache]: Analyzing trace with hash 659319747, now seen corresponding path program 1 times [2018-11-28 13:35:32,704 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:35:32,704 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:35:32,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:35:32,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:35:32,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:35:32,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:35:32,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:35:32,765 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:35:32,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:35:32,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:35:32,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:35:32,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:35:32,765 INFO L87 Difference]: Start difference. First operand 15417 states and 49310 transitions. Second operand 3 states. [2018-11-28 13:35:32,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:35:32,907 INFO L93 Difference]: Finished difference Result 28677 states and 90548 transitions. [2018-11-28 13:35:32,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:35:32,908 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-11-28 13:35:32,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:35:32,963 INFO L225 Difference]: With dead ends: 28677 [2018-11-28 13:35:32,963 INFO L226 Difference]: Without dead ends: 28673 [2018-11-28 13:35:32,964 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-11-28 13:35:33,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28673 states. [2018-11-28 13:35:33,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28673 to 24152. [2018-11-28 13:35:33,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24152 states. [2018-11-28 13:35:33,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24152 states to 24152 states and 76316 transitions. [2018-11-28 13:35:33,481 INFO L78 Accepts]: Start accepts. Automaton has 24152 states and 76316 transitions. Word has length 50 [2018-11-28 13:35:33,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:35:33,482 INFO L480 AbstractCegarLoop]: Abstraction has 24152 states and 76316 transitions. [2018-11-28 13:35:33,482 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:35:33,482 INFO L276 IsEmpty]: Start isEmpty. Operand 24152 states and 76316 transitions. [2018-11-28 13:35:33,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-28 13:35:33,485 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:35:33,485 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:35:33,485 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:35:33,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:35:33,485 INFO L82 PathProgramCache]: Analyzing trace with hash 669168142, now seen corresponding path program 1 times [2018-11-28 13:35:33,485 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:35:33,485 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:35:33,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:35:33,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:35:33,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:35:33,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:35:33,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:35:33,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:35:33,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 13:35:33,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 13:35:33,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 13:35:33,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 13:35:33,554 INFO L87 Difference]: Start difference. First operand 24152 states and 76316 transitions. Second operand 6 states. [2018-11-28 13:35:34,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:35:34,115 INFO L93 Difference]: Finished difference Result 33838 states and 105314 transitions. [2018-11-28 13:35:34,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 13:35:34,116 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2018-11-28 13:35:34,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:35:34,167 INFO L225 Difference]: With dead ends: 33838 [2018-11-28 13:35:34,167 INFO L226 Difference]: Without dead ends: 33741 [2018-11-28 13:35:34,167 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-11-28 13:35:34,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33741 states. [2018-11-28 13:35:34,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33741 to 23973. [2018-11-28 13:35:34,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23973 states. [2018-11-28 13:35:34,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23973 states to 23973 states and 75822 transitions. [2018-11-28 13:35:34,529 INFO L78 Accepts]: Start accepts. Automaton has 23973 states and 75822 transitions. Word has length 54 [2018-11-28 13:35:34,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:35:34,530 INFO L480 AbstractCegarLoop]: Abstraction has 23973 states and 75822 transitions. [2018-11-28 13:35:34,530 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 13:35:34,530 INFO L276 IsEmpty]: Start isEmpty. Operand 23973 states and 75822 transitions. [2018-11-28 13:35:34,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-28 13:35:34,537 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:35:34,537 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:35:34,537 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:35:34,537 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:35:34,537 INFO L82 PathProgramCache]: Analyzing trace with hash -494140957, now seen corresponding path program 1 times [2018-11-28 13:35:34,537 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:35:34,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:35:34,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:35:34,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:35:34,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:35:34,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:35:34,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:35:34,607 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:35:34,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 13:35:34,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 13:35:34,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 13:35:34,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:35:34,608 INFO L87 Difference]: Start difference. First operand 23973 states and 75822 transitions. Second operand 4 states. [2018-11-28 13:35:34,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:35:34,825 INFO L93 Difference]: Finished difference Result 30737 states and 97932 transitions. [2018-11-28 13:35:34,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 13:35:34,826 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2018-11-28 13:35:34,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:35:34,873 INFO L225 Difference]: With dead ends: 30737 [2018-11-28 13:35:34,873 INFO L226 Difference]: Without dead ends: 30737 [2018-11-28 13:35:34,873 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:35:34,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30737 states. [2018-11-28 13:35:35,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30737 to 27609. [2018-11-28 13:35:35,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27609 states. [2018-11-28 13:35:35,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27609 states to 27609 states and 87450 transitions. [2018-11-28 13:35:35,215 INFO L78 Accepts]: Start accepts. Automaton has 27609 states and 87450 transitions. Word has length 64 [2018-11-28 13:35:35,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:35:35,215 INFO L480 AbstractCegarLoop]: Abstraction has 27609 states and 87450 transitions. [2018-11-28 13:35:35,215 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 13:35:35,216 INFO L276 IsEmpty]: Start isEmpty. Operand 27609 states and 87450 transitions. [2018-11-28 13:35:35,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-28 13:35:35,222 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:35:35,222 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:35:35,222 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:35:35,222 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:35:35,222 INFO L82 PathProgramCache]: Analyzing trace with hash 1248669378, now seen corresponding path program 1 times [2018-11-28 13:35:35,222 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:35:35,222 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:35:35,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:35:35,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:35:35,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:35:35,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:35:35,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:35:35,292 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:35:35,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 13:35:35,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 13:35:35,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 13:35:35,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 13:35:35,292 INFO L87 Difference]: Start difference. First operand 27609 states and 87450 transitions. Second operand 6 states. [2018-11-28 13:35:36,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:35:36,047 INFO L93 Difference]: Finished difference Result 65702 states and 204771 transitions. [2018-11-28 13:35:36,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-28 13:35:36,047 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2018-11-28 13:35:36,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:35:36,145 INFO L225 Difference]: With dead ends: 65702 [2018-11-28 13:35:36,146 INFO L226 Difference]: Without dead ends: 65638 [2018-11-28 13:35:36,146 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-11-28 13:35:36,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65638 states. [2018-11-28 13:35:36,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65638 to 39277. [2018-11-28 13:35:36,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39277 states. [2018-11-28 13:35:36,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39277 states to 39277 states and 121531 transitions. [2018-11-28 13:35:36,783 INFO L78 Accepts]: Start accepts. Automaton has 39277 states and 121531 transitions. Word has length 64 [2018-11-28 13:35:36,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:35:36,784 INFO L480 AbstractCegarLoop]: Abstraction has 39277 states and 121531 transitions. [2018-11-28 13:35:36,784 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 13:35:36,784 INFO L276 IsEmpty]: Start isEmpty. Operand 39277 states and 121531 transitions. [2018-11-28 13:35:36,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-28 13:35:36,795 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:35:36,795 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:35:36,795 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:35:36,795 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:35:36,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1121736755, now seen corresponding path program 1 times [2018-11-28 13:35:36,795 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:35:36,795 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:35:36,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:35:36,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:35:36,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:35:36,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:35:36,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:35:36,839 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:35:36,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:35:36,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:35:36,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:35:36,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:35:36,840 INFO L87 Difference]: Start difference. First operand 39277 states and 121531 transitions. Second operand 3 states. [2018-11-28 13:35:36,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:35:36,990 INFO L93 Difference]: Finished difference Result 44930 states and 137016 transitions. [2018-11-28 13:35:36,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:35:36,991 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2018-11-28 13:35:36,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:35:37,052 INFO L225 Difference]: With dead ends: 44930 [2018-11-28 13:35:37,052 INFO L226 Difference]: Without dead ends: 44930 [2018-11-28 13:35:37,052 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-11-28 13:35:37,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44930 states. [2018-11-28 13:35:37,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44930 to 38917. [2018-11-28 13:35:37,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38917 states. [2018-11-28 13:35:37,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38917 states to 38917 states and 117881 transitions. [2018-11-28 13:35:37,596 INFO L78 Accepts]: Start accepts. Automaton has 38917 states and 117881 transitions. Word has length 70 [2018-11-28 13:35:37,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:35:37,597 INFO L480 AbstractCegarLoop]: Abstraction has 38917 states and 117881 transitions. [2018-11-28 13:35:37,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:35:37,597 INFO L276 IsEmpty]: Start isEmpty. Operand 38917 states and 117881 transitions. [2018-11-28 13:35:37,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-28 13:35:37,610 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:35:37,610 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:35:37,610 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:35:37,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:35:37,610 INFO L82 PathProgramCache]: Analyzing trace with hash 729490707, now seen corresponding path program 1 times [2018-11-28 13:35:37,611 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:35:37,611 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:35:37,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:35:37,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:35:37,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:35:37,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:35:37,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:35:37,761 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:35:37,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 13:35:37,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 13:35:37,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 13:35:37,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-28 13:35:37,762 INFO L87 Difference]: Start difference. First operand 38917 states and 117881 transitions. Second operand 7 states. [2018-11-28 13:35:38,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:35:38,867 INFO L93 Difference]: Finished difference Result 56282 states and 170059 transitions. [2018-11-28 13:35:38,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 13:35:38,868 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 71 [2018-11-28 13:35:38,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:35:38,971 INFO L225 Difference]: With dead ends: 56282 [2018-11-28 13:35:38,971 INFO L226 Difference]: Without dead ends: 55978 [2018-11-28 13:35:38,971 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-11-28 13:35:39,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55978 states. [2018-11-28 13:35:39,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55978 to 47673. [2018-11-28 13:35:39,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47673 states. [2018-11-28 13:35:39,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47673 states to 47673 states and 144132 transitions. [2018-11-28 13:35:39,932 INFO L78 Accepts]: Start accepts. Automaton has 47673 states and 144132 transitions. Word has length 71 [2018-11-28 13:35:39,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:35:39,932 INFO L480 AbstractCegarLoop]: Abstraction has 47673 states and 144132 transitions. [2018-11-28 13:35:39,932 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 13:35:39,932 INFO L276 IsEmpty]: Start isEmpty. Operand 47673 states and 144132 transitions. [2018-11-28 13:35:39,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-28 13:35:39,949 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:35:39,950 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:35:39,950 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:35:39,950 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:35:39,950 INFO L82 PathProgramCache]: Analyzing trace with hash -1067460652, now seen corresponding path program 1 times [2018-11-28 13:35:39,950 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:35:39,951 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:35:39,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:35:39,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:35:39,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:35:39,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:35:40,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:35:40,025 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:35:40,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:35:40,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:35:40,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:35:40,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:35:40,026 INFO L87 Difference]: Start difference. First operand 47673 states and 144132 transitions. Second operand 5 states. [2018-11-28 13:35:40,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:35:40,082 INFO L93 Difference]: Finished difference Result 13173 states and 32973 transitions. [2018-11-28 13:35:40,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 13:35:40,083 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2018-11-28 13:35:40,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:35:40,094 INFO L225 Difference]: With dead ends: 13173 [2018-11-28 13:35:40,094 INFO L226 Difference]: Without dead ends: 11053 [2018-11-28 13:35:40,094 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-11-28 13:35:40,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11053 states. [2018-11-28 13:35:40,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11053 to 8482. [2018-11-28 13:35:40,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8482 states. [2018-11-28 13:35:40,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8482 states to 8482 states and 21145 transitions. [2018-11-28 13:35:40,196 INFO L78 Accepts]: Start accepts. Automaton has 8482 states and 21145 transitions. Word has length 71 [2018-11-28 13:35:40,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:35:40,197 INFO L480 AbstractCegarLoop]: Abstraction has 8482 states and 21145 transitions. [2018-11-28 13:35:40,197 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:35:40,197 INFO L276 IsEmpty]: Start isEmpty. Operand 8482 states and 21145 transitions. [2018-11-28 13:35:40,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-28 13:35:40,206 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:35:40,206 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:35:40,206 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:35:40,206 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:35:40,206 INFO L82 PathProgramCache]: Analyzing trace with hash -865171650, now seen corresponding path program 1 times [2018-11-28 13:35:40,207 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:35:40,207 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:35:40,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:35:40,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:35:40,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:35:40,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:35:40,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:35:40,286 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:35:40,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:35:40,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:35:40,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:35:40,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:35:40,287 INFO L87 Difference]: Start difference. First operand 8482 states and 21145 transitions. Second operand 5 states. [2018-11-28 13:35:40,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:35:40,565 INFO L93 Difference]: Finished difference Result 11201 states and 26966 transitions. [2018-11-28 13:35:40,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 13:35:40,565 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2018-11-28 13:35:40,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:35:40,575 INFO L225 Difference]: With dead ends: 11201 [2018-11-28 13:35:40,575 INFO L226 Difference]: Without dead ends: 11201 [2018-11-28 13:35:40,576 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-28 13:35:40,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11201 states. [2018-11-28 13:35:40,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11201 to 10096. [2018-11-28 13:35:40,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10096 states. [2018-11-28 13:35:40,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10096 states to 10096 states and 24606 transitions. [2018-11-28 13:35:40,686 INFO L78 Accepts]: Start accepts. Automaton has 10096 states and 24606 transitions. Word has length 99 [2018-11-28 13:35:40,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:35:40,686 INFO L480 AbstractCegarLoop]: Abstraction has 10096 states and 24606 transitions. [2018-11-28 13:35:40,686 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:35:40,687 INFO L276 IsEmpty]: Start isEmpty. Operand 10096 states and 24606 transitions. [2018-11-28 13:35:40,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-28 13:35:40,697 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:35:40,697 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:35:40,698 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:35:40,698 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:35:40,698 INFO L82 PathProgramCache]: Analyzing trace with hash -2088421946, now seen corresponding path program 2 times [2018-11-28 13:35:40,698 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:35:40,698 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:35:40,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:35:40,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:35:40,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:35:40,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:35:40,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:35:40,805 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:35:40,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 13:35:40,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 13:35:40,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 13:35:40,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-28 13:35:40,806 INFO L87 Difference]: Start difference. First operand 10096 states and 24606 transitions. Second operand 6 states. [2018-11-28 13:35:41,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:35:41,081 INFO L93 Difference]: Finished difference Result 12489 states and 30149 transitions. [2018-11-28 13:35:41,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 13:35:41,082 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2018-11-28 13:35:41,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:35:41,093 INFO L225 Difference]: With dead ends: 12489 [2018-11-28 13:35:41,093 INFO L226 Difference]: Without dead ends: 12457 [2018-11-28 13:35:41,093 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-11-28 13:35:41,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12457 states. [2018-11-28 13:35:41,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12457 to 10637. [2018-11-28 13:35:41,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10637 states. [2018-11-28 13:35:41,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10637 states to 10637 states and 25802 transitions. [2018-11-28 13:35:41,208 INFO L78 Accepts]: Start accepts. Automaton has 10637 states and 25802 transitions. Word has length 99 [2018-11-28 13:35:41,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:35:41,209 INFO L480 AbstractCegarLoop]: Abstraction has 10637 states and 25802 transitions. [2018-11-28 13:35:41,209 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 13:35:41,209 INFO L276 IsEmpty]: Start isEmpty. Operand 10637 states and 25802 transitions. [2018-11-28 13:35:41,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-28 13:35:41,223 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:35:41,223 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:35:41,223 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:35:41,223 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:35:41,224 INFO L82 PathProgramCache]: Analyzing trace with hash 409593991, now seen corresponding path program 1 times [2018-11-28 13:35:41,224 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:35:41,224 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:35:41,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:35:41,226 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:35:41,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:35:41,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:35:41,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:35:41,341 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:35:41,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 13:35:41,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 13:35:41,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 13:35:41,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-28 13:35:41,343 INFO L87 Difference]: Start difference. First operand 10637 states and 25802 transitions. Second operand 7 states. [2018-11-28 13:35:41,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:35:41,472 INFO L93 Difference]: Finished difference Result 14153 states and 34381 transitions. [2018-11-28 13:35:41,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 13:35:41,473 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 99 [2018-11-28 13:35:41,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:35:41,485 INFO L225 Difference]: With dead ends: 14153 [2018-11-28 13:35:41,486 INFO L226 Difference]: Without dead ends: 14153 [2018-11-28 13:35:41,486 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-11-28 13:35:41,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14153 states. [2018-11-28 13:35:41,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14153 to 11679. [2018-11-28 13:35:41,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11679 states. [2018-11-28 13:35:41,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11679 states to 11679 states and 28441 transitions. [2018-11-28 13:35:41,618 INFO L78 Accepts]: Start accepts. Automaton has 11679 states and 28441 transitions. Word has length 99 [2018-11-28 13:35:41,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:35:41,619 INFO L480 AbstractCegarLoop]: Abstraction has 11679 states and 28441 transitions. [2018-11-28 13:35:41,619 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 13:35:41,619 INFO L276 IsEmpty]: Start isEmpty. Operand 11679 states and 28441 transitions. [2018-11-28 13:35:41,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-28 13:35:41,630 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:35:41,630 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:35:41,630 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:35:41,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:35:41,631 INFO L82 PathProgramCache]: Analyzing trace with hash -434877880, now seen corresponding path program 1 times [2018-11-28 13:35:41,631 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:35:41,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:35:41,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:35:41,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:35:41,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:35:41,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:35:41,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:35:41,702 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:35:41,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:35:41,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:35:41,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:35:41,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:35:41,703 INFO L87 Difference]: Start difference. First operand 11679 states and 28441 transitions. Second operand 3 states. [2018-11-28 13:35:41,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:35:41,749 INFO L93 Difference]: Finished difference Result 11615 states and 28185 transitions. [2018-11-28 13:35:41,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:35:41,749 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2018-11-28 13:35:41,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:35:41,760 INFO L225 Difference]: With dead ends: 11615 [2018-11-28 13:35:41,760 INFO L226 Difference]: Without dead ends: 11583 [2018-11-28 13:35:41,760 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:35:41,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11583 states. [2018-11-28 13:35:41,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11583 to 10304. [2018-11-28 13:35:41,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10304 states. [2018-11-28 13:35:41,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10304 states to 10304 states and 25166 transitions. [2018-11-28 13:35:41,876 INFO L78 Accepts]: Start accepts. Automaton has 10304 states and 25166 transitions. Word has length 99 [2018-11-28 13:35:41,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:35:41,876 INFO L480 AbstractCegarLoop]: Abstraction has 10304 states and 25166 transitions. [2018-11-28 13:35:41,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:35:41,876 INFO L276 IsEmpty]: Start isEmpty. Operand 10304 states and 25166 transitions. [2018-11-28 13:35:41,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-11-28 13:35:41,886 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:35:41,886 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:35:41,887 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:35:41,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:35:41,887 INFO L82 PathProgramCache]: Analyzing trace with hash -1234396919, now seen corresponding path program 1 times [2018-11-28 13:35:41,887 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:35:41,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:35:41,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:35:41,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:35:41,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:35:41,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:35:42,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:35:42,025 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:35:42,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 13:35:42,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 13:35:42,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 13:35:42,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-28 13:35:42,026 INFO L87 Difference]: Start difference. First operand 10304 states and 25166 transitions. Second operand 7 states. [2018-11-28 13:35:42,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:35:42,409 INFO L93 Difference]: Finished difference Result 16181 states and 37681 transitions. [2018-11-28 13:35:42,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 13:35:42,410 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 101 [2018-11-28 13:35:42,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:35:42,424 INFO L225 Difference]: With dead ends: 16181 [2018-11-28 13:35:42,424 INFO L226 Difference]: Without dead ends: 16181 [2018-11-28 13:35:42,424 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2018-11-28 13:35:42,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16181 states. [2018-11-28 13:35:42,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16181 to 13240. [2018-11-28 13:35:42,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13240 states. [2018-11-28 13:35:42,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13240 states to 13240 states and 31561 transitions. [2018-11-28 13:35:42,581 INFO L78 Accepts]: Start accepts. Automaton has 13240 states and 31561 transitions. Word has length 101 [2018-11-28 13:35:42,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:35:42,581 INFO L480 AbstractCegarLoop]: Abstraction has 13240 states and 31561 transitions. [2018-11-28 13:35:42,581 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 13:35:42,581 INFO L276 IsEmpty]: Start isEmpty. Operand 13240 states and 31561 transitions. [2018-11-28 13:35:42,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-11-28 13:35:42,595 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:35:42,595 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:35:42,596 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:35:42,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:35:42,596 INFO L82 PathProgramCache]: Analyzing trace with hash -1023046006, now seen corresponding path program 1 times [2018-11-28 13:35:42,596 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:35:42,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:35:42,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:35:42,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:35:42,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:35:42,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:35:42,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:35:42,674 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:35:42,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 13:35:42,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 13:35:42,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 13:35:42,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-28 13:35:42,675 INFO L87 Difference]: Start difference. First operand 13240 states and 31561 transitions. Second operand 7 states. [2018-11-28 13:35:42,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:35:42,987 INFO L93 Difference]: Finished difference Result 13628 states and 32382 transitions. [2018-11-28 13:35:42,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 13:35:42,988 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 101 [2018-11-28 13:35:42,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:35:43,001 INFO L225 Difference]: With dead ends: 13628 [2018-11-28 13:35:43,001 INFO L226 Difference]: Without dead ends: 13628 [2018-11-28 13:35:43,001 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-11-28 13:35:43,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13628 states. [2018-11-28 13:35:43,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13628 to 13145. [2018-11-28 13:35:43,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13145 states. [2018-11-28 13:35:43,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13145 states to 13145 states and 31299 transitions. [2018-11-28 13:35:43,143 INFO L78 Accepts]: Start accepts. Automaton has 13145 states and 31299 transitions. Word has length 101 [2018-11-28 13:35:43,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:35:43,144 INFO L480 AbstractCegarLoop]: Abstraction has 13145 states and 31299 transitions. [2018-11-28 13:35:43,144 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 13:35:43,144 INFO L276 IsEmpty]: Start isEmpty. Operand 13145 states and 31299 transitions. [2018-11-28 13:35:43,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-11-28 13:35:43,157 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:35:43,157 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:35:43,157 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:35:43,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:35:43,157 INFO L82 PathProgramCache]: Analyzing trace with hash -1548947767, now seen corresponding path program 1 times [2018-11-28 13:35:43,157 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:35:43,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:35:43,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:35:43,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:35:43,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:35:43,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:35:43,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:35:43,234 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:35:43,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 13:35:43,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 13:35:43,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 13:35:43,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 13:35:43,235 INFO L87 Difference]: Start difference. First operand 13145 states and 31299 transitions. Second operand 6 states. [2018-11-28 13:35:43,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:35:43,588 INFO L93 Difference]: Finished difference Result 17991 states and 42789 transitions. [2018-11-28 13:35:43,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 13:35:43,589 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 101 [2018-11-28 13:35:43,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:35:43,605 INFO L225 Difference]: With dead ends: 17991 [2018-11-28 13:35:43,606 INFO L226 Difference]: Without dead ends: 17991 [2018-11-28 13:35:43,606 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-28 13:35:43,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17991 states. [2018-11-28 13:35:43,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17991 to 16167. [2018-11-28 13:35:43,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16167 states. [2018-11-28 13:35:43,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16167 states to 16167 states and 38582 transitions. [2018-11-28 13:35:43,779 INFO L78 Accepts]: Start accepts. Automaton has 16167 states and 38582 transitions. Word has length 101 [2018-11-28 13:35:43,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:35:43,779 INFO L480 AbstractCegarLoop]: Abstraction has 16167 states and 38582 transitions. [2018-11-28 13:35:43,779 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 13:35:43,779 INFO L276 IsEmpty]: Start isEmpty. Operand 16167 states and 38582 transitions. [2018-11-28 13:35:43,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-11-28 13:35:43,794 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:35:43,794 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:35:43,795 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:35:43,795 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:35:43,795 INFO L82 PathProgramCache]: Analyzing trace with hash -2059481944, now seen corresponding path program 1 times [2018-11-28 13:35:43,795 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:35:43,795 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:35:43,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:35:43,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:35:43,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:35:43,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:35:43,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:35:43,857 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:35:43,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 13:35:43,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 13:35:43,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 13:35:43,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:35:43,858 INFO L87 Difference]: Start difference. First operand 16167 states and 38582 transitions. Second operand 4 states. [2018-11-28 13:35:44,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:35:44,150 INFO L93 Difference]: Finished difference Result 16311 states and 38942 transitions. [2018-11-28 13:35:44,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 13:35:44,150 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2018-11-28 13:35:44,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:35:44,165 INFO L225 Difference]: With dead ends: 16311 [2018-11-28 13:35:44,165 INFO L226 Difference]: Without dead ends: 16279 [2018-11-28 13:35:44,166 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-11-28 13:35:44,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16279 states. [2018-11-28 13:35:44,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16279 to 15621. [2018-11-28 13:35:44,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15621 states. [2018-11-28 13:35:44,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15621 states to 15621 states and 37337 transitions. [2018-11-28 13:35:44,330 INFO L78 Accepts]: Start accepts. Automaton has 15621 states and 37337 transitions. Word has length 101 [2018-11-28 13:35:44,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:35:44,330 INFO L480 AbstractCegarLoop]: Abstraction has 15621 states and 37337 transitions. [2018-11-28 13:35:44,330 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 13:35:44,330 INFO L276 IsEmpty]: Start isEmpty. Operand 15621 states and 37337 transitions. [2018-11-28 13:35:44,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-11-28 13:35:44,344 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:35:44,344 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:35:44,344 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:35:44,344 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:35:44,345 INFO L82 PathProgramCache]: Analyzing trace with hash 438533993, now seen corresponding path program 1 times [2018-11-28 13:35:44,345 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:35:44,345 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:35:44,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:35:44,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:35:44,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:35:44,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:35:44,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:35:44,394 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:35:44,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:35:44,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:35:44,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:35:44,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:35:44,395 INFO L87 Difference]: Start difference. First operand 15621 states and 37337 transitions. Second operand 3 states. [2018-11-28 13:35:44,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:35:44,445 INFO L93 Difference]: Finished difference Result 19085 states and 45490 transitions. [2018-11-28 13:35:44,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:35:44,446 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2018-11-28 13:35:44,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:35:44,464 INFO L225 Difference]: With dead ends: 19085 [2018-11-28 13:35:44,464 INFO L226 Difference]: Without dead ends: 19085 [2018-11-28 13:35:44,464 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-11-28 13:35:44,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19085 states. [2018-11-28 13:35:44,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19085 to 19017. [2018-11-28 13:35:44,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19017 states. [2018-11-28 13:35:44,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19017 states to 19017 states and 45339 transitions. [2018-11-28 13:35:44,659 INFO L78 Accepts]: Start accepts. Automaton has 19017 states and 45339 transitions. Word has length 101 [2018-11-28 13:35:44,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:35:44,659 INFO L480 AbstractCegarLoop]: Abstraction has 19017 states and 45339 transitions. [2018-11-28 13:35:44,659 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:35:44,660 INFO L276 IsEmpty]: Start isEmpty. Operand 19017 states and 45339 transitions. [2018-11-28 13:35:44,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-11-28 13:35:44,677 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:35:44,677 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:35:44,677 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:35:44,677 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:35:44,678 INFO L82 PathProgramCache]: Analyzing trace with hash 469553800, now seen corresponding path program 1 times [2018-11-28 13:35:44,678 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:35:44,678 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:35:44,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:35:44,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:35:44,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:35:44,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:35:44,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:35:44,750 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:35:44,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 13:35:44,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 13:35:44,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 13:35:44,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:35:44,751 INFO L87 Difference]: Start difference. First operand 19017 states and 45339 transitions. Second operand 4 states. [2018-11-28 13:35:44,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:35:44,978 INFO L93 Difference]: Finished difference Result 19307 states and 45707 transitions. [2018-11-28 13:35:44,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 13:35:44,979 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2018-11-28 13:35:44,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:35:44,997 INFO L225 Difference]: With dead ends: 19307 [2018-11-28 13:35:44,997 INFO L226 Difference]: Without dead ends: 19307 [2018-11-28 13:35:44,998 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:35:45,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19307 states. [2018-11-28 13:35:45,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19307 to 19080. [2018-11-28 13:35:45,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19080 states. [2018-11-28 13:35:45,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19080 states to 19080 states and 45223 transitions. [2018-11-28 13:35:45,193 INFO L78 Accepts]: Start accepts. Automaton has 19080 states and 45223 transitions. Word has length 101 [2018-11-28 13:35:45,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:35:45,193 INFO L480 AbstractCegarLoop]: Abstraction has 19080 states and 45223 transitions. [2018-11-28 13:35:45,194 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 13:35:45,194 INFO L276 IsEmpty]: Start isEmpty. Operand 19080 states and 45223 transitions. [2018-11-28 13:35:45,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-11-28 13:35:45,212 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:35:45,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-28 13:35:45,212 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:35:45,212 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:35:45,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1107880064, now seen corresponding path program 2 times [2018-11-28 13:35:45,213 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:35:45,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:35:45,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:35:45,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:35:45,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:35:45,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:35:45,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:35:45,285 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:35:45,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:35:45,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:35:45,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:35:45,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:35:45,285 INFO L87 Difference]: Start difference. First operand 19080 states and 45223 transitions. Second operand 5 states. [2018-11-28 13:35:45,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:35:45,603 INFO L93 Difference]: Finished difference Result 19753 states and 46589 transitions. [2018-11-28 13:35:45,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 13:35:45,604 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 101 [2018-11-28 13:35:45,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:35:45,624 INFO L225 Difference]: With dead ends: 19753 [2018-11-28 13:35:45,624 INFO L226 Difference]: Without dead ends: 19753 [2018-11-28 13:35:45,624 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-28 13:35:45,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19753 states. [2018-11-28 13:35:45,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19753 to 19082. [2018-11-28 13:35:45,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19082 states. [2018-11-28 13:35:45,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19082 states to 19082 states and 45153 transitions. [2018-11-28 13:35:45,821 INFO L78 Accepts]: Start accepts. Automaton has 19082 states and 45153 transitions. Word has length 101 [2018-11-28 13:35:45,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:35:45,821 INFO L480 AbstractCegarLoop]: Abstraction has 19082 states and 45153 transitions. [2018-11-28 13:35:45,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:35:45,821 INFO L276 IsEmpty]: Start isEmpty. Operand 19082 states and 45153 transitions. [2018-11-28 13:35:45,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-11-28 13:35:45,850 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:35:45,850 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:35:45,850 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:35:45,850 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:35:45,850 INFO L82 PathProgramCache]: Analyzing trace with hash -405592084, now seen corresponding path program 3 times [2018-11-28 13:35:45,851 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:35:45,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:35:45,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:35:45,852 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:35:45,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:35:45,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:35:45,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:35:45,916 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:35:45,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 13:35:45,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 13:35:45,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 13:35:45,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 13:35:45,917 INFO L87 Difference]: Start difference. First operand 19082 states and 45153 transitions. Second operand 6 states. [2018-11-28 13:35:46,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:35:46,211 INFO L93 Difference]: Finished difference Result 22023 states and 51919 transitions. [2018-11-28 13:35:46,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 13:35:46,212 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 101 [2018-11-28 13:35:46,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:35:46,233 INFO L225 Difference]: With dead ends: 22023 [2018-11-28 13:35:46,233 INFO L226 Difference]: Without dead ends: 22023 [2018-11-28 13:35:46,234 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-28 13:35:46,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22023 states. [2018-11-28 13:35:46,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22023 to 19315. [2018-11-28 13:35:46,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19315 states. [2018-11-28 13:35:46,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19315 states to 19315 states and 45676 transitions. [2018-11-28 13:35:46,450 INFO L78 Accepts]: Start accepts. Automaton has 19315 states and 45676 transitions. Word has length 101 [2018-11-28 13:35:46,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:35:46,451 INFO L480 AbstractCegarLoop]: Abstraction has 19315 states and 45676 transitions. [2018-11-28 13:35:46,451 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 13:35:46,451 INFO L276 IsEmpty]: Start isEmpty. Operand 19315 states and 45676 transitions. [2018-11-28 13:35:46,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-11-28 13:35:46,470 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:35:46,470 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:35:46,470 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:35:46,470 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:35:46,471 INFO L82 PathProgramCache]: Analyzing trace with hash 378185964, now seen corresponding path program 4 times [2018-11-28 13:35:46,471 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:35:46,471 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:35:46,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:35:46,472 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:35:46,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:35:46,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:35:46,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:35:46,524 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:35:46,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:35:46,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:35:46,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:35:46,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:35:46,525 INFO L87 Difference]: Start difference. First operand 19315 states and 45676 transitions. Second operand 5 states. [2018-11-28 13:35:46,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:35:46,738 INFO L93 Difference]: Finished difference Result 21149 states and 49527 transitions. [2018-11-28 13:35:46,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 13:35:46,739 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 101 [2018-11-28 13:35:46,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:35:46,757 INFO L225 Difference]: With dead ends: 21149 [2018-11-28 13:35:46,757 INFO L226 Difference]: Without dead ends: 21149 [2018-11-28 13:35:46,757 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-11-28 13:35:46,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21149 states. [2018-11-28 13:35:46,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21149 to 19539. [2018-11-28 13:35:46,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19539 states. [2018-11-28 13:35:46,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19539 states to 19539 states and 46139 transitions. [2018-11-28 13:35:46,941 INFO L78 Accepts]: Start accepts. Automaton has 19539 states and 46139 transitions. Word has length 101 [2018-11-28 13:35:46,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:35:46,942 INFO L480 AbstractCegarLoop]: Abstraction has 19539 states and 46139 transitions. [2018-11-28 13:35:46,942 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:35:46,942 INFO L276 IsEmpty]: Start isEmpty. Operand 19539 states and 46139 transitions. [2018-11-28 13:35:46,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-28 13:35:46,960 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:35:46,960 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:35:46,960 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:35:46,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:35:46,960 INFO L82 PathProgramCache]: Analyzing trace with hash 845608803, now seen corresponding path program 1 times [2018-11-28 13:35:46,960 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:35:46,960 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:35:46,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:35:46,962 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:35:46,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:35:46,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:35:47,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:35:47,082 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:35:47,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-28 13:35:47,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-28 13:35:47,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 13:35:47,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-11-28 13:35:47,083 INFO L87 Difference]: Start difference. First operand 19539 states and 46139 transitions. Second operand 10 states. [2018-11-28 13:35:47,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:35:47,484 INFO L93 Difference]: Finished difference Result 21929 states and 51695 transitions. [2018-11-28 13:35:47,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 13:35:47,485 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 103 [2018-11-28 13:35:47,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:35:47,489 INFO L225 Difference]: With dead ends: 21929 [2018-11-28 13:35:47,489 INFO L226 Difference]: Without dead ends: 3980 [2018-11-28 13:35:47,489 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2018-11-28 13:35:47,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3980 states. [2018-11-28 13:35:47,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3980 to 3977. [2018-11-28 13:35:47,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3977 states. [2018-11-28 13:35:47,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3977 states to 3977 states and 9561 transitions. [2018-11-28 13:35:47,519 INFO L78 Accepts]: Start accepts. Automaton has 3977 states and 9561 transitions. Word has length 103 [2018-11-28 13:35:47,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:35:47,519 INFO L480 AbstractCegarLoop]: Abstraction has 3977 states and 9561 transitions. [2018-11-28 13:35:47,519 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-28 13:35:47,519 INFO L276 IsEmpty]: Start isEmpty. Operand 3977 states and 9561 transitions. [2018-11-28 13:35:47,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-28 13:35:47,522 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:35:47,523 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:35:47,523 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:35:47,523 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:35:47,523 INFO L82 PathProgramCache]: Analyzing trace with hash 1730835046, now seen corresponding path program 1 times [2018-11-28 13:35:47,523 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:35:47,523 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:35:47,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:35:47,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:35:47,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:35:47,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:35:47,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:35:47,658 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:35:47,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-11-28 13:35:47,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-28 13:35:47,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-28 13:35:47,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-11-28 13:35:47,659 INFO L87 Difference]: Start difference. First operand 3977 states and 9561 transitions. Second operand 13 states. [2018-11-28 13:35:48,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:35:48,158 INFO L93 Difference]: Finished difference Result 6589 states and 15569 transitions. [2018-11-28 13:35:48,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-28 13:35:48,159 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 103 [2018-11-28 13:35:48,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:35:48,163 INFO L225 Difference]: With dead ends: 6589 [2018-11-28 13:35:48,163 INFO L226 Difference]: Without dead ends: 4554 [2018-11-28 13:35:48,163 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=387, Unknown=0, NotChecked=0, Total=462 [2018-11-28 13:35:48,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4554 states. [2018-11-28 13:35:48,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4554 to 4042. [2018-11-28 13:35:48,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4042 states. [2018-11-28 13:35:48,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4042 states to 4042 states and 9645 transitions. [2018-11-28 13:35:48,200 INFO L78 Accepts]: Start accepts. Automaton has 4042 states and 9645 transitions. Word has length 103 [2018-11-28 13:35:48,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:35:48,200 INFO L480 AbstractCegarLoop]: Abstraction has 4042 states and 9645 transitions. [2018-11-28 13:35:48,200 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-28 13:35:48,200 INFO L276 IsEmpty]: Start isEmpty. Operand 4042 states and 9645 transitions. [2018-11-28 13:35:48,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-28 13:35:48,204 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:35:48,204 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:35:48,204 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:35:48,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:35:48,204 INFO L82 PathProgramCache]: Analyzing trace with hash -1276794876, now seen corresponding path program 2 times [2018-11-28 13:35:48,205 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:35:48,205 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:35:48,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:35:48,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:35:48,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:35:48,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:35:48,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:35:48,269 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-11-28 13:35:48,366 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-11-28 13:35:48,367 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 01:35:48 BasicIcfg [2018-11-28 13:35:48,367 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 13:35:48,368 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 13:35:48,368 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 13:35:48,368 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 13:35:48,368 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:35:19" (3/4) ... [2018-11-28 13:35:48,370 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-28 13:35:48,484 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_a5a0257f-bd04-402e-ad03-0fa103836382/bin-2019/uautomizer/witness.graphml [2018-11-28 13:35:48,484 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 13:35:48,485 INFO L168 Benchmark]: Toolchain (without parser) took 30607.42 ms. Allocated memory was 1.0 GB in the beginning and 3.7 GB in the end (delta: 2.6 GB). Free memory was 950.6 MB in the beginning and 1.0 GB in the end (delta: -90.0 MB). Peak memory consumption was 2.6 GB. Max. memory is 11.5 GB. [2018-11-28 13:35:48,486 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 13:35:48,486 INFO L168 Benchmark]: CACSL2BoogieTranslator took 433.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -160.5 MB). Peak memory consumption was 31.5 MB. Max. memory is 11.5 GB. [2018-11-28 13:35:48,487 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.96 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-28 13:35:48,487 INFO L168 Benchmark]: Boogie Preprocessor took 36.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-28 13:35:48,487 INFO L168 Benchmark]: RCFGBuilder took 676.16 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 57.3 MB). Peak memory consumption was 57.3 MB. Max. memory is 11.5 GB. [2018-11-28 13:35:48,487 INFO L168 Benchmark]: TraceAbstraction took 29294.25 ms. Allocated memory was 1.2 GB in the beginning and 3.7 GB in the end (delta: 2.5 GB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -43.8 MB). Peak memory consumption was 2.5 GB. Max. memory is 11.5 GB. [2018-11-28 13:35:48,488 INFO L168 Benchmark]: Witness Printer took 116.75 ms. Allocated memory is still 3.7 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 51.6 MB). Peak memory consumption was 51.6 MB. Max. memory is 11.5 GB. [2018-11-28 13:35:48,489 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 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 433.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -160.5 MB). Peak memory consumption was 31.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 46.96 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 36.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 676.16 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 57.3 MB). Peak memory consumption was 57.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 29294.25 ms. Allocated memory was 1.2 GB in the beginning and 3.7 GB in the end (delta: 2.5 GB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -43.8 MB). Peak memory consumption was 2.5 GB. Max. memory is 11.5 GB. * Witness Printer took 116.75 ms. Allocated memory is still 3.7 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 51.6 MB). Peak memory consumption was 51.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L672] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L674] -1 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L676] -1 int __unbuffered_p0_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0] [L678] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0] [L680] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L681] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L682] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L684] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L685] -1 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L686] -1 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L687] -1 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L688] -1 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L689] -1 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L690] -1 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L691] -1 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L692] -1 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L693] -1 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L694] -1 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L695] -1 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L696] -1 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L697] -1 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L698] -1 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L700] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L701] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L702] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L789] -1 pthread_t t2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L790] FCALL, FORK -1 pthread_create(&t2, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L791] -1 pthread_t t3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L792] FCALL, FORK -1 pthread_create(&t3, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L737] 0 x$w_buff1 = x$w_buff0 [L738] 0 x$w_buff0 = 1 [L739] 0 x$w_buff1_used = x$w_buff0_used [L740] 0 x$w_buff0_used = (_Bool)1 [L5] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L742] 0 x$r_buff1_thd0 = x$r_buff0_thd0 [L743] 0 x$r_buff1_thd1 = x$r_buff0_thd1 [L744] 0 x$r_buff1_thd2 = x$r_buff0_thd2 [L745] 0 x$r_buff0_thd2 = (_Bool)1 [L748] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L749] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L750] 0 x$flush_delayed = weak$$choice2 [L751] 0 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L752] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L752] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L752] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L752] 0 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L753] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L753] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L754] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L754] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L755] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L755] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L756] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L756] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L757] EXPR 0 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L757] 0 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L758] EXPR 0 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L758] 0 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L759] 0 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L760] EXPR 0 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L760] 0 x = x$flush_delayed ? x$mem_tmp : x [L761] 0 x$flush_delayed = (_Bool)0 [L764] 0 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L767] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L706] 1 y = 1 [L709] 1 __unbuffered_p0_EAX = y [L712] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L713] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L714] 1 x$flush_delayed = weak$$choice2 [L715] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L716] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L767] 0 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L768] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L768] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L769] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L716] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L717] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L717] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L718] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L718] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L719] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L719] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L720] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L720] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L721] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L721] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L722] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L722] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L723] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L724] EXPR 1 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$flush_delayed ? x$mem_tmp : x=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L724] 1 x = x$flush_delayed ? x$mem_tmp : x [L725] 1 x$flush_delayed = (_Bool)0 [L730] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L769] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L770] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L770] 0 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L771] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L771] 0 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L774] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L794] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L798] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L798] EXPR -1 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L798] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L798] -1 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L799] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L799] -1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L800] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L800] -1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L801] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L801] -1 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L802] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L802] -1 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L805] -1 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L5] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L5] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 284 locations, 3 error locations. UNSAFE Result, 29.1s OverallTime, 26 OverallIterations, 1 TraceHistogramMax, 10.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 8894 SDtfs, 9623 SDslu, 20666 SDs, 0 SdLazy, 6854 SolverSat, 351 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 234 GetRequests, 59 SyntacticMatches, 25 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=83128occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 8.7s AutomataMinimizationTime, 25 MinimizatonAttempts, 131522 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 2192 NumberOfCodeBlocks, 2192 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 2064 ConstructedInterpolants, 0 QuantifiedInterpolants, 411602 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 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...