./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix035_tso.opt_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_626a176b-f84e-41ed-9dce-5cb735f6b7e9/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_626a176b-f84e-41ed-9dce-5cb735f6b7e9/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_626a176b-f84e-41ed-9dce-5cb735f6b7e9/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_626a176b-f84e-41ed-9dce-5cb735f6b7e9/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix035_tso.opt_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_626a176b-f84e-41ed-9dce-5cb735f6b7e9/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_626a176b-f84e-41ed-9dce-5cb735f6b7e9/bin-2019/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 00d92b40773ef1575f2814e1b92f3f694886005e ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-02 06:25:32,225 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 06:25:32,226 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 06:25:32,232 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 06:25:32,232 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 06:25:32,233 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 06:25:32,234 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 06:25:32,235 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 06:25:32,236 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 06:25:32,237 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 06:25:32,237 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 06:25:32,237 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 06:25:32,238 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 06:25:32,239 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 06:25:32,239 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 06:25:32,239 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 06:25:32,240 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 06:25:32,241 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 06:25:32,242 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 06:25:32,242 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 06:25:32,243 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 06:25:32,244 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 06:25:32,245 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 06:25:32,245 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 06:25:32,245 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 06:25:32,246 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 06:25:32,246 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 06:25:32,247 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 06:25:32,247 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 06:25:32,247 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 06:25:32,248 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 06:25:32,248 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 06:25:32,248 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 06:25:32,248 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 06:25:32,249 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 06:25:32,249 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 06:25:32,249 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_626a176b-f84e-41ed-9dce-5cb735f6b7e9/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-02 06:25:32,256 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 06:25:32,256 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 06:25:32,257 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 06:25:32,257 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 06:25:32,257 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 06:25:32,257 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 06:25:32,257 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 06:25:32,258 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 06:25:32,258 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 06:25:32,258 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 06:25:32,258 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 06:25:32,258 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 06:25:32,258 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 06:25:32,259 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 06:25:32,259 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 06:25:32,259 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 06:25:32,259 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 06:25:32,259 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 06:25:32,260 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 06:25:32,260 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 06:25:32,260 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 06:25:32,260 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 06:25:32,260 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 06:25:32,260 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 06:25:32,261 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 06:25:32,261 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 06:25:32,261 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 06:25:32,261 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 06:25:32,261 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 06:25:32,261 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 06:25:32,261 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 06:25:32,262 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 06:25:32,262 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 06:25:32,262 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 06:25:32,262 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 06:25:32,262 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-02 06:25:32,262 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_626a176b-f84e-41ed-9dce-5cb735f6b7e9/bin-2019/utaipan 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 -> Taipan 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 -> 00d92b40773ef1575f2814e1b92f3f694886005e [2018-12-02 06:25:32,283 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 06:25:32,291 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 06:25:32,294 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 06:25:32,295 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 06:25:32,295 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 06:25:32,296 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_626a176b-f84e-41ed-9dce-5cb735f6b7e9/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/mix035_tso.opt_false-unreach-call.i [2018-12-02 06:25:32,330 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_626a176b-f84e-41ed-9dce-5cb735f6b7e9/bin-2019/utaipan/data/88802a3f6/e07ff354244340e984cdaa545abac69b/FLAGe900d8bb0 [2018-12-02 06:25:32,800 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 06:25:32,800 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_626a176b-f84e-41ed-9dce-5cb735f6b7e9/sv-benchmarks/c/pthread-wmm/mix035_tso.opt_false-unreach-call.i [2018-12-02 06:25:32,807 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_626a176b-f84e-41ed-9dce-5cb735f6b7e9/bin-2019/utaipan/data/88802a3f6/e07ff354244340e984cdaa545abac69b/FLAGe900d8bb0 [2018-12-02 06:25:33,167 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_626a176b-f84e-41ed-9dce-5cb735f6b7e9/bin-2019/utaipan/data/88802a3f6/e07ff354244340e984cdaa545abac69b [2018-12-02 06:25:33,169 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 06:25:33,170 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 06:25:33,171 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 06:25:33,171 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 06:25:33,174 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 06:25:33,174 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 06:25:33" (1/1) ... [2018-12-02 06:25:33,177 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51e31f4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:25:33, skipping insertion in model container [2018-12-02 06:25:33,177 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 06:25:33" (1/1) ... [2018-12-02 06:25:33,185 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 06:25:33,224 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 06:25:33,445 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 06:25:33,452 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 06:25:33,536 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 06:25:33,566 INFO L195 MainTranslator]: Completed translation [2018-12-02 06:25:33,566 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:25:33 WrapperNode [2018-12-02 06:25:33,566 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 06:25:33,566 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 06:25:33,566 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 06:25:33,566 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 06:25:33,572 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:25:33" (1/1) ... [2018-12-02 06:25:33,581 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:25:33" (1/1) ... [2018-12-02 06:25:33,597 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 06:25:33,597 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 06:25:33,597 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 06:25:33,597 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 06:25:33,603 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:25:33" (1/1) ... [2018-12-02 06:25:33,603 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:25:33" (1/1) ... [2018-12-02 06:25:33,606 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:25:33" (1/1) ... [2018-12-02 06:25:33,606 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:25:33" (1/1) ... [2018-12-02 06:25:33,611 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:25:33" (1/1) ... [2018-12-02 06:25:33,613 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:25:33" (1/1) ... [2018-12-02 06:25:33,615 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:25:33" (1/1) ... [2018-12-02 06:25:33,617 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 06:25:33,617 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 06:25:33,617 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 06:25:33,617 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 06:25:33,617 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:25:33" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_626a176b-f84e-41ed-9dce-5cb735f6b7e9/bin-2019/utaipan/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-02 06:25:33,648 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 06:25:33,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 06:25:33,648 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-02 06:25:33,648 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 06:25:33,648 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-02 06:25:33,648 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-02 06:25:33,648 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-02 06:25:33,648 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-02 06:25:33,648 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2018-12-02 06:25:33,648 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2018-12-02 06:25:33,648 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-02 06:25:33,648 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 06:25:33,648 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 06:25:33,649 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-02 06:25:33,937 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 06:25:33,937 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-02 06:25:33,937 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 06:25:33 BoogieIcfgContainer [2018-12-02 06:25:33,937 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 06:25:33,938 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 06:25:33,938 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 06:25:33,940 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 06:25:33,940 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 06:25:33" (1/3) ... [2018-12-02 06:25:33,940 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d5d82e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 06:25:33, skipping insertion in model container [2018-12-02 06:25:33,940 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:25:33" (2/3) ... [2018-12-02 06:25:33,940 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d5d82e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 06:25:33, skipping insertion in model container [2018-12-02 06:25:33,940 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 06:25:33" (3/3) ... [2018-12-02 06:25:33,941 INFO L112 eAbstractionObserver]: Analyzing ICFG mix035_tso.opt_false-unreach-call.i [2018-12-02 06:25:33,963 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,963 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,963 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,963 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,964 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,964 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,964 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,964 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,964 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,964 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,965 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet5.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,965 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,965 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,965 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,965 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,965 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet5.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,966 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,966 WARN L317 ript$VariableManager]: TermVariabe Thread2_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,966 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet5.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,966 WARN L317 ript$VariableManager]: TermVariabe Thread2_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,966 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,966 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet5.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,966 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,967 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,967 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,967 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,967 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,967 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,967 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,968 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,968 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,968 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,968 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,968 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,968 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,968 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,969 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,969 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,969 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,969 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,969 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,969 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,970 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,970 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,970 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,970 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,970 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,970 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,970 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,971 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,971 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,971 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,971 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,971 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,971 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,971 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,971 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,972 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,972 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,972 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,972 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,972 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,973 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,973 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,973 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,973 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,973 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,973 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,973 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,974 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,974 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,974 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,974 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,974 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,974 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,974 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,975 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,975 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,975 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,975 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,975 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,975 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,975 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,976 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,976 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,976 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,976 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,976 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,977 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,977 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,977 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,977 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,977 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,977 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,977 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,978 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,978 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,978 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,978 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,978 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,978 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,978 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,979 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,979 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,979 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,979 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,979 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,979 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,979 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,980 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,980 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,980 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,980 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,980 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,980 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,981 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,981 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,981 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,981 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,981 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,981 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,981 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,982 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,982 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,982 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,982 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,982 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,982 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,982 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,983 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,983 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,983 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,983 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,983 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,983 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,983 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,984 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,984 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,984 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,984 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,984 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,984 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,984 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,984 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,985 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,985 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,985 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,985 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,985 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,985 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:25:33,990 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-02 06:25:33,990 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 06:25:33,997 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-02 06:25:34,006 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-02 06:25:34,024 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 06:25:34,024 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 06:25:34,024 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 06:25:34,024 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 06:25:34,024 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 06:25:34,024 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 06:25:34,024 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 06:25:34,024 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 06:25:34,031 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 147places, 178 transitions [2018-12-02 06:25:54,859 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 149046 states. [2018-12-02 06:25:54,860 INFO L276 IsEmpty]: Start isEmpty. Operand 149046 states. [2018-12-02 06:25:54,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-02 06:25:54,868 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:25:54,869 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-02 06:25:54,870 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:25:54,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:25:54,873 INFO L82 PathProgramCache]: Analyzing trace with hash 585073781, now seen corresponding path program 1 times [2018-12-02 06:25:54,875 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:25:54,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:25:54,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:25:54,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:25:54,910 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:25:54,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:25:55,021 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-02 06:25:55,023 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:25:55,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 06:25:55,023 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:25:55,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 06:25:55,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 06:25:55,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 06:25:55,035 INFO L87 Difference]: Start difference. First operand 149046 states. Second operand 4 states. [2018-12-02 06:25:56,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:25:56,399 INFO L93 Difference]: Finished difference Result 257066 states and 1188605 transitions. [2018-12-02 06:25:56,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 06:25:56,400 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2018-12-02 06:25:56,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:25:58,675 INFO L225 Difference]: With dead ends: 257066 [2018-12-02 06:25:58,676 INFO L226 Difference]: Without dead ends: 174816 [2018-12-02 06:25:58,677 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-02 06:25:59,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174816 states. [2018-12-02 06:26:01,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174816 to 110556. [2018-12-02 06:26:01,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110556 states. [2018-12-02 06:26:01,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110556 states to 110556 states and 511487 transitions. [2018-12-02 06:26:01,809 INFO L78 Accepts]: Start accepts. Automaton has 110556 states and 511487 transitions. Word has length 47 [2018-12-02 06:26:01,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:26:01,809 INFO L480 AbstractCegarLoop]: Abstraction has 110556 states and 511487 transitions. [2018-12-02 06:26:01,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 06:26:01,810 INFO L276 IsEmpty]: Start isEmpty. Operand 110556 states and 511487 transitions. [2018-12-02 06:26:01,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-02 06:26:01,819 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:26:01,819 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:26:01,819 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:26:01,819 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:26:01,820 INFO L82 PathProgramCache]: Analyzing trace with hash 188144804, now seen corresponding path program 1 times [2018-12-02 06:26:01,820 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:26:01,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:26:01,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:26:01,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:26:01,823 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:26:01,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:26:01,867 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-02 06:26:01,868 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:26:01,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 06:26:01,868 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:26:01,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 06:26:01,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 06:26:01,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 06:26:01,869 INFO L87 Difference]: Start difference. First operand 110556 states and 511487 transitions. Second operand 4 states. [2018-12-02 06:26:02,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:26:02,369 INFO L93 Difference]: Finished difference Result 99454 states and 448691 transitions. [2018-12-02 06:26:02,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 06:26:02,370 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2018-12-02 06:26:02,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:26:02,604 INFO L225 Difference]: With dead ends: 99454 [2018-12-02 06:26:02,604 INFO L226 Difference]: Without dead ends: 95224 [2018-12-02 06:26:02,604 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-02 06:26:03,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95224 states. [2018-12-02 06:26:04,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95224 to 95224. [2018-12-02 06:26:04,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95224 states. [2018-12-02 06:26:04,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95224 states to 95224 states and 433075 transitions. [2018-12-02 06:26:04,702 INFO L78 Accepts]: Start accepts. Automaton has 95224 states and 433075 transitions. Word has length 55 [2018-12-02 06:26:04,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:26:04,702 INFO L480 AbstractCegarLoop]: Abstraction has 95224 states and 433075 transitions. [2018-12-02 06:26:04,702 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 06:26:04,702 INFO L276 IsEmpty]: Start isEmpty. Operand 95224 states and 433075 transitions. [2018-12-02 06:26:04,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-02 06:26:04,709 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:26:04,709 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] [2018-12-02 06:26:04,709 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:26:04,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:26:04,709 INFO L82 PathProgramCache]: Analyzing trace with hash 1709149424, now seen corresponding path program 1 times [2018-12-02 06:26:04,710 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:26:04,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:26:04,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:26:04,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:26:04,712 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:26:04,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:26:04,751 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-02 06:26:04,751 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:26:04,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 06:26:04,751 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:26:04,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 06:26:04,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 06:26:04,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 06:26:04,752 INFO L87 Difference]: Start difference. First operand 95224 states and 433075 transitions. Second operand 3 states. [2018-12-02 06:26:05,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:26:05,164 INFO L93 Difference]: Finished difference Result 95224 states and 432231 transitions. [2018-12-02 06:26:05,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 06:26:05,165 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2018-12-02 06:26:05,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:26:05,422 INFO L225 Difference]: With dead ends: 95224 [2018-12-02 06:26:05,422 INFO L226 Difference]: Without dead ends: 95224 [2018-12-02 06:26:05,422 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-02 06:26:07,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95224 states. [2018-12-02 06:26:08,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95224 to 95224. [2018-12-02 06:26:08,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95224 states. [2018-12-02 06:26:08,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95224 states to 95224 states and 432231 transitions. [2018-12-02 06:26:08,603 INFO L78 Accepts]: Start accepts. Automaton has 95224 states and 432231 transitions. Word has length 56 [2018-12-02 06:26:08,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:26:08,603 INFO L480 AbstractCegarLoop]: Abstraction has 95224 states and 432231 transitions. [2018-12-02 06:26:08,603 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 06:26:08,603 INFO L276 IsEmpty]: Start isEmpty. Operand 95224 states and 432231 transitions. [2018-12-02 06:26:08,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-02 06:26:08,609 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:26:08,609 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] [2018-12-02 06:26:08,609 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:26:08,609 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:26:08,609 INFO L82 PathProgramCache]: Analyzing trace with hash -843007537, now seen corresponding path program 1 times [2018-12-02 06:26:08,609 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:26:08,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:26:08,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:26:08,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:26:08,611 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:26:08,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:26:08,657 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-02 06:26:08,657 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:26:08,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 06:26:08,657 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:26:08,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 06:26:08,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 06:26:08,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 06:26:08,658 INFO L87 Difference]: Start difference. First operand 95224 states and 432231 transitions. Second operand 5 states. [2018-12-02 06:26:09,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:26:09,977 INFO L93 Difference]: Finished difference Result 208036 states and 908843 transitions. [2018-12-02 06:26:09,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 06:26:09,977 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2018-12-02 06:26:09,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:26:10,515 INFO L225 Difference]: With dead ends: 208036 [2018-12-02 06:26:10,515 INFO L226 Difference]: Without dead ends: 205116 [2018-12-02 06:26:10,515 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-02 06:26:11,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205116 states. [2018-12-02 06:26:13,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205116 to 137860. [2018-12-02 06:26:13,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137860 states. [2018-12-02 06:26:13,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137860 states to 137860 states and 605636 transitions. [2018-12-02 06:26:13,868 INFO L78 Accepts]: Start accepts. Automaton has 137860 states and 605636 transitions. Word has length 56 [2018-12-02 06:26:13,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:26:13,868 INFO L480 AbstractCegarLoop]: Abstraction has 137860 states and 605636 transitions. [2018-12-02 06:26:13,868 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 06:26:13,868 INFO L276 IsEmpty]: Start isEmpty. Operand 137860 states and 605636 transitions. [2018-12-02 06:26:13,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-02 06:26:13,874 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:26:13,874 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] [2018-12-02 06:26:13,874 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:26:13,874 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:26:13,875 INFO L82 PathProgramCache]: Analyzing trace with hash -484759346, now seen corresponding path program 1 times [2018-12-02 06:26:13,875 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:26:13,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:26:13,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:26:13,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:26:13,876 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:26:13,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:26:13,927 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-02 06:26:13,927 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:26:13,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 06:26:13,927 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:26:13,927 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 06:26:13,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 06:26:13,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 06:26:13,928 INFO L87 Difference]: Start difference. First operand 137860 states and 605636 transitions. Second operand 5 states. [2018-12-02 06:26:15,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:26:15,312 INFO L93 Difference]: Finished difference Result 270772 states and 1180494 transitions. [2018-12-02 06:26:15,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 06:26:15,313 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2018-12-02 06:26:15,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:26:16,056 INFO L225 Difference]: With dead ends: 270772 [2018-12-02 06:26:16,057 INFO L226 Difference]: Without dead ends: 268197 [2018-12-02 06:26:16,057 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-02 06:26:19,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268197 states. [2018-12-02 06:26:21,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268197 to 153577. [2018-12-02 06:26:21,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153577 states. [2018-12-02 06:26:22,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153577 states to 153577 states and 669996 transitions. [2018-12-02 06:26:22,058 INFO L78 Accepts]: Start accepts. Automaton has 153577 states and 669996 transitions. Word has length 56 [2018-12-02 06:26:22,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:26:22,059 INFO L480 AbstractCegarLoop]: Abstraction has 153577 states and 669996 transitions. [2018-12-02 06:26:22,059 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 06:26:22,059 INFO L276 IsEmpty]: Start isEmpty. Operand 153577 states and 669996 transitions. [2018-12-02 06:26:22,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-02 06:26:22,069 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:26:22,069 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] [2018-12-02 06:26:22,069 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:26:22,069 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:26:22,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1508119156, now seen corresponding path program 1 times [2018-12-02 06:26:22,069 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:26:22,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:26:22,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:26:22,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:26:22,071 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:26:22,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:26:22,099 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-02 06:26:22,099 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:26:22,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 06:26:22,100 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:26:22,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 06:26:22,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 06:26:22,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 06:26:22,100 INFO L87 Difference]: Start difference. First operand 153577 states and 669996 transitions. Second operand 3 states. [2018-12-02 06:26:23,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:26:23,390 INFO L93 Difference]: Finished difference Result 200749 states and 861108 transitions. [2018-12-02 06:26:23,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 06:26:23,391 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2018-12-02 06:26:23,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:26:23,912 INFO L225 Difference]: With dead ends: 200749 [2018-12-02 06:26:23,912 INFO L226 Difference]: Without dead ends: 200729 [2018-12-02 06:26:23,912 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-02 06:26:24,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200729 states. [2018-12-02 06:26:27,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200729 to 174143. [2018-12-02 06:26:27,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174143 states. [2018-12-02 06:26:30,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174143 states to 174143 states and 753651 transitions. [2018-12-02 06:26:30,581 INFO L78 Accepts]: Start accepts. Automaton has 174143 states and 753651 transitions. Word has length 58 [2018-12-02 06:26:30,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:26:30,581 INFO L480 AbstractCegarLoop]: Abstraction has 174143 states and 753651 transitions. [2018-12-02 06:26:30,581 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 06:26:30,581 INFO L276 IsEmpty]: Start isEmpty. Operand 174143 states and 753651 transitions. [2018-12-02 06:26:30,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-02 06:26:30,605 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:26:30,605 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] [2018-12-02 06:26:30,605 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:26:30,605 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:26:30,605 INFO L82 PathProgramCache]: Analyzing trace with hash 979024319, now seen corresponding path program 1 times [2018-12-02 06:26:30,605 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:26:30,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:26:30,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:26:30,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:26:30,607 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:26:30,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:26:30,668 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-02 06:26:30,668 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:26:30,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 06:26:30,668 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:26:30,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 06:26:30,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 06:26:30,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 06:26:30,669 INFO L87 Difference]: Start difference. First operand 174143 states and 753651 transitions. Second operand 6 states. [2018-12-02 06:26:32,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:26:32,306 INFO L93 Difference]: Finished difference Result 300091 states and 1288125 transitions. [2018-12-02 06:26:32,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 06:26:32,307 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2018-12-02 06:26:32,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:26:33,318 INFO L225 Difference]: With dead ends: 300091 [2018-12-02 06:26:33,318 INFO L226 Difference]: Without dead ends: 297046 [2018-12-02 06:26:33,319 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-02 06:26:34,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297046 states. [2018-12-02 06:26:37,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297046 to 176097. [2018-12-02 06:26:37,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176097 states. [2018-12-02 06:26:37,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176097 states to 176097 states and 763970 transitions. [2018-12-02 06:26:37,972 INFO L78 Accepts]: Start accepts. Automaton has 176097 states and 763970 transitions. Word has length 62 [2018-12-02 06:26:37,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:26:37,972 INFO L480 AbstractCegarLoop]: Abstraction has 176097 states and 763970 transitions. [2018-12-02 06:26:37,972 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 06:26:37,972 INFO L276 IsEmpty]: Start isEmpty. Operand 176097 states and 763970 transitions. [2018-12-02 06:26:37,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-02 06:26:37,997 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:26:37,997 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:26:37,997 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:26:37,998 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:26:37,998 INFO L82 PathProgramCache]: Analyzing trace with hash -2067287304, now seen corresponding path program 1 times [2018-12-02 06:26:37,998 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:26:37,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:26:37,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:26:38,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:26:38,000 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:26:38,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:26:38,065 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-02 06:26:38,066 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:26:38,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 06:26:38,066 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:26:38,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 06:26:38,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 06:26:38,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-02 06:26:38,066 INFO L87 Difference]: Start difference. First operand 176097 states and 763970 transitions. Second operand 6 states. [2018-12-02 06:26:39,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:26:39,775 INFO L93 Difference]: Finished difference Result 240021 states and 1031910 transitions. [2018-12-02 06:26:39,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 06:26:39,776 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 63 [2018-12-02 06:26:39,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:26:40,376 INFO L225 Difference]: With dead ends: 240021 [2018-12-02 06:26:40,376 INFO L226 Difference]: Without dead ends: 235465 [2018-12-02 06:26:40,376 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-02 06:26:41,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235465 states. [2018-12-02 06:26:46,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235465 to 220997. [2018-12-02 06:26:46,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220997 states. [2018-12-02 06:26:47,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220997 states to 220997 states and 953582 transitions. [2018-12-02 06:26:47,153 INFO L78 Accepts]: Start accepts. Automaton has 220997 states and 953582 transitions. Word has length 63 [2018-12-02 06:26:47,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:26:47,153 INFO L480 AbstractCegarLoop]: Abstraction has 220997 states and 953582 transitions. [2018-12-02 06:26:47,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 06:26:47,153 INFO L276 IsEmpty]: Start isEmpty. Operand 220997 states and 953582 transitions. [2018-12-02 06:26:47,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-02 06:26:47,190 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:26:47,190 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-02 06:26:47,190 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:26:47,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:26:47,190 INFO L82 PathProgramCache]: Analyzing trace with hash 430728633, now seen corresponding path program 1 times [2018-12-02 06:26:47,190 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:26:47,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:26:47,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:26:47,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:26:47,192 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:26:47,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:26:47,254 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-02 06:26:47,254 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:26:47,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 06:26:47,254 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:26:47,254 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 06:26:47,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 06:26:47,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 06:26:47,255 INFO L87 Difference]: Start difference. First operand 220997 states and 953582 transitions. Second operand 7 states. [2018-12-02 06:26:49,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:26:49,425 INFO L93 Difference]: Finished difference Result 315729 states and 1321019 transitions. [2018-12-02 06:26:49,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 06:26:49,426 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2018-12-02 06:26:49,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:26:50,251 INFO L225 Difference]: With dead ends: 315729 [2018-12-02 06:26:50,251 INFO L226 Difference]: Without dead ends: 315729 [2018-12-02 06:26:50,251 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-02 06:26:51,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315729 states. [2018-12-02 06:26:55,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315729 to 259069. [2018-12-02 06:26:55,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259069 states. [2018-12-02 06:26:56,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259069 states to 259069 states and 1098844 transitions. [2018-12-02 06:26:56,160 INFO L78 Accepts]: Start accepts. Automaton has 259069 states and 1098844 transitions. Word has length 63 [2018-12-02 06:26:56,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:26:56,160 INFO L480 AbstractCegarLoop]: Abstraction has 259069 states and 1098844 transitions. [2018-12-02 06:26:56,160 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 06:26:56,160 INFO L276 IsEmpty]: Start isEmpty. Operand 259069 states and 1098844 transitions. [2018-12-02 06:26:56,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-02 06:26:56,197 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:26:56,197 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-02 06:26:56,197 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:26:56,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:26:56,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1318232314, now seen corresponding path program 1 times [2018-12-02 06:26:56,198 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:26:56,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:26:56,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:26:56,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:26:56,199 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:26:56,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:26:56,232 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-02 06:26:56,232 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:26:56,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 06:26:56,233 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:26:56,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 06:26:56,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 06:26:56,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 06:26:56,233 INFO L87 Difference]: Start difference. First operand 259069 states and 1098844 transitions. Second operand 3 states. [2018-12-02 06:26:59,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:26:59,545 INFO L93 Difference]: Finished difference Result 197445 states and 831542 transitions. [2018-12-02 06:26:59,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 06:26:59,546 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2018-12-02 06:26:59,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:27:00,009 INFO L225 Difference]: With dead ends: 197445 [2018-12-02 06:27:00,009 INFO L226 Difference]: Without dead ends: 195125 [2018-12-02 06:27:00,010 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 06:27:00,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195125 states. [2018-12-02 06:27:02,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195125 to 187350. [2018-12-02 06:27:02,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187350 states. [2018-12-02 06:27:03,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187350 states to 187350 states and 792569 transitions. [2018-12-02 06:27:03,763 INFO L78 Accepts]: Start accepts. Automaton has 187350 states and 792569 transitions. Word has length 63 [2018-12-02 06:27:03,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:27:03,763 INFO L480 AbstractCegarLoop]: Abstraction has 187350 states and 792569 transitions. [2018-12-02 06:27:03,763 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 06:27:03,763 INFO L276 IsEmpty]: Start isEmpty. Operand 187350 states and 792569 transitions. [2018-12-02 06:27:03,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-02 06:27:03,792 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:27:03,792 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:27:03,792 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:27:03,792 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:27:03,792 INFO L82 PathProgramCache]: Analyzing trace with hash 1987526324, now seen corresponding path program 1 times [2018-12-02 06:27:03,793 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:27:03,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:03,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:27:03,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:03,794 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:27:03,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:27:03,855 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-02 06:27:03,855 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:27:03,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 06:27:03,855 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:27:03,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 06:27:03,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 06:27:03,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 06:27:03,856 INFO L87 Difference]: Start difference. First operand 187350 states and 792569 transitions. Second operand 6 states. [2018-12-02 06:27:05,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:27:05,176 INFO L93 Difference]: Finished difference Result 244558 states and 1008335 transitions. [2018-12-02 06:27:05,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 06:27:05,176 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2018-12-02 06:27:05,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:27:05,790 INFO L225 Difference]: With dead ends: 244558 [2018-12-02 06:27:05,790 INFO L226 Difference]: Without dead ends: 244558 [2018-12-02 06:27:05,790 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-02 06:27:07,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244558 states. [2018-12-02 06:27:09,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244558 to 204774. [2018-12-02 06:27:09,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204774 states. [2018-12-02 06:27:10,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204774 states to 204774 states and 856501 transitions. [2018-12-02 06:27:10,558 INFO L78 Accepts]: Start accepts. Automaton has 204774 states and 856501 transitions. Word has length 64 [2018-12-02 06:27:10,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:27:10,558 INFO L480 AbstractCegarLoop]: Abstraction has 204774 states and 856501 transitions. [2018-12-02 06:27:10,558 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 06:27:10,558 INFO L276 IsEmpty]: Start isEmpty. Operand 204774 states and 856501 transitions. [2018-12-02 06:27:10,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-02 06:27:10,587 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:27:10,587 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:27:10,588 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:27:10,588 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:27:10,588 INFO L82 PathProgramCache]: Analyzing trace with hash -1419937291, now seen corresponding path program 1 times [2018-12-02 06:27:10,588 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:27:10,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:10,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:27:10,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:10,589 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:27:10,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:27:10,626 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-02 06:27:10,627 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:27:10,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 06:27:10,627 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:27:10,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 06:27:10,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 06:27:10,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 06:27:10,627 INFO L87 Difference]: Start difference. First operand 204774 states and 856501 transitions. Second operand 5 states. [2018-12-02 06:27:10,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:27:10,791 INFO L93 Difference]: Finished difference Result 43022 states and 165199 transitions. [2018-12-02 06:27:10,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 06:27:10,792 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 64 [2018-12-02 06:27:10,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:27:10,857 INFO L225 Difference]: With dead ends: 43022 [2018-12-02 06:27:10,858 INFO L226 Difference]: Without dead ends: 36622 [2018-12-02 06:27:10,858 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-02 06:27:10,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36622 states. [2018-12-02 06:27:11,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36622 to 36382. [2018-12-02 06:27:11,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36382 states. [2018-12-02 06:27:11,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36382 states to 36382 states and 138621 transitions. [2018-12-02 06:27:11,335 INFO L78 Accepts]: Start accepts. Automaton has 36382 states and 138621 transitions. Word has length 64 [2018-12-02 06:27:11,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:27:11,336 INFO L480 AbstractCegarLoop]: Abstraction has 36382 states and 138621 transitions. [2018-12-02 06:27:11,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 06:27:11,336 INFO L276 IsEmpty]: Start isEmpty. Operand 36382 states and 138621 transitions. [2018-12-02 06:27:11,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-02 06:27:11,346 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:27:11,346 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] [2018-12-02 06:27:11,346 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:27:11,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:27:11,347 INFO L82 PathProgramCache]: Analyzing trace with hash -307792068, now seen corresponding path program 1 times [2018-12-02 06:27:11,347 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:27:11,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:11,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:27:11,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:11,348 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:27:11,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:27:11,389 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-02 06:27:11,389 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:27:11,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 06:27:11,390 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:27:11,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 06:27:11,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 06:27:11,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 06:27:11,390 INFO L87 Difference]: Start difference. First operand 36382 states and 138621 transitions. Second operand 6 states. [2018-12-02 06:27:11,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:27:11,748 INFO L93 Difference]: Finished difference Result 63002 states and 239452 transitions. [2018-12-02 06:27:11,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 06:27:11,748 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 73 [2018-12-02 06:27:11,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:27:11,865 INFO L225 Difference]: With dead ends: 63002 [2018-12-02 06:27:11,865 INFO L226 Difference]: Without dead ends: 62682 [2018-12-02 06:27:11,865 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-12-02 06:27:11,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62682 states. [2018-12-02 06:27:13,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62682 to 40883. [2018-12-02 06:27:13,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40883 states. [2018-12-02 06:27:13,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40883 states to 40883 states and 155060 transitions. [2018-12-02 06:27:13,449 INFO L78 Accepts]: Start accepts. Automaton has 40883 states and 155060 transitions. Word has length 73 [2018-12-02 06:27:13,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:27:13,449 INFO L480 AbstractCegarLoop]: Abstraction has 40883 states and 155060 transitions. [2018-12-02 06:27:13,449 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 06:27:13,449 INFO L276 IsEmpty]: Start isEmpty. Operand 40883 states and 155060 transitions. [2018-12-02 06:27:13,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-02 06:27:13,466 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:27:13,467 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:27:13,467 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:27:13,467 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:27:13,467 INFO L82 PathProgramCache]: Analyzing trace with hash -1309504378, now seen corresponding path program 1 times [2018-12-02 06:27:13,467 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:27:13,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:13,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:27:13,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:13,468 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:27:13,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:27:13,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-02 06:27:13,525 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:27:13,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 06:27:13,525 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:27:13,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 06:27:13,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 06:27:13,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 06:27:13,525 INFO L87 Difference]: Start difference. First operand 40883 states and 155060 transitions. Second operand 6 states. [2018-12-02 06:27:14,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:27:14,020 INFO L93 Difference]: Finished difference Result 54980 states and 204663 transitions. [2018-12-02 06:27:14,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 06:27:14,021 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 77 [2018-12-02 06:27:14,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:27:14,120 INFO L225 Difference]: With dead ends: 54980 [2018-12-02 06:27:14,120 INFO L226 Difference]: Without dead ends: 54980 [2018-12-02 06:27:14,121 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-02 06:27:14,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54980 states. [2018-12-02 06:27:14,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54980 to 52089. [2018-12-02 06:27:14,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52089 states. [2018-12-02 06:27:14,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52089 states to 52089 states and 195048 transitions. [2018-12-02 06:27:14,857 INFO L78 Accepts]: Start accepts. Automaton has 52089 states and 195048 transitions. Word has length 77 [2018-12-02 06:27:14,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:27:14,857 INFO L480 AbstractCegarLoop]: Abstraction has 52089 states and 195048 transitions. [2018-12-02 06:27:14,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 06:27:14,857 INFO L276 IsEmpty]: Start isEmpty. Operand 52089 states and 195048 transitions. [2018-12-02 06:27:14,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-02 06:27:14,883 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:27:14,883 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:27:14,883 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:27:14,883 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:27:14,883 INFO L82 PathProgramCache]: Analyzing trace with hash 1740698437, now seen corresponding path program 1 times [2018-12-02 06:27:14,883 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:27:14,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:14,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:27:14,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:14,885 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:27:14,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:27:14,922 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-02 06:27:14,922 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:27:14,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 06:27:14,922 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:27:14,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 06:27:14,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 06:27:14,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 06:27:14,923 INFO L87 Difference]: Start difference. First operand 52089 states and 195048 transitions. Second operand 4 states. [2018-12-02 06:27:15,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:27:15,219 INFO L93 Difference]: Finished difference Result 65722 states and 243866 transitions. [2018-12-02 06:27:15,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 06:27:15,219 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2018-12-02 06:27:15,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:27:15,481 INFO L225 Difference]: With dead ends: 65722 [2018-12-02 06:27:15,481 INFO L226 Difference]: Without dead ends: 65722 [2018-12-02 06:27:15,481 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-02 06:27:15,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65722 states. [2018-12-02 06:27:16,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65722 to 56534. [2018-12-02 06:27:16,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56534 states. [2018-12-02 06:27:16,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56534 states to 56534 states and 210659 transitions. [2018-12-02 06:27:16,250 INFO L78 Accepts]: Start accepts. Automaton has 56534 states and 210659 transitions. Word has length 77 [2018-12-02 06:27:16,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:27:16,250 INFO L480 AbstractCegarLoop]: Abstraction has 56534 states and 210659 transitions. [2018-12-02 06:27:16,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 06:27:16,250 INFO L276 IsEmpty]: Start isEmpty. Operand 56534 states and 210659 transitions. [2018-12-02 06:27:16,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-02 06:27:16,282 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:27:16,282 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:27:16,282 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:27:16,282 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:27:16,282 INFO L82 PathProgramCache]: Analyzing trace with hash 908253575, now seen corresponding path program 1 times [2018-12-02 06:27:16,282 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:27:16,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:16,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:27:16,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:16,284 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:27:16,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:27:16,347 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-02 06:27:16,347 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:27:16,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 06:27:16,347 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:27:16,347 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 06:27:16,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 06:27:16,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 06:27:16,348 INFO L87 Difference]: Start difference. First operand 56534 states and 210659 transitions. Second operand 6 states. [2018-12-02 06:27:16,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:27:16,738 INFO L93 Difference]: Finished difference Result 67144 states and 243766 transitions. [2018-12-02 06:27:16,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 06:27:16,738 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 77 [2018-12-02 06:27:16,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:27:16,853 INFO L225 Difference]: With dead ends: 67144 [2018-12-02 06:27:16,853 INFO L226 Difference]: Without dead ends: 67144 [2018-12-02 06:27:16,853 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-02 06:27:16,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67144 states. [2018-12-02 06:27:17,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67144 to 56632. [2018-12-02 06:27:17,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56632 states. [2018-12-02 06:27:17,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56632 states to 56632 states and 207962 transitions. [2018-12-02 06:27:17,818 INFO L78 Accepts]: Start accepts. Automaton has 56632 states and 207962 transitions. Word has length 77 [2018-12-02 06:27:17,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:27:17,818 INFO L480 AbstractCegarLoop]: Abstraction has 56632 states and 207962 transitions. [2018-12-02 06:27:17,818 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 06:27:17,818 INFO L276 IsEmpty]: Start isEmpty. Operand 56632 states and 207962 transitions. [2018-12-02 06:27:17,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-02 06:27:17,849 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:27:17,849 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:27:17,850 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:27:17,850 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:27:17,850 INFO L82 PathProgramCache]: Analyzing trace with hash 1119604488, now seen corresponding path program 1 times [2018-12-02 06:27:17,850 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:27:17,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:17,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:27:17,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:17,852 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:27:17,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:27:17,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:27:17,894 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:27:17,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 06:27:17,894 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:27:17,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 06:27:17,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 06:27:17,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 06:27:17,894 INFO L87 Difference]: Start difference. First operand 56632 states and 207962 transitions. Second operand 5 states. [2018-12-02 06:27:18,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:27:18,245 INFO L93 Difference]: Finished difference Result 70282 states and 256645 transitions. [2018-12-02 06:27:18,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 06:27:18,246 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2018-12-02 06:27:18,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:27:18,368 INFO L225 Difference]: With dead ends: 70282 [2018-12-02 06:27:18,368 INFO L226 Difference]: Without dead ends: 70282 [2018-12-02 06:27:18,368 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-02 06:27:18,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70282 states. [2018-12-02 06:27:19,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70282 to 62426. [2018-12-02 06:27:19,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62426 states. [2018-12-02 06:27:19,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62426 states to 62426 states and 227425 transitions. [2018-12-02 06:27:19,253 INFO L78 Accepts]: Start accepts. Automaton has 62426 states and 227425 transitions. Word has length 77 [2018-12-02 06:27:19,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:27:19,253 INFO L480 AbstractCegarLoop]: Abstraction has 62426 states and 227425 transitions. [2018-12-02 06:27:19,253 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 06:27:19,253 INFO L276 IsEmpty]: Start isEmpty. Operand 62426 states and 227425 transitions. [2018-12-02 06:27:19,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-02 06:27:19,287 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:27:19,287 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:27:19,287 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:27:19,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:27:19,287 INFO L82 PathProgramCache]: Analyzing trace with hash 609070311, now seen corresponding path program 1 times [2018-12-02 06:27:19,287 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:27:19,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:19,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:27:19,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:19,289 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:27:19,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:27:19,324 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-02 06:27:19,324 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:27:19,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 06:27:19,324 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:27:19,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 06:27:19,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 06:27:19,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 06:27:19,325 INFO L87 Difference]: Start difference. First operand 62426 states and 227425 transitions. Second operand 4 states. [2018-12-02 06:27:19,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:27:19,887 INFO L93 Difference]: Finished difference Result 77322 states and 282185 transitions. [2018-12-02 06:27:19,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 06:27:19,888 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2018-12-02 06:27:19,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:27:20,025 INFO L225 Difference]: With dead ends: 77322 [2018-12-02 06:27:20,025 INFO L226 Difference]: Without dead ends: 75050 [2018-12-02 06:27:20,025 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 06:27:20,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75050 states. [2018-12-02 06:27:20,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75050 to 71466. [2018-12-02 06:27:20,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71466 states. [2018-12-02 06:27:21,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71466 states to 71466 states and 260377 transitions. [2018-12-02 06:27:21,012 INFO L78 Accepts]: Start accepts. Automaton has 71466 states and 260377 transitions. Word has length 77 [2018-12-02 06:27:21,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:27:21,013 INFO L480 AbstractCegarLoop]: Abstraction has 71466 states and 260377 transitions. [2018-12-02 06:27:21,013 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 06:27:21,013 INFO L276 IsEmpty]: Start isEmpty. Operand 71466 states and 260377 transitions. [2018-12-02 06:27:21,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-02 06:27:21,049 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:27:21,049 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:27:21,050 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:27:21,050 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:27:21,050 INFO L82 PathProgramCache]: Analyzing trace with hash -1187881048, now seen corresponding path program 1 times [2018-12-02 06:27:21,050 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:27:21,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:21,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:27:21,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:21,051 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:27:21,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:27:21,096 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-02 06:27:21,096 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:27:21,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 06:27:21,096 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:27:21,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 06:27:21,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 06:27:21,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 06:27:21,097 INFO L87 Difference]: Start difference. First operand 71466 states and 260377 transitions. Second operand 6 states. [2018-12-02 06:27:21,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:27:21,178 INFO L93 Difference]: Finished difference Result 23466 states and 74665 transitions. [2018-12-02 06:27:21,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 06:27:21,179 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 77 [2018-12-02 06:27:21,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:27:21,201 INFO L225 Difference]: With dead ends: 23466 [2018-12-02 06:27:21,201 INFO L226 Difference]: Without dead ends: 19444 [2018-12-02 06:27:21,201 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-12-02 06:27:21,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19444 states. [2018-12-02 06:27:21,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19444 to 17669. [2018-12-02 06:27:21,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17669 states. [2018-12-02 06:27:21,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17669 states to 17669 states and 55442 transitions. [2018-12-02 06:27:21,377 INFO L78 Accepts]: Start accepts. Automaton has 17669 states and 55442 transitions. Word has length 77 [2018-12-02 06:27:21,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:27:21,378 INFO L480 AbstractCegarLoop]: Abstraction has 17669 states and 55442 transitions. [2018-12-02 06:27:21,378 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 06:27:21,378 INFO L276 IsEmpty]: Start isEmpty. Operand 17669 states and 55442 transitions. [2018-12-02 06:27:21,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 06:27:21,393 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:27:21,393 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] [2018-12-02 06:27:21,393 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:27:21,393 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:27:21,393 INFO L82 PathProgramCache]: Analyzing trace with hash -1598760952, now seen corresponding path program 1 times [2018-12-02 06:27:21,393 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:27:21,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:21,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:27:21,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:21,394 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:27:21,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:27:21,453 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-02 06:27:21,453 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:27:21,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 06:27:21,453 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:27:21,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 06:27:21,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 06:27:21,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 06:27:21,454 INFO L87 Difference]: Start difference. First operand 17669 states and 55442 transitions. Second operand 6 states. [2018-12-02 06:27:21,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:27:21,601 INFO L93 Difference]: Finished difference Result 20079 states and 62410 transitions. [2018-12-02 06:27:21,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 06:27:21,601 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2018-12-02 06:27:21,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:27:21,624 INFO L225 Difference]: With dead ends: 20079 [2018-12-02 06:27:21,624 INFO L226 Difference]: Without dead ends: 19704 [2018-12-02 06:27:21,625 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-02 06:27:21,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19704 states. [2018-12-02 06:27:21,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19704 to 16849. [2018-12-02 06:27:21,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16849 states. [2018-12-02 06:27:21,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16849 states to 16849 states and 52451 transitions. [2018-12-02 06:27:21,812 INFO L78 Accepts]: Start accepts. Automaton has 16849 states and 52451 transitions. Word has length 94 [2018-12-02 06:27:21,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:27:21,812 INFO L480 AbstractCegarLoop]: Abstraction has 16849 states and 52451 transitions. [2018-12-02 06:27:21,813 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 06:27:21,813 INFO L276 IsEmpty]: Start isEmpty. Operand 16849 states and 52451 transitions. [2018-12-02 06:27:21,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 06:27:21,828 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:27:21,828 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] [2018-12-02 06:27:21,828 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:27:21,828 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:27:21,828 INFO L82 PathProgramCache]: Analyzing trace with hash -1368484759, now seen corresponding path program 1 times [2018-12-02 06:27:21,828 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:27:21,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:21,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:27:21,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:21,829 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:27:21,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:27:21,868 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-02 06:27:21,868 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:27:21,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 06:27:21,868 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:27:21,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 06:27:21,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 06:27:21,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 06:27:21,869 INFO L87 Difference]: Start difference. First operand 16849 states and 52451 transitions. Second operand 4 states. [2018-12-02 06:27:21,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:27:21,931 INFO L93 Difference]: Finished difference Result 16529 states and 51283 transitions. [2018-12-02 06:27:21,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 06:27:21,931 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2018-12-02 06:27:21,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:27:21,948 INFO L225 Difference]: With dead ends: 16529 [2018-12-02 06:27:21,948 INFO L226 Difference]: Without dead ends: 16529 [2018-12-02 06:27:21,949 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-02 06:27:21,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16529 states. [2018-12-02 06:27:22,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16529 to 14162. [2018-12-02 06:27:22,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14162 states. [2018-12-02 06:27:22,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14162 states to 14162 states and 43820 transitions. [2018-12-02 06:27:22,112 INFO L78 Accepts]: Start accepts. Automaton has 14162 states and 43820 transitions. Word has length 94 [2018-12-02 06:27:22,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:27:22,112 INFO L480 AbstractCegarLoop]: Abstraction has 14162 states and 43820 transitions. [2018-12-02 06:27:22,112 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 06:27:22,112 INFO L276 IsEmpty]: Start isEmpty. Operand 14162 states and 43820 transitions. [2018-12-02 06:27:22,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 06:27:22,124 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:27:22,124 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] [2018-12-02 06:27:22,124 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:27:22,125 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:27:22,125 INFO L82 PathProgramCache]: Analyzing trace with hash 618997001, now seen corresponding path program 1 times [2018-12-02 06:27:22,125 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:27:22,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:22,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:27:22,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:22,126 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:27:22,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:27:22,200 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-02 06:27:22,201 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:27:22,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 06:27:22,201 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:27:22,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 06:27:22,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 06:27:22,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-02 06:27:22,201 INFO L87 Difference]: Start difference. First operand 14162 states and 43820 transitions. Second operand 7 states. [2018-12-02 06:27:22,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:27:22,372 INFO L93 Difference]: Finished difference Result 16649 states and 51202 transitions. [2018-12-02 06:27:22,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 06:27:22,372 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2018-12-02 06:27:22,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:27:22,390 INFO L225 Difference]: With dead ends: 16649 [2018-12-02 06:27:22,390 INFO L226 Difference]: Without dead ends: 16649 [2018-12-02 06:27:22,390 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-02 06:27:22,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16649 states. [2018-12-02 06:27:22,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16649 to 16125. [2018-12-02 06:27:22,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16125 states. [2018-12-02 06:27:22,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16125 states to 16125 states and 49756 transitions. [2018-12-02 06:27:22,557 INFO L78 Accepts]: Start accepts. Automaton has 16125 states and 49756 transitions. Word has length 94 [2018-12-02 06:27:22,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:27:22,558 INFO L480 AbstractCegarLoop]: Abstraction has 16125 states and 49756 transitions. [2018-12-02 06:27:22,558 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 06:27:22,558 INFO L276 IsEmpty]: Start isEmpty. Operand 16125 states and 49756 transitions. [2018-12-02 06:27:22,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 06:27:22,571 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:27:22,571 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] [2018-12-02 06:27:22,572 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:27:22,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:27:22,572 INFO L82 PathProgramCache]: Analyzing trace with hash 1506500682, now seen corresponding path program 1 times [2018-12-02 06:27:22,572 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:27:22,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:22,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:27:22,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:22,573 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:27:22,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:27:22,631 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-02 06:27:22,632 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:27:22,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 06:27:22,632 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:27:22,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 06:27:22,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 06:27:22,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 06:27:22,632 INFO L87 Difference]: Start difference. First operand 16125 states and 49756 transitions. Second operand 7 states. [2018-12-02 06:27:22,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:27:22,730 INFO L93 Difference]: Finished difference Result 27725 states and 85344 transitions. [2018-12-02 06:27:22,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 06:27:22,731 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2018-12-02 06:27:22,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:27:22,746 INFO L225 Difference]: With dead ends: 27725 [2018-12-02 06:27:22,746 INFO L226 Difference]: Without dead ends: 14585 [2018-12-02 06:27:22,747 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2018-12-02 06:27:22,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14585 states. [2018-12-02 06:27:22,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14585 to 14585. [2018-12-02 06:27:22,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14585 states. [2018-12-02 06:27:22,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14585 states to 14585 states and 44848 transitions. [2018-12-02 06:27:22,899 INFO L78 Accepts]: Start accepts. Automaton has 14585 states and 44848 transitions. Word has length 94 [2018-12-02 06:27:22,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:27:22,899 INFO L480 AbstractCegarLoop]: Abstraction has 14585 states and 44848 transitions. [2018-12-02 06:27:22,899 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 06:27:22,899 INFO L276 IsEmpty]: Start isEmpty. Operand 14585 states and 44848 transitions. [2018-12-02 06:27:22,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 06:27:22,913 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:27:22,913 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 06:27:22,913 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:27:22,913 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:27:22,913 INFO L82 PathProgramCache]: Analyzing trace with hash 873472454, now seen corresponding path program 2 times [2018-12-02 06:27:22,913 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:27:22,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:22,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:27:22,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:22,915 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:27:22,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:27:22,988 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-02 06:27:22,989 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:27:22,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-02 06:27:22,989 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:27:22,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 06:27:22,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 06:27:22,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-02 06:27:22,989 INFO L87 Difference]: Start difference. First operand 14585 states and 44848 transitions. Second operand 9 states. [2018-12-02 06:27:23,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:27:23,193 INFO L93 Difference]: Finished difference Result 37390 states and 115520 transitions. [2018-12-02 06:27:23,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 06:27:23,193 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 94 [2018-12-02 06:27:23,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:27:23,204 INFO L225 Difference]: With dead ends: 37390 [2018-12-02 06:27:23,204 INFO L226 Difference]: Without dead ends: 10367 [2018-12-02 06:27:23,204 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=203, Unknown=0, NotChecked=0, Total=306 [2018-12-02 06:27:23,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10367 states. [2018-12-02 06:27:23,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10367 to 10367. [2018-12-02 06:27:23,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10367 states. [2018-12-02 06:27:23,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10367 states to 10367 states and 31829 transitions. [2018-12-02 06:27:23,297 INFO L78 Accepts]: Start accepts. Automaton has 10367 states and 31829 transitions. Word has length 94 [2018-12-02 06:27:23,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:27:23,298 INFO L480 AbstractCegarLoop]: Abstraction has 10367 states and 31829 transitions. [2018-12-02 06:27:23,298 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 06:27:23,298 INFO L276 IsEmpty]: Start isEmpty. Operand 10367 states and 31829 transitions. [2018-12-02 06:27:23,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 06:27:23,306 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:27:23,306 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] [2018-12-02 06:27:23,306 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:27:23,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:27:23,306 INFO L82 PathProgramCache]: Analyzing trace with hash 15963458, now seen corresponding path program 2 times [2018-12-02 06:27:23,306 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:27:23,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:23,307 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 06:27:23,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:23,307 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:27:23,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:27:23,359 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-02 06:27:23,359 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:27:23,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 06:27:23,359 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:27:23,359 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 06:27:23,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 06:27:23,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-02 06:27:23,359 INFO L87 Difference]: Start difference. First operand 10367 states and 31829 transitions. Second operand 7 states. [2018-12-02 06:27:23,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:27:23,582 INFO L93 Difference]: Finished difference Result 11293 states and 34537 transitions. [2018-12-02 06:27:23,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 06:27:23,582 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2018-12-02 06:27:23,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:27:23,594 INFO L225 Difference]: With dead ends: 11293 [2018-12-02 06:27:23,594 INFO L226 Difference]: Without dead ends: 11293 [2018-12-02 06:27:23,594 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-02 06:27:23,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11293 states. [2018-12-02 06:27:23,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11293 to 10141. [2018-12-02 06:27:23,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10141 states. [2018-12-02 06:27:23,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10141 states to 10141 states and 31185 transitions. [2018-12-02 06:27:23,697 INFO L78 Accepts]: Start accepts. Automaton has 10141 states and 31185 transitions. Word has length 94 [2018-12-02 06:27:23,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:27:23,697 INFO L480 AbstractCegarLoop]: Abstraction has 10141 states and 31185 transitions. [2018-12-02 06:27:23,697 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 06:27:23,697 INFO L276 IsEmpty]: Start isEmpty. Operand 10141 states and 31185 transitions. [2018-12-02 06:27:23,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 06:27:23,706 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:27:23,706 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:27:23,706 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:27:23,706 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:27:23,706 INFO L82 PathProgramCache]: Analyzing trace with hash 475121201, now seen corresponding path program 2 times [2018-12-02 06:27:23,706 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:27:23,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:23,707 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 06:27:23,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:23,707 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:27:23,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:27:23,766 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-02 06:27:23,766 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:27:23,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 06:27:23,766 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:27:23,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 06:27:23,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 06:27:23,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 06:27:23,766 INFO L87 Difference]: Start difference. First operand 10141 states and 31185 transitions. Second operand 5 states. [2018-12-02 06:27:23,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:27:23,808 INFO L93 Difference]: Finished difference Result 10141 states and 31121 transitions. [2018-12-02 06:27:23,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 06:27:23,808 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-12-02 06:27:23,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:27:23,818 INFO L225 Difference]: With dead ends: 10141 [2018-12-02 06:27:23,818 INFO L226 Difference]: Without dead ends: 10141 [2018-12-02 06:27:23,818 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-02 06:27:23,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10141 states. [2018-12-02 06:27:23,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10141 to 8869. [2018-12-02 06:27:23,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8869 states. [2018-12-02 06:27:23,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8869 states to 8869 states and 27231 transitions. [2018-12-02 06:27:23,905 INFO L78 Accepts]: Start accepts. Automaton has 8869 states and 27231 transitions. Word has length 94 [2018-12-02 06:27:23,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:27:23,905 INFO L480 AbstractCegarLoop]: Abstraction has 8869 states and 27231 transitions. [2018-12-02 06:27:23,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 06:27:23,905 INFO L276 IsEmpty]: Start isEmpty. Operand 8869 states and 27231 transitions. [2018-12-02 06:27:23,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 06:27:23,912 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:27:23,912 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] [2018-12-02 06:27:23,913 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:27:23,913 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:27:23,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1362624882, now seen corresponding path program 3 times [2018-12-02 06:27:23,913 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:27:23,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:23,914 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 06:27:23,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:23,914 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:27:23,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:27:24,013 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-02 06:27:24,013 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:27:24,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-02 06:27:24,013 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:27:24,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 06:27:24,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 06:27:24,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-02 06:27:24,014 INFO L87 Difference]: Start difference. First operand 8869 states and 27231 transitions. Second operand 11 states. [2018-12-02 06:27:24,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:27:24,587 INFO L93 Difference]: Finished difference Result 15029 states and 46079 transitions. [2018-12-02 06:27:24,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 06:27:24,588 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 94 [2018-12-02 06:27:24,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:27:24,601 INFO L225 Difference]: With dead ends: 15029 [2018-12-02 06:27:24,601 INFO L226 Difference]: Without dead ends: 9807 [2018-12-02 06:27:24,602 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2018-12-02 06:27:24,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9807 states. [2018-12-02 06:27:24,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9807 to 8983. [2018-12-02 06:27:24,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8983 states. [2018-12-02 06:27:24,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8983 states to 8983 states and 27388 transitions. [2018-12-02 06:27:24,709 INFO L78 Accepts]: Start accepts. Automaton has 8983 states and 27388 transitions. Word has length 94 [2018-12-02 06:27:24,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:27:24,709 INFO L480 AbstractCegarLoop]: Abstraction has 8983 states and 27388 transitions. [2018-12-02 06:27:24,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 06:27:24,709 INFO L276 IsEmpty]: Start isEmpty. Operand 8983 states and 27388 transitions. [2018-12-02 06:27:24,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 06:27:24,717 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:27:24,717 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] [2018-12-02 06:27:24,717 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:27:24,717 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:27:24,717 INFO L82 PathProgramCache]: Analyzing trace with hash 1113002672, now seen corresponding path program 4 times [2018-12-02 06:27:24,718 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:27:24,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:24,719 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 06:27:24,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:24,719 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:27:24,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 06:27:24,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 06:27:24,754 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 06:27:24,825 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-02 06:27:24,826 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 06:27:24 BasicIcfg [2018-12-02 06:27:24,826 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 06:27:24,827 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 06:27:24,827 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 06:27:24,827 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 06:27:24,827 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 06:25:33" (3/4) ... [2018-12-02 06:27:24,829 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-02 06:27:24,902 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_626a176b-f84e-41ed-9dce-5cb735f6b7e9/bin-2019/utaipan/witness.graphml [2018-12-02 06:27:24,902 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 06:27:24,903 INFO L168 Benchmark]: Toolchain (without parser) took 111733.18 ms. Allocated memory was 1.0 GB in the beginning and 7.4 GB in the end (delta: 6.3 GB). Free memory was 947.0 MB in the beginning and 4.8 GB in the end (delta: -3.8 GB). Peak memory consumption was 2.5 GB. Max. memory is 11.5 GB. [2018-12-02 06:27:24,904 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 06:27:24,904 INFO L168 Benchmark]: CACSL2BoogieTranslator took 395.14 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 67.6 MB). Free memory was 947.0 MB in the beginning and 1.0 GB in the end (delta: -98.7 MB). Peak memory consumption was 28.6 MB. Max. memory is 11.5 GB. [2018-12-02 06:27:24,904 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.88 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-02 06:27:24,904 INFO L168 Benchmark]: Boogie Preprocessor took 19.38 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-02 06:27:24,905 INFO L168 Benchmark]: RCFGBuilder took 320.67 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 995.3 MB in the end (delta: 45.0 MB). Peak memory consumption was 45.0 MB. Max. memory is 11.5 GB. [2018-12-02 06:27:24,905 INFO L168 Benchmark]: TraceAbstraction took 110888.55 ms. Allocated memory was 1.1 GB in the beginning and 7.4 GB in the end (delta: 6.3 GB). Free memory was 995.3 MB in the beginning and 4.8 GB in the end (delta: -3.8 GB). Peak memory consumption was 2.5 GB. Max. memory is 11.5 GB. [2018-12-02 06:27:24,905 INFO L168 Benchmark]: Witness Printer took 75.46 ms. Allocated memory is still 7.4 GB. Free memory was 4.8 GB in the beginning and 4.8 GB in the end (delta: 35.1 MB). Peak memory consumption was 35.1 MB. Max. memory is 11.5 GB. [2018-12-02 06:27:24,907 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 395.14 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 67.6 MB). Free memory was 947.0 MB in the beginning and 1.0 GB in the end (delta: -98.7 MB). Peak memory consumption was 28.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 30.88 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.38 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 320.67 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 995.3 MB in the end (delta: 45.0 MB). Peak memory consumption was 45.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 110888.55 ms. Allocated memory was 1.1 GB in the beginning and 7.4 GB in the end (delta: 6.3 GB). Free memory was 995.3 MB in the beginning and 4.8 GB in the end (delta: -3.8 GB). Peak memory consumption was 2.5 GB. Max. memory is 11.5 GB. * Witness Printer took 75.46 ms. Allocated memory is still 7.4 GB. Free memory was 4.8 GB in the beginning and 4.8 GB in the end (delta: 35.1 MB). Peak memory consumption was 35.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L672] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L674] -1 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L676] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L678] -1 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0] [L680] -1 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L682] -1 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0] [L683] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0] [L684] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L686] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L688] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L689] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L690] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L691] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L692] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L693] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L694] -1 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L695] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0] [L696] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L697] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L698] -1 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L699] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L700] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L701] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L702] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L703] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L704] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L706] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L707] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L708] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L798] -1 pthread_t t936; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L799] FCALL, FORK -1 pthread_create(&t936, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L800] -1 pthread_t t937; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L801] FCALL, FORK -1 pthread_create(&t937, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L802] -1 pthread_t t938; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L803] FCALL, FORK -1 pthread_create(&t938, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L755] 0 y$w_buff1 = y$w_buff0 [L756] 0 y$w_buff0 = 1 [L757] 0 y$w_buff1_used = y$w_buff0_used [L758] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L760] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L761] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L762] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L763] 0 y$r_buff1_thd3 = y$r_buff0_thd3 [L764] 0 y$r_buff0_thd3 = (_Bool)1 [L767] 0 z = 1 [L770] 0 __unbuffered_p2_EAX = z [L773] 0 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L776] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L712] 1 a = 1 [L715] 1 __unbuffered_p0_EAX = x [L720] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L727] 2 x = 1 [L730] 2 weak$$choice0 = __VERIFIER_nondet_pointer() [L731] 2 weak$$choice2 = __VERIFIER_nondet_pointer() [L732] 2 y$flush_delayed = weak$$choice2 [L733] 2 y$mem_tmp = y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L734] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L776] 0 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L777] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L777] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L734] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L735] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L735] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L736] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L736] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L778] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L778] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L779] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L779] 0 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L780] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L780] 0 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L783] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L737] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L737] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L738] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L738] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L739] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L739] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L740] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L740] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L741] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L742] EXPR 2 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L742] 2 y = y$flush_delayed ? y$mem_tmp : y [L743] 2 y$flush_delayed = (_Bool)0 [L748] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L805] -1 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L809] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L809] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L809] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L809] -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) [L810] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L810] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L811] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L811] -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 [L812] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L812] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L813] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L813] -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 [L816] -1 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 220 locations, 3 error locations. UNSAFE Result, 110.8s OverallTime, 28 OverallIterations, 1 TraceHistogramMax, 29.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 7394 SDtfs, 9516 SDslu, 17342 SDs, 0 SdLazy, 5294 SolverSat, 373 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 244 GetRequests, 63 SyntacticMatches, 16 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=259069occurred in iteration=9, 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: 57.9s AutomataMinimizationTime, 27 MinimizatonAttempts, 579197 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 2088 NumberOfCodeBlocks, 2088 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 1967 ConstructedInterpolants, 0 QuantifiedInterpolants, 401038 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 27 InterpolantComputations, 27 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...