./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi010_power.opt_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_79bc4abe-63a3-420b-8442-9ed8b2598fd3/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_79bc4abe-63a3-420b-8442-9ed8b2598fd3/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_79bc4abe-63a3-420b-8442-9ed8b2598fd3/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_79bc4abe-63a3-420b-8442-9ed8b2598fd3/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi010_power.opt_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_79bc4abe-63a3-420b-8442-9ed8b2598fd3/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_79bc4abe-63a3-420b-8442-9ed8b2598fd3/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 df6b0475df83f06f064c78d3a4d54c725d19829e ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 10:55:54,153 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 10:55:54,154 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 10:55:54,162 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 10:55:54,162 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 10:55:54,163 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 10:55:54,163 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 10:55:54,164 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 10:55:54,165 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 10:55:54,166 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 10:55:54,166 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 10:55:54,167 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 10:55:54,167 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 10:55:54,168 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 10:55:54,168 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 10:55:54,169 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 10:55:54,169 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 10:55:54,171 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 10:55:54,172 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 10:55:54,173 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 10:55:54,174 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 10:55:54,174 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 10:55:54,175 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 10:55:54,176 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 10:55:54,176 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 10:55:54,176 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 10:55:54,177 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 10:55:54,177 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 10:55:54,177 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 10:55:54,178 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 10:55:54,178 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 10:55:54,178 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 10:55:54,178 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 10:55:54,179 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 10:55:54,179 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 10:55:54,179 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 10:55:54,179 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_79bc4abe-63a3-420b-8442-9ed8b2598fd3/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-09 10:55:54,186 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 10:55:54,186 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 10:55:54,187 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 10:55:54,187 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 10:55:54,187 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 10:55:54,187 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 10:55:54,187 INFO L133 SettingsManager]: * Use SBE=true [2018-12-09 10:55:54,187 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 10:55:54,188 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 10:55:54,188 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 10:55:54,188 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 10:55:54,188 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 10:55:54,188 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 10:55:54,188 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 10:55:54,188 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 10:55:54,188 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 10:55:54,188 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 10:55:54,188 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 10:55:54,188 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 10:55:54,189 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 10:55:54,189 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 10:55:54,189 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 10:55:54,189 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 10:55:54,189 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 10:55:54,189 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 10:55:54,189 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 10:55:54,189 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 10:55:54,189 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-09 10:55:54,189 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 10:55:54,189 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 10:55:54,190 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_79bc4abe-63a3-420b-8442-9ed8b2598fd3/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 -> df6b0475df83f06f064c78d3a4d54c725d19829e [2018-12-09 10:55:54,207 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 10:55:54,213 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 10:55:54,215 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 10:55:54,216 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 10:55:54,216 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 10:55:54,217 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_79bc4abe-63a3-420b-8442-9ed8b2598fd3/bin-2019/uautomizer/../../sv-benchmarks/c/pthread-wmm/rfi010_power.opt_false-unreach-call.i [2018-12-09 10:55:54,251 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_79bc4abe-63a3-420b-8442-9ed8b2598fd3/bin-2019/uautomizer/data/388185102/ddff246c344344e1878b86987e1ba58d/FLAG040465734 [2018-12-09 10:55:54,688 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 10:55:54,688 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_79bc4abe-63a3-420b-8442-9ed8b2598fd3/sv-benchmarks/c/pthread-wmm/rfi010_power.opt_false-unreach-call.i [2018-12-09 10:55:54,695 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_79bc4abe-63a3-420b-8442-9ed8b2598fd3/bin-2019/uautomizer/data/388185102/ddff246c344344e1878b86987e1ba58d/FLAG040465734 [2018-12-09 10:55:54,704 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_79bc4abe-63a3-420b-8442-9ed8b2598fd3/bin-2019/uautomizer/data/388185102/ddff246c344344e1878b86987e1ba58d [2018-12-09 10:55:54,706 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 10:55:54,706 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 10:55:54,707 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 10:55:54,707 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 10:55:54,709 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 10:55:54,709 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 10:55:54" (1/1) ... [2018-12-09 10:55:54,711 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ab2707f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:55:54, skipping insertion in model container [2018-12-09 10:55:54,711 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 10:55:54" (1/1) ... [2018-12-09 10:55:54,715 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 10:55:54,736 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 10:55:54,914 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 10:55:54,922 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 10:55:54,998 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 10:55:55,029 INFO L195 MainTranslator]: Completed translation [2018-12-09 10:55:55,029 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:55:55 WrapperNode [2018-12-09 10:55:55,029 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 10:55:55,030 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 10:55:55,030 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 10:55:55,030 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 10:55:55,035 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:55:55" (1/1) ... [2018-12-09 10:55:55,049 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:55:55" (1/1) ... [2018-12-09 10:55:55,073 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 10:55:55,073 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 10:55:55,073 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 10:55:55,073 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 10:55:55,080 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:55:55" (1/1) ... [2018-12-09 10:55:55,080 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:55:55" (1/1) ... [2018-12-09 10:55:55,084 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:55:55" (1/1) ... [2018-12-09 10:55:55,084 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:55:55" (1/1) ... [2018-12-09 10:55:55,092 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:55:55" (1/1) ... [2018-12-09 10:55:55,095 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:55:55" (1/1) ... [2018-12-09 10:55:55,097 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:55:55" (1/1) ... [2018-12-09 10:55:55,101 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 10:55:55,101 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 10:55:55,101 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 10:55:55,101 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 10:55:55,102 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:55:55" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_79bc4abe-63a3-420b-8442-9ed8b2598fd3/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 10:55:55,139 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 10:55:55,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 10:55:55,139 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-09 10:55:55,139 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 10:55:55,139 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-09 10:55:55,139 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-09 10:55:55,139 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-09 10:55:55,139 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-09 10:55:55,140 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-09 10:55:55,140 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 10:55:55,140 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 10:55:55,141 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-09 10:55:55,511 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 10:55:55,511 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-09 10:55:55,512 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 10:55:55 BoogieIcfgContainer [2018-12-09 10:55:55,512 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 10:55:55,512 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 10:55:55,512 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 10:55:55,514 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 10:55:55,514 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 10:55:54" (1/3) ... [2018-12-09 10:55:55,515 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58630172 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 10:55:55, skipping insertion in model container [2018-12-09 10:55:55,515 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:55:55" (2/3) ... [2018-12-09 10:55:55,515 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58630172 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 10:55:55, skipping insertion in model container [2018-12-09 10:55:55,515 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 10:55:55" (3/3) ... [2018-12-09 10:55:55,516 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi010_power.opt_false-unreach-call.i [2018-12-09 10:55:55,542 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,542 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,542 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,542 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,543 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,543 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,543 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,543 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,543 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,543 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,543 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,543 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,544 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,544 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,544 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,544 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,544 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,544 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,544 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,544 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,544 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,544 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,544 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,545 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,545 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,545 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,545 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,545 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,545 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,545 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,545 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,545 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,545 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,546 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,546 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,546 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,546 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,546 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,546 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,546 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,546 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,546 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,546 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,546 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,547 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,547 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,547 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,547 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,547 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,547 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,547 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,547 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,547 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,547 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,547 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,547 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,548 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,548 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,548 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,548 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,548 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,548 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,548 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,548 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,548 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,548 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,548 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,548 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,549 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,549 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,549 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,549 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,549 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,549 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,549 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,549 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,549 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,549 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,549 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,550 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,550 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,550 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,550 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,550 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,550 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,550 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,550 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,550 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,550 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,550 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,551 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,551 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,551 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,551 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,551 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,551 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,551 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,551 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,552 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,552 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,552 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,552 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,552 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,552 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,552 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,552 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,552 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,552 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,552 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,553 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,553 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,553 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,553 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,553 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,554 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,554 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,554 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,555 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,555 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,555 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,555 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,555 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,555 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,555 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,555 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,555 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,555 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,556 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,556 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,556 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,556 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,556 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,556 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,556 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,556 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,556 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,556 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,557 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,557 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,557 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,557 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,557 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,557 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,557 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,557 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,557 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,558 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,558 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,558 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,558 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,558 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,558 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,558 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,558 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,558 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,559 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,559 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,559 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,559 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,559 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,559 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,559 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,559 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,559 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,559 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,559 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,559 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,560 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,560 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,560 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,560 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,560 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,560 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,560 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,560 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,560 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,560 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,561 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,561 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,561 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,561 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,561 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,561 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,561 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,561 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,561 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,561 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,562 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,562 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,562 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,562 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,562 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,562 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,562 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,562 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,562 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,563 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,563 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,563 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,563 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,563 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,563 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,563 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,563 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,563 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,563 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,563 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,563 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,563 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,564 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,564 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,564 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,564 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,564 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,564 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,564 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,564 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,564 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,564 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet56.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,564 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet56.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,564 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,564 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,565 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet56.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,565 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet56.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:55:55,568 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-09 10:55:55,568 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 10:55:55,574 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-09 10:55:55,583 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-09 10:55:55,598 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 10:55:55,599 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 10:55:55,599 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 10:55:55,599 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 10:55:55,599 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 10:55:55,599 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 10:55:55,599 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 10:55:55,599 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 10:55:55,599 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 10:55:55,609 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 173places, 226 transitions [2018-12-09 10:56:01,497 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 83127 states. [2018-12-09 10:56:01,498 INFO L276 IsEmpty]: Start isEmpty. Operand 83127 states. [2018-12-09 10:56:01,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-09 10:56:01,504 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:56:01,504 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] [2018-12-09 10:56:01,506 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:56:01,509 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:56:01,510 INFO L82 PathProgramCache]: Analyzing trace with hash -1645016021, now seen corresponding path program 1 times [2018-12-09 10:56:01,511 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:56:01,511 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:56:01,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:56:01,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:56:01,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:56:01,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:56:01,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:56:01,645 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:56:01,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 10:56:01,648 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 10:56:01,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 10:56:01,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 10:56:01,692 INFO L87 Difference]: Start difference. First operand 83127 states. Second operand 4 states. [2018-12-09 10:56:02,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:56:02,481 INFO L93 Difference]: Finished difference Result 150583 states and 603160 transitions. [2018-12-09 10:56:02,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 10:56:02,482 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2018-12-09 10:56:02,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:56:03,017 INFO L225 Difference]: With dead ends: 150583 [2018-12-09 10:56:03,017 INFO L226 Difference]: Without dead ends: 105839 [2018-12-09 10:56:03,018 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 10:56:03,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105839 states. [2018-12-09 10:56:04,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105839 to 61235. [2018-12-09 10:56:04,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61235 states. [2018-12-09 10:56:05,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61235 states to 61235 states and 248290 transitions. [2018-12-09 10:56:05,121 INFO L78 Accepts]: Start accepts. Automaton has 61235 states and 248290 transitions. Word has length 38 [2018-12-09 10:56:05,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:56:05,122 INFO L480 AbstractCegarLoop]: Abstraction has 61235 states and 248290 transitions. [2018-12-09 10:56:05,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 10:56:05,122 INFO L276 IsEmpty]: Start isEmpty. Operand 61235 states and 248290 transitions. [2018-12-09 10:56:05,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-09 10:56:05,127 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:56:05,127 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:56:05,128 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:56:05,128 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:56:05,128 INFO L82 PathProgramCache]: Analyzing trace with hash 1043746306, now seen corresponding path program 1 times [2018-12-09 10:56:05,128 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:56:05,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:56:05,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:56:05,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:56:05,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:56:05,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:56:05,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:56:05,178 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:56:05,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 10:56:05,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 10:56:05,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 10:56:05,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 10:56:05,180 INFO L87 Difference]: Start difference. First operand 61235 states and 248290 transitions. Second operand 5 states. [2018-12-09 10:56:07,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:56:07,147 INFO L93 Difference]: Finished difference Result 146039 states and 554300 transitions. [2018-12-09 10:56:07,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 10:56:07,147 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2018-12-09 10:56:07,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:56:07,504 INFO L225 Difference]: With dead ends: 146039 [2018-12-09 10:56:07,505 INFO L226 Difference]: Without dead ends: 145471 [2018-12-09 10:56:07,505 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-09 10:56:08,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145471 states. [2018-12-09 10:56:09,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145471 to 96613. [2018-12-09 10:56:09,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96613 states. [2018-12-09 10:56:10,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96613 states to 96613 states and 368455 transitions. [2018-12-09 10:56:10,216 INFO L78 Accepts]: Start accepts. Automaton has 96613 states and 368455 transitions. Word has length 46 [2018-12-09 10:56:10,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:56:10,217 INFO L480 AbstractCegarLoop]: Abstraction has 96613 states and 368455 transitions. [2018-12-09 10:56:10,217 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 10:56:10,217 INFO L276 IsEmpty]: Start isEmpty. Operand 96613 states and 368455 transitions. [2018-12-09 10:56:10,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-09 10:56:10,220 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:56:10,221 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:56:10,221 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:56:10,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:56:10,221 INFO L82 PathProgramCache]: Analyzing trace with hash -1415245602, now seen corresponding path program 1 times [2018-12-09 10:56:10,221 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:56:10,221 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:56:10,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:56:10,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:56:10,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:56:10,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:56:10,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:56:10,260 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:56:10,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 10:56:10,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 10:56:10,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 10:56:10,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 10:56:10,261 INFO L87 Difference]: Start difference. First operand 96613 states and 368455 transitions. Second operand 5 states. [2018-12-09 10:56:11,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:56:11,278 INFO L93 Difference]: Finished difference Result 199269 states and 748089 transitions. [2018-12-09 10:56:11,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 10:56:11,279 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2018-12-09 10:56:11,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:56:11,694 INFO L225 Difference]: With dead ends: 199269 [2018-12-09 10:56:11,694 INFO L226 Difference]: Without dead ends: 198805 [2018-12-09 10:56:11,694 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-09 10:56:13,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198805 states. [2018-12-09 10:56:14,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198805 to 108296. [2018-12-09 10:56:14,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108296 states. [2018-12-09 10:56:15,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108296 states to 108296 states and 408659 transitions. [2018-12-09 10:56:15,114 INFO L78 Accepts]: Start accepts. Automaton has 108296 states and 408659 transitions. Word has length 47 [2018-12-09 10:56:15,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:56:15,114 INFO L480 AbstractCegarLoop]: Abstraction has 108296 states and 408659 transitions. [2018-12-09 10:56:15,114 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 10:56:15,114 INFO L276 IsEmpty]: Start isEmpty. Operand 108296 states and 408659 transitions. [2018-12-09 10:56:15,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-09 10:56:15,121 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:56:15,121 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:56:15,121 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:56:15,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:56:15,122 INFO L82 PathProgramCache]: Analyzing trace with hash -1958778492, now seen corresponding path program 1 times [2018-12-09 10:56:15,122 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:56:15,122 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:56:15,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:56:15,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:56:15,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:56:15,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:56:15,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:56:15,152 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:56:15,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 10:56:15,153 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 10:56:15,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 10:56:15,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 10:56:15,153 INFO L87 Difference]: Start difference. First operand 108296 states and 408659 transitions. Second operand 3 states. [2018-12-09 10:56:15,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:56:15,824 INFO L93 Difference]: Finished difference Result 179115 states and 655174 transitions. [2018-12-09 10:56:15,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 10:56:15,824 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2018-12-09 10:56:15,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:56:16,176 INFO L225 Difference]: With dead ends: 179115 [2018-12-09 10:56:16,176 INFO L226 Difference]: Without dead ends: 179115 [2018-12-09 10:56:16,177 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 10:56:17,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179115 states. [2018-12-09 10:56:20,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179115 to 163646. [2018-12-09 10:56:20,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163646 states. [2018-12-09 10:56:21,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163646 states to 163646 states and 603625 transitions. [2018-12-09 10:56:21,012 INFO L78 Accepts]: Start accepts. Automaton has 163646 states and 603625 transitions. Word has length 49 [2018-12-09 10:56:21,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:56:21,012 INFO L480 AbstractCegarLoop]: Abstraction has 163646 states and 603625 transitions. [2018-12-09 10:56:21,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 10:56:21,012 INFO L276 IsEmpty]: Start isEmpty. Operand 163646 states and 603625 transitions. [2018-12-09 10:56:21,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-09 10:56:21,027 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:56:21,027 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:56:21,027 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:56:21,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:56:21,027 INFO L82 PathProgramCache]: Analyzing trace with hash 984479439, now seen corresponding path program 1 times [2018-12-09 10:56:21,027 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:56:21,027 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:56:21,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:56:21,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:56:21,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:56:21,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:56:21,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:56:21,076 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:56:21,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 10:56:21,077 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 10:56:21,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 10:56:21,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 10:56:21,077 INFO L87 Difference]: Start difference. First operand 163646 states and 603625 transitions. Second operand 6 states. [2018-12-09 10:56:22,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:56:22,903 INFO L93 Difference]: Finished difference Result 315523 states and 1139598 transitions. [2018-12-09 10:56:22,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 10:56:22,903 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2018-12-09 10:56:22,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:56:23,546 INFO L225 Difference]: With dead ends: 315523 [2018-12-09 10:56:23,546 INFO L226 Difference]: Without dead ends: 314987 [2018-12-09 10:56:23,547 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-12-09 10:56:25,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314987 states. [2018-12-09 10:56:28,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314987 to 164409. [2018-12-09 10:56:28,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164409 states. [2018-12-09 10:56:28,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164409 states to 164409 states and 606496 transitions. [2018-12-09 10:56:28,718 INFO L78 Accepts]: Start accepts. Automaton has 164409 states and 606496 transitions. Word has length 53 [2018-12-09 10:56:28,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:56:28,719 INFO L480 AbstractCegarLoop]: Abstraction has 164409 states and 606496 transitions. [2018-12-09 10:56:28,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 10:56:28,719 INFO L276 IsEmpty]: Start isEmpty. Operand 164409 states and 606496 transitions. [2018-12-09 10:56:28,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-09 10:56:28,733 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:56:28,733 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:56:28,733 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:56:28,733 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:56:28,733 INFO L82 PathProgramCache]: Analyzing trace with hash -721809298, now seen corresponding path program 1 times [2018-12-09 10:56:28,733 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:56:28,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:56:28,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:56:28,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:56:28,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:56:28,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:56:28,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:56:28,792 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:56:28,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 10:56:28,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 10:56:28,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 10:56:28,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-09 10:56:28,792 INFO L87 Difference]: Start difference. First operand 164409 states and 606496 transitions. Second operand 6 states. [2018-12-09 10:56:30,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:56:30,000 INFO L93 Difference]: Finished difference Result 215866 states and 792770 transitions. [2018-12-09 10:56:30,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 10:56:30,001 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2018-12-09 10:56:30,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:56:30,460 INFO L225 Difference]: With dead ends: 215866 [2018-12-09 10:56:30,460 INFO L226 Difference]: Without dead ends: 215866 [2018-12-09 10:56:30,460 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-09 10:56:33,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215866 states. [2018-12-09 10:56:35,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215866 to 201215. [2018-12-09 10:56:35,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201215 states. [2018-12-09 10:56:36,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201215 states to 201215 states and 739037 transitions. [2018-12-09 10:56:36,444 INFO L78 Accepts]: Start accepts. Automaton has 201215 states and 739037 transitions. Word has length 53 [2018-12-09 10:56:36,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:56:36,445 INFO L480 AbstractCegarLoop]: Abstraction has 201215 states and 739037 transitions. [2018-12-09 10:56:36,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 10:56:36,445 INFO L276 IsEmpty]: Start isEmpty. Operand 201215 states and 739037 transitions. [2018-12-09 10:56:36,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-09 10:56:36,462 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:56:36,462 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:56:36,462 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:56:36,462 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:56:36,463 INFO L82 PathProgramCache]: Analyzing trace with hash 1776206639, now seen corresponding path program 1 times [2018-12-09 10:56:36,463 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:56:36,463 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:56:36,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:56:36,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:56:36,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:56:36,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:56:36,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:56:36,525 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:56:36,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 10:56:36,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 10:56:36,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 10:56:36,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 10:56:36,526 INFO L87 Difference]: Start difference. First operand 201215 states and 739037 transitions. Second operand 7 states. [2018-12-09 10:56:38,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:56:38,203 INFO L93 Difference]: Finished difference Result 286186 states and 1016985 transitions. [2018-12-09 10:56:38,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 10:56:38,204 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2018-12-09 10:56:38,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:56:39,194 INFO L225 Difference]: With dead ends: 286186 [2018-12-09 10:56:39,194 INFO L226 Difference]: Without dead ends: 286186 [2018-12-09 10:56:39,194 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-12-09 10:56:40,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286186 states. [2018-12-09 10:56:45,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286186 to 229832. [2018-12-09 10:56:45,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229832 states. [2018-12-09 10:56:46,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229832 states to 229832 states and 831774 transitions. [2018-12-09 10:56:46,546 INFO L78 Accepts]: Start accepts. Automaton has 229832 states and 831774 transitions. Word has length 53 [2018-12-09 10:56:46,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:56:46,546 INFO L480 AbstractCegarLoop]: Abstraction has 229832 states and 831774 transitions. [2018-12-09 10:56:46,546 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 10:56:46,546 INFO L276 IsEmpty]: Start isEmpty. Operand 229832 states and 831774 transitions. [2018-12-09 10:56:46,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-09 10:56:46,564 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:56:46,564 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:56:46,564 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:56:46,564 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:56:46,565 INFO L82 PathProgramCache]: Analyzing trace with hash -1631256976, now seen corresponding path program 1 times [2018-12-09 10:56:46,565 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:56:46,565 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:56:46,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:56:46,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:56:46,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:56:46,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:56:46,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:56:46,600 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:56:46,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 10:56:46,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 10:56:46,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 10:56:46,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 10:56:46,601 INFO L87 Difference]: Start difference. First operand 229832 states and 831774 transitions. Second operand 4 states. [2018-12-09 10:56:46,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:56:46,734 INFO L93 Difference]: Finished difference Result 38679 states and 122684 transitions. [2018-12-09 10:56:46,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 10:56:46,735 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2018-12-09 10:56:46,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:56:46,778 INFO L225 Difference]: With dead ends: 38679 [2018-12-09 10:56:46,778 INFO L226 Difference]: Without dead ends: 32083 [2018-12-09 10:56:46,778 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 10:56:46,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32083 states. [2018-12-09 10:56:47,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32083 to 31836. [2018-12-09 10:56:47,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31836 states. [2018-12-09 10:56:47,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31836 states to 31836 states and 99515 transitions. [2018-12-09 10:56:47,135 INFO L78 Accepts]: Start accepts. Automaton has 31836 states and 99515 transitions. Word has length 53 [2018-12-09 10:56:47,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:56:47,135 INFO L480 AbstractCegarLoop]: Abstraction has 31836 states and 99515 transitions. [2018-12-09 10:56:47,135 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 10:56:47,135 INFO L276 IsEmpty]: Start isEmpty. Operand 31836 states and 99515 transitions. [2018-12-09 10:56:47,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-09 10:56:47,140 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:56:47,140 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:56:47,141 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:56:47,141 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:56:47,141 INFO L82 PathProgramCache]: Analyzing trace with hash -917178143, now seen corresponding path program 1 times [2018-12-09 10:56:47,141 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:56:47,141 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:56:47,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:56:47,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:56:47,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:56:47,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:56:47,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:56:47,184 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:56:47,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 10:56:47,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 10:56:47,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 10:56:47,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 10:56:47,185 INFO L87 Difference]: Start difference. First operand 31836 states and 99515 transitions. Second operand 4 states. [2018-12-09 10:56:47,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:56:47,436 INFO L93 Difference]: Finished difference Result 41208 states and 129949 transitions. [2018-12-09 10:56:47,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 10:56:47,437 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2018-12-09 10:56:47,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:56:47,490 INFO L225 Difference]: With dead ends: 41208 [2018-12-09 10:56:47,490 INFO L226 Difference]: Without dead ends: 41208 [2018-12-09 10:56:47,490 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 10:56:47,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41208 states. [2018-12-09 10:56:47,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41208 to 35932. [2018-12-09 10:56:47,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35932 states. [2018-12-09 10:56:47,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35932 states to 35932 states and 112644 transitions. [2018-12-09 10:56:47,927 INFO L78 Accepts]: Start accepts. Automaton has 35932 states and 112644 transitions. Word has length 63 [2018-12-09 10:56:47,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:56:47,928 INFO L480 AbstractCegarLoop]: Abstraction has 35932 states and 112644 transitions. [2018-12-09 10:56:47,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 10:56:47,928 INFO L276 IsEmpty]: Start isEmpty. Operand 35932 states and 112644 transitions. [2018-12-09 10:56:47,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-09 10:56:47,933 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:56:47,933 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] [2018-12-09 10:56:47,934 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:56:47,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:56:47,934 INFO L82 PathProgramCache]: Analyzing trace with hash 825632192, now seen corresponding path program 1 times [2018-12-09 10:56:47,934 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:56:47,934 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:56:47,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:56:47,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:56:47,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:56:47,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:56:47,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:56:47,986 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:56:47,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 10:56:47,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 10:56:47,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 10:56:47,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 10:56:47,987 INFO L87 Difference]: Start difference. First operand 35932 states and 112644 transitions. Second operand 6 states. [2018-12-09 10:56:48,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:56:48,801 INFO L93 Difference]: Finished difference Result 72509 states and 225560 transitions. [2018-12-09 10:56:48,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 10:56:48,802 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 63 [2018-12-09 10:56:48,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:56:48,901 INFO L225 Difference]: With dead ends: 72509 [2018-12-09 10:56:48,901 INFO L226 Difference]: Without dead ends: 72445 [2018-12-09 10:56:48,901 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-12-09 10:56:49,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72445 states. [2018-12-09 10:56:49,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72445 to 40892. [2018-12-09 10:56:49,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40892 states. [2018-12-09 10:56:49,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40892 states to 40892 states and 126622 transitions. [2018-12-09 10:56:49,538 INFO L78 Accepts]: Start accepts. Automaton has 40892 states and 126622 transitions. Word has length 63 [2018-12-09 10:56:49,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:56:49,538 INFO L480 AbstractCegarLoop]: Abstraction has 40892 states and 126622 transitions. [2018-12-09 10:56:49,538 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 10:56:49,538 INFO L276 IsEmpty]: Start isEmpty. Operand 40892 states and 126622 transitions. [2018-12-09 10:56:49,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-09 10:56:49,549 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:56:49,549 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] [2018-12-09 10:56:49,549 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:56:49,549 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:56:49,549 INFO L82 PathProgramCache]: Analyzing trace with hash -1816196687, now seen corresponding path program 1 times [2018-12-09 10:56:49,549 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:56:49,549 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:56:49,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:56:49,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:56:49,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:56:49,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:56:49,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:56:49,572 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:56:49,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 10:56:49,573 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 10:56:49,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 10:56:49,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 10:56:49,573 INFO L87 Difference]: Start difference. First operand 40892 states and 126622 transitions. Second operand 3 states. [2018-12-09 10:56:49,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:56:49,708 INFO L93 Difference]: Finished difference Result 46897 states and 143099 transitions. [2018-12-09 10:56:49,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 10:56:49,709 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2018-12-09 10:56:49,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:56:49,766 INFO L225 Difference]: With dead ends: 46897 [2018-12-09 10:56:49,766 INFO L226 Difference]: Without dead ends: 46897 [2018-12-09 10:56:49,766 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 10:56:49,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46897 states. [2018-12-09 10:56:50,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46897 to 40580. [2018-12-09 10:56:50,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40580 states. [2018-12-09 10:56:50,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40580 states to 40580 states and 123024 transitions. [2018-12-09 10:56:50,256 INFO L78 Accepts]: Start accepts. Automaton has 40580 states and 123024 transitions. Word has length 69 [2018-12-09 10:56:50,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:56:50,256 INFO L480 AbstractCegarLoop]: Abstraction has 40580 states and 123024 transitions. [2018-12-09 10:56:50,257 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 10:56:50,257 INFO L276 IsEmpty]: Start isEmpty. Operand 40580 states and 123024 transitions. [2018-12-09 10:56:50,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-09 10:56:50,266 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:56:50,266 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:56:50,266 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:56:50,267 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:56:50,267 INFO L82 PathProgramCache]: Analyzing trace with hash -1992546375, now seen corresponding path program 1 times [2018-12-09 10:56:50,267 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:56:50,267 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:56:50,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:56:50,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:56:50,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:56:50,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:56:50,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:56:50,320 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:56:50,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 10:56:50,320 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 10:56:50,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 10:56:50,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 10:56:50,321 INFO L87 Difference]: Start difference. First operand 40580 states and 123024 transitions. Second operand 7 states. [2018-12-09 10:56:51,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:56:51,145 INFO L93 Difference]: Finished difference Result 56545 states and 170864 transitions. [2018-12-09 10:56:51,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 10:56:51,145 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 70 [2018-12-09 10:56:51,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:56:51,217 INFO L225 Difference]: With dead ends: 56545 [2018-12-09 10:56:51,217 INFO L226 Difference]: Without dead ends: 56241 [2018-12-09 10:56:51,217 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-12-09 10:56:51,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56241 states. [2018-12-09 10:56:51,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56241 to 47672. [2018-12-09 10:56:51,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47672 states. [2018-12-09 10:56:52,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47672 states to 47672 states and 144131 transitions. [2018-12-09 10:56:52,011 INFO L78 Accepts]: Start accepts. Automaton has 47672 states and 144131 transitions. Word has length 70 [2018-12-09 10:56:52,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:56:52,011 INFO L480 AbstractCegarLoop]: Abstraction has 47672 states and 144131 transitions. [2018-12-09 10:56:52,011 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 10:56:52,011 INFO L276 IsEmpty]: Start isEmpty. Operand 47672 states and 144131 transitions. [2018-12-09 10:56:52,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-09 10:56:52,024 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:56:52,024 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:56:52,024 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:56:52,024 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:56:52,024 INFO L82 PathProgramCache]: Analyzing trace with hash 505469562, now seen corresponding path program 1 times [2018-12-09 10:56:52,024 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:56:52,025 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:56:52,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:56:52,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:56:52,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:56:52,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:56:52,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:56:52,089 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:56:52,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 10:56:52,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 10:56:52,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 10:56:52,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-09 10:56:52,090 INFO L87 Difference]: Start difference. First operand 47672 states and 144131 transitions. Second operand 8 states. [2018-12-09 10:56:52,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:56:52,829 INFO L93 Difference]: Finished difference Result 57838 states and 172357 transitions. [2018-12-09 10:56:52,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 10:56:52,830 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 70 [2018-12-09 10:56:52,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:56:52,902 INFO L225 Difference]: With dead ends: 57838 [2018-12-09 10:56:52,902 INFO L226 Difference]: Without dead ends: 57838 [2018-12-09 10:56:52,902 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-12-09 10:56:52,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57838 states. [2018-12-09 10:56:53,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57838 to 50532. [2018-12-09 10:56:53,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50532 states. [2018-12-09 10:56:53,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50532 states to 50532 states and 152080 transitions. [2018-12-09 10:56:53,540 INFO L78 Accepts]: Start accepts. Automaton has 50532 states and 152080 transitions. Word has length 70 [2018-12-09 10:56:53,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:56:53,540 INFO L480 AbstractCegarLoop]: Abstraction has 50532 states and 152080 transitions. [2018-12-09 10:56:53,540 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 10:56:53,541 INFO L276 IsEmpty]: Start isEmpty. Operand 50532 states and 152080 transitions. [2018-12-09 10:56:53,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-09 10:56:53,553 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:56:53,553 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:56:53,553 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:56:53,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:56:53,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1392973243, now seen corresponding path program 1 times [2018-12-09 10:56:53,554 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:56:53,554 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:56:53,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:56:53,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:56:53,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:56:53,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:56:53,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:56:53,584 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:56:53,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 10:56:53,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 10:56:53,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 10:56:53,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 10:56:53,584 INFO L87 Difference]: Start difference. First operand 50532 states and 152080 transitions. Second operand 5 states. [2018-12-09 10:56:53,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:56:53,631 INFO L93 Difference]: Finished difference Result 13236 states and 33132 transitions. [2018-12-09 10:56:53,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 10:56:53,632 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2018-12-09 10:56:53,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:56:53,640 INFO L225 Difference]: With dead ends: 13236 [2018-12-09 10:56:53,640 INFO L226 Difference]: Without dead ends: 11116 [2018-12-09 10:56:53,641 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-09 10:56:53,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11116 states. [2018-12-09 10:56:53,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11116 to 8545. [2018-12-09 10:56:53,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8545 states. [2018-12-09 10:56:53,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8545 states to 8545 states and 21304 transitions. [2018-12-09 10:56:53,722 INFO L78 Accepts]: Start accepts. Automaton has 8545 states and 21304 transitions. Word has length 70 [2018-12-09 10:56:53,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:56:53,722 INFO L480 AbstractCegarLoop]: Abstraction has 8545 states and 21304 transitions. [2018-12-09 10:56:53,722 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 10:56:53,722 INFO L276 IsEmpty]: Start isEmpty. Operand 8545 states and 21304 transitions. [2018-12-09 10:56:53,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-09 10:56:53,728 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:56:53,728 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] [2018-12-09 10:56:53,728 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:56:53,728 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:56:53,728 INFO L82 PathProgramCache]: Analyzing trace with hash -1668171352, now seen corresponding path program 1 times [2018-12-09 10:56:53,728 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:56:53,728 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:56:53,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:56:53,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:56:53,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:56:53,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:56:53,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-12-09 10:56:53,760 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:56:53,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 10:56:53,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 10:56:53,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 10:56:53,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 10:56:53,761 INFO L87 Difference]: Start difference. First operand 8545 states and 21304 transitions. Second operand 4 states. [2018-12-09 10:56:53,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:56:53,883 INFO L93 Difference]: Finished difference Result 9960 states and 24428 transitions. [2018-12-09 10:56:53,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 10:56:53,883 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2018-12-09 10:56:53,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:56:53,890 INFO L225 Difference]: With dead ends: 9960 [2018-12-09 10:56:53,890 INFO L226 Difference]: Without dead ends: 9960 [2018-12-09 10:56:53,890 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 10:56:53,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9960 states. [2018-12-09 10:56:54,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9960 to 9441. [2018-12-09 10:56:54,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9441 states. [2018-12-09 10:56:54,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9441 states to 9441 states and 23271 transitions. [2018-12-09 10:56:54,068 INFO L78 Accepts]: Start accepts. Automaton has 9441 states and 23271 transitions. Word has length 98 [2018-12-09 10:56:54,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:56:54,068 INFO L480 AbstractCegarLoop]: Abstraction has 9441 states and 23271 transitions. [2018-12-09 10:56:54,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 10:56:54,068 INFO L276 IsEmpty]: Start isEmpty. Operand 9441 states and 23271 transitions. [2018-12-09 10:56:54,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-09 10:56:54,075 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:56:54,075 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] [2018-12-09 10:56:54,075 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:56:54,075 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:56:54,075 INFO L82 PathProgramCache]: Analyzing trace with hash 549586601, now seen corresponding path program 1 times [2018-12-09 10:56:54,075 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:56:54,075 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:56:54,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:56:54,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:56:54,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:56:54,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:56:54,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:56:54,105 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:56:54,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 10:56:54,106 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 10:56:54,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 10:56:54,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 10:56:54,106 INFO L87 Difference]: Start difference. First operand 9441 states and 23271 transitions. Second operand 3 states. [2018-12-09 10:56:54,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:56:54,236 INFO L93 Difference]: Finished difference Result 12725 states and 30850 transitions. [2018-12-09 10:56:54,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 10:56:54,236 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2018-12-09 10:56:54,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:56:54,245 INFO L225 Difference]: With dead ends: 12725 [2018-12-09 10:56:54,245 INFO L226 Difference]: Without dead ends: 12725 [2018-12-09 10:56:54,245 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 10:56:54,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12725 states. [2018-12-09 10:56:54,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12725 to 11524. [2018-12-09 10:56:54,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11524 states. [2018-12-09 10:56:54,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11524 states to 11524 states and 28181 transitions. [2018-12-09 10:56:54,341 INFO L78 Accepts]: Start accepts. Automaton has 11524 states and 28181 transitions. Word has length 98 [2018-12-09 10:56:54,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:56:54,341 INFO L480 AbstractCegarLoop]: Abstraction has 11524 states and 28181 transitions. [2018-12-09 10:56:54,341 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 10:56:54,341 INFO L276 IsEmpty]: Start isEmpty. Operand 11524 states and 28181 transitions. [2018-12-09 10:56:54,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-09 10:56:54,348 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:56:54,348 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] [2018-12-09 10:56:54,348 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:56:54,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:56:54,348 INFO L82 PathProgramCache]: Analyzing trace with hash -2029746999, now seen corresponding path program 2 times [2018-12-09 10:56:54,348 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:56:54,348 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:56:54,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:56:54,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:56:54,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:56:54,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:56:54,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-12-09 10:56:54,395 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:56:54,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 10:56:54,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 10:56:54,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 10:56:54,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 10:56:54,395 INFO L87 Difference]: Start difference. First operand 11524 states and 28181 transitions. Second operand 6 states. [2018-12-09 10:56:54,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:56:54,702 INFO L93 Difference]: Finished difference Result 14264 states and 34204 transitions. [2018-12-09 10:56:54,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 10:56:54,702 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 98 [2018-12-09 10:56:54,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:56:54,712 INFO L225 Difference]: With dead ends: 14264 [2018-12-09 10:56:54,712 INFO L226 Difference]: Without dead ends: 14264 [2018-12-09 10:56:54,712 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-09 10:56:54,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14264 states. [2018-12-09 10:56:54,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14264 to 11317. [2018-12-09 10:56:54,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11317 states. [2018-12-09 10:56:54,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11317 states to 11317 states and 27219 transitions. [2018-12-09 10:56:54,814 INFO L78 Accepts]: Start accepts. Automaton has 11317 states and 27219 transitions. Word has length 98 [2018-12-09 10:56:54,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:56:54,815 INFO L480 AbstractCegarLoop]: Abstraction has 11317 states and 27219 transitions. [2018-12-09 10:56:54,815 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 10:56:54,815 INFO L276 IsEmpty]: Start isEmpty. Operand 11317 states and 27219 transitions. [2018-12-09 10:56:54,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-09 10:56:54,824 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:56:54,824 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] [2018-12-09 10:56:54,824 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:56:54,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:56:54,824 INFO L82 PathProgramCache]: Analyzing trace with hash -604414203, now seen corresponding path program 1 times [2018-12-09 10:56:54,824 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:56:54,824 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:56:54,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:56:54,826 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 10:56:54,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:56:54,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:56:54,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:56:54,911 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:56:54,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 10:56:54,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 10:56:54,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 10:56:54,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-09 10:56:54,911 INFO L87 Difference]: Start difference. First operand 11317 states and 27219 transitions. Second operand 8 states. [2018-12-09 10:56:55,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:56:55,322 INFO L93 Difference]: Finished difference Result 15645 states and 37757 transitions. [2018-12-09 10:56:55,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 10:56:55,322 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 100 [2018-12-09 10:56:55,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:56:55,333 INFO L225 Difference]: With dead ends: 15645 [2018-12-09 10:56:55,333 INFO L226 Difference]: Without dead ends: 15613 [2018-12-09 10:56:55,333 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2018-12-09 10:56:55,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15613 states. [2018-12-09 10:56:55,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15613 to 13044. [2018-12-09 10:56:55,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13044 states. [2018-12-09 10:56:55,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13044 states to 13044 states and 31554 transitions. [2018-12-09 10:56:55,454 INFO L78 Accepts]: Start accepts. Automaton has 13044 states and 31554 transitions. Word has length 100 [2018-12-09 10:56:55,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:56:55,454 INFO L480 AbstractCegarLoop]: Abstraction has 13044 states and 31554 transitions. [2018-12-09 10:56:55,454 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 10:56:55,454 INFO L276 IsEmpty]: Start isEmpty. Operand 13044 states and 31554 transitions. [2018-12-09 10:56:55,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-09 10:56:55,463 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:56:55,464 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] [2018-12-09 10:56:55,464 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:56:55,464 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:56:55,464 INFO L82 PathProgramCache]: Analyzing trace with hash 1893601734, now seen corresponding path program 1 times [2018-12-09 10:56:55,464 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:56:55,464 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:56:55,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:56:55,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:56:55,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:56:55,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:56:55,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:56:55,517 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:56:55,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 10:56:55,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 10:56:55,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 10:56:55,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 10:56:55,517 INFO L87 Difference]: Start difference. First operand 13044 states and 31554 transitions. Second operand 7 states. [2018-12-09 10:56:55,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:56:55,857 INFO L93 Difference]: Finished difference Result 18318 states and 44570 transitions. [2018-12-09 10:56:55,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 10:56:55,858 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 100 [2018-12-09 10:56:55,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:56:55,870 INFO L225 Difference]: With dead ends: 18318 [2018-12-09 10:56:55,870 INFO L226 Difference]: Without dead ends: 18318 [2018-12-09 10:56:55,870 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2018-12-09 10:56:55,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18318 states. [2018-12-09 10:56:55,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18318 to 13525. [2018-12-09 10:56:55,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13525 states. [2018-12-09 10:56:56,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13525 states to 13525 states and 32837 transitions. [2018-12-09 10:56:56,011 INFO L78 Accepts]: Start accepts. Automaton has 13525 states and 32837 transitions. Word has length 100 [2018-12-09 10:56:56,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:56:56,011 INFO L480 AbstractCegarLoop]: Abstraction has 13525 states and 32837 transitions. [2018-12-09 10:56:56,011 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 10:56:56,011 INFO L276 IsEmpty]: Start isEmpty. Operand 13525 states and 32837 transitions. [2018-12-09 10:56:56,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-09 10:56:56,022 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:56:56,022 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] [2018-12-09 10:56:56,022 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:56:56,022 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:56:56,022 INFO L82 PathProgramCache]: Analyzing trace with hash -1513861881, now seen corresponding path program 1 times [2018-12-09 10:56:56,022 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:56:56,022 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:56:56,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:56:56,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:56:56,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:56:56,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:56:56,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:56:56,087 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:56:56,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 10:56:56,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 10:56:56,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 10:56:56,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-09 10:56:56,088 INFO L87 Difference]: Start difference. First operand 13525 states and 32837 transitions. Second operand 8 states. [2018-12-09 10:56:56,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:56:56,475 INFO L93 Difference]: Finished difference Result 15997 states and 38734 transitions. [2018-12-09 10:56:56,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 10:56:56,475 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 100 [2018-12-09 10:56:56,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:56:56,487 INFO L225 Difference]: With dead ends: 15997 [2018-12-09 10:56:56,488 INFO L226 Difference]: Without dead ends: 15997 [2018-12-09 10:56:56,488 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-12-09 10:56:56,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15997 states. [2018-12-09 10:56:56,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15997 to 13587. [2018-12-09 10:56:56,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13587 states. [2018-12-09 10:56:56,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13587 states to 13587 states and 32969 transitions. [2018-12-09 10:56:56,617 INFO L78 Accepts]: Start accepts. Automaton has 13587 states and 32969 transitions. Word has length 100 [2018-12-09 10:56:56,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:56:56,617 INFO L480 AbstractCegarLoop]: Abstraction has 13587 states and 32969 transitions. [2018-12-09 10:56:56,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 10:56:56,617 INFO L276 IsEmpty]: Start isEmpty. Operand 13587 states and 32969 transitions. [2018-12-09 10:56:56,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-09 10:56:56,628 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:56:56,628 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] [2018-12-09 10:56:56,628 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:56:56,628 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:56:56,628 INFO L82 PathProgramCache]: Analyzing trace with hash -144454555, now seen corresponding path program 1 times [2018-12-09 10:56:56,628 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:56:56,628 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:56:56,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:56:56,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:56:56,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:56:56,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:56:56,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:56:56,699 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:56:56,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 10:56:56,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 10:56:56,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 10:56:56,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 10:56:56,700 INFO L87 Difference]: Start difference. First operand 13587 states and 32969 transitions. Second operand 6 states. [2018-12-09 10:56:56,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:56:56,802 INFO L93 Difference]: Finished difference Result 13315 states and 32017 transitions. [2018-12-09 10:56:56,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 10:56:56,803 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2018-12-09 10:56:56,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:56:56,812 INFO L225 Difference]: With dead ends: 13315 [2018-12-09 10:56:56,812 INFO L226 Difference]: Without dead ends: 13315 [2018-12-09 10:56:56,812 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-09 10:56:56,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13315 states. [2018-12-09 10:56:56,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13315 to 11142. [2018-12-09 10:56:56,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11142 states. [2018-12-09 10:56:56,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11142 states to 11142 states and 26898 transitions. [2018-12-09 10:56:56,909 INFO L78 Accepts]: Start accepts. Automaton has 11142 states and 26898 transitions. Word has length 100 [2018-12-09 10:56:56,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:56:56,909 INFO L480 AbstractCegarLoop]: Abstraction has 11142 states and 26898 transitions. [2018-12-09 10:56:56,909 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 10:56:56,909 INFO L276 IsEmpty]: Start isEmpty. Operand 11142 states and 26898 transitions. [2018-12-09 10:56:56,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-09 10:56:56,916 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:56:56,916 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] [2018-12-09 10:56:56,917 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:56:56,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:56:56,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1824196817, now seen corresponding path program 1 times [2018-12-09 10:56:56,917 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:56:56,917 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:56:56,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:56:56,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:56:56,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:56:56,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:56:56,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:56:56,952 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:56:56,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 10:56:56,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 10:56:56,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 10:56:56,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 10:56:56,953 INFO L87 Difference]: Start difference. First operand 11142 states and 26898 transitions. Second operand 5 states. [2018-12-09 10:56:57,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:56:57,131 INFO L93 Difference]: Finished difference Result 12940 states and 30676 transitions. [2018-12-09 10:56:57,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 10:56:57,131 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2018-12-09 10:56:57,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:56:57,139 INFO L225 Difference]: With dead ends: 12940 [2018-12-09 10:56:57,140 INFO L226 Difference]: Without dead ends: 12940 [2018-12-09 10:56:57,140 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-09 10:56:57,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12940 states. [2018-12-09 10:56:57,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12940 to 11271. [2018-12-09 10:56:57,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11271 states. [2018-12-09 10:56:57,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11271 states to 11271 states and 27163 transitions. [2018-12-09 10:56:57,244 INFO L78 Accepts]: Start accepts. Automaton has 11271 states and 27163 transitions. Word has length 100 [2018-12-09 10:56:57,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:56:57,244 INFO L480 AbstractCegarLoop]: Abstraction has 11271 states and 27163 transitions. [2018-12-09 10:56:57,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 10:56:57,244 INFO L276 IsEmpty]: Start isEmpty. Operand 11271 states and 27163 transitions. [2018-12-09 10:56:57,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 10:56:57,253 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:56:57,254 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] [2018-12-09 10:56:57,254 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:56:57,254 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:56:57,254 INFO L82 PathProgramCache]: Analyzing trace with hash -309091398, now seen corresponding path program 1 times [2018-12-09 10:56:57,254 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:56:57,254 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:56:57,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:56:57,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:56:57,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:56:57,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:56:57,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:56:57,329 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:56:57,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 10:56:57,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 10:56:57,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 10:56:57,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-09 10:56:57,329 INFO L87 Difference]: Start difference. First operand 11271 states and 27163 transitions. Second operand 8 states. [2018-12-09 10:56:58,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:56:58,084 INFO L93 Difference]: Finished difference Result 17784 states and 41718 transitions. [2018-12-09 10:56:58,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-09 10:56:58,085 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 102 [2018-12-09 10:56:58,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:56:58,098 INFO L225 Difference]: With dead ends: 17784 [2018-12-09 10:56:58,098 INFO L226 Difference]: Without dead ends: 17689 [2018-12-09 10:56:58,098 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2018-12-09 10:56:58,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17689 states. [2018-12-09 10:56:58,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17689 to 13165. [2018-12-09 10:56:58,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13165 states. [2018-12-09 10:56:58,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13165 states to 13165 states and 31423 transitions. [2018-12-09 10:56:58,231 INFO L78 Accepts]: Start accepts. Automaton has 13165 states and 31423 transitions. Word has length 102 [2018-12-09 10:56:58,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:56:58,231 INFO L480 AbstractCegarLoop]: Abstraction has 13165 states and 31423 transitions. [2018-12-09 10:56:58,231 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 10:56:58,231 INFO L276 IsEmpty]: Start isEmpty. Operand 13165 states and 31423 transitions. [2018-12-09 10:56:58,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 10:56:58,241 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:56:58,241 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] [2018-12-09 10:56:58,241 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:56:58,241 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:56:58,241 INFO L82 PathProgramCache]: Analyzing trace with hash 1908666555, now seen corresponding path program 1 times [2018-12-09 10:56:58,242 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:56:58,242 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:56:58,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:56:58,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:56:58,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:56:58,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:56:58,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:56:58,315 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:56:58,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 10:56:58,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 10:56:58,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 10:56:58,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 10:56:58,316 INFO L87 Difference]: Start difference. First operand 13165 states and 31423 transitions. Second operand 7 states. [2018-12-09 10:56:58,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:56:58,615 INFO L93 Difference]: Finished difference Result 18127 states and 42049 transitions. [2018-12-09 10:56:58,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 10:56:58,615 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 102 [2018-12-09 10:56:58,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:56:58,627 INFO L225 Difference]: With dead ends: 18127 [2018-12-09 10:56:58,627 INFO L226 Difference]: Without dead ends: 18127 [2018-12-09 10:56:58,627 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2018-12-09 10:56:58,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18127 states. [2018-12-09 10:56:58,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18127 to 15594. [2018-12-09 10:56:58,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15594 states. [2018-12-09 10:56:58,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15594 states to 15594 states and 36654 transitions. [2018-12-09 10:56:58,772 INFO L78 Accepts]: Start accepts. Automaton has 15594 states and 36654 transitions. Word has length 102 [2018-12-09 10:56:58,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:56:58,773 INFO L480 AbstractCegarLoop]: Abstraction has 15594 states and 36654 transitions. [2018-12-09 10:56:58,773 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 10:56:58,773 INFO L276 IsEmpty]: Start isEmpty. Operand 15594 states and 36654 transitions. [2018-12-09 10:56:58,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 10:56:58,783 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:56:58,783 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] [2018-12-09 10:56:58,783 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:56:58,783 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:56:58,783 INFO L82 PathProgramCache]: Analyzing trace with hash 2120017468, now seen corresponding path program 1 times [2018-12-09 10:56:58,783 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:56:58,783 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:56:58,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:56:58,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:56:58,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:56:58,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:56:58,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-12-09 10:56:58,858 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:56:58,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 10:56:58,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 10:56:58,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 10:56:58,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-09 10:56:58,858 INFO L87 Difference]: Start difference. First operand 15594 states and 36654 transitions. Second operand 7 states. [2018-12-09 10:56:59,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:56:59,025 INFO L93 Difference]: Finished difference Result 16268 states and 38127 transitions. [2018-12-09 10:56:59,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 10:56:59,025 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 102 [2018-12-09 10:56:59,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:56:59,036 INFO L225 Difference]: With dead ends: 16268 [2018-12-09 10:56:59,036 INFO L226 Difference]: Without dead ends: 16268 [2018-12-09 10:56:59,036 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2018-12-09 10:56:59,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16268 states. [2018-12-09 10:56:59,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16268 to 16121. [2018-12-09 10:56:59,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16121 states. [2018-12-09 10:56:59,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16121 states to 16121 states and 37834 transitions. [2018-12-09 10:56:59,173 INFO L78 Accepts]: Start accepts. Automaton has 16121 states and 37834 transitions. Word has length 102 [2018-12-09 10:56:59,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:56:59,173 INFO L480 AbstractCegarLoop]: Abstraction has 16121 states and 37834 transitions. [2018-12-09 10:56:59,173 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 10:56:59,173 INFO L276 IsEmpty]: Start isEmpty. Operand 16121 states and 37834 transitions. [2018-12-09 10:56:59,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 10:56:59,186 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:56:59,186 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] [2018-12-09 10:56:59,186 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:56:59,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:56:59,186 INFO L82 PathProgramCache]: Analyzing trace with hash -1287446147, now seen corresponding path program 1 times [2018-12-09 10:56:59,186 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:56:59,186 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:56:59,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:56:59,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:56:59,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:56:59,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:56:59,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:56:59,279 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:56:59,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-09 10:56:59,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 10:56:59,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 10:56:59,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-09 10:56:59,279 INFO L87 Difference]: Start difference. First operand 16121 states and 37834 transitions. Second operand 9 states. [2018-12-09 10:56:59,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:56:59,391 INFO L93 Difference]: Finished difference Result 19649 states and 46341 transitions. [2018-12-09 10:56:59,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 10:56:59,391 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2018-12-09 10:56:59,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:56:59,393 INFO L225 Difference]: With dead ends: 19649 [2018-12-09 10:56:59,394 INFO L226 Difference]: Without dead ends: 3718 [2018-12-09 10:56:59,394 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2018-12-09 10:56:59,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3718 states. [2018-12-09 10:56:59,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3718 to 3716. [2018-12-09 10:56:59,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3716 states. [2018-12-09 10:56:59,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3716 states to 3716 states and 8809 transitions. [2018-12-09 10:56:59,417 INFO L78 Accepts]: Start accepts. Automaton has 3716 states and 8809 transitions. Word has length 102 [2018-12-09 10:56:59,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:56:59,417 INFO L480 AbstractCegarLoop]: Abstraction has 3716 states and 8809 transitions. [2018-12-09 10:56:59,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 10:56:59,417 INFO L276 IsEmpty]: Start isEmpty. Operand 3716 states and 8809 transitions. [2018-12-09 10:56:59,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 10:56:59,419 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:56:59,419 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] [2018-12-09 10:56:59,419 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:56:59,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:56:59,419 INFO L82 PathProgramCache]: Analyzing trace with hash -373689113, now seen corresponding path program 1 times [2018-12-09 10:56:59,420 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:56:59,420 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:56:59,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:56:59,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:56:59,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:56:59,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:56:59,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:56:59,454 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:56:59,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 10:56:59,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 10:56:59,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 10:56:59,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 10:56:59,455 INFO L87 Difference]: Start difference. First operand 3716 states and 8809 transitions. Second operand 5 states. [2018-12-09 10:56:59,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:56:59,561 INFO L93 Difference]: Finished difference Result 4151 states and 9753 transitions. [2018-12-09 10:56:59,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 10:56:59,561 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2018-12-09 10:56:59,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:56:59,564 INFO L225 Difference]: With dead ends: 4151 [2018-12-09 10:56:59,564 INFO L226 Difference]: Without dead ends: 4116 [2018-12-09 10:56:59,564 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 10:56:59,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4116 states. [2018-12-09 10:56:59,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4116 to 3772. [2018-12-09 10:56:59,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3772 states. [2018-12-09 10:56:59,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3772 states to 3772 states and 8934 transitions. [2018-12-09 10:56:59,591 INFO L78 Accepts]: Start accepts. Automaton has 3772 states and 8934 transitions. Word has length 102 [2018-12-09 10:56:59,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:56:59,591 INFO L480 AbstractCegarLoop]: Abstraction has 3772 states and 8934 transitions. [2018-12-09 10:56:59,591 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 10:56:59,591 INFO L276 IsEmpty]: Start isEmpty. Operand 3772 states and 8934 transitions. [2018-12-09 10:56:59,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 10:56:59,594 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:56:59,594 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] [2018-12-09 10:56:59,594 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:56:59,594 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:56:59,594 INFO L82 PathProgramCache]: Analyzing trace with hash -409676059, now seen corresponding path program 1 times [2018-12-09 10:56:59,594 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:56:59,594 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:56:59,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:56:59,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:56:59,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:56:59,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:56:59,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:56:59,644 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:56:59,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 10:56:59,644 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 10:56:59,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 10:56:59,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-09 10:56:59,644 INFO L87 Difference]: Start difference. First operand 3772 states and 8934 transitions. Second operand 7 states. [2018-12-09 10:56:59,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:56:59,812 INFO L93 Difference]: Finished difference Result 4206 states and 9846 transitions. [2018-12-09 10:56:59,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 10:56:59,812 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 102 [2018-12-09 10:56:59,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:56:59,816 INFO L225 Difference]: With dead ends: 4206 [2018-12-09 10:56:59,816 INFO L226 Difference]: Without dead ends: 4206 [2018-12-09 10:56:59,816 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-12-09 10:56:59,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4206 states. [2018-12-09 10:56:59,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4206 to 3714. [2018-12-09 10:56:59,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3714 states. [2018-12-09 10:56:59,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3714 states to 3714 states and 8816 transitions. [2018-12-09 10:56:59,842 INFO L78 Accepts]: Start accepts. Automaton has 3714 states and 8816 transitions. Word has length 102 [2018-12-09 10:56:59,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:56:59,842 INFO L480 AbstractCegarLoop]: Abstraction has 3714 states and 8816 transitions. [2018-12-09 10:56:59,842 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 10:56:59,843 INFO L276 IsEmpty]: Start isEmpty. Operand 3714 states and 8816 transitions. [2018-12-09 10:56:59,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 10:56:59,845 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:56:59,845 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] [2018-12-09 10:56:59,845 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:56:59,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:56:59,845 INFO L82 PathProgramCache]: Analyzing trace with hash -1904655584, now seen corresponding path program 2 times [2018-12-09 10:56:59,845 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:56:59,845 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:56:59,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:56:59,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:56:59,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:56:59,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:56:59,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:56:59,952 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:56:59,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-09 10:56:59,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-09 10:56:59,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 10:56:59,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-12-09 10:56:59,952 INFO L87 Difference]: Start difference. First operand 3714 states and 8816 transitions. Second operand 12 states. [2018-12-09 10:57:00,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:57:00,449 INFO L93 Difference]: Finished difference Result 5110 states and 11911 transitions. [2018-12-09 10:57:00,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-09 10:57:00,449 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 102 [2018-12-09 10:57:00,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:57:00,452 INFO L225 Difference]: With dead ends: 5110 [2018-12-09 10:57:00,452 INFO L226 Difference]: Without dead ends: 5110 [2018-12-09 10:57:00,452 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2018-12-09 10:57:00,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5110 states. [2018-12-09 10:57:00,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5110 to 3759. [2018-12-09 10:57:00,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3759 states. [2018-12-09 10:57:00,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3759 states to 3759 states and 8900 transitions. [2018-12-09 10:57:00,480 INFO L78 Accepts]: Start accepts. Automaton has 3759 states and 8900 transitions. Word has length 102 [2018-12-09 10:57:00,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:57:00,480 INFO L480 AbstractCegarLoop]: Abstraction has 3759 states and 8900 transitions. [2018-12-09 10:57:00,480 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-09 10:57:00,481 INFO L276 IsEmpty]: Start isEmpty. Operand 3759 states and 8900 transitions. [2018-12-09 10:57:00,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 10:57:00,483 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:57:00,483 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] [2018-12-09 10:57:00,483 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:57:00,483 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:57:00,483 INFO L82 PathProgramCache]: Analyzing trace with hash -1017151903, now seen corresponding path program 2 times [2018-12-09 10:57:00,483 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:57:00,483 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:57:00,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:57:00,484 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 10:57:00,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:57:00,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:57:00,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:57:00,584 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:57:00,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-09 10:57:00,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-09 10:57:00,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-09 10:57:00,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-12-09 10:57:00,584 INFO L87 Difference]: Start difference. First operand 3759 states and 8900 transitions. Second operand 13 states. [2018-12-09 10:57:00,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:57:00,997 INFO L93 Difference]: Finished difference Result 6089 states and 14213 transitions. [2018-12-09 10:57:00,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-09 10:57:00,997 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 102 [2018-12-09 10:57:00,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:57:01,000 INFO L225 Difference]: With dead ends: 6089 [2018-12-09 10:57:01,000 INFO L226 Difference]: Without dead ends: 4362 [2018-12-09 10:57:01,001 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=387, Unknown=0, NotChecked=0, Total=462 [2018-12-09 10:57:01,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4362 states. [2018-12-09 10:57:01,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4362 to 3815. [2018-12-09 10:57:01,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3815 states. [2018-12-09 10:57:01,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3815 states to 3815 states and 8962 transitions. [2018-12-09 10:57:01,026 INFO L78 Accepts]: Start accepts. Automaton has 3815 states and 8962 transitions. Word has length 102 [2018-12-09 10:57:01,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:57:01,026 INFO L480 AbstractCegarLoop]: Abstraction has 3815 states and 8962 transitions. [2018-12-09 10:57:01,026 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-09 10:57:01,026 INFO L276 IsEmpty]: Start isEmpty. Operand 3815 states and 8962 transitions. [2018-12-09 10:57:01,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 10:57:01,028 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:57:01,029 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] [2018-12-09 10:57:01,029 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:57:01,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:57:01,029 INFO L82 PathProgramCache]: Analyzing trace with hash -604299489, now seen corresponding path program 3 times [2018-12-09 10:57:01,029 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:57:01,029 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:57:01,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:57:01,030 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 10:57:01,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:57:01,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:57:01,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:57:01,064 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 10:57:01,127 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-09 10:57:01,128 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 10:57:01 BasicIcfg [2018-12-09 10:57:01,128 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 10:57:01,128 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 10:57:01,129 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 10:57:01,129 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 10:57:01,129 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 10:55:55" (3/4) ... [2018-12-09 10:57:01,130 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-09 10:57:01,202 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_79bc4abe-63a3-420b-8442-9ed8b2598fd3/bin-2019/uautomizer/witness.graphml [2018-12-09 10:57:01,202 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 10:57:01,202 INFO L168 Benchmark]: Toolchain (without parser) took 66496.42 ms. Allocated memory was 1.0 GB in the beginning and 6.9 GB in the end (delta: 5.9 GB). Free memory was 945.3 MB in the beginning and 4.4 GB in the end (delta: -3.4 GB). Peak memory consumption was 2.4 GB. Max. memory is 11.5 GB. [2018-12-09 10:57:01,203 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 971.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 10:57:01,203 INFO L168 Benchmark]: CACSL2BoogieTranslator took 322.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 945.3 MB in the beginning and 1.1 GB in the end (delta: -177.8 MB). Peak memory consumption was 37.1 MB. Max. memory is 11.5 GB. [2018-12-09 10:57:01,203 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2018-12-09 10:57:01,204 INFO L168 Benchmark]: Boogie Preprocessor took 27.62 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 10:57:01,204 INFO L168 Benchmark]: RCFGBuilder took 410.71 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: 53.9 MB). Peak memory consumption was 53.9 MB. Max. memory is 11.5 GB. [2018-12-09 10:57:01,204 INFO L168 Benchmark]: TraceAbstraction took 65616.14 ms. Allocated memory was 1.2 GB in the beginning and 6.9 GB in the end (delta: 5.7 GB). Free memory was 1.1 GB in the beginning and 4.5 GB in the end (delta: -3.4 GB). Peak memory consumption was 2.3 GB. Max. memory is 11.5 GB. [2018-12-09 10:57:01,204 INFO L168 Benchmark]: Witness Printer took 73.30 ms. Allocated memory is still 6.9 GB. Free memory was 4.5 GB in the beginning and 4.4 GB in the end (delta: 67.5 MB). Peak memory consumption was 67.5 MB. Max. memory is 11.5 GB. [2018-12-09 10:57:01,205 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 971.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 322.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 945.3 MB in the beginning and 1.1 GB in the end (delta: -177.8 MB). Peak memory consumption was 37.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 43.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.62 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 410.71 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: 53.9 MB). Peak memory consumption was 53.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 65616.14 ms. Allocated memory was 1.2 GB in the beginning and 6.9 GB in the end (delta: 5.7 GB). Free memory was 1.1 GB in the beginning and 4.5 GB in the end (delta: -3.4 GB). Peak memory consumption was 2.3 GB. Max. memory is 11.5 GB. * Witness Printer took 73.30 ms. Allocated memory is still 6.9 GB. Free memory was 4.5 GB in the beginning and 4.4 GB in the end (delta: 67.5 MB). Peak memory consumption was 67.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L672] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L674] -1 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L676] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L678] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L679] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L680] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L682] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L684] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L685] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L686] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L687] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L688] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L689] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L690] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L691] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L692] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L693] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L694] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L695] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L696] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L697] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L698] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L699] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L700] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L786] -1 pthread_t t1765; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L787] FCALL, FORK -1 pthread_create(&t1765, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L788] -1 pthread_t t1766; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L789] FCALL, FORK -1 pthread_create(&t1766, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L734] 0 y$w_buff1 = y$w_buff0 [L735] 0 y$w_buff0 = 1 [L736] 0 y$w_buff1_used = y$w_buff0_used [L737] 0 y$w_buff0_used = (_Bool)1 [L5] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L739] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L740] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L741] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L742] 0 y$r_buff0_thd2 = (_Bool)1 [L745] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L746] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L747] 0 y$flush_delayed = weak$$choice2 [L748] 0 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L749] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L749] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L749] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L749] 0 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L750] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L750] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L751] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L751] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L752] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L752] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L753] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L753] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L754] EXPR 0 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L754] 0 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L755] EXPR 0 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L755] 0 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L756] 0 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L757] EXPR 0 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L757] 0 y = y$flush_delayed ? y$mem_tmp : y [L758] 0 y$flush_delayed = (_Bool)0 [L761] 0 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L764] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L704] 1 x = 1 [L709] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L710] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L711] 1 y$flush_delayed = weak$$choice2 [L712] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L713] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=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, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L764] 0 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L765] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=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, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L765] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L766] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=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, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L766] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L713] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L714] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L714] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L715] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L715] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L767] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L767] 0 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L768] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L768] 0 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L771] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=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, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L716] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=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 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L716] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L717] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=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 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L717] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L718] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=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 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L718] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L719] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=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 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L719] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L720] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=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, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L721] EXPR 1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=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, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L721] 1 y = y$flush_delayed ? y$mem_tmp : y [L722] 1 y$flush_delayed = (_Bool)0 [L727] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L791] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=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=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L795] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=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=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L795] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=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=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L795] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=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=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L795] -1 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L796] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=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=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L796] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L797] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=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=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L797] -1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L798] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=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=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L798] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L799] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=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=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L799] -1 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L802] -1 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=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=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L5] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=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=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L5] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=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=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 283 locations, 3 error locations. UNSAFE Result, 65.5s OverallTime, 31 OverallIterations, 1 TraceHistogramMax, 20.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 11118 SDtfs, 14077 SDslu, 31437 SDs, 0 SdLazy, 13063 SolverSat, 716 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 330 GetRequests, 78 SyntacticMatches, 21 SemanticMatches, 231 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=229832occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 36.5s AutomataMinimizationTime, 30 MinimizatonAttempts, 511083 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 2509 NumberOfCodeBlocks, 2509 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 2377 ConstructedInterpolants, 0 QuantifiedInterpolants, 515423 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 30 InterpolantComputations, 30 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...