./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix041_pso.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_23c5e75f-74b3-4fdd-ba3a-a14deb4a6377/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_23c5e75f-74b3-4fdd-ba3a-a14deb4a6377/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_23c5e75f-74b3-4fdd-ba3a-a14deb4a6377/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_23c5e75f-74b3-4fdd-ba3a-a14deb4a6377/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix041_pso.opt_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_23c5e75f-74b3-4fdd-ba3a-a14deb4a6377/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_23c5e75f-74b3-4fdd-ba3a-a14deb4a6377/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 312968f43197d6c548eeb38f4d8e08bfae3b68af ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-03 01:37:03,002 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 01:37:03,003 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 01:37:03,009 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 01:37:03,009 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 01:37:03,010 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 01:37:03,010 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 01:37:03,011 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 01:37:03,012 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 01:37:03,012 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 01:37:03,013 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 01:37:03,013 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 01:37:03,013 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 01:37:03,014 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 01:37:03,015 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 01:37:03,015 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 01:37:03,015 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 01:37:03,016 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 01:37:03,017 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 01:37:03,018 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 01:37:03,019 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 01:37:03,019 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 01:37:03,020 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 01:37:03,020 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 01:37:03,020 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 01:37:03,021 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 01:37:03,021 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 01:37:03,022 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 01:37:03,022 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 01:37:03,023 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 01:37:03,023 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 01:37:03,023 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 01:37:03,023 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 01:37:03,023 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 01:37:03,024 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 01:37:03,024 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 01:37:03,024 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_23c5e75f-74b3-4fdd-ba3a-a14deb4a6377/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-03 01:37:03,031 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 01:37:03,032 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 01:37:03,032 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 01:37:03,032 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 01:37:03,032 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 01:37:03,032 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 01:37:03,033 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 01:37:03,033 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 01:37:03,033 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 01:37:03,033 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-03 01:37:03,033 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 01:37:03,033 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-03 01:37:03,033 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 01:37:03,033 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 01:37:03,034 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 01:37:03,034 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 01:37:03,034 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 01:37:03,034 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 01:37:03,034 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 01:37:03,034 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 01:37:03,034 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 01:37:03,034 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 01:37:03,034 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 01:37:03,034 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 01:37:03,034 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 01:37:03,035 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 01:37:03,035 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-03 01:37:03,035 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 01:37:03,035 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 01:37:03,035 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 01:37:03,035 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 01:37:03,035 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 01:37:03,035 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 01:37:03,035 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 01:37:03,035 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 01:37:03,035 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 01:37:03,036 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_23c5e75f-74b3-4fdd-ba3a-a14deb4a6377/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 -> 312968f43197d6c548eeb38f4d8e08bfae3b68af [2018-12-03 01:37:03,053 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 01:37:03,060 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 01:37:03,062 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 01:37:03,063 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-03 01:37:03,063 INFO L276 PluginConnector]: CDTParser initialized [2018-12-03 01:37:03,064 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_23c5e75f-74b3-4fdd-ba3a-a14deb4a6377/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/mix041_pso.opt_false-unreach-call.i [2018-12-03 01:37:03,100 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_23c5e75f-74b3-4fdd-ba3a-a14deb4a6377/bin-2019/utaipan/data/5c41ea85f/c63456670f784f6899f611fd551c4017/FLAG002863b90 [2018-12-03 01:37:03,486 INFO L307 CDTParser]: Found 1 translation units. [2018-12-03 01:37:03,486 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_23c5e75f-74b3-4fdd-ba3a-a14deb4a6377/sv-benchmarks/c/pthread-wmm/mix041_pso.opt_false-unreach-call.i [2018-12-03 01:37:03,494 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_23c5e75f-74b3-4fdd-ba3a-a14deb4a6377/bin-2019/utaipan/data/5c41ea85f/c63456670f784f6899f611fd551c4017/FLAG002863b90 [2018-12-03 01:37:03,838 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_23c5e75f-74b3-4fdd-ba3a-a14deb4a6377/bin-2019/utaipan/data/5c41ea85f/c63456670f784f6899f611fd551c4017 [2018-12-03 01:37:03,840 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 01:37:03,841 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-03 01:37:03,841 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-03 01:37:03,842 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-03 01:37:03,844 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-03 01:37:03,844 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 01:37:03" (1/1) ... [2018-12-03 01:37:03,846 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@190a4d52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:37:03, skipping insertion in model container [2018-12-03 01:37:03,846 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 01:37:03" (1/1) ... [2018-12-03 01:37:03,852 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-03 01:37:03,879 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-03 01:37:04,080 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 01:37:04,087 INFO L191 MainTranslator]: Completed pre-run [2018-12-03 01:37:04,162 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 01:37:04,197 INFO L195 MainTranslator]: Completed translation [2018-12-03 01:37:04,197 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:37:04 WrapperNode [2018-12-03 01:37:04,197 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-03 01:37:04,198 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 01:37:04,198 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 01:37:04,198 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 01:37:04,205 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:37:04" (1/1) ... [2018-12-03 01:37:04,215 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:37:04" (1/1) ... [2018-12-03 01:37:04,232 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 01:37:04,232 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 01:37:04,232 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 01:37:04,232 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 01:37:04,238 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:37:04" (1/1) ... [2018-12-03 01:37:04,239 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:37:04" (1/1) ... [2018-12-03 01:37:04,241 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:37:04" (1/1) ... [2018-12-03 01:37:04,241 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:37:04" (1/1) ... [2018-12-03 01:37:04,246 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:37:04" (1/1) ... [2018-12-03 01:37:04,248 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:37:04" (1/1) ... [2018-12-03 01:37:04,250 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:37:04" (1/1) ... [2018-12-03 01:37:04,252 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 01:37:04,252 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 01:37:04,252 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 01:37:04,253 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 01:37:04,253 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:37:04" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_23c5e75f-74b3-4fdd-ba3a-a14deb4a6377/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-03 01:37:04,284 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-03 01:37:04,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-03 01:37:04,284 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-03 01:37:04,284 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-03 01:37:04,285 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-03 01:37:04,285 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-03 01:37:04,285 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-03 01:37:04,285 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-03 01:37:04,285 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-03 01:37:04,285 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 01:37:04,285 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 01:37:04,286 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-03 01:37:04,569 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 01:37:04,569 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-03 01:37:04,569 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 01:37:04 BoogieIcfgContainer [2018-12-03 01:37:04,569 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 01:37:04,570 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 01:37:04,570 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 01:37:04,572 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 01:37:04,572 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.12 01:37:03" (1/3) ... [2018-12-03 01:37:04,572 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f1460dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 01:37:04, skipping insertion in model container [2018-12-03 01:37:04,572 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:37:04" (2/3) ... [2018-12-03 01:37:04,572 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f1460dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 01:37:04, skipping insertion in model container [2018-12-03 01:37:04,572 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 01:37:04" (3/3) ... [2018-12-03 01:37:04,573 INFO L112 eAbstractionObserver]: Analyzing ICFG mix041_pso.opt_false-unreach-call.i [2018-12-03 01:37:04,594 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:37:04,595 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:37:04,595 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:37:04,595 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:37:04,595 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:37:04,595 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:37:04,595 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:37:04,595 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:37:04,595 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:37:04,595 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:37:04,596 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:37:04,596 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:37:04,596 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:37:04,596 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:37:04,596 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:37:04,596 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:37:04,596 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:37:04,596 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:37:04,596 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:37:04,596 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:37:04,596 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:37:04,597 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:37:04,597 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:37:04,597 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:37:04,597 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:37:04,597 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:37:04,597 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:37:04,597 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:37:04,597 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:37:04,597 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:37:04,597 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:37:04,598 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:37:04,598 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:37:04,598 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:37:04,598 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:37:04,598 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:37:04,598 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:37:04,598 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:37:04,598 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:37:04,598 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:37:04,599 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:37:04,599 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:37:04,599 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:37:04,599 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:37:04,599 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:37:04,599 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:37:04,599 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:37:04,599 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:37:04,599 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:37:04,599 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:37:04,600 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:37:04,600 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:37:04,600 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:37:04,600 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:37:04,600 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:37:04,600 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:37:04,600 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:37:04,600 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:37:04,600 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:37:04,600 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:37:04,600 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:37:04,601 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:37:04,601 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:37:04,601 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:37:04,601 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:37:04,601 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:37:04,601 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:37:04,601 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:37:04,601 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:37:04,601 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:37:04,601 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:37:04,601 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:37:04,605 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-03 01:37:04,605 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 01:37:04,610 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-03 01:37:04,619 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-03 01:37:04,634 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 01:37:04,634 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 01:37:04,634 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 01:37:04,634 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 01:37:04,634 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 01:37:04,634 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 01:37:04,634 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 01:37:04,634 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 01:37:04,641 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 143places, 181 transitions [2018-12-03 01:37:05,670 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 25089 states. [2018-12-03 01:37:05,671 INFO L276 IsEmpty]: Start isEmpty. Operand 25089 states. [2018-12-03 01:37:05,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-03 01:37:05,676 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:37:05,677 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:37:05,678 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:37:05,681 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:37:05,681 INFO L82 PathProgramCache]: Analyzing trace with hash 224065163, now seen corresponding path program 1 times [2018-12-03 01:37:05,682 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:37:05,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:37:05,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:37:05,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:37:05,717 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:37:05,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:37:05,823 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-03 01:37:05,825 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:37:05,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 01:37:05,825 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:37:05,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 01:37:05,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 01:37:05,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 01:37:05,838 INFO L87 Difference]: Start difference. First operand 25089 states. Second operand 4 states. [2018-12-03 01:37:06,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:37:06,319 INFO L93 Difference]: Finished difference Result 45389 states and 177627 transitions. [2018-12-03 01:37:06,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 01:37:06,320 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2018-12-03 01:37:06,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:37:06,469 INFO L225 Difference]: With dead ends: 45389 [2018-12-03 01:37:06,469 INFO L226 Difference]: Without dead ends: 40629 [2018-12-03 01:37:06,470 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-03 01:37:06,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40629 states. [2018-12-03 01:37:07,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40629 to 23663. [2018-12-03 01:37:07,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23663 states. [2018-12-03 01:37:07,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23663 states to 23663 states and 92544 transitions. [2018-12-03 01:37:07,293 INFO L78 Accepts]: Start accepts. Automaton has 23663 states and 92544 transitions. Word has length 38 [2018-12-03 01:37:07,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:37:07,293 INFO L480 AbstractCegarLoop]: Abstraction has 23663 states and 92544 transitions. [2018-12-03 01:37:07,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 01:37:07,293 INFO L276 IsEmpty]: Start isEmpty. Operand 23663 states and 92544 transitions. [2018-12-03 01:37:07,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-03 01:37:07,296 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:37:07,296 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] [2018-12-03 01:37:07,296 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:37:07,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:37:07,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1632937034, now seen corresponding path program 1 times [2018-12-03 01:37:07,296 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:37:07,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:37:07,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:37:07,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:37:07,299 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:37:07,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:37:07,329 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-03 01:37:07,329 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:37:07,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 01:37:07,330 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:37:07,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 01:37:07,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 01:37:07,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 01:37:07,331 INFO L87 Difference]: Start difference. First operand 23663 states and 92544 transitions. Second operand 3 states. [2018-12-03 01:37:07,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:37:07,505 INFO L93 Difference]: Finished difference Result 23663 states and 92160 transitions. [2018-12-03 01:37:07,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 01:37:07,506 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2018-12-03 01:37:07,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:37:07,575 INFO L225 Difference]: With dead ends: 23663 [2018-12-03 01:37:07,575 INFO L226 Difference]: Without dead ends: 23663 [2018-12-03 01:37:07,575 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-03 01:37:07,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23663 states. [2018-12-03 01:37:08,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23663 to 23663. [2018-12-03 01:37:08,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23663 states. [2018-12-03 01:37:08,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23663 states to 23663 states and 92160 transitions. [2018-12-03 01:37:08,075 INFO L78 Accepts]: Start accepts. Automaton has 23663 states and 92160 transitions. Word has length 45 [2018-12-03 01:37:08,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:37:08,075 INFO L480 AbstractCegarLoop]: Abstraction has 23663 states and 92160 transitions. [2018-12-03 01:37:08,075 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 01:37:08,075 INFO L276 IsEmpty]: Start isEmpty. Operand 23663 states and 92160 transitions. [2018-12-03 01:37:08,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-03 01:37:08,077 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:37:08,077 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] [2018-12-03 01:37:08,077 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:37:08,078 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:37:08,078 INFO L82 PathProgramCache]: Analyzing trace with hash -164014325, now seen corresponding path program 1 times [2018-12-03 01:37:08,078 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:37:08,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:37:08,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:37:08,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:37:08,080 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:37:08,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:37:08,133 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-03 01:37:08,133 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:37:08,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 01:37:08,134 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:37:08,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 01:37:08,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 01:37:08,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 01:37:08,134 INFO L87 Difference]: Start difference. First operand 23663 states and 92160 transitions. Second operand 5 states. [2018-12-03 01:37:08,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:37:08,701 INFO L93 Difference]: Finished difference Result 64831 states and 240932 transitions. [2018-12-03 01:37:08,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 01:37:08,702 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2018-12-03 01:37:08,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:37:08,824 INFO L225 Difference]: With dead ends: 64831 [2018-12-03 01:37:08,824 INFO L226 Difference]: Without dead ends: 64671 [2018-12-03 01:37:08,824 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-03 01:37:09,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64671 states. [2018-12-03 01:37:09,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64671 to 37143. [2018-12-03 01:37:09,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37143 states. [2018-12-03 01:37:09,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37143 states to 37143 states and 137901 transitions. [2018-12-03 01:37:09,561 INFO L78 Accepts]: Start accepts. Automaton has 37143 states and 137901 transitions. Word has length 45 [2018-12-03 01:37:09,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:37:09,562 INFO L480 AbstractCegarLoop]: Abstraction has 37143 states and 137901 transitions. [2018-12-03 01:37:09,562 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 01:37:09,562 INFO L276 IsEmpty]: Start isEmpty. Operand 37143 states and 137901 transitions. [2018-12-03 01:37:09,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-03 01:37:09,564 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:37:09,564 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:37:09,565 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:37:09,565 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:37:09,565 INFO L82 PathProgramCache]: Analyzing trace with hash 1508997083, now seen corresponding path program 1 times [2018-12-03 01:37:09,565 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:37:09,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:37:09,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:37:09,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:37:09,567 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:37:09,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:37:09,601 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-03 01:37:09,601 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:37:09,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 01:37:09,601 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:37:09,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 01:37:09,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 01:37:09,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 01:37:09,602 INFO L87 Difference]: Start difference. First operand 37143 states and 137901 transitions. Second operand 3 states. [2018-12-03 01:37:09,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:37:09,878 INFO L93 Difference]: Finished difference Result 37143 states and 137892 transitions. [2018-12-03 01:37:09,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 01:37:09,879 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2018-12-03 01:37:09,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:37:09,933 INFO L225 Difference]: With dead ends: 37143 [2018-12-03 01:37:09,933 INFO L226 Difference]: Without dead ends: 37143 [2018-12-03 01:37:09,934 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-03 01:37:10,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37143 states. [2018-12-03 01:37:10,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37143 to 37143. [2018-12-03 01:37:10,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37143 states. [2018-12-03 01:37:10,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37143 states to 37143 states and 137892 transitions. [2018-12-03 01:37:10,416 INFO L78 Accepts]: Start accepts. Automaton has 37143 states and 137892 transitions. Word has length 46 [2018-12-03 01:37:10,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:37:10,416 INFO L480 AbstractCegarLoop]: Abstraction has 37143 states and 137892 transitions. [2018-12-03 01:37:10,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 01:37:10,417 INFO L276 IsEmpty]: Start isEmpty. Operand 37143 states and 137892 transitions. [2018-12-03 01:37:10,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-03 01:37:10,418 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:37:10,419 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:37:10,419 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:37:10,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:37:10,419 INFO L82 PathProgramCache]: Analyzing trace with hash -1043159878, now seen corresponding path program 1 times [2018-12-03 01:37:10,419 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:37:10,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:37:10,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:37:10,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:37:10,422 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:37:10,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:37:10,477 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-03 01:37:10,478 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:37:10,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 01:37:10,478 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:37:10,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 01:37:10,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 01:37:10,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 01:37:10,478 INFO L87 Difference]: Start difference. First operand 37143 states and 137892 transitions. Second operand 5 states. [2018-12-03 01:37:10,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:37:10,947 INFO L93 Difference]: Finished difference Result 66627 states and 246193 transitions. [2018-12-03 01:37:10,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 01:37:10,948 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2018-12-03 01:37:10,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:37:11,066 INFO L225 Difference]: With dead ends: 66627 [2018-12-03 01:37:11,066 INFO L226 Difference]: Without dead ends: 66459 [2018-12-03 01:37:11,066 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-03 01:37:11,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66459 states. [2018-12-03 01:37:11,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66459 to 38835. [2018-12-03 01:37:11,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38835 states. [2018-12-03 01:37:11,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38835 states to 38835 states and 143650 transitions. [2018-12-03 01:37:11,742 INFO L78 Accepts]: Start accepts. Automaton has 38835 states and 143650 transitions. Word has length 46 [2018-12-03 01:37:11,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:37:11,742 INFO L480 AbstractCegarLoop]: Abstraction has 38835 states and 143650 transitions. [2018-12-03 01:37:11,742 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 01:37:11,742 INFO L276 IsEmpty]: Start isEmpty. Operand 38835 states and 143650 transitions. [2018-12-03 01:37:11,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-03 01:37:11,747 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:37:11,748 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:37:11,748 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:37:11,748 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:37:11,748 INFO L82 PathProgramCache]: Analyzing trace with hash 942235242, now seen corresponding path program 1 times [2018-12-03 01:37:11,748 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:37:11,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:37:11,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:37:11,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:37:11,749 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:37:11,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:37:11,784 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-03 01:37:11,784 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:37:11,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 01:37:11,784 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:37:11,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 01:37:11,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 01:37:11,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 01:37:11,785 INFO L87 Difference]: Start difference. First operand 38835 states and 143650 transitions. Second operand 4 states. [2018-12-03 01:37:11,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:37:11,831 INFO L93 Difference]: Finished difference Result 14217 states and 47061 transitions. [2018-12-03 01:37:11,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 01:37:11,831 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2018-12-03 01:37:11,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:37:11,848 INFO L225 Difference]: With dead ends: 14217 [2018-12-03 01:37:11,848 INFO L226 Difference]: Without dead ends: 13696 [2018-12-03 01:37:11,849 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-03 01:37:11,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13696 states. [2018-12-03 01:37:11,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13696 to 13696. [2018-12-03 01:37:11,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13696 states. [2018-12-03 01:37:11,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13696 states to 13696 states and 45509 transitions. [2018-12-03 01:37:11,992 INFO L78 Accepts]: Start accepts. Automaton has 13696 states and 45509 transitions. Word has length 53 [2018-12-03 01:37:11,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:37:11,992 INFO L480 AbstractCegarLoop]: Abstraction has 13696 states and 45509 transitions. [2018-12-03 01:37:11,992 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 01:37:11,992 INFO L276 IsEmpty]: Start isEmpty. Operand 13696 states and 45509 transitions. [2018-12-03 01:37:11,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-03 01:37:11,995 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:37:11,995 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:37:11,995 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:37:11,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:37:11,995 INFO L82 PathProgramCache]: Analyzing trace with hash 1496318134, now seen corresponding path program 1 times [2018-12-03 01:37:11,995 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:37:11,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:37:11,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:37:11,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:37:11,997 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:37:12,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:37:12,037 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-03 01:37:12,037 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:37:12,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 01:37:12,037 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:37:12,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 01:37:12,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 01:37:12,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 01:37:12,038 INFO L87 Difference]: Start difference. First operand 13696 states and 45509 transitions. Second operand 4 states. [2018-12-03 01:37:12,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:37:12,176 INFO L93 Difference]: Finished difference Result 19084 states and 62264 transitions. [2018-12-03 01:37:12,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 01:37:12,176 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2018-12-03 01:37:12,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:37:12,198 INFO L225 Difference]: With dead ends: 19084 [2018-12-03 01:37:12,198 INFO L226 Difference]: Without dead ends: 19084 [2018-12-03 01:37:12,198 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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-03 01:37:12,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19084 states. [2018-12-03 01:37:12,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19084 to 14780. [2018-12-03 01:37:12,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14780 states. [2018-12-03 01:37:12,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14780 states to 14780 states and 48764 transitions. [2018-12-03 01:37:12,382 INFO L78 Accepts]: Start accepts. Automaton has 14780 states and 48764 transitions. Word has length 59 [2018-12-03 01:37:12,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:37:12,382 INFO L480 AbstractCegarLoop]: Abstraction has 14780 states and 48764 transitions. [2018-12-03 01:37:12,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 01:37:12,382 INFO L276 IsEmpty]: Start isEmpty. Operand 14780 states and 48764 transitions. [2018-12-03 01:37:12,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-03 01:37:12,385 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:37:12,385 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:37:12,385 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:37:12,385 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:37:12,385 INFO L82 PathProgramCache]: Analyzing trace with hash -1055838827, now seen corresponding path program 1 times [2018-12-03 01:37:12,385 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:37:12,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:37:12,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:37:12,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:37:12,387 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:37:12,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:37:12,432 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-03 01:37:12,432 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:37:12,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 01:37:12,432 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:37:12,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 01:37:12,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 01:37:12,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 01:37:12,433 INFO L87 Difference]: Start difference. First operand 14780 states and 48764 transitions. Second operand 4 states. [2018-12-03 01:37:12,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:37:12,790 INFO L93 Difference]: Finished difference Result 20683 states and 67222 transitions. [2018-12-03 01:37:12,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 01:37:12,790 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2018-12-03 01:37:12,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:37:12,817 INFO L225 Difference]: With dead ends: 20683 [2018-12-03 01:37:12,817 INFO L226 Difference]: Without dead ends: 20683 [2018-12-03 01:37:12,818 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-03 01:37:12,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20683 states. [2018-12-03 01:37:13,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20683 to 18616. [2018-12-03 01:37:13,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18616 states. [2018-12-03 01:37:13,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18616 states to 18616 states and 60973 transitions. [2018-12-03 01:37:13,046 INFO L78 Accepts]: Start accepts. Automaton has 18616 states and 60973 transitions. Word has length 59 [2018-12-03 01:37:13,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:37:13,047 INFO L480 AbstractCegarLoop]: Abstraction has 18616 states and 60973 transitions. [2018-12-03 01:37:13,047 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 01:37:13,047 INFO L276 IsEmpty]: Start isEmpty. Operand 18616 states and 60973 transitions. [2018-12-03 01:37:13,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-03 01:37:13,050 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:37:13,050 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:37:13,050 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:37:13,050 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:37:13,050 INFO L82 PathProgramCache]: Analyzing trace with hash 297470870, now seen corresponding path program 1 times [2018-12-03 01:37:13,050 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:37:13,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:37:13,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:37:13,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:37:13,051 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:37:13,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:37:13,118 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-03 01:37:13,119 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:37:13,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 01:37:13,119 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:37:13,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 01:37:13,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 01:37:13,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-03 01:37:13,119 INFO L87 Difference]: Start difference. First operand 18616 states and 60973 transitions. Second operand 6 states. [2018-12-03 01:37:13,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:37:13,353 INFO L93 Difference]: Finished difference Result 20124 states and 65124 transitions. [2018-12-03 01:37:13,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 01:37:13,354 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2018-12-03 01:37:13,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:37:13,375 INFO L225 Difference]: With dead ends: 20124 [2018-12-03 01:37:13,376 INFO L226 Difference]: Without dead ends: 20124 [2018-12-03 01:37:13,376 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-03 01:37:13,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20124 states. [2018-12-03 01:37:13,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20124 to 19170. [2018-12-03 01:37:13,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19170 states. [2018-12-03 01:37:13,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19170 states to 19170 states and 62482 transitions. [2018-12-03 01:37:13,572 INFO L78 Accepts]: Start accepts. Automaton has 19170 states and 62482 transitions. Word has length 59 [2018-12-03 01:37:13,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:37:13,572 INFO L480 AbstractCegarLoop]: Abstraction has 19170 states and 62482 transitions. [2018-12-03 01:37:13,572 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 01:37:13,572 INFO L276 IsEmpty]: Start isEmpty. Operand 19170 states and 62482 transitions. [2018-12-03 01:37:13,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-03 01:37:13,575 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:37:13,576 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:37:13,576 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:37:13,576 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:37:13,576 INFO L82 PathProgramCache]: Analyzing trace with hash 4067863, now seen corresponding path program 1 times [2018-12-03 01:37:13,576 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:37:13,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:37:13,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:37:13,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:37:13,577 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:37:13,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:37:13,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-03 01:37:13,631 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:37:13,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 01:37:13,631 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:37:13,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 01:37:13,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 01:37:13,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-03 01:37:13,631 INFO L87 Difference]: Start difference. First operand 19170 states and 62482 transitions. Second operand 6 states. [2018-12-03 01:37:13,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:37:13,966 INFO L93 Difference]: Finished difference Result 24714 states and 79880 transitions. [2018-12-03 01:37:13,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 01:37:13,966 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2018-12-03 01:37:13,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:37:13,995 INFO L225 Difference]: With dead ends: 24714 [2018-12-03 01:37:13,995 INFO L226 Difference]: Without dead ends: 24682 [2018-12-03 01:37:13,995 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-12-03 01:37:14,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24682 states. [2018-12-03 01:37:14,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24682 to 18802. [2018-12-03 01:37:14,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18802 states. [2018-12-03 01:37:14,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18802 states to 18802 states and 61266 transitions. [2018-12-03 01:37:14,216 INFO L78 Accepts]: Start accepts. Automaton has 18802 states and 61266 transitions. Word has length 59 [2018-12-03 01:37:14,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:37:14,216 INFO L480 AbstractCegarLoop]: Abstraction has 18802 states and 61266 transitions. [2018-12-03 01:37:14,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 01:37:14,216 INFO L276 IsEmpty]: Start isEmpty. Operand 18802 states and 61266 transitions. [2018-12-03 01:37:14,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-03 01:37:14,227 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:37:14,227 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:37:14,227 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:37:14,227 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:37:14,227 INFO L82 PathProgramCache]: Analyzing trace with hash 1469976449, now seen corresponding path program 1 times [2018-12-03 01:37:14,227 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:37:14,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:37:14,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:37:14,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:37:14,228 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:37:14,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:37:14,264 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-03 01:37:14,264 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:37:14,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 01:37:14,265 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:37:14,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 01:37:14,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 01:37:14,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-03 01:37:14,265 INFO L87 Difference]: Start difference. First operand 18802 states and 61266 transitions. Second operand 5 states. [2018-12-03 01:37:14,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:37:14,287 INFO L93 Difference]: Finished difference Result 3366 states and 8825 transitions. [2018-12-03 01:37:14,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 01:37:14,288 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2018-12-03 01:37:14,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:37:14,290 INFO L225 Difference]: With dead ends: 3366 [2018-12-03 01:37:14,290 INFO L226 Difference]: Without dead ends: 2798 [2018-12-03 01:37:14,290 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-03 01:37:14,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2798 states. [2018-12-03 01:37:14,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2798 to 2655. [2018-12-03 01:37:14,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2655 states. [2018-12-03 01:37:14,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2655 states to 2655 states and 6946 transitions. [2018-12-03 01:37:14,308 INFO L78 Accepts]: Start accepts. Automaton has 2655 states and 6946 transitions. Word has length 73 [2018-12-03 01:37:14,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:37:14,308 INFO L480 AbstractCegarLoop]: Abstraction has 2655 states and 6946 transitions. [2018-12-03 01:37:14,308 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 01:37:14,308 INFO L276 IsEmpty]: Start isEmpty. Operand 2655 states and 6946 transitions. [2018-12-03 01:37:14,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-03 01:37:14,310 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:37:14,310 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] [2018-12-03 01:37:14,310 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:37:14,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:37:14,310 INFO L82 PathProgramCache]: Analyzing trace with hash -401390984, now seen corresponding path program 1 times [2018-12-03 01:37:14,310 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:37:14,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:37:14,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:37:14,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:37:14,311 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:37:14,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:37:14,353 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-03 01:37:14,354 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:37:14,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 01:37:14,354 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:37:14,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 01:37:14,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 01:37:14,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 01:37:14,354 INFO L87 Difference]: Start difference. First operand 2655 states and 6946 transitions. Second operand 4 states. [2018-12-03 01:37:14,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:37:14,432 INFO L93 Difference]: Finished difference Result 3185 states and 8174 transitions. [2018-12-03 01:37:14,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 01:37:14,432 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2018-12-03 01:37:14,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:37:14,434 INFO L225 Difference]: With dead ends: 3185 [2018-12-03 01:37:14,434 INFO L226 Difference]: Without dead ends: 3157 [2018-12-03 01:37:14,435 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-03 01:37:14,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3157 states. [2018-12-03 01:37:14,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3157 to 3120. [2018-12-03 01:37:14,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3120 states. [2018-12-03 01:37:14,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3120 states to 3120 states and 8050 transitions. [2018-12-03 01:37:14,457 INFO L78 Accepts]: Start accepts. Automaton has 3120 states and 8050 transitions. Word has length 92 [2018-12-03 01:37:14,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:37:14,457 INFO L480 AbstractCegarLoop]: Abstraction has 3120 states and 8050 transitions. [2018-12-03 01:37:14,457 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 01:37:14,457 INFO L276 IsEmpty]: Start isEmpty. Operand 3120 states and 8050 transitions. [2018-12-03 01:37:14,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-03 01:37:14,459 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:37:14,459 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] [2018-12-03 01:37:14,460 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:37:14,460 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:37:14,460 INFO L82 PathProgramCache]: Analyzing trace with hash 568190039, now seen corresponding path program 1 times [2018-12-03 01:37:14,460 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:37:14,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:37:14,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:37:14,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:37:14,461 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:37:14,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:37:14,486 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-03 01:37:14,486 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:37:14,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 01:37:14,486 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:37:14,487 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 01:37:14,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 01:37:14,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 01:37:14,487 INFO L87 Difference]: Start difference. First operand 3120 states and 8050 transitions. Second operand 4 states. [2018-12-03 01:37:14,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:37:14,604 INFO L93 Difference]: Finished difference Result 4034 states and 10499 transitions. [2018-12-03 01:37:14,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 01:37:14,604 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2018-12-03 01:37:14,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:37:14,607 INFO L225 Difference]: With dead ends: 4034 [2018-12-03 01:37:14,607 INFO L226 Difference]: Without dead ends: 4034 [2018-12-03 01:37:14,607 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 01:37:14,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4034 states. [2018-12-03 01:37:14,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4034 to 2994. [2018-12-03 01:37:14,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2994 states. [2018-12-03 01:37:14,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2994 states to 2994 states and 7680 transitions. [2018-12-03 01:37:14,630 INFO L78 Accepts]: Start accepts. Automaton has 2994 states and 7680 transitions. Word has length 92 [2018-12-03 01:37:14,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:37:14,631 INFO L480 AbstractCegarLoop]: Abstraction has 2994 states and 7680 transitions. [2018-12-03 01:37:14,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 01:37:14,631 INFO L276 IsEmpty]: Start isEmpty. Operand 2994 states and 7680 transitions. [2018-12-03 01:37:14,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-03 01:37:14,633 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:37:14,633 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] [2018-12-03 01:37:14,633 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:37:14,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:37:14,633 INFO L82 PathProgramCache]: Analyzing trace with hash -167652887, now seen corresponding path program 2 times [2018-12-03 01:37:14,633 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:37:14,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:37:14,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:37:14,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:37:14,634 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:37:14,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:37:14,667 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-03 01:37:14,667 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:37:14,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 01:37:14,667 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:37:14,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 01:37:14,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 01:37:14,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 01:37:14,667 INFO L87 Difference]: Start difference. First operand 2994 states and 7680 transitions. Second operand 5 states. [2018-12-03 01:37:14,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:37:14,797 INFO L93 Difference]: Finished difference Result 3400 states and 8637 transitions. [2018-12-03 01:37:14,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 01:37:14,797 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2018-12-03 01:37:14,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:37:14,800 INFO L225 Difference]: With dead ends: 3400 [2018-12-03 01:37:14,800 INFO L226 Difference]: Without dead ends: 3372 [2018-12-03 01:37:14,800 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-03 01:37:14,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3372 states. [2018-12-03 01:37:14,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3372 to 2994. [2018-12-03 01:37:14,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2994 states. [2018-12-03 01:37:14,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2994 states to 2994 states and 7672 transitions. [2018-12-03 01:37:14,823 INFO L78 Accepts]: Start accepts. Automaton has 2994 states and 7672 transitions. Word has length 92 [2018-12-03 01:37:14,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:37:14,823 INFO L480 AbstractCegarLoop]: Abstraction has 2994 states and 7672 transitions. [2018-12-03 01:37:14,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 01:37:14,823 INFO L276 IsEmpty]: Start isEmpty. Operand 2994 states and 7672 transitions. [2018-12-03 01:37:14,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-03 01:37:14,826 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:37:14,826 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-03 01:37:14,826 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:37:14,826 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:37:14,826 INFO L82 PathProgramCache]: Analyzing trace with hash -299900742, now seen corresponding path program 1 times [2018-12-03 01:37:14,826 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:37:14,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:37:14,827 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 01:37:14,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:37:14,827 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:37:14,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:37:14,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:37:14,857 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:37:14,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 01:37:14,857 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:37:14,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 01:37:14,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 01:37:14,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 01:37:14,857 INFO L87 Difference]: Start difference. First operand 2994 states and 7672 transitions. Second operand 4 states. [2018-12-03 01:37:14,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:37:14,946 INFO L93 Difference]: Finished difference Result 5218 states and 13652 transitions. [2018-12-03 01:37:14,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 01:37:14,946 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2018-12-03 01:37:14,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:37:14,950 INFO L225 Difference]: With dead ends: 5218 [2018-12-03 01:37:14,950 INFO L226 Difference]: Without dead ends: 5190 [2018-12-03 01:37:14,951 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 01:37:14,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5190 states. [2018-12-03 01:37:14,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5190 to 2817. [2018-12-03 01:37:14,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2817 states. [2018-12-03 01:37:14,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2817 states to 2817 states and 7201 transitions. [2018-12-03 01:37:14,981 INFO L78 Accepts]: Start accepts. Automaton has 2817 states and 7201 transitions. Word has length 94 [2018-12-03 01:37:14,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:37:14,981 INFO L480 AbstractCegarLoop]: Abstraction has 2817 states and 7201 transitions. [2018-12-03 01:37:14,981 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 01:37:14,982 INFO L276 IsEmpty]: Start isEmpty. Operand 2817 states and 7201 transitions. [2018-12-03 01:37:14,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-03 01:37:14,984 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:37:14,984 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-03 01:37:14,984 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:37:14,985 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:37:14,985 INFO L82 PathProgramCache]: Analyzing trace with hash 29865019, now seen corresponding path program 1 times [2018-12-03 01:37:14,985 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:37:14,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:37:14,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:37:14,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:37:14,986 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:37:14,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:37:15,059 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-03 01:37:15,059 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:37:15,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 01:37:15,059 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:37:15,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 01:37:15,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 01:37:15,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-03 01:37:15,060 INFO L87 Difference]: Start difference. First operand 2817 states and 7201 transitions. Second operand 6 states. [2018-12-03 01:37:15,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:37:15,283 INFO L93 Difference]: Finished difference Result 3106 states and 7779 transitions. [2018-12-03 01:37:15,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 01:37:15,283 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2018-12-03 01:37:15,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:37:15,285 INFO L225 Difference]: With dead ends: 3106 [2018-12-03 01:37:15,285 INFO L226 Difference]: Without dead ends: 3053 [2018-12-03 01:37:15,285 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-03 01:37:15,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3053 states. [2018-12-03 01:37:15,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3053 to 2969. [2018-12-03 01:37:15,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2969 states. [2018-12-03 01:37:15,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2969 states to 2969 states and 7504 transitions. [2018-12-03 01:37:15,306 INFO L78 Accepts]: Start accepts. Automaton has 2969 states and 7504 transitions. Word has length 94 [2018-12-03 01:37:15,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:37:15,307 INFO L480 AbstractCegarLoop]: Abstraction has 2969 states and 7504 transitions. [2018-12-03 01:37:15,307 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 01:37:15,307 INFO L276 IsEmpty]: Start isEmpty. Operand 2969 states and 7504 transitions. [2018-12-03 01:37:15,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-03 01:37:15,309 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:37:15,309 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-03 01:37:15,309 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:37:15,309 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:37:15,309 INFO L82 PathProgramCache]: Analyzing trace with hash 1730605498, now seen corresponding path program 1 times [2018-12-03 01:37:15,310 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:37:15,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:37:15,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:37:15,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:37:15,311 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:37:15,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:37:15,388 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-03 01:37:15,388 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:37:15,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 01:37:15,388 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:37:15,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 01:37:15,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 01:37:15,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-03 01:37:15,389 INFO L87 Difference]: Start difference. First operand 2969 states and 7504 transitions. Second operand 7 states. [2018-12-03 01:37:15,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:37:15,582 INFO L93 Difference]: Finished difference Result 3179 states and 8029 transitions. [2018-12-03 01:37:15,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 01:37:15,582 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2018-12-03 01:37:15,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:37:15,584 INFO L225 Difference]: With dead ends: 3179 [2018-12-03 01:37:15,584 INFO L226 Difference]: Without dead ends: 3179 [2018-12-03 01:37:15,585 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-03 01:37:15,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3179 states. [2018-12-03 01:37:15,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3179 to 2946. [2018-12-03 01:37:15,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2946 states. [2018-12-03 01:37:15,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2946 states to 2946 states and 7460 transitions. [2018-12-03 01:37:15,604 INFO L78 Accepts]: Start accepts. Automaton has 2946 states and 7460 transitions. Word has length 94 [2018-12-03 01:37:15,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:37:15,604 INFO L480 AbstractCegarLoop]: Abstraction has 2946 states and 7460 transitions. [2018-12-03 01:37:15,604 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 01:37:15,604 INFO L276 IsEmpty]: Start isEmpty. Operand 2946 states and 7460 transitions. [2018-12-03 01:37:15,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-03 01:37:15,606 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:37:15,606 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-03 01:37:15,606 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:37:15,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:37:15,606 INFO L82 PathProgramCache]: Analyzing trace with hash -1153482278, now seen corresponding path program 1 times [2018-12-03 01:37:15,606 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:37:15,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:37:15,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:37:15,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:37:15,607 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:37:15,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:37:15,640 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-03 01:37:15,641 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:37:15,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 01:37:15,641 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:37:15,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 01:37:15,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 01:37:15,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 01:37:15,641 INFO L87 Difference]: Start difference. First operand 2946 states and 7460 transitions. Second operand 5 states. [2018-12-03 01:37:15,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:37:15,752 INFO L93 Difference]: Finished difference Result 5437 states and 14032 transitions. [2018-12-03 01:37:15,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 01:37:15,753 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-12-03 01:37:15,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:37:15,756 INFO L225 Difference]: With dead ends: 5437 [2018-12-03 01:37:15,756 INFO L226 Difference]: Without dead ends: 5411 [2018-12-03 01:37:15,757 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-03 01:37:15,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5411 states. [2018-12-03 01:37:15,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5411 to 3000. [2018-12-03 01:37:15,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3000 states. [2018-12-03 01:37:15,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3000 states to 3000 states and 7583 transitions. [2018-12-03 01:37:15,783 INFO L78 Accepts]: Start accepts. Automaton has 3000 states and 7583 transitions. Word has length 94 [2018-12-03 01:37:15,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:37:15,783 INFO L480 AbstractCegarLoop]: Abstraction has 3000 states and 7583 transitions. [2018-12-03 01:37:15,783 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 01:37:15,783 INFO L276 IsEmpty]: Start isEmpty. Operand 3000 states and 7583 transitions. [2018-12-03 01:37:15,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-03 01:37:15,785 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:37:15,785 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-03 01:37:15,785 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:37:15,785 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:37:15,786 INFO L82 PathProgramCache]: Analyzing trace with hash -363042151, now seen corresponding path program 1 times [2018-12-03 01:37:15,786 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:37:15,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:37:15,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:37:15,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:37:15,787 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:37:15,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:37:15,837 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-03 01:37:15,837 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:37:15,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 01:37:15,837 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:37:15,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 01:37:15,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 01:37:15,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-03 01:37:15,838 INFO L87 Difference]: Start difference. First operand 3000 states and 7583 transitions. Second operand 5 states. [2018-12-03 01:37:15,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:37:15,896 INFO L93 Difference]: Finished difference Result 2722 states and 6852 transitions. [2018-12-03 01:37:15,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 01:37:15,897 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-12-03 01:37:15,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:37:15,898 INFO L225 Difference]: With dead ends: 2722 [2018-12-03 01:37:15,899 INFO L226 Difference]: Without dead ends: 2722 [2018-12-03 01:37:15,899 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-03 01:37:15,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2722 states. [2018-12-03 01:37:15,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2722 to 2626. [2018-12-03 01:37:15,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2626 states. [2018-12-03 01:37:15,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2626 states to 2626 states and 6654 transitions. [2018-12-03 01:37:15,915 INFO L78 Accepts]: Start accepts. Automaton has 2626 states and 6654 transitions. Word has length 94 [2018-12-03 01:37:15,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:37:15,915 INFO L480 AbstractCegarLoop]: Abstraction has 2626 states and 6654 transitions. [2018-12-03 01:37:15,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 01:37:15,915 INFO L276 IsEmpty]: Start isEmpty. Operand 2626 states and 6654 transitions. [2018-12-03 01:37:15,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-03 01:37:15,917 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:37:15,917 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-03 01:37:15,918 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:37:15,918 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:37:15,918 INFO L82 PathProgramCache]: Analyzing trace with hash -140505574, now seen corresponding path program 1 times [2018-12-03 01:37:15,918 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:37:15,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:37:15,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:37:15,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:37:15,919 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:37:15,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:37:15,983 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-03 01:37:15,983 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:37:15,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 01:37:15,984 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:37:15,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 01:37:15,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 01:37:15,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-03 01:37:15,984 INFO L87 Difference]: Start difference. First operand 2626 states and 6654 transitions. Second operand 6 states. [2018-12-03 01:37:16,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:37:16,049 INFO L93 Difference]: Finished difference Result 2658 states and 6606 transitions. [2018-12-03 01:37:16,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 01:37:16,050 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2018-12-03 01:37:16,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:37:16,052 INFO L225 Difference]: With dead ends: 2658 [2018-12-03 01:37:16,052 INFO L226 Difference]: Without dead ends: 2658 [2018-12-03 01:37:16,052 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-03 01:37:16,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2658 states. [2018-12-03 01:37:16,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2658 to 2232. [2018-12-03 01:37:16,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2232 states. [2018-12-03 01:37:16,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2232 states to 2232 states and 5594 transitions. [2018-12-03 01:37:16,068 INFO L78 Accepts]: Start accepts. Automaton has 2232 states and 5594 transitions. Word has length 94 [2018-12-03 01:37:16,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:37:16,068 INFO L480 AbstractCegarLoop]: Abstraction has 2232 states and 5594 transitions. [2018-12-03 01:37:16,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 01:37:16,068 INFO L276 IsEmpty]: Start isEmpty. Operand 2232 states and 5594 transitions. [2018-12-03 01:37:16,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-03 01:37:16,070 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:37:16,070 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:37:16,070 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:37:16,070 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:37:16,070 INFO L82 PathProgramCache]: Analyzing trace with hash 1073631423, now seen corresponding path program 1 times [2018-12-03 01:37:16,070 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:37:16,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:37:16,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:37:16,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:37:16,071 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:37:16,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:37:16,148 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-03 01:37:16,148 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:37:16,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-03 01:37:16,148 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:37:16,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 01:37:16,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 01:37:16,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-03 01:37:16,149 INFO L87 Difference]: Start difference. First operand 2232 states and 5594 transitions. Second operand 8 states. [2018-12-03 01:37:16,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:37:16,363 INFO L93 Difference]: Finished difference Result 3187 states and 8014 transitions. [2018-12-03 01:37:16,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 01:37:16,364 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 96 [2018-12-03 01:37:16,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:37:16,366 INFO L225 Difference]: With dead ends: 3187 [2018-12-03 01:37:16,366 INFO L226 Difference]: Without dead ends: 3155 [2018-12-03 01:37:16,366 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-12-03 01:37:16,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3155 states. [2018-12-03 01:37:16,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3155 to 2847. [2018-12-03 01:37:16,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2847 states. [2018-12-03 01:37:16,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2847 states to 2847 states and 7178 transitions. [2018-12-03 01:37:16,385 INFO L78 Accepts]: Start accepts. Automaton has 2847 states and 7178 transitions. Word has length 96 [2018-12-03 01:37:16,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:37:16,385 INFO L480 AbstractCegarLoop]: Abstraction has 2847 states and 7178 transitions. [2018-12-03 01:37:16,385 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 01:37:16,385 INFO L276 IsEmpty]: Start isEmpty. Operand 2847 states and 7178 transitions. [2018-12-03 01:37:16,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-03 01:37:16,387 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:37:16,388 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:37:16,388 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:37:16,388 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:37:16,388 INFO L82 PathProgramCache]: Analyzing trace with hash -1976571392, now seen corresponding path program 1 times [2018-12-03 01:37:16,388 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:37:16,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:37:16,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:37:16,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:37:16,389 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:37:16,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:37:16,441 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-03 01:37:16,441 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:37:16,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 01:37:16,441 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:37:16,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 01:37:16,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 01:37:16,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-03 01:37:16,441 INFO L87 Difference]: Start difference. First operand 2847 states and 7178 transitions. Second operand 7 states. [2018-12-03 01:37:16,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:37:16,569 INFO L93 Difference]: Finished difference Result 2844 states and 7157 transitions. [2018-12-03 01:37:16,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 01:37:16,569 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2018-12-03 01:37:16,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:37:16,571 INFO L225 Difference]: With dead ends: 2844 [2018-12-03 01:37:16,571 INFO L226 Difference]: Without dead ends: 2844 [2018-12-03 01:37:16,571 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-12-03 01:37:16,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2844 states. [2018-12-03 01:37:16,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2844 to 2812. [2018-12-03 01:37:16,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2812 states. [2018-12-03 01:37:16,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2812 states to 2812 states and 7097 transitions. [2018-12-03 01:37:16,589 INFO L78 Accepts]: Start accepts. Automaton has 2812 states and 7097 transitions. Word has length 96 [2018-12-03 01:37:16,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:37:16,589 INFO L480 AbstractCegarLoop]: Abstraction has 2812 states and 7097 transitions. [2018-12-03 01:37:16,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 01:37:16,589 INFO L276 IsEmpty]: Start isEmpty. Operand 2812 states and 7097 transitions. [2018-12-03 01:37:16,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-03 01:37:16,591 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:37:16,591 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:37:16,592 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:37:16,592 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:37:16,592 INFO L82 PathProgramCache]: Analyzing trace with hash 1403397184, now seen corresponding path program 1 times [2018-12-03 01:37:16,592 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:37:16,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:37:16,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:37:16,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:37:16,593 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:37:16,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:37:16,625 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-03 01:37:16,625 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:37:16,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 01:37:16,625 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:37:16,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 01:37:16,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 01:37:16,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 01:37:16,626 INFO L87 Difference]: Start difference. First operand 2812 states and 7097 transitions. Second operand 5 states. [2018-12-03 01:37:16,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:37:16,738 INFO L93 Difference]: Finished difference Result 3164 states and 7961 transitions. [2018-12-03 01:37:16,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 01:37:16,738 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2018-12-03 01:37:16,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:37:16,741 INFO L225 Difference]: With dead ends: 3164 [2018-12-03 01:37:16,741 INFO L226 Difference]: Without dead ends: 3132 [2018-12-03 01:37:16,741 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-03 01:37:16,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3132 states. [2018-12-03 01:37:16,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3132 to 2628. [2018-12-03 01:37:16,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2628 states. [2018-12-03 01:37:16,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2628 states to 2628 states and 6638 transitions. [2018-12-03 01:37:16,761 INFO L78 Accepts]: Start accepts. Automaton has 2628 states and 6638 transitions. Word has length 96 [2018-12-03 01:37:16,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:37:16,762 INFO L480 AbstractCegarLoop]: Abstraction has 2628 states and 6638 transitions. [2018-12-03 01:37:16,762 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 01:37:16,762 INFO L276 IsEmpty]: Start isEmpty. Operand 2628 states and 6638 transitions. [2018-12-03 01:37:16,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-03 01:37:16,764 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:37:16,764 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:37:16,764 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:37:16,764 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:37:16,765 INFO L82 PathProgramCache]: Analyzing trace with hash -1646805631, now seen corresponding path program 1 times [2018-12-03 01:37:16,765 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:37:16,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:37:16,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:37:16,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:37:16,766 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:37:16,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:37:16,847 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-03 01:37:16,848 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:37:16,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-03 01:37:16,848 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:37:16,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 01:37:16,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 01:37:16,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-03 01:37:16,848 INFO L87 Difference]: Start difference. First operand 2628 states and 6638 transitions. Second operand 10 states. [2018-12-03 01:37:17,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:37:17,099 INFO L93 Difference]: Finished difference Result 4381 states and 11302 transitions. [2018-12-03 01:37:17,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 01:37:17,099 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2018-12-03 01:37:17,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:37:17,100 INFO L225 Difference]: With dead ends: 4381 [2018-12-03 01:37:17,101 INFO L226 Difference]: Without dead ends: 1799 [2018-12-03 01:37:17,101 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2018-12-03 01:37:17,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1799 states. [2018-12-03 01:37:17,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1799 to 1799. [2018-12-03 01:37:17,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1799 states. [2018-12-03 01:37:17,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1799 states to 1799 states and 4734 transitions. [2018-12-03 01:37:17,112 INFO L78 Accepts]: Start accepts. Automaton has 1799 states and 4734 transitions. Word has length 96 [2018-12-03 01:37:17,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:37:17,113 INFO L480 AbstractCegarLoop]: Abstraction has 1799 states and 4734 transitions. [2018-12-03 01:37:17,113 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 01:37:17,113 INFO L276 IsEmpty]: Start isEmpty. Operand 1799 states and 4734 transitions. [2018-12-03 01:37:17,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-03 01:37:17,114 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:37:17,114 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:37:17,114 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:37:17,114 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:37:17,114 INFO L82 PathProgramCache]: Analyzing trace with hash -1343180800, now seen corresponding path program 2 times [2018-12-03 01:37:17,114 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:37:17,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:37:17,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:37:17,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:37:17,115 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:37:17,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:37:17,164 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-03 01:37:17,164 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:37:17,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 01:37:17,164 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:37:17,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 01:37:17,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 01:37:17,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-03 01:37:17,165 INFO L87 Difference]: Start difference. First operand 1799 states and 4734 transitions. Second operand 5 states. [2018-12-03 01:37:17,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:37:17,180 INFO L93 Difference]: Finished difference Result 1799 states and 4708 transitions. [2018-12-03 01:37:17,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 01:37:17,181 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2018-12-03 01:37:17,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:37:17,182 INFO L225 Difference]: With dead ends: 1799 [2018-12-03 01:37:17,182 INFO L226 Difference]: Without dead ends: 1799 [2018-12-03 01:37:17,182 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-03 01:37:17,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1799 states. [2018-12-03 01:37:17,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1799 to 1799. [2018-12-03 01:37:17,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1799 states. [2018-12-03 01:37:17,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1799 states to 1799 states and 4708 transitions. [2018-12-03 01:37:17,195 INFO L78 Accepts]: Start accepts. Automaton has 1799 states and 4708 transitions. Word has length 96 [2018-12-03 01:37:17,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:37:17,195 INFO L480 AbstractCegarLoop]: Abstraction has 1799 states and 4708 transitions. [2018-12-03 01:37:17,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 01:37:17,195 INFO L276 IsEmpty]: Start isEmpty. Operand 1799 states and 4708 transitions. [2018-12-03 01:37:17,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-03 01:37:17,196 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:37:17,196 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:37:17,197 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:37:17,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:37:17,197 INFO L82 PathProgramCache]: Analyzing trace with hash -1013415039, now seen corresponding path program 2 times [2018-12-03 01:37:17,197 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:37:17,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:37:17,197 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 01:37:17,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:37:17,198 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:37:17,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:37:17,289 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-03 01:37:17,289 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:37:17,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-03 01:37:17,289 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:37:17,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 01:37:17,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 01:37:17,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-03 01:37:17,290 INFO L87 Difference]: Start difference. First operand 1799 states and 4708 transitions. Second operand 12 states. [2018-12-03 01:37:17,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:37:17,646 INFO L93 Difference]: Finished difference Result 3406 states and 9006 transitions. [2018-12-03 01:37:17,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-03 01:37:17,647 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 96 [2018-12-03 01:37:17,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:37:17,649 INFO L225 Difference]: With dead ends: 3406 [2018-12-03 01:37:17,649 INFO L226 Difference]: Without dead ends: 2430 [2018-12-03 01:37:17,649 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2018-12-03 01:37:17,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2430 states. [2018-12-03 01:37:17,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2430 to 2278. [2018-12-03 01:37:17,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2278 states. [2018-12-03 01:37:17,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2278 states to 2278 states and 5830 transitions. [2018-12-03 01:37:17,666 INFO L78 Accepts]: Start accepts. Automaton has 2278 states and 5830 transitions. Word has length 96 [2018-12-03 01:37:17,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:37:17,666 INFO L480 AbstractCegarLoop]: Abstraction has 2278 states and 5830 transitions. [2018-12-03 01:37:17,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 01:37:17,666 INFO L276 IsEmpty]: Start isEmpty. Operand 2278 states and 5830 transitions. [2018-12-03 01:37:17,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-03 01:37:17,667 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:37:17,667 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:37:17,667 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:37:17,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:37:17,668 INFO L82 PathProgramCache]: Analyzing trace with hash -2137183355, now seen corresponding path program 3 times [2018-12-03 01:37:17,668 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:37:17,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:37:17,668 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 01:37:17,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:37:17,669 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:37:17,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 01:37:17,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 01:37:17,704 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-03 01:37:17,769 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-03 01:37:17,770 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 01:37:17 BasicIcfg [2018-12-03 01:37:17,770 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 01:37:17,770 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-03 01:37:17,770 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-03 01:37:17,770 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-03 01:37:17,771 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 01:37:04" (3/4) ... [2018-12-03 01:37:17,772 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-03 01:37:17,838 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_23c5e75f-74b3-4fdd-ba3a-a14deb4a6377/bin-2019/utaipan/witness.graphml [2018-12-03 01:37:17,838 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-03 01:37:17,839 INFO L168 Benchmark]: Toolchain (without parser) took 13998.77 ms. Allocated memory was 1.0 GB in the beginning and 2.9 GB in the end (delta: 1.9 GB). Free memory was 947.0 MB in the beginning and 1.4 GB in the end (delta: -439.2 MB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. [2018-12-03 01:37:17,840 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 01:37:17,840 INFO L168 Benchmark]: CACSL2BoogieTranslator took 356.12 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 71.3 MB). Free memory was 947.0 MB in the beginning and 1.0 GB in the end (delta: -96.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. [2018-12-03 01:37:17,840 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.31 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: 7.2 MB). Peak memory consumption was 7.2 MB. Max. memory is 11.5 GB. [2018-12-03 01:37:17,840 INFO L168 Benchmark]: Boogie Preprocessor took 19.95 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 01:37:17,840 INFO L168 Benchmark]: RCFGBuilder took 316.84 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 984.3 MB in the end (delta: 51.5 MB). Peak memory consumption was 51.5 MB. Max. memory is 11.5 GB. [2018-12-03 01:37:17,840 INFO L168 Benchmark]: TraceAbstraction took 13200.24 ms. Allocated memory was 1.1 GB in the beginning and 2.9 GB in the end (delta: 1.8 GB). Free memory was 984.3 MB in the beginning and 1.4 GB in the end (delta: -401.9 MB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. [2018-12-03 01:37:17,841 INFO L168 Benchmark]: Witness Printer took 68.38 ms. Allocated memory is still 2.9 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 01:37:17,842 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 356.12 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 71.3 MB). Free memory was 947.0 MB in the beginning and 1.0 GB in the end (delta: -96.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 34.31 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: 7.2 MB). Peak memory consumption was 7.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.95 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 316.84 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 984.3 MB in the end (delta: 51.5 MB). Peak memory consumption was 51.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 13200.24 ms. Allocated memory was 1.1 GB in the beginning and 2.9 GB in the end (delta: 1.8 GB). Free memory was 984.3 MB in the beginning and 1.4 GB in the end (delta: -401.9 MB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. * Witness Printer took 68.38 ms. Allocated memory is still 2.9 GB. Free memory is still 1.4 GB. There was no memory consumed. 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: [L671] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L673] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L675] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L676] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L677] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L679] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L680] -1 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L681] -1 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L682] -1 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L683] -1 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L684] -1 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L685] -1 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L686] -1 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L687] -1 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L688] -1 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L689] -1 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L690] -1 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L691] -1 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L692] -1 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L693] -1 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L695] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L697] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L698] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L699] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L765] -1 pthread_t t1097; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L766] FCALL, FORK -1 pthread_create(&t1097, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L767] -1 pthread_t t1098; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L768] FCALL, FORK -1 pthread_create(&t1098, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L723] 0 x$w_buff1 = x$w_buff0 [L724] 0 x$w_buff0 = 2 [L725] 0 x$w_buff1_used = x$w_buff0_used [L726] 0 x$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L728] 0 x$r_buff1_thd0 = x$r_buff0_thd0 [L729] 0 x$r_buff1_thd1 = x$r_buff0_thd1 [L730] 0 x$r_buff1_thd2 = x$r_buff0_thd2 [L731] 0 x$r_buff0_thd2 = (_Bool)1 [L734] 0 y = 1 [L737] 0 __unbuffered_p1_EAX = y [L740] 0 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L743] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L703] 1 z = 1 [L706] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L743] 0 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L744] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L709] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L744] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L709] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x=2, y=1, z=1] [L745] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x=2, y=1, z=1] [L745] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L709] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x)=2, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x=2, y=1, z=1] [L709] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L710] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L746] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L710] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L746] 0 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L747] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L747] 0 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L750] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L711] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L711] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L712] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L712] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L713] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L713] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L716] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L770] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L774] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L774] EXPR -1 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L774] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L774] -1 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L775] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L775] -1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L776] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L776] -1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L777] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L777] -1 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L778] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L778] -1 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L781] -1 weak$$choice0 = __VERIFIER_nondet_pointer() [L782] -1 weak$$choice2 = __VERIFIER_nondet_pointer() [L783] -1 x$flush_delayed = weak$$choice2 [L784] -1 x$mem_tmp = x VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L785] EXPR -1 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L785] -1 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L786] EXPR -1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L786] -1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L787] EXPR -1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L787] -1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L788] EXPR -1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L788] -1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L789] EXPR -1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L789] -1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L790] EXPR -1 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L790] -1 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L791] EXPR -1 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L791] -1 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L792] -1 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L793] EXPR -1 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L793] -1 x = x$flush_delayed ? x$mem_tmp : x [L794] -1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 181 locations, 3 error locations. UNSAFE Result, 13.1s OverallTime, 27 OverallIterations, 1 TraceHistogramMax, 5.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5870 SDtfs, 5500 SDslu, 12275 SDs, 0 SdLazy, 4796 SolverSat, 273 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 244 GetRequests, 72 SyntacticMatches, 22 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=38835occurred in iteration=5, 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: 4.4s AutomataMinimizationTime, 26 MinimizatonAttempts, 93540 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 2094 NumberOfCodeBlocks, 2094 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 1972 ConstructedInterpolants, 0 QuantifiedInterpolants, 404822 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 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...