./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi003_power.oepc_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_5940e5c3-0b9c-400a-86d4-3bda992fda9c/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_5940e5c3-0b9c-400a-86d4-3bda992fda9c/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_5940e5c3-0b9c-400a-86d4-3bda992fda9c/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_5940e5c3-0b9c-400a-86d4-3bda992fda9c/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi003_power.oepc_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_5940e5c3-0b9c-400a-86d4-3bda992fda9c/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_5940e5c3-0b9c-400a-86d4-3bda992fda9c/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 0f20ad64a36f65b3ea5567e30447f3d321dd784a .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 03:45:12,161 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 03:45:12,162 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 03:45:12,168 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 03:45:12,168 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 03:45:12,169 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 03:45:12,169 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 03:45:12,170 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 03:45:12,171 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 03:45:12,171 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 03:45:12,171 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 03:45:12,172 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 03:45:12,172 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 03:45:12,172 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 03:45:12,173 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 03:45:12,173 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 03:45:12,174 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 03:45:12,174 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 03:45:12,175 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 03:45:12,176 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 03:45:12,176 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 03:45:12,177 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 03:45:12,178 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 03:45:12,178 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 03:45:12,178 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 03:45:12,179 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 03:45:12,179 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 03:45:12,179 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 03:45:12,180 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 03:45:12,180 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 03:45:12,180 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 03:45:12,181 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 03:45:12,181 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 03:45:12,181 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 03:45:12,181 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 03:45:12,182 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 03:45:12,182 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_5940e5c3-0b9c-400a-86d4-3bda992fda9c/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-02 03:45:12,189 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 03:45:12,189 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 03:45:12,189 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 03:45:12,189 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 03:45:12,189 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 03:45:12,189 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 03:45:12,190 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 03:45:12,190 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 03:45:12,190 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 03:45:12,190 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 03:45:12,190 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 03:45:12,190 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 03:45:12,190 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 03:45:12,190 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 03:45:12,191 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 03:45:12,191 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 03:45:12,191 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 03:45:12,191 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 03:45:12,191 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 03:45:12,191 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 03:45:12,191 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 03:45:12,191 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 03:45:12,191 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 03:45:12,191 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 03:45:12,191 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 03:45:12,192 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 03:45:12,192 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 03:45:12,192 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 03:45:12,192 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 03:45:12,192 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 03:45:12,192 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 03:45:12,192 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 03:45:12,192 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 03:45:12,192 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 03:45:12,192 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 03:45:12,192 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-02 03:45:12,193 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_5940e5c3-0b9c-400a-86d4-3bda992fda9c/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 -> 0f20ad64a36f65b3ea5567e30447f3d321dd784a [2018-12-02 03:45:12,210 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 03:45:12,219 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 03:45:12,222 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 03:45:12,223 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 03:45:12,223 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 03:45:12,224 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_5940e5c3-0b9c-400a-86d4-3bda992fda9c/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/rfi003_power.oepc_false-unreach-call.i [2018-12-02 03:45:12,263 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5940e5c3-0b9c-400a-86d4-3bda992fda9c/bin-2019/utaipan/data/3e8c5efcc/97157a8c58d046ce820cfacd04559530/FLAG8963158cb [2018-12-02 03:45:12,680 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 03:45:12,680 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_5940e5c3-0b9c-400a-86d4-3bda992fda9c/sv-benchmarks/c/pthread-wmm/rfi003_power.oepc_false-unreach-call.i [2018-12-02 03:45:12,687 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5940e5c3-0b9c-400a-86d4-3bda992fda9c/bin-2019/utaipan/data/3e8c5efcc/97157a8c58d046ce820cfacd04559530/FLAG8963158cb [2018-12-02 03:45:12,695 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_5940e5c3-0b9c-400a-86d4-3bda992fda9c/bin-2019/utaipan/data/3e8c5efcc/97157a8c58d046ce820cfacd04559530 [2018-12-02 03:45:12,697 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 03:45:12,698 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 03:45:12,698 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 03:45:12,698 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 03:45:12,700 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 03:45:12,701 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:45:12" (1/1) ... [2018-12-02 03:45:12,702 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@159e01e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:45:12, skipping insertion in model container [2018-12-02 03:45:12,703 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:45:12" (1/1) ... [2018-12-02 03:45:12,707 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 03:45:12,727 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 03:45:12,900 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 03:45:12,908 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 03:45:13,003 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 03:45:13,050 INFO L195 MainTranslator]: Completed translation [2018-12-02 03:45:13,050 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:45:13 WrapperNode [2018-12-02 03:45:13,050 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 03:45:13,051 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 03:45:13,051 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 03:45:13,051 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 03:45:13,057 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:45:13" (1/1) ... [2018-12-02 03:45:13,071 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:45:13" (1/1) ... [2018-12-02 03:45:13,091 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 03:45:13,092 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 03:45:13,092 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 03:45:13,092 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 03:45:13,099 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:45:13" (1/1) ... [2018-12-02 03:45:13,100 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:45:13" (1/1) ... [2018-12-02 03:45:13,103 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:45:13" (1/1) ... [2018-12-02 03:45:13,104 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:45:13" (1/1) ... [2018-12-02 03:45:13,111 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:45:13" (1/1) ... [2018-12-02 03:45:13,114 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:45:13" (1/1) ... [2018-12-02 03:45:13,117 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:45:13" (1/1) ... [2018-12-02 03:45:13,120 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 03:45:13,120 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 03:45:13,120 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 03:45:13,120 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 03:45:13,121 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:45:13" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5940e5c3-0b9c-400a-86d4-3bda992fda9c/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 03:45:13,158 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 03:45:13,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 03:45:13,158 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-02 03:45:13,158 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 03:45:13,158 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-02 03:45:13,158 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-02 03:45:13,158 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-02 03:45:13,158 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-02 03:45:13,158 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-02 03:45:13,158 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 03:45:13,158 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 03:45:13,159 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-02 03:45:13,423 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 03:45:13,423 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-02 03:45:13,424 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:45:13 BoogieIcfgContainer [2018-12-02 03:45:13,424 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 03:45:13,424 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 03:45:13,424 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 03:45:13,426 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 03:45:13,426 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 03:45:12" (1/3) ... [2018-12-02 03:45:13,427 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c6b47e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 03:45:13, skipping insertion in model container [2018-12-02 03:45:13,427 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:45:13" (2/3) ... [2018-12-02 03:45:13,427 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c6b47e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 03:45:13, skipping insertion in model container [2018-12-02 03:45:13,427 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:45:13" (3/3) ... [2018-12-02 03:45:13,428 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi003_power.oepc_false-unreach-call.i [2018-12-02 03:45:13,451 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:45:13,451 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:45:13,452 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:45:13,452 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:45:13,452 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:45:13,452 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:45:13,452 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:45:13,452 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:45:13,452 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:45:13,452 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:45:13,453 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:45:13,453 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:45:13,453 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:45:13,453 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:45:13,453 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:45:13,453 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:45:13,453 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:45:13,453 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:45:13,453 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:45:13,453 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:45:13,453 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:45:13,454 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:45:13,454 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:45:13,454 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:45:13,454 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:45:13,454 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:45:13,454 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:45:13,454 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:45:13,455 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:45:13,455 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:45:13,455 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:45:13,455 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:45:13,455 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:45:13,455 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:45:13,455 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:45:13,455 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:45:13,455 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:45:13,456 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:45:13,456 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:45:13,456 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:45:13,456 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:45:13,456 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:45:13,456 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:45:13,456 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:45:13,457 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:45:13,457 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:45:13,457 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:45:13,457 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:45:13,457 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:45:13,457 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:45:13,457 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:45:13,457 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:45:13,458 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:45:13,458 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:45:13,458 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:45:13,458 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:45:13,458 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:45:13,458 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:45:13,458 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:45:13,458 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:45:13,458 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:45:13,458 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:45:13,458 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:45:13,459 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:45:13,459 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:45:13,459 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:45:13,459 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:45:13,459 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:45:13,459 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:45:13,459 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:45:13,459 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:45:13,459 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:45:13,460 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:45:13,460 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:45:13,460 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:45:13,460 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:45:13,460 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:45:13,460 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:45:13,460 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:45:13,460 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:45:13,461 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:45:13,461 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:45:13,461 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:45:13,461 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:45:13,461 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:45:13,461 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:45:13,461 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:45:13,461 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:45:13,462 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:45:13,462 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:45:13,462 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:45:13,462 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:45:13,462 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:45:13,462 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:45:13,462 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:45:13,462 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:45:13,463 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:45:13,463 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:45:13,463 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:45:13,463 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:45:13,463 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:45:13,463 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:45:13,464 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:45:13,464 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:45:13,464 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:45:13,464 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:45:13,464 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:45:13,465 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:45:13,465 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:45:13,465 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:45:13,465 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:45:13,465 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:45:13,465 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:45:13,465 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:45:13,466 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:45:13,466 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:45:13,466 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:45:13,466 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:45:13,466 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:45:13,466 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:45:13,466 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:45:13,467 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:45:13,467 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:45:13,467 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:45:13,467 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:45:13,467 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:45:13,467 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:45:13,467 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:45:13,467 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:45:13,467 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:45:13,468 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:45:13,468 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:45:13,468 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:45:13,468 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:45:13,468 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:45:13,468 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:45:13,471 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-02 03:45:13,472 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 03:45:13,477 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-02 03:45:13,487 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-02 03:45:13,503 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 03:45:13,503 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 03:45:13,503 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 03:45:13,503 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 03:45:13,503 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 03:45:13,503 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 03:45:13,503 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 03:45:13,503 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 03:45:13,511 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 131places, 163 transitions [2018-12-02 03:45:14,570 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 27855 states. [2018-12-02 03:45:14,571 INFO L276 IsEmpty]: Start isEmpty. Operand 27855 states. [2018-12-02 03:45:14,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-02 03:45:14,577 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:45:14,577 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-02 03:45:14,579 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:45:14,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:45:14,582 INFO L82 PathProgramCache]: Analyzing trace with hash 71244223, now seen corresponding path program 1 times [2018-12-02 03:45:14,584 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:45:14,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:45:14,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:45:14,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:45:14,618 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:45:14,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:45:14,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:45:14,754 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:45:14,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 03:45:14,755 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:45:14,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 03:45:14,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 03:45:14,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 03:45:14,767 INFO L87 Difference]: Start difference. First operand 27855 states. Second operand 4 states. [2018-12-02 03:45:15,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:45:15,116 INFO L93 Difference]: Finished difference Result 47767 states and 183118 transitions. [2018-12-02 03:45:15,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 03:45:15,117 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2018-12-02 03:45:15,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:45:15,239 INFO L225 Difference]: With dead ends: 47767 [2018-12-02 03:45:15,239 INFO L226 Difference]: Without dead ends: 34607 [2018-12-02 03:45:15,241 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 03:45:15,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34607 states. [2018-12-02 03:45:15,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34607 to 21755. [2018-12-02 03:45:15,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21755 states. [2018-12-02 03:45:15,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21755 states to 21755 states and 83440 transitions. [2018-12-02 03:45:15,895 INFO L78 Accepts]: Start accepts. Automaton has 21755 states and 83440 transitions. Word has length 38 [2018-12-02 03:45:15,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:45:15,896 INFO L480 AbstractCegarLoop]: Abstraction has 21755 states and 83440 transitions. [2018-12-02 03:45:15,896 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 03:45:15,896 INFO L276 IsEmpty]: Start isEmpty. Operand 21755 states and 83440 transitions. [2018-12-02 03:45:15,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-02 03:45:15,901 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:45:15,901 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-02 03:45:15,901 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:45:15,902 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:45:15,902 INFO L82 PathProgramCache]: Analyzing trace with hash -1724990409, now seen corresponding path program 1 times [2018-12-02 03:45:15,902 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:45:15,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:45:15,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:45:15,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:45:15,905 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:45:15,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:45:15,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:45:15,954 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:45:15,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 03:45:15,955 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:45:15,955 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 03:45:15,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 03:45:15,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 03:45:15,956 INFO L87 Difference]: Start difference. First operand 21755 states and 83440 transitions. Second operand 5 states. [2018-12-02 03:45:16,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:45:16,440 INFO L93 Difference]: Finished difference Result 47633 states and 173801 transitions. [2018-12-02 03:45:16,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 03:45:16,441 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2018-12-02 03:45:16,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:45:16,561 INFO L225 Difference]: With dead ends: 47633 [2018-12-02 03:45:16,562 INFO L226 Difference]: Without dead ends: 47065 [2018-12-02 03:45:16,562 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-02 03:45:16,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47065 states. [2018-12-02 03:45:17,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47065 to 31795. [2018-12-02 03:45:17,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31795 states. [2018-12-02 03:45:17,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31795 states to 31795 states and 116818 transitions. [2018-12-02 03:45:17,264 INFO L78 Accepts]: Start accepts. Automaton has 31795 states and 116818 transitions. Word has length 46 [2018-12-02 03:45:17,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:45:17,265 INFO L480 AbstractCegarLoop]: Abstraction has 31795 states and 116818 transitions. [2018-12-02 03:45:17,266 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 03:45:17,266 INFO L276 IsEmpty]: Start isEmpty. Operand 31795 states and 116818 transitions. [2018-12-02 03:45:17,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-02 03:45:17,268 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:45:17,269 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:45:17,269 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:45:17,269 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:45:17,269 INFO L82 PathProgramCache]: Analyzing trace with hash -2058408648, now seen corresponding path program 1 times [2018-12-02 03:45:17,269 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:45:17,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:45:17,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:45:17,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:45:17,272 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:45:17,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:45:17,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:45:17,320 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:45:17,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 03:45:17,320 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:45:17,320 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 03:45:17,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 03:45:17,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 03:45:17,321 INFO L87 Difference]: Start difference. First operand 31795 states and 116818 transitions. Second operand 5 states. [2018-12-02 03:45:17,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:45:17,719 INFO L93 Difference]: Finished difference Result 63027 states and 229113 transitions. [2018-12-02 03:45:17,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 03:45:17,720 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2018-12-02 03:45:17,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:45:17,832 INFO L225 Difference]: With dead ends: 63027 [2018-12-02 03:45:17,833 INFO L226 Difference]: Without dead ends: 62563 [2018-12-02 03:45:17,833 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-02 03:45:18,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62563 states. [2018-12-02 03:45:18,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62563 to 35363. [2018-12-02 03:45:18,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35363 states. [2018-12-02 03:45:18,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35363 states to 35363 states and 128876 transitions. [2018-12-02 03:45:18,608 INFO L78 Accepts]: Start accepts. Automaton has 35363 states and 128876 transitions. Word has length 47 [2018-12-02 03:45:18,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:45:18,609 INFO L480 AbstractCegarLoop]: Abstraction has 35363 states and 128876 transitions. [2018-12-02 03:45:18,609 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 03:45:18,609 INFO L276 IsEmpty]: Start isEmpty. Operand 35363 states and 128876 transitions. [2018-12-02 03:45:18,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-02 03:45:18,613 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:45:18,613 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:45:18,613 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:45:18,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:45:18,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1703022802, now seen corresponding path program 1 times [2018-12-02 03:45:18,614 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:45:18,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:45:18,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:45:18,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:45:18,615 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:45:18,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:45:18,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:45:18,643 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:45:18,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 03:45:18,643 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:45:18,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 03:45:18,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 03:45:18,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 03:45:18,643 INFO L87 Difference]: Start difference. First operand 35363 states and 128876 transitions. Second operand 3 states. [2018-12-02 03:45:18,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:45:18,798 INFO L93 Difference]: Finished difference Result 45909 states and 163944 transitions. [2018-12-02 03:45:18,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 03:45:18,799 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2018-12-02 03:45:18,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:45:18,871 INFO L225 Difference]: With dead ends: 45909 [2018-12-02 03:45:18,871 INFO L226 Difference]: Without dead ends: 45909 [2018-12-02 03:45:18,871 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 03:45:19,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45909 states. [2018-12-02 03:45:19,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45909 to 40246. [2018-12-02 03:45:19,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40246 states. [2018-12-02 03:45:19,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40246 states to 40246 states and 145214 transitions. [2018-12-02 03:45:19,565 INFO L78 Accepts]: Start accepts. Automaton has 40246 states and 145214 transitions. Word has length 49 [2018-12-02 03:45:19,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:45:19,565 INFO L480 AbstractCegarLoop]: Abstraction has 40246 states and 145214 transitions. [2018-12-02 03:45:19,565 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 03:45:19,565 INFO L276 IsEmpty]: Start isEmpty. Operand 40246 states and 145214 transitions. [2018-12-02 03:45:19,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-02 03:45:19,572 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:45:19,573 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-02 03:45:19,573 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:45:19,573 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:45:19,573 INFO L82 PathProgramCache]: Analyzing trace with hash 1764675695, now seen corresponding path program 1 times [2018-12-02 03:45:19,573 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:45:19,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:45:19,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:45:19,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:45:19,575 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:45:19,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:45:19,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:45:19,626 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:45:19,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 03:45:19,626 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:45:19,626 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 03:45:19,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 03:45:19,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 03:45:19,627 INFO L87 Difference]: Start difference. First operand 40246 states and 145214 transitions. Second operand 6 states. [2018-12-02 03:45:20,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:45:20,074 INFO L93 Difference]: Finished difference Result 70849 states and 252354 transitions. [2018-12-02 03:45:20,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 03:45:20,075 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2018-12-02 03:45:20,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:45:20,195 INFO L225 Difference]: With dead ends: 70849 [2018-12-02 03:45:20,195 INFO L226 Difference]: Without dead ends: 70313 [2018-12-02 03:45:20,195 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-12-02 03:45:20,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70313 states. [2018-12-02 03:45:20,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70313 to 40897. [2018-12-02 03:45:20,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40897 states. [2018-12-02 03:45:21,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40897 states to 40897 states and 147667 transitions. [2018-12-02 03:45:21,057 INFO L78 Accepts]: Start accepts. Automaton has 40897 states and 147667 transitions. Word has length 53 [2018-12-02 03:45:21,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:45:21,058 INFO L480 AbstractCegarLoop]: Abstraction has 40897 states and 147667 transitions. [2018-12-02 03:45:21,058 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 03:45:21,058 INFO L276 IsEmpty]: Start isEmpty. Operand 40897 states and 147667 transitions. [2018-12-02 03:45:21,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-02 03:45:21,065 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:45:21,065 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-02 03:45:21,065 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:45:21,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:45:21,066 INFO L82 PathProgramCache]: Analyzing trace with hash -2096426106, now seen corresponding path program 1 times [2018-12-02 03:45:21,066 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:45:21,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:45:21,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:45:21,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:45:21,067 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:45:21,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:45:21,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:45:21,145 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:45:21,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 03:45:21,145 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:45:21,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 03:45:21,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 03:45:21,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-02 03:45:21,146 INFO L87 Difference]: Start difference. First operand 40897 states and 147667 transitions. Second operand 6 states. [2018-12-02 03:45:21,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:45:21,607 INFO L93 Difference]: Finished difference Result 56598 states and 201647 transitions. [2018-12-02 03:45:21,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 03:45:21,608 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2018-12-02 03:45:21,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:45:21,703 INFO L225 Difference]: With dead ends: 56598 [2018-12-02 03:45:21,703 INFO L226 Difference]: Without dead ends: 55459 [2018-12-02 03:45:21,704 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-02 03:45:21,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55459 states. [2018-12-02 03:45:22,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55459 to 51954. [2018-12-02 03:45:22,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51954 states. [2018-12-02 03:45:22,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51954 states to 51954 states and 186006 transitions. [2018-12-02 03:45:22,593 INFO L78 Accepts]: Start accepts. Automaton has 51954 states and 186006 transitions. Word has length 53 [2018-12-02 03:45:22,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:45:22,593 INFO L480 AbstractCegarLoop]: Abstraction has 51954 states and 186006 transitions. [2018-12-02 03:45:22,593 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 03:45:22,593 INFO L276 IsEmpty]: Start isEmpty. Operand 51954 states and 186006 transitions. [2018-12-02 03:45:22,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-02 03:45:22,603 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:45:22,603 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-02 03:45:22,603 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:45:22,603 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:45:22,603 INFO L82 PathProgramCache]: Analyzing trace with hash 401589831, now seen corresponding path program 1 times [2018-12-02 03:45:22,603 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:45:22,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:45:22,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:45:22,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:45:22,605 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:45:22,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:45:22,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:45:22,680 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:45:22,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 03:45:22,680 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:45:22,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 03:45:22,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 03:45:22,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 03:45:22,681 INFO L87 Difference]: Start difference. First operand 51954 states and 186006 transitions. Second operand 7 states. [2018-12-02 03:45:23,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:45:23,508 INFO L93 Difference]: Finished difference Result 75637 states and 260103 transitions. [2018-12-02 03:45:23,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 03:45:23,508 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2018-12-02 03:45:23,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:45:23,631 INFO L225 Difference]: With dead ends: 75637 [2018-12-02 03:45:23,631 INFO L226 Difference]: Without dead ends: 75637 [2018-12-02 03:45:23,631 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-12-02 03:45:23,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75637 states. [2018-12-02 03:45:24,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75637 to 61472. [2018-12-02 03:45:24,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61472 states. [2018-12-02 03:45:24,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61472 states to 61472 states and 215183 transitions. [2018-12-02 03:45:24,689 INFO L78 Accepts]: Start accepts. Automaton has 61472 states and 215183 transitions. Word has length 53 [2018-12-02 03:45:24,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:45:24,689 INFO L480 AbstractCegarLoop]: Abstraction has 61472 states and 215183 transitions. [2018-12-02 03:45:24,689 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 03:45:24,689 INFO L276 IsEmpty]: Start isEmpty. Operand 61472 states and 215183 transitions. [2018-12-02 03:45:24,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-02 03:45:24,698 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:45:24,699 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-02 03:45:24,699 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:45:24,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:45:24,699 INFO L82 PathProgramCache]: Analyzing trace with hash 1289093512, now seen corresponding path program 1 times [2018-12-02 03:45:24,699 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:45:24,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:45:24,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:45:24,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:45:24,701 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:45:24,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:45:24,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:45:24,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:45:24,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 03:45:24,746 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:45:24,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 03:45:24,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 03:45:24,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 03:45:24,746 INFO L87 Difference]: Start difference. First operand 61472 states and 215183 transitions. Second operand 4 states. [2018-12-02 03:45:24,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:45:24,794 INFO L93 Difference]: Finished difference Result 13777 states and 43273 transitions. [2018-12-02 03:45:24,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 03:45:24,794 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2018-12-02 03:45:24,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:45:24,809 INFO L225 Difference]: With dead ends: 13777 [2018-12-02 03:45:24,809 INFO L226 Difference]: Without dead ends: 12160 [2018-12-02 03:45:24,810 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 03:45:24,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12160 states. [2018-12-02 03:45:24,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12160 to 12112. [2018-12-02 03:45:24,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12112 states. [2018-12-02 03:45:24,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12112 states to 12112 states and 37957 transitions. [2018-12-02 03:45:24,939 INFO L78 Accepts]: Start accepts. Automaton has 12112 states and 37957 transitions. Word has length 53 [2018-12-02 03:45:24,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:45:24,939 INFO L480 AbstractCegarLoop]: Abstraction has 12112 states and 37957 transitions. [2018-12-02 03:45:24,939 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 03:45:24,940 INFO L276 IsEmpty]: Start isEmpty. Operand 12112 states and 37957 transitions. [2018-12-02 03:45:24,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-02 03:45:24,944 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:45:24,944 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:45:24,944 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:45:24,944 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:45:24,944 INFO L82 PathProgramCache]: Analyzing trace with hash 942323206, now seen corresponding path program 1 times [2018-12-02 03:45:24,944 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:45:24,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:45:24,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:45:24,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:45:24,946 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:45:24,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:45:24,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:45:24,992 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:45:24,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 03:45:24,992 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:45:24,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 03:45:24,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 03:45:24,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 03:45:24,993 INFO L87 Difference]: Start difference. First operand 12112 states and 37957 transitions. Second operand 4 states. [2018-12-02 03:45:25,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:45:25,113 INFO L93 Difference]: Finished difference Result 14275 states and 44580 transitions. [2018-12-02 03:45:25,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 03:45:25,113 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2018-12-02 03:45:25,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:45:25,131 INFO L225 Difference]: With dead ends: 14275 [2018-12-02 03:45:25,131 INFO L226 Difference]: Without dead ends: 14275 [2018-12-02 03:45:25,131 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 03:45:25,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14275 states. [2018-12-02 03:45:25,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14275 to 12843. [2018-12-02 03:45:25,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12843 states. [2018-12-02 03:45:25,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12843 states to 12843 states and 40182 transitions. [2018-12-02 03:45:25,277 INFO L78 Accepts]: Start accepts. Automaton has 12843 states and 40182 transitions. Word has length 63 [2018-12-02 03:45:25,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:45:25,277 INFO L480 AbstractCegarLoop]: Abstraction has 12843 states and 40182 transitions. [2018-12-02 03:45:25,278 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 03:45:25,278 INFO L276 IsEmpty]: Start isEmpty. Operand 12843 states and 40182 transitions. [2018-12-02 03:45:25,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-02 03:45:25,282 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:45:25,282 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:45:25,282 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:45:25,282 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:45:25,282 INFO L82 PathProgramCache]: Analyzing trace with hash -1609833755, now seen corresponding path program 1 times [2018-12-02 03:45:25,283 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:45:25,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:45:25,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:45:25,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:45:25,285 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:45:25,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:45:25,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:45:25,330 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:45:25,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 03:45:25,330 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:45:25,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 03:45:25,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 03:45:25,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 03:45:25,331 INFO L87 Difference]: Start difference. First operand 12843 states and 40182 transitions. Second operand 6 states. [2018-12-02 03:45:25,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:45:25,623 INFO L93 Difference]: Finished difference Result 23410 states and 72791 transitions. [2018-12-02 03:45:25,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-02 03:45:25,624 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 63 [2018-12-02 03:45:25,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:45:25,651 INFO L225 Difference]: With dead ends: 23410 [2018-12-02 03:45:25,651 INFO L226 Difference]: Without dead ends: 23346 [2018-12-02 03:45:25,651 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-12-02 03:45:25,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23346 states. [2018-12-02 03:45:25,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23346 to 13812. [2018-12-02 03:45:25,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13812 states. [2018-12-02 03:45:25,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13812 states to 13812 states and 42966 transitions. [2018-12-02 03:45:25,852 INFO L78 Accepts]: Start accepts. Automaton has 13812 states and 42966 transitions. Word has length 63 [2018-12-02 03:45:25,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:45:25,852 INFO L480 AbstractCegarLoop]: Abstraction has 13812 states and 42966 transitions. [2018-12-02 03:45:25,853 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 03:45:25,853 INFO L276 IsEmpty]: Start isEmpty. Operand 13812 states and 42966 transitions. [2018-12-02 03:45:25,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-02 03:45:25,858 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:45:25,858 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] [2018-12-02 03:45:25,859 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:45:25,859 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:45:25,859 INFO L82 PathProgramCache]: Analyzing trace with hash -1160555304, now seen corresponding path program 1 times [2018-12-02 03:45:25,859 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:45:25,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:45:25,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:45:25,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:45:25,860 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:45:25,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:45:25,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:45:25,895 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:45:25,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 03:45:25,895 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:45:25,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 03:45:25,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 03:45:25,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 03:45:25,895 INFO L87 Difference]: Start difference. First operand 13812 states and 42966 transitions. Second operand 4 states. [2018-12-02 03:45:26,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:45:26,046 INFO L93 Difference]: Finished difference Result 17359 states and 53255 transitions. [2018-12-02 03:45:26,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 03:45:26,046 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2018-12-02 03:45:26,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:45:26,066 INFO L225 Difference]: With dead ends: 17359 [2018-12-02 03:45:26,066 INFO L226 Difference]: Without dead ends: 17359 [2018-12-02 03:45:26,066 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 03:45:26,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17359 states. [2018-12-02 03:45:26,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17359 to 15783. [2018-12-02 03:45:26,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15783 states. [2018-12-02 03:45:26,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15783 states to 15783 states and 48578 transitions. [2018-12-02 03:45:26,242 INFO L78 Accepts]: Start accepts. Automaton has 15783 states and 48578 transitions. Word has length 65 [2018-12-02 03:45:26,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:45:26,242 INFO L480 AbstractCegarLoop]: Abstraction has 15783 states and 48578 transitions. [2018-12-02 03:45:26,242 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 03:45:26,243 INFO L276 IsEmpty]: Start isEmpty. Operand 15783 states and 48578 transitions. [2018-12-02 03:45:26,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-02 03:45:26,250 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:45:26,250 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] [2018-12-02 03:45:26,251 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:45:26,251 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:45:26,251 INFO L82 PathProgramCache]: Analyzing trace with hash 1057202649, now seen corresponding path program 1 times [2018-12-02 03:45:26,251 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:45:26,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:45:26,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:45:26,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:45:26,252 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:45:26,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:45:26,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:45:26,283 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:45:26,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 03:45:26,284 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:45:26,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 03:45:26,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 03:45:26,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 03:45:26,284 INFO L87 Difference]: Start difference. First operand 15783 states and 48578 transitions. Second operand 3 states. [2018-12-02 03:45:26,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:45:26,398 INFO L93 Difference]: Finished difference Result 16413 states and 50318 transitions. [2018-12-02 03:45:26,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 03:45:26,398 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2018-12-02 03:45:26,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:45:26,415 INFO L225 Difference]: With dead ends: 16413 [2018-12-02 03:45:26,415 INFO L226 Difference]: Without dead ends: 16413 [2018-12-02 03:45:26,416 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 03:45:26,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16413 states. [2018-12-02 03:45:26,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16413 to 16125. [2018-12-02 03:45:26,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16125 states. [2018-12-02 03:45:26,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16125 states to 16125 states and 49516 transitions. [2018-12-02 03:45:26,605 INFO L78 Accepts]: Start accepts. Automaton has 16125 states and 49516 transitions. Word has length 65 [2018-12-02 03:45:26,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:45:26,605 INFO L480 AbstractCegarLoop]: Abstraction has 16125 states and 49516 transitions. [2018-12-02 03:45:26,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 03:45:26,605 INFO L276 IsEmpty]: Start isEmpty. Operand 16125 states and 49516 transitions. [2018-12-02 03:45:26,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-02 03:45:26,613 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:45:26,614 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] [2018-12-02 03:45:26,614 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:45:26,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:45:26,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1484400773, now seen corresponding path program 1 times [2018-12-02 03:45:26,614 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:45:26,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:45:26,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:45:26,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:45:26,615 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:45:26,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:45:26,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:45:26,661 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:45:26,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 03:45:26,661 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:45:26,661 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 03:45:26,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 03:45:26,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 03:45:26,662 INFO L87 Difference]: Start difference. First operand 16125 states and 49516 transitions. Second operand 6 states. [2018-12-02 03:45:27,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:45:27,059 INFO L93 Difference]: Finished difference Result 19568 states and 59304 transitions. [2018-12-02 03:45:27,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 03:45:27,060 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2018-12-02 03:45:27,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:45:27,081 INFO L225 Difference]: With dead ends: 19568 [2018-12-02 03:45:27,081 INFO L226 Difference]: Without dead ends: 19568 [2018-12-02 03:45:27,082 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-02 03:45:27,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19568 states. [2018-12-02 03:45:27,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19568 to 18524. [2018-12-02 03:45:27,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18524 states. [2018-12-02 03:45:27,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18524 states to 18524 states and 56466 transitions. [2018-12-02 03:45:27,285 INFO L78 Accepts]: Start accepts. Automaton has 18524 states and 56466 transitions. Word has length 67 [2018-12-02 03:45:27,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:45:27,285 INFO L480 AbstractCegarLoop]: Abstraction has 18524 states and 56466 transitions. [2018-12-02 03:45:27,285 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 03:45:27,285 INFO L276 IsEmpty]: Start isEmpty. Operand 18524 states and 56466 transitions. [2018-12-02 03:45:27,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-02 03:45:27,296 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:45:27,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:45:27,296 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:45:27,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:45:27,296 INFO L82 PathProgramCache]: Analyzing trace with hash -592808570, now seen corresponding path program 1 times [2018-12-02 03:45:27,296 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:45:27,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:45:27,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:45:27,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:45:27,298 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:45:27,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:45:27,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:45:27,359 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:45:27,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 03:45:27,359 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:45:27,359 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 03:45:27,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 03:45:27,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 03:45:27,359 INFO L87 Difference]: Start difference. First operand 18524 states and 56466 transitions. Second operand 6 states. [2018-12-02 03:45:27,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:45:27,597 INFO L93 Difference]: Finished difference Result 21666 states and 64013 transitions. [2018-12-02 03:45:27,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 03:45:27,598 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2018-12-02 03:45:27,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:45:27,622 INFO L225 Difference]: With dead ends: 21666 [2018-12-02 03:45:27,623 INFO L226 Difference]: Without dead ends: 21666 [2018-12-02 03:45:27,623 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-02 03:45:27,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21666 states. [2018-12-02 03:45:27,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21666 to 18841. [2018-12-02 03:45:27,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18841 states. [2018-12-02 03:45:27,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18841 states to 18841 states and 56340 transitions. [2018-12-02 03:45:27,832 INFO L78 Accepts]: Start accepts. Automaton has 18841 states and 56340 transitions. Word has length 67 [2018-12-02 03:45:27,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:45:27,832 INFO L480 AbstractCegarLoop]: Abstraction has 18841 states and 56340 transitions. [2018-12-02 03:45:27,833 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 03:45:27,833 INFO L276 IsEmpty]: Start isEmpty. Operand 18841 states and 56340 transitions. [2018-12-02 03:45:27,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-02 03:45:27,842 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:45:27,842 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] [2018-12-02 03:45:27,842 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:45:27,842 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:45:27,843 INFO L82 PathProgramCache]: Analyzing trace with hash -381457657, now seen corresponding path program 1 times [2018-12-02 03:45:27,843 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:45:27,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:45:27,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:45:27,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:45:27,844 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:45:27,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:45:27,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:45:27,882 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:45:27,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 03:45:27,882 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:45:27,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 03:45:27,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 03:45:27,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 03:45:27,883 INFO L87 Difference]: Start difference. First operand 18841 states and 56340 transitions. Second operand 5 states. [2018-12-02 03:45:28,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:45:28,072 INFO L93 Difference]: Finished difference Result 23854 states and 70897 transitions. [2018-12-02 03:45:28,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 03:45:28,073 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-12-02 03:45:28,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:45:28,099 INFO L225 Difference]: With dead ends: 23854 [2018-12-02 03:45:28,099 INFO L226 Difference]: Without dead ends: 23854 [2018-12-02 03:45:28,099 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-02 03:45:28,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23854 states. [2018-12-02 03:45:28,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23854 to 20164. [2018-12-02 03:45:28,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20164 states. [2018-12-02 03:45:28,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20164 states to 20164 states and 59821 transitions. [2018-12-02 03:45:28,323 INFO L78 Accepts]: Start accepts. Automaton has 20164 states and 59821 transitions. Word has length 67 [2018-12-02 03:45:28,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:45:28,323 INFO L480 AbstractCegarLoop]: Abstraction has 20164 states and 59821 transitions. [2018-12-02 03:45:28,323 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 03:45:28,323 INFO L276 IsEmpty]: Start isEmpty. Operand 20164 states and 59821 transitions. [2018-12-02 03:45:28,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-02 03:45:28,333 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:45:28,333 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] [2018-12-02 03:45:28,333 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:45:28,334 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:45:28,334 INFO L82 PathProgramCache]: Analyzing trace with hash -891991834, now seen corresponding path program 1 times [2018-12-02 03:45:28,334 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:45:28,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:45:28,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:45:28,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:45:28,335 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:45:28,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:45:28,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:45:28,383 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:45:28,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 03:45:28,383 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:45:28,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 03:45:28,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 03:45:28,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 03:45:28,384 INFO L87 Difference]: Start difference. First operand 20164 states and 59821 transitions. Second operand 5 states. [2018-12-02 03:45:28,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:45:28,631 INFO L93 Difference]: Finished difference Result 27231 states and 80368 transitions. [2018-12-02 03:45:28,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 03:45:28,631 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-12-02 03:45:28,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:45:28,662 INFO L225 Difference]: With dead ends: 27231 [2018-12-02 03:45:28,662 INFO L226 Difference]: Without dead ends: 27231 [2018-12-02 03:45:28,662 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 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-02 03:45:28,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27231 states. [2018-12-02 03:45:28,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27231 to 21349. [2018-12-02 03:45:28,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21349 states. [2018-12-02 03:45:28,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21349 states to 21349 states and 63327 transitions. [2018-12-02 03:45:28,926 INFO L78 Accepts]: Start accepts. Automaton has 21349 states and 63327 transitions. Word has length 67 [2018-12-02 03:45:28,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:45:28,926 INFO L480 AbstractCegarLoop]: Abstraction has 21349 states and 63327 transitions. [2018-12-02 03:45:28,926 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 03:45:28,926 INFO L276 IsEmpty]: Start isEmpty. Operand 21349 states and 63327 transitions. [2018-12-02 03:45:28,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-02 03:45:28,936 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:45:28,936 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] [2018-12-02 03:45:28,936 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:45:28,936 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:45:28,936 INFO L82 PathProgramCache]: Analyzing trace with hash 1595520999, now seen corresponding path program 1 times [2018-12-02 03:45:28,936 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:45:28,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:45:28,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:45:28,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:45:28,937 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:45:28,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:45:28,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:45:28,973 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:45:28,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 03:45:28,973 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:45:28,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 03:45:28,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 03:45:28,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 03:45:28,973 INFO L87 Difference]: Start difference. First operand 21349 states and 63327 transitions. Second operand 4 states. [2018-12-02 03:45:29,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:45:29,265 INFO L93 Difference]: Finished difference Result 28445 states and 84501 transitions. [2018-12-02 03:45:29,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 03:45:29,265 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2018-12-02 03:45:29,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:45:29,298 INFO L225 Difference]: With dead ends: 28445 [2018-12-02 03:45:29,298 INFO L226 Difference]: Without dead ends: 28025 [2018-12-02 03:45:29,298 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 03:45:29,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28025 states. [2018-12-02 03:45:29,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28025 to 25833. [2018-12-02 03:45:29,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25833 states. [2018-12-02 03:45:29,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25833 states to 25833 states and 76849 transitions. [2018-12-02 03:45:29,621 INFO L78 Accepts]: Start accepts. Automaton has 25833 states and 76849 transitions. Word has length 67 [2018-12-02 03:45:29,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:45:29,622 INFO L480 AbstractCegarLoop]: Abstraction has 25833 states and 76849 transitions. [2018-12-02 03:45:29,622 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 03:45:29,622 INFO L276 IsEmpty]: Start isEmpty. Operand 25833 states and 76849 transitions. [2018-12-02 03:45:29,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-02 03:45:29,635 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:45:29,635 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] [2018-12-02 03:45:29,635 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:45:29,635 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:45:29,635 INFO L82 PathProgramCache]: Analyzing trace with hash -201430360, now seen corresponding path program 1 times [2018-12-02 03:45:29,635 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:45:29,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:45:29,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:45:29,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:45:29,636 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:45:29,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:45:29,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:45:29,663 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:45:29,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 03:45:29,663 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:45:29,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 03:45:29,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 03:45:29,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 03:45:29,664 INFO L87 Difference]: Start difference. First operand 25833 states and 76849 transitions. Second operand 5 states. [2018-12-02 03:45:29,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:45:29,701 INFO L93 Difference]: Finished difference Result 7049 states and 16989 transitions. [2018-12-02 03:45:29,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 03:45:29,701 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-12-02 03:45:29,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:45:29,705 INFO L225 Difference]: With dead ends: 7049 [2018-12-02 03:45:29,705 INFO L226 Difference]: Without dead ends: 5562 [2018-12-02 03:45:29,705 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-02 03:45:29,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5562 states. [2018-12-02 03:45:29,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5562 to 4888. [2018-12-02 03:45:29,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4888 states. [2018-12-02 03:45:29,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4888 states to 4888 states and 11541 transitions. [2018-12-02 03:45:29,740 INFO L78 Accepts]: Start accepts. Automaton has 4888 states and 11541 transitions. Word has length 67 [2018-12-02 03:45:29,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:45:29,740 INFO L480 AbstractCegarLoop]: Abstraction has 4888 states and 11541 transitions. [2018-12-02 03:45:29,740 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 03:45:29,740 INFO L276 IsEmpty]: Start isEmpty. Operand 4888 states and 11541 transitions. [2018-12-02 03:45:29,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-02 03:45:29,744 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:45:29,744 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] [2018-12-02 03:45:29,745 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:45:29,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:45:29,745 INFO L82 PathProgramCache]: Analyzing trace with hash -1225324604, now seen corresponding path program 1 times [2018-12-02 03:45:29,745 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:45:29,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:45:29,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:45:29,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:45:29,746 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:45:29,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:45:29,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:45:29,791 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:45:29,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 03:45:29,791 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:45:29,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 03:45:29,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 03:45:29,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 03:45:29,792 INFO L87 Difference]: Start difference. First operand 4888 states and 11541 transitions. Second operand 5 states. [2018-12-02 03:45:29,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:45:29,917 INFO L93 Difference]: Finished difference Result 5732 states and 13375 transitions. [2018-12-02 03:45:29,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 03:45:29,917 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2018-12-02 03:45:29,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:45:29,921 INFO L225 Difference]: With dead ends: 5732 [2018-12-02 03:45:29,921 INFO L226 Difference]: Without dead ends: 5698 [2018-12-02 03:45:29,921 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-02 03:45:29,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5698 states. [2018-12-02 03:45:29,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5698 to 5046. [2018-12-02 03:45:29,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5046 states. [2018-12-02 03:45:29,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5046 states to 5046 states and 11853 transitions. [2018-12-02 03:45:29,957 INFO L78 Accepts]: Start accepts. Automaton has 5046 states and 11853 transitions. Word has length 82 [2018-12-02 03:45:29,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:45:29,958 INFO L480 AbstractCegarLoop]: Abstraction has 5046 states and 11853 transitions. [2018-12-02 03:45:29,958 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 03:45:29,958 INFO L276 IsEmpty]: Start isEmpty. Operand 5046 states and 11853 transitions. [2018-12-02 03:45:29,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-02 03:45:29,961 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:45:29,962 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] [2018-12-02 03:45:29,962 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:45:29,962 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:45:29,962 INFO L82 PathProgramCache]: Analyzing trace with hash 1401587043, now seen corresponding path program 1 times [2018-12-02 03:45:29,962 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:45:29,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:45:29,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:45:29,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:45:29,964 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:45:29,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:45:30,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:45:30,007 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:45:30,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 03:45:30,007 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:45:30,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 03:45:30,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 03:45:30,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-02 03:45:30,008 INFO L87 Difference]: Start difference. First operand 5046 states and 11853 transitions. Second operand 6 states. [2018-12-02 03:45:30,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:45:30,165 INFO L93 Difference]: Finished difference Result 6708 states and 15748 transitions. [2018-12-02 03:45:30,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 03:45:30,165 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2018-12-02 03:45:30,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:45:30,169 INFO L225 Difference]: With dead ends: 6708 [2018-12-02 03:45:30,169 INFO L226 Difference]: Without dead ends: 6676 [2018-12-02 03:45:30,169 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-02 03:45:30,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6676 states. [2018-12-02 03:45:30,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6676 to 5404. [2018-12-02 03:45:30,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5404 states. [2018-12-02 03:45:30,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5404 states to 5404 states and 12732 transitions. [2018-12-02 03:45:30,210 INFO L78 Accepts]: Start accepts. Automaton has 5404 states and 12732 transitions. Word has length 82 [2018-12-02 03:45:30,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:45:30,211 INFO L480 AbstractCegarLoop]: Abstraction has 5404 states and 12732 transitions. [2018-12-02 03:45:30,211 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 03:45:30,211 INFO L276 IsEmpty]: Start isEmpty. Operand 5404 states and 12732 transitions. [2018-12-02 03:45:30,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-02 03:45:30,214 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:45:30,214 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] [2018-12-02 03:45:30,214 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:45:30,215 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:45:30,215 INFO L82 PathProgramCache]: Analyzing trace with hash -395364316, now seen corresponding path program 1 times [2018-12-02 03:45:30,215 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:45:30,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:45:30,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:45:30,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:45:30,216 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:45:30,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:45:30,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:45:30,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:45:30,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 03:45:30,271 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:45:30,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 03:45:30,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 03:45:30,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-02 03:45:30,272 INFO L87 Difference]: Start difference. First operand 5404 states and 12732 transitions. Second operand 7 states. [2018-12-02 03:45:30,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:45:30,491 INFO L93 Difference]: Finished difference Result 8734 states and 21012 transitions. [2018-12-02 03:45:30,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 03:45:30,491 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 82 [2018-12-02 03:45:30,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:45:30,497 INFO L225 Difference]: With dead ends: 8734 [2018-12-02 03:45:30,497 INFO L226 Difference]: Without dead ends: 8734 [2018-12-02 03:45:30,497 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2018-12-02 03:45:30,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8734 states. [2018-12-02 03:45:30,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8734 to 6145. [2018-12-02 03:45:30,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6145 states. [2018-12-02 03:45:30,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6145 states to 6145 states and 14616 transitions. [2018-12-02 03:45:30,555 INFO L78 Accepts]: Start accepts. Automaton has 6145 states and 14616 transitions. Word has length 82 [2018-12-02 03:45:30,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:45:30,555 INFO L480 AbstractCegarLoop]: Abstraction has 6145 states and 14616 transitions. [2018-12-02 03:45:30,555 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 03:45:30,555 INFO L276 IsEmpty]: Start isEmpty. Operand 6145 states and 14616 transitions. [2018-12-02 03:45:30,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-02 03:45:30,559 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:45:30,559 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] [2018-12-02 03:45:30,560 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:45:30,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:45:30,560 INFO L82 PathProgramCache]: Analyzing trace with hash 492139365, now seen corresponding path program 1 times [2018-12-02 03:45:30,560 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:45:30,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:45:30,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:45:30,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:45:30,561 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:45:30,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:45:30,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:45:30,624 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:45:30,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 03:45:30,624 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:45:30,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 03:45:30,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 03:45:30,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 03:45:30,624 INFO L87 Difference]: Start difference. First operand 6145 states and 14616 transitions. Second operand 6 states. [2018-12-02 03:45:30,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:45:30,656 INFO L93 Difference]: Finished difference Result 7313 states and 17387 transitions. [2018-12-02 03:45:30,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 03:45:30,657 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2018-12-02 03:45:30,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:45:30,662 INFO L225 Difference]: With dead ends: 7313 [2018-12-02 03:45:30,662 INFO L226 Difference]: Without dead ends: 7313 [2018-12-02 03:45:30,662 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 03:45:30,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7313 states. [2018-12-02 03:45:30,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7313 to 5480. [2018-12-02 03:45:30,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5480 states. [2018-12-02 03:45:30,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5480 states to 5480 states and 12892 transitions. [2018-12-02 03:45:30,705 INFO L78 Accepts]: Start accepts. Automaton has 5480 states and 12892 transitions. Word has length 82 [2018-12-02 03:45:30,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:45:30,706 INFO L480 AbstractCegarLoop]: Abstraction has 5480 states and 12892 transitions. [2018-12-02 03:45:30,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 03:45:30,706 INFO L276 IsEmpty]: Start isEmpty. Operand 5480 states and 12892 transitions. [2018-12-02 03:45:30,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-02 03:45:30,709 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:45:30,709 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:45:30,709 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:45:30,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:45:30,709 INFO L82 PathProgramCache]: Analyzing trace with hash -1239836187, now seen corresponding path program 1 times [2018-12-02 03:45:30,709 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:45:30,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:45:30,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:45:30,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:45:30,710 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:45:30,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:45:30,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:45:30,758 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:45:30,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 03:45:30,758 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:45:30,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 03:45:30,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 03:45:30,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 03:45:30,758 INFO L87 Difference]: Start difference. First operand 5480 states and 12892 transitions. Second operand 6 states. [2018-12-02 03:45:30,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:45:30,828 INFO L93 Difference]: Finished difference Result 5096 states and 11724 transitions. [2018-12-02 03:45:30,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 03:45:30,828 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2018-12-02 03:45:30,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:45:30,832 INFO L225 Difference]: With dead ends: 5096 [2018-12-02 03:45:30,832 INFO L226 Difference]: Without dead ends: 5096 [2018-12-02 03:45:30,832 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-02 03:45:30,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5096 states. [2018-12-02 03:45:30,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5096 to 3190. [2018-12-02 03:45:30,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3190 states. [2018-12-02 03:45:30,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3190 states to 3190 states and 7391 transitions. [2018-12-02 03:45:30,860 INFO L78 Accepts]: Start accepts. Automaton has 3190 states and 7391 transitions. Word has length 82 [2018-12-02 03:45:30,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:45:30,860 INFO L480 AbstractCegarLoop]: Abstraction has 3190 states and 7391 transitions. [2018-12-02 03:45:30,860 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 03:45:30,860 INFO L276 IsEmpty]: Start isEmpty. Operand 3190 states and 7391 transitions. [2018-12-02 03:45:30,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-02 03:45:30,862 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:45:30,862 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] [2018-12-02 03:45:30,862 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:45:30,862 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:45:30,862 INFO L82 PathProgramCache]: Analyzing trace with hash -1939261575, now seen corresponding path program 1 times [2018-12-02 03:45:30,862 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:45:30,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:45:30,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:45:30,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:45:30,863 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:45:30,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:45:30,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:45:30,940 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:45:30,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 03:45:30,940 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:45:30,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 03:45:30,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 03:45:30,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-02 03:45:30,940 INFO L87 Difference]: Start difference. First operand 3190 states and 7391 transitions. Second operand 7 states. [2018-12-02 03:45:31,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:45:31,065 INFO L93 Difference]: Finished difference Result 3738 states and 8627 transitions. [2018-12-02 03:45:31,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 03:45:31,065 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 84 [2018-12-02 03:45:31,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:45:31,068 INFO L225 Difference]: With dead ends: 3738 [2018-12-02 03:45:31,068 INFO L226 Difference]: Without dead ends: 3738 [2018-12-02 03:45:31,068 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2018-12-02 03:45:31,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3738 states. [2018-12-02 03:45:31,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3738 to 3641. [2018-12-02 03:45:31,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3641 states. [2018-12-02 03:45:31,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3641 states to 3641 states and 8435 transitions. [2018-12-02 03:45:31,096 INFO L78 Accepts]: Start accepts. Automaton has 3641 states and 8435 transitions. Word has length 84 [2018-12-02 03:45:31,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:45:31,096 INFO L480 AbstractCegarLoop]: Abstraction has 3641 states and 8435 transitions. [2018-12-02 03:45:31,096 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 03:45:31,096 INFO L276 IsEmpty]: Start isEmpty. Operand 3641 states and 8435 transitions. [2018-12-02 03:45:31,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-02 03:45:31,099 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:45:31,099 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] [2018-12-02 03:45:31,099 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:45:31,099 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:45:31,099 INFO L82 PathProgramCache]: Analyzing trace with hash -1051757894, now seen corresponding path program 1 times [2018-12-02 03:45:31,099 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:45:31,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:45:31,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:45:31,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:45:31,101 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:45:31,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:45:31,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:45:31,180 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:45:31,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-02 03:45:31,180 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:45:31,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 03:45:31,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 03:45:31,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-12-02 03:45:31,181 INFO L87 Difference]: Start difference. First operand 3641 states and 8435 transitions. Second operand 10 states. [2018-12-02 03:45:31,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:45:31,921 INFO L93 Difference]: Finished difference Result 6341 states and 14692 transitions. [2018-12-02 03:45:31,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 03:45:31,921 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 84 [2018-12-02 03:45:31,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:45:31,925 INFO L225 Difference]: With dead ends: 6341 [2018-12-02 03:45:31,925 INFO L226 Difference]: Without dead ends: 4297 [2018-12-02 03:45:31,926 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2018-12-02 03:45:31,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4297 states. [2018-12-02 03:45:31,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4297 to 3676. [2018-12-02 03:45:31,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3676 states. [2018-12-02 03:45:31,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3676 states to 3676 states and 8434 transitions. [2018-12-02 03:45:31,965 INFO L78 Accepts]: Start accepts. Automaton has 3676 states and 8434 transitions. Word has length 84 [2018-12-02 03:45:31,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:45:31,965 INFO L480 AbstractCegarLoop]: Abstraction has 3676 states and 8434 transitions. [2018-12-02 03:45:31,965 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 03:45:31,965 INFO L276 IsEmpty]: Start isEmpty. Operand 3676 states and 8434 transitions. [2018-12-02 03:45:31,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-02 03:45:31,968 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:45:31,968 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:45:31,969 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:45:31,969 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:45:31,969 INFO L82 PathProgramCache]: Analyzing trace with hash 454383476, now seen corresponding path program 2 times [2018-12-02 03:45:31,969 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:45:31,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:45:31,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:45:31,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:45:31,970 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:45:31,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:45:32,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:45:32,040 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:45:32,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 03:45:32,040 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:45:32,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 03:45:32,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 03:45:32,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-02 03:45:32,041 INFO L87 Difference]: Start difference. First operand 3676 states and 8434 transitions. Second operand 8 states. [2018-12-02 03:45:32,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:45:32,367 INFO L93 Difference]: Finished difference Result 6529 states and 15057 transitions. [2018-12-02 03:45:32,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 03:45:32,367 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 84 [2018-12-02 03:45:32,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:45:32,370 INFO L225 Difference]: With dead ends: 6529 [2018-12-02 03:45:32,370 INFO L226 Difference]: Without dead ends: 2810 [2018-12-02 03:45:32,371 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-12-02 03:45:32,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2810 states. [2018-12-02 03:45:32,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2810 to 2810. [2018-12-02 03:45:32,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2810 states. [2018-12-02 03:45:32,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2810 states to 2810 states and 6504 transitions. [2018-12-02 03:45:32,398 INFO L78 Accepts]: Start accepts. Automaton has 2810 states and 6504 transitions. Word has length 84 [2018-12-02 03:45:32,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:45:32,398 INFO L480 AbstractCegarLoop]: Abstraction has 2810 states and 6504 transitions. [2018-12-02 03:45:32,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 03:45:32,398 INFO L276 IsEmpty]: Start isEmpty. Operand 2810 states and 6504 transitions. [2018-12-02 03:45:32,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-02 03:45:32,401 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:45:32,401 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] [2018-12-02 03:45:32,401 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:45:32,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:45:32,401 INFO L82 PathProgramCache]: Analyzing trace with hash 955940820, now seen corresponding path program 1 times [2018-12-02 03:45:32,401 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:45:32,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:45:32,402 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 03:45:32,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:45:32,403 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:45:32,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:45:32,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:45:32,454 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:45:32,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 03:45:32,454 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:45:32,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 03:45:32,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 03:45:32,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-02 03:45:32,455 INFO L87 Difference]: Start difference. First operand 2810 states and 6504 transitions. Second operand 7 states. [2018-12-02 03:45:32,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:45:32,638 INFO L93 Difference]: Finished difference Result 3247 states and 7538 transitions. [2018-12-02 03:45:32,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 03:45:32,639 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 84 [2018-12-02 03:45:32,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:45:32,641 INFO L225 Difference]: With dead ends: 3247 [2018-12-02 03:45:32,641 INFO L226 Difference]: Without dead ends: 3247 [2018-12-02 03:45:32,641 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-02 03:45:32,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3247 states. [2018-12-02 03:45:32,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3247 to 2890. [2018-12-02 03:45:32,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2890 states. [2018-12-02 03:45:32,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2890 states to 2890 states and 6729 transitions. [2018-12-02 03:45:32,659 INFO L78 Accepts]: Start accepts. Automaton has 2890 states and 6729 transitions. Word has length 84 [2018-12-02 03:45:32,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:45:32,660 INFO L480 AbstractCegarLoop]: Abstraction has 2890 states and 6729 transitions. [2018-12-02 03:45:32,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 03:45:32,660 INFO L276 IsEmpty]: Start isEmpty. Operand 2890 states and 6729 transitions. [2018-12-02 03:45:32,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-02 03:45:32,661 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:45:32,661 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] [2018-12-02 03:45:32,662 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:45:32,662 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:45:32,662 INFO L82 PathProgramCache]: Analyzing trace with hash 1237296374, now seen corresponding path program 1 times [2018-12-02 03:45:32,662 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:45:32,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:45:32,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:45:32,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:45:32,663 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:45:32,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:45:32,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:45:32,734 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:45:32,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 03:45:32,734 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:45:32,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 03:45:32,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 03:45:32,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-02 03:45:32,734 INFO L87 Difference]: Start difference. First operand 2890 states and 6729 transitions. Second operand 7 states. [2018-12-02 03:45:32,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:45:32,850 INFO L93 Difference]: Finished difference Result 3006 states and 6922 transitions. [2018-12-02 03:45:32,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 03:45:32,851 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 84 [2018-12-02 03:45:32,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:45:32,853 INFO L225 Difference]: With dead ends: 3006 [2018-12-02 03:45:32,853 INFO L226 Difference]: Without dead ends: 3006 [2018-12-02 03:45:32,854 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-12-02 03:45:32,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3006 states. [2018-12-02 03:45:32,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3006 to 2728. [2018-12-02 03:45:32,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2728 states. [2018-12-02 03:45:32,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2728 states to 2728 states and 6289 transitions. [2018-12-02 03:45:32,879 INFO L78 Accepts]: Start accepts. Automaton has 2728 states and 6289 transitions. Word has length 84 [2018-12-02 03:45:32,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:45:32,879 INFO L480 AbstractCegarLoop]: Abstraction has 2728 states and 6289 transitions. [2018-12-02 03:45:32,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 03:45:32,879 INFO L276 IsEmpty]: Start isEmpty. Operand 2728 states and 6289 transitions. [2018-12-02 03:45:32,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-02 03:45:32,881 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:45:32,881 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] [2018-12-02 03:45:32,881 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:45:32,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:45:32,882 INFO L82 PathProgramCache]: Analyzing trace with hash 1448647287, now seen corresponding path program 2 times [2018-12-02 03:45:32,882 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:45:32,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:45:32,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:45:32,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:45:32,883 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:45:32,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:45:32,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:45:32,956 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:45:32,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 03:45:32,957 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:45:32,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 03:45:32,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 03:45:32,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-02 03:45:32,957 INFO L87 Difference]: Start difference. First operand 2728 states and 6289 transitions. Second operand 8 states. [2018-12-02 03:45:33,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:45:33,097 INFO L93 Difference]: Finished difference Result 3112 states and 7156 transitions. [2018-12-02 03:45:33,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 03:45:33,098 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 84 [2018-12-02 03:45:33,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:45:33,100 INFO L225 Difference]: With dead ends: 3112 [2018-12-02 03:45:33,100 INFO L226 Difference]: Without dead ends: 3112 [2018-12-02 03:45:33,100 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2018-12-02 03:45:33,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3112 states. [2018-12-02 03:45:33,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3112 to 2751. [2018-12-02 03:45:33,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2751 states. [2018-12-02 03:45:33,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2751 states to 2751 states and 6330 transitions. [2018-12-02 03:45:33,118 INFO L78 Accepts]: Start accepts. Automaton has 2751 states and 6330 transitions. Word has length 84 [2018-12-02 03:45:33,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:45:33,118 INFO L480 AbstractCegarLoop]: Abstraction has 2751 states and 6330 transitions. [2018-12-02 03:45:33,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 03:45:33,118 INFO L276 IsEmpty]: Start isEmpty. Operand 2751 states and 6330 transitions. [2018-12-02 03:45:33,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-02 03:45:33,120 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:45:33,120 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] [2018-12-02 03:45:33,120 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:45:33,120 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:45:33,120 INFO L82 PathProgramCache]: Analyzing trace with hash -1958816328, now seen corresponding path program 3 times [2018-12-02 03:45:33,120 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:45:33,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:45:33,121 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 03:45:33,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:45:33,121 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:45:33,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:45:33,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:45:33,207 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:45:33,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-02 03:45:33,207 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:45:33,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 03:45:33,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 03:45:33,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-02 03:45:33,208 INFO L87 Difference]: Start difference. First operand 2751 states and 6330 transitions. Second operand 11 states. [2018-12-02 03:45:33,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:45:33,683 INFO L93 Difference]: Finished difference Result 4763 states and 11016 transitions. [2018-12-02 03:45:33,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 03:45:33,684 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 84 [2018-12-02 03:45:33,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:45:33,686 INFO L225 Difference]: With dead ends: 4763 [2018-12-02 03:45:33,686 INFO L226 Difference]: Without dead ends: 3059 [2018-12-02 03:45:33,686 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2018-12-02 03:45:33,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3059 states. [2018-12-02 03:45:33,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3059 to 2731. [2018-12-02 03:45:33,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2731 states. [2018-12-02 03:45:33,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2731 states to 2731 states and 6288 transitions. [2018-12-02 03:45:33,710 INFO L78 Accepts]: Start accepts. Automaton has 2731 states and 6288 transitions. Word has length 84 [2018-12-02 03:45:33,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:45:33,710 INFO L480 AbstractCegarLoop]: Abstraction has 2731 states and 6288 transitions. [2018-12-02 03:45:33,711 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 03:45:33,711 INFO L276 IsEmpty]: Start isEmpty. Operand 2731 states and 6288 transitions. [2018-12-02 03:45:33,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-02 03:45:33,713 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:45:33,713 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] [2018-12-02 03:45:33,713 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:45:33,713 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:45:33,713 INFO L82 PathProgramCache]: Analyzing trace with hash 10917176, now seen corresponding path program 4 times [2018-12-02 03:45:33,713 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:45:33,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:45:33,714 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 03:45:33,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:45:33,714 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:45:33,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:45:33,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:45:33,747 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 03:45:33,814 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-02 03:45:33,816 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 03:45:33 BasicIcfg [2018-12-02 03:45:33,816 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 03:45:33,816 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 03:45:33,816 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 03:45:33,816 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 03:45:33,816 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:45:13" (3/4) ... [2018-12-02 03:45:33,818 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-02 03:45:33,890 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_5940e5c3-0b9c-400a-86d4-3bda992fda9c/bin-2019/utaipan/witness.graphml [2018-12-02 03:45:33,890 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 03:45:33,891 INFO L168 Benchmark]: Toolchain (without parser) took 21193.31 ms. Allocated memory was 1.0 GB in the beginning and 3.3 GB in the end (delta: 2.3 GB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -161.7 MB). Peak memory consumption was 2.2 GB. Max. memory is 11.5 GB. [2018-12-02 03:45:33,892 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 03:45:33,892 INFO L168 Benchmark]: CACSL2BoogieTranslator took 352.01 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 107.5 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -134.9 MB). Peak memory consumption was 34.0 MB. Max. memory is 11.5 GB. [2018-12-02 03:45:33,892 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.99 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-02 03:45:33,892 INFO L168 Benchmark]: Boogie Preprocessor took 27.95 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 03:45:33,892 INFO L168 Benchmark]: RCFGBuilder took 303.82 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 48.8 MB). Peak memory consumption was 48.8 MB. Max. memory is 11.5 GB. [2018-12-02 03:45:33,892 INFO L168 Benchmark]: TraceAbstraction took 20391.42 ms. Allocated memory was 1.1 GB in the beginning and 3.3 GB in the end (delta: 2.2 GB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -121.6 MB). Peak memory consumption was 2.1 GB. Max. memory is 11.5 GB. [2018-12-02 03:45:33,893 INFO L168 Benchmark]: Witness Printer took 74.26 ms. Allocated memory is still 3.3 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 43.3 MB). Peak memory consumption was 43.3 MB. Max. memory is 11.5 GB. [2018-12-02 03:45:33,894 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 352.01 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 107.5 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -134.9 MB). Peak memory consumption was 34.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 40.99 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.95 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 303.82 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 48.8 MB). Peak memory consumption was 48.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 20391.42 ms. Allocated memory was 1.1 GB in the beginning and 3.3 GB in the end (delta: 2.2 GB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -121.6 MB). Peak memory consumption was 2.1 GB. Max. memory is 11.5 GB. * Witness Printer took 74.26 ms. Allocated memory is still 3.3 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 43.3 MB). Peak memory consumption was 43.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L672] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L674] -1 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L676] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L678] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L679] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L680] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L682] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L683] -1 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L684] -1 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L685] -1 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L686] -1 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L687] -1 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L688] -1 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, 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] [L689] -1 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, 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] [L690] -1 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, 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] [L691] -1 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, 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] [L692] -1 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, 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}] [L693] -1 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, 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] [L694] -1 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, 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] [L695] -1 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, 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] [L696] -1 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, 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] [L698] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, 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] [L699] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, 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] [L700] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L776] -1 pthread_t t1635; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L777] FCALL, FORK -1 pthread_create(&t1635, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L778] -1 pthread_t t1636; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L779] FCALL, FORK -1 pthread_create(&t1636, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L734] 0 x$w_buff1 = x$w_buff0 [L735] 0 x$w_buff0 = 1 [L736] 0 x$w_buff1_used = x$w_buff0_used [L737] 0 x$w_buff0_used = (_Bool)1 [L5] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L739] 0 x$r_buff1_thd0 = x$r_buff0_thd0 [L740] 0 x$r_buff1_thd1 = x$r_buff0_thd1 [L741] 0 x$r_buff1_thd2 = x$r_buff0_thd2 [L742] 0 x$r_buff0_thd2 = (_Bool)1 [L745] 0 y = 1 [L748] 0 __unbuffered_p1_EAX = y [L751] 0 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L754] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L704] 1 y = 2 [L709] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L710] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L711] 1 x$flush_delayed = weak$$choice2 [L712] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L713] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L754] 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) [L755] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L755] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L713] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L756] 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_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L756] 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 [L757] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L714] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L714] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L715] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L715] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L716] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L716] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L717] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L717] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L718] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L718] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L719] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L719] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L720] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L721] EXPR 1 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$flush_delayed ? x$mem_tmp : x=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L721] 1 x = x$flush_delayed ? x$mem_tmp : x [L722] 1 x$flush_delayed = (_Bool)0 [L727] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L757] 0 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L758] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L758] 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 [L761] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L781] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L785] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L785] EXPR -1 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L785] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L785] -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) [L786] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L786] -1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L787] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L787] -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 [L788] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L788] -1 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L789] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L789] -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 [L792] -1 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L5] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L5] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 199 locations, 3 error locations. UNSAFE Result, 20.3s OverallTime, 31 OverallIterations, 1 TraceHistogramMax, 9.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 8043 SDtfs, 9887 SDslu, 19304 SDs, 0 SdLazy, 7859 SolverSat, 399 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 301 GetRequests, 75 SyntacticMatches, 24 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=61472occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 8.1s AutomataMinimizationTime, 30 MinimizatonAttempts, 147550 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 2132 NumberOfCodeBlocks, 2132 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 2018 ConstructedInterpolants, 0 QuantifiedInterpolants, 380616 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 30 InterpolantComputations, 30 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...