./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix038_pso.opt_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_842da144-4e49-4258-a87f-126cac75161e/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_842da144-4e49-4258-a87f-126cac75161e/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_842da144-4e49-4258-a87f-126cac75161e/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_842da144-4e49-4258-a87f-126cac75161e/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix038_pso.opt_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_842da144-4e49-4258-a87f-126cac75161e/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_842da144-4e49-4258-a87f-126cac75161e/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 625e9cfcd00842fe2e2329e3096ecaaf5131f016 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 22:29:43,778 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 22:29:43,779 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 22:29:43,785 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 22:29:43,785 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 22:29:43,786 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 22:29:43,787 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 22:29:43,787 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 22:29:43,788 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 22:29:43,789 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 22:29:43,789 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 22:29:43,789 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 22:29:43,790 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 22:29:43,790 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 22:29:43,791 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 22:29:43,791 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 22:29:43,792 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 22:29:43,792 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 22:29:43,793 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 22:29:43,794 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 22:29:43,795 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 22:29:43,795 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 22:29:43,796 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 22:29:43,797 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 22:29:43,797 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 22:29:43,797 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 22:29:43,798 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 22:29:43,798 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 22:29:43,798 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 22:29:43,799 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 22:29:43,799 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 22:29:43,799 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 22:29:43,800 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 22:29:43,800 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 22:29:43,800 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 22:29:43,801 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 22:29:43,801 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_842da144-4e49-4258-a87f-126cac75161e/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-02 22:29:43,808 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 22:29:43,808 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 22:29:43,809 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 22:29:43,809 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 22:29:43,809 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 22:29:43,809 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 22:29:43,809 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 22:29:43,809 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 22:29:43,809 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 22:29:43,810 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 22:29:43,810 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 22:29:43,810 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 22:29:43,810 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 22:29:43,810 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 22:29:43,810 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 22:29:43,810 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 22:29:43,810 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 22:29:43,811 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 22:29:43,811 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 22:29:43,811 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 22:29:43,811 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 22:29:43,811 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 22:29:43,811 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 22:29:43,811 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 22:29:43,811 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 22:29:43,811 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 22:29:43,811 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 22:29:43,811 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 22:29:43,812 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 22:29:43,812 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 22:29:43,812 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 22:29:43,812 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 22:29:43,812 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 22:29:43,812 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 22:29:43,812 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 22:29:43,812 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-02 22:29:43,812 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_842da144-4e49-4258-a87f-126cac75161e/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 -> 625e9cfcd00842fe2e2329e3096ecaaf5131f016 [2018-12-02 22:29:43,830 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 22:29:43,836 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 22:29:43,838 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 22:29:43,839 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 22:29:43,839 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 22:29:43,840 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_842da144-4e49-4258-a87f-126cac75161e/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/mix038_pso.opt_false-unreach-call.i [2018-12-02 22:29:43,873 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_842da144-4e49-4258-a87f-126cac75161e/bin-2019/utaipan/data/2e0d552ff/999e1ffa3a1041df8a5d0f060f99ab7e/FLAGf60dfda31 [2018-12-02 22:29:44,338 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 22:29:44,339 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_842da144-4e49-4258-a87f-126cac75161e/sv-benchmarks/c/pthread-wmm/mix038_pso.opt_false-unreach-call.i [2018-12-02 22:29:44,346 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_842da144-4e49-4258-a87f-126cac75161e/bin-2019/utaipan/data/2e0d552ff/999e1ffa3a1041df8a5d0f060f99ab7e/FLAGf60dfda31 [2018-12-02 22:29:44,355 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_842da144-4e49-4258-a87f-126cac75161e/bin-2019/utaipan/data/2e0d552ff/999e1ffa3a1041df8a5d0f060f99ab7e [2018-12-02 22:29:44,356 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 22:29:44,357 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 22:29:44,358 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 22:29:44,358 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 22:29:44,360 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 22:29:44,360 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 10:29:44" (1/1) ... [2018-12-02 22:29:44,362 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ab2707f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:29:44, skipping insertion in model container [2018-12-02 22:29:44,362 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 10:29:44" (1/1) ... [2018-12-02 22:29:44,366 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 22:29:44,388 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 22:29:44,563 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 22:29:44,571 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 22:29:44,643 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 22:29:44,674 INFO L195 MainTranslator]: Completed translation [2018-12-02 22:29:44,675 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:29:44 WrapperNode [2018-12-02 22:29:44,675 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 22:29:44,675 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 22:29:44,675 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 22:29:44,675 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 22:29:44,681 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:29:44" (1/1) ... [2018-12-02 22:29:44,691 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:29:44" (1/1) ... [2018-12-02 22:29:44,706 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 22:29:44,707 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 22:29:44,707 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 22:29:44,707 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 22:29:44,713 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:29:44" (1/1) ... [2018-12-02 22:29:44,713 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:29:44" (1/1) ... [2018-12-02 22:29:44,715 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:29:44" (1/1) ... [2018-12-02 22:29:44,716 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:29:44" (1/1) ... [2018-12-02 22:29:44,721 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:29:44" (1/1) ... [2018-12-02 22:29:44,723 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:29:44" (1/1) ... [2018-12-02 22:29:44,724 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:29:44" (1/1) ... [2018-12-02 22:29:44,726 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 22:29:44,727 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 22:29:44,727 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 22:29:44,727 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 22:29:44,727 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:29:44" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_842da144-4e49-4258-a87f-126cac75161e/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 22:29:44,759 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 22:29:44,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 22:29:44,760 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-02 22:29:44,760 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 22:29:44,760 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-02 22:29:44,760 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-02 22:29:44,760 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-02 22:29:44,760 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-02 22:29:44,760 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2018-12-02 22:29:44,760 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2018-12-02 22:29:44,760 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-02 22:29:44,760 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 22:29:44,760 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 22:29:44,761 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 22:29:45,051 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 22:29:45,051 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-02 22:29:45,052 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 10:29:45 BoogieIcfgContainer [2018-12-02 22:29:45,052 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 22:29:45,052 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 22:29:45,053 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 22:29:45,055 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 22:29:45,055 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 10:29:44" (1/3) ... [2018-12-02 22:29:45,056 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6aca063c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 10:29:45, skipping insertion in model container [2018-12-02 22:29:45,056 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:29:44" (2/3) ... [2018-12-02 22:29:45,056 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6aca063c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 10:29:45, skipping insertion in model container [2018-12-02 22:29:45,057 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 10:29:45" (3/3) ... [2018-12-02 22:29:45,058 INFO L112 eAbstractionObserver]: Analyzing ICFG mix038_pso.opt_false-unreach-call.i [2018-12-02 22:29:45,090 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,090 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,090 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,090 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,090 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,091 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,091 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,091 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,091 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,091 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,092 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet5.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,092 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,092 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,092 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,092 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,092 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet5.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,092 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,092 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,093 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet5.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,093 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,093 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,093 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet5.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,093 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,093 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,093 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,094 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,094 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,094 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,094 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,094 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,094 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,095 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,095 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,095 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,095 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,095 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,095 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,095 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,096 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,096 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,096 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,096 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,096 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,096 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,096 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,097 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,097 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,097 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,097 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,097 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,097 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,097 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,098 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,098 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,098 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,098 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,098 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,098 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,098 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,098 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,099 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,099 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,099 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,099 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,099 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,099 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,100 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,100 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,100 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,100 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,100 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,100 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,100 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,100 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,101 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,101 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,101 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,101 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,101 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,101 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,101 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,101 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,102 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,102 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,102 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,102 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,102 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,102 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,103 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,103 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,103 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,103 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,103 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,103 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,103 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,104 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,104 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,104 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,104 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,104 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,104 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,104 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,105 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,105 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,105 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,105 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,105 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,105 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,105 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,105 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,106 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,106 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,106 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,106 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,106 WARN L317 ript$VariableManager]: TermVariabe Thread2_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,106 WARN L317 ript$VariableManager]: TermVariabe Thread2_P2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,106 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,107 WARN L317 ript$VariableManager]: TermVariabe Thread2_P2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,107 WARN L317 ript$VariableManager]: TermVariabe Thread2_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,107 WARN L317 ript$VariableManager]: TermVariabe Thread2_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,107 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,107 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,107 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,107 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,108 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,108 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,108 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,108 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,108 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,108 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,108 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,108 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,109 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,109 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,109 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,109 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,109 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,109 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,109 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,110 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,110 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,110 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,110 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,110 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,110 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~nondet34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,110 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~nondet34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,110 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,111 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,111 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~nondet34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,111 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~nondet34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:29:45,116 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-02 22:29:45,116 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 22:29:45,123 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-02 22:29:45,136 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-02 22:29:45,154 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 22:29:45,154 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 22:29:45,154 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 22:29:45,154 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 22:29:45,154 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 22:29:45,154 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 22:29:45,154 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 22:29:45,154 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 22:29:45,162 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 146places, 177 transitions [2018-12-02 22:30:05,596 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 149045 states. [2018-12-02 22:30:05,597 INFO L276 IsEmpty]: Start isEmpty. Operand 149045 states. [2018-12-02 22:30:05,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-02 22:30:05,605 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:30:05,605 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 22:30:05,606 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 22:30:05,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:30:05,610 INFO L82 PathProgramCache]: Analyzing trace with hash 1389776375, now seen corresponding path program 1 times [2018-12-02 22:30:05,612 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 22:30:05,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:30:05,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:30:05,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:30:05,648 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 22:30:05,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:30:05,765 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 22:30:05,767 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 22:30:05,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 22:30:05,767 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 22:30:05,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 22:30:05,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 22:30:05,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 22:30:05,779 INFO L87 Difference]: Start difference. First operand 149045 states. Second operand 4 states. [2018-12-02 22:30:08,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:30:08,669 INFO L93 Difference]: Finished difference Result 257065 states and 1188604 transitions. [2018-12-02 22:30:08,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 22:30:08,671 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2018-12-02 22:30:08,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:30:09,324 INFO L225 Difference]: With dead ends: 257065 [2018-12-02 22:30:09,325 INFO L226 Difference]: Without dead ends: 174815 [2018-12-02 22:30:09,326 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 22:30:10,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174815 states. [2018-12-02 22:30:12,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174815 to 110555. [2018-12-02 22:30:12,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110555 states. [2018-12-02 22:30:12,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110555 states to 110555 states and 511486 transitions. [2018-12-02 22:30:12,456 INFO L78 Accepts]: Start accepts. Automaton has 110555 states and 511486 transitions. Word has length 46 [2018-12-02 22:30:12,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:30:12,457 INFO L480 AbstractCegarLoop]: Abstraction has 110555 states and 511486 transitions. [2018-12-02 22:30:12,457 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 22:30:12,457 INFO L276 IsEmpty]: Start isEmpty. Operand 110555 states and 511486 transitions. [2018-12-02 22:30:12,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-02 22:30:12,468 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:30:12,468 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 22:30:12,468 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 22:30:12,468 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:30:12,468 INFO L82 PathProgramCache]: Analyzing trace with hash -1733656626, now seen corresponding path program 1 times [2018-12-02 22:30:12,468 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 22:30:12,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:30:12,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:30:12,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:30:12,471 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 22:30:12,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:30:12,515 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 22:30:12,515 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 22:30:12,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 22:30:12,516 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 22:30:12,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 22:30:12,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 22:30:12,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 22:30:12,517 INFO L87 Difference]: Start difference. First operand 110555 states and 511486 transitions. Second operand 5 states. [2018-12-02 22:30:14,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:30:14,325 INFO L93 Difference]: Finished difference Result 240605 states and 1068741 transitions. [2018-12-02 22:30:14,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 22:30:14,325 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2018-12-02 22:30:14,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:30:14,953 INFO L225 Difference]: With dead ends: 240605 [2018-12-02 22:30:14,953 INFO L226 Difference]: Without dead ends: 237055 [2018-12-02 22:30:14,953 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 22:30:15,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237055 states. [2018-12-02 22:30:18,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237055 to 160435. [2018-12-02 22:30:18,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160435 states. [2018-12-02 22:30:18,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160435 states to 160435 states and 716930 transitions. [2018-12-02 22:30:18,902 INFO L78 Accepts]: Start accepts. Automaton has 160435 states and 716930 transitions. Word has length 54 [2018-12-02 22:30:18,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:30:18,902 INFO L480 AbstractCegarLoop]: Abstraction has 160435 states and 716930 transitions. [2018-12-02 22:30:18,902 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 22:30:18,902 INFO L276 IsEmpty]: Start isEmpty. Operand 160435 states and 716930 transitions. [2018-12-02 22:30:18,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-02 22:30:18,912 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:30:18,912 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 22:30:18,913 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 22:30:18,913 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:30:18,913 INFO L82 PathProgramCache]: Analyzing trace with hash 901134090, now seen corresponding path program 1 times [2018-12-02 22:30:18,913 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 22:30:18,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:30:18,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:30:18,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:30:18,915 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 22:30:18,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:30:18,958 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 22:30:18,958 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 22:30:18,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 22:30:18,959 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 22:30:18,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 22:30:18,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 22:30:18,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 22:30:18,959 INFO L87 Difference]: Start difference. First operand 160435 states and 716930 transitions. Second operand 5 states. [2018-12-02 22:30:20,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:30:20,625 INFO L93 Difference]: Finished difference Result 317175 states and 1405287 transitions. [2018-12-02 22:30:20,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 22:30:20,625 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2018-12-02 22:30:20,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:30:24,324 INFO L225 Difference]: With dead ends: 317175 [2018-12-02 22:30:24,324 INFO L226 Difference]: Without dead ends: 314275 [2018-12-02 22:30:24,325 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 22:30:25,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314275 states. [2018-12-02 22:30:28,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314275 to 178275. [2018-12-02 22:30:28,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178275 states. [2018-12-02 22:30:28,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178275 states to 178275 states and 791492 transitions. [2018-12-02 22:30:28,864 INFO L78 Accepts]: Start accepts. Automaton has 178275 states and 791492 transitions. Word has length 55 [2018-12-02 22:30:28,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:30:28,864 INFO L480 AbstractCegarLoop]: Abstraction has 178275 states and 791492 transitions. [2018-12-02 22:30:28,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 22:30:28,864 INFO L276 IsEmpty]: Start isEmpty. Operand 178275 states and 791492 transitions. [2018-12-02 22:30:28,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-02 22:30:28,878 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:30:28,879 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] [2018-12-02 22:30:28,879 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 22:30:28,879 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:30:28,879 INFO L82 PathProgramCache]: Analyzing trace with hash -710959504, now seen corresponding path program 1 times [2018-12-02 22:30:28,879 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 22:30:28,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:30:28,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:30:28,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:30:28,881 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 22:30:28,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:30:28,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 22:30:28,910 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 22:30:28,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 22:30:28,911 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 22:30:28,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 22:30:28,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 22:30:28,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 22:30:28,911 INFO L87 Difference]: Start difference. First operand 178275 states and 791492 transitions. Second operand 3 states. [2018-12-02 22:30:30,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:30:30,363 INFO L93 Difference]: Finished difference Result 231655 states and 1011276 transitions. [2018-12-02 22:30:30,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 22:30:30,363 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2018-12-02 22:30:30,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:30:30,962 INFO L225 Difference]: With dead ends: 231655 [2018-12-02 22:30:30,962 INFO L226 Difference]: Without dead ends: 231655 [2018-12-02 22:30:30,963 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 22:30:32,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231655 states. [2018-12-02 22:30:37,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231655 to 202940. [2018-12-02 22:30:37,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202940 states. [2018-12-02 22:30:38,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202940 states to 202940 states and 893564 transitions. [2018-12-02 22:30:38,212 INFO L78 Accepts]: Start accepts. Automaton has 202940 states and 893564 transitions. Word has length 57 [2018-12-02 22:30:38,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:30:38,212 INFO L480 AbstractCegarLoop]: Abstraction has 202940 states and 893564 transitions. [2018-12-02 22:30:38,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 22:30:38,212 INFO L276 IsEmpty]: Start isEmpty. Operand 202940 states and 893564 transitions. [2018-12-02 22:30:38,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-02 22:30:38,245 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:30:38,245 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] [2018-12-02 22:30:38,245 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 22:30:38,245 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:30:38,245 INFO L82 PathProgramCache]: Analyzing trace with hash 1048459579, now seen corresponding path program 1 times [2018-12-02 22:30:38,245 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 22:30:38,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:30:38,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:30:38,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:30:38,247 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 22:30:38,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:30:38,303 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 22:30:38,303 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 22:30:38,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 22:30:38,304 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 22:30:38,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 22:30:38,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 22:30:38,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 22:30:38,304 INFO L87 Difference]: Start difference. First operand 202940 states and 893564 transitions. Second operand 6 states. [2018-12-02 22:30:40,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:30:40,444 INFO L93 Difference]: Finished difference Result 356175 states and 1552272 transitions. [2018-12-02 22:30:40,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 22:30:40,445 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2018-12-02 22:30:40,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:30:41,358 INFO L225 Difference]: With dead ends: 356175 [2018-12-02 22:30:41,358 INFO L226 Difference]: Without dead ends: 352825 [2018-12-02 22:30:41,359 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 22:30:43,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352825 states. [2018-12-02 22:30:49,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352825 to 205745. [2018-12-02 22:30:49,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205745 states. [2018-12-02 22:30:50,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205745 states to 205745 states and 906783 transitions. [2018-12-02 22:30:50,029 INFO L78 Accepts]: Start accepts. Automaton has 205745 states and 906783 transitions. Word has length 61 [2018-12-02 22:30:50,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:30:50,029 INFO L480 AbstractCegarLoop]: Abstraction has 205745 states and 906783 transitions. [2018-12-02 22:30:50,029 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 22:30:50,029 INFO L276 IsEmpty]: Start isEmpty. Operand 205745 states and 906783 transitions. [2018-12-02 22:30:50,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-02 22:30:50,060 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:30:50,060 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] [2018-12-02 22:30:50,061 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 22:30:50,061 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:30:50,061 INFO L82 PathProgramCache]: Analyzing trace with hash -639670917, now seen corresponding path program 1 times [2018-12-02 22:30:50,061 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 22:30:50,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:30:50,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:30:50,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:30:50,062 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 22:30:50,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:30:50,122 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 22:30:50,122 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 22:30:50,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 22:30:50,122 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 22:30:50,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 22:30:50,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 22:30:50,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 22:30:50,123 INFO L87 Difference]: Start difference. First operand 205745 states and 906783 transitions. Second operand 7 states. [2018-12-02 22:30:52,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:30:52,566 INFO L93 Difference]: Finished difference Result 363445 states and 1539808 transitions. [2018-12-02 22:30:52,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 22:30:52,566 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 61 [2018-12-02 22:30:52,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:30:53,466 INFO L225 Difference]: With dead ends: 363445 [2018-12-02 22:30:53,466 INFO L226 Difference]: Without dead ends: 363445 [2018-12-02 22:30:53,467 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-12-02 22:30:55,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363445 states. [2018-12-02 22:31:02,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363445 to 273285. [2018-12-02 22:31:02,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273285 states. [2018-12-02 22:31:02,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273285 states to 273285 states and 1180560 transitions. [2018-12-02 22:31:02,941 INFO L78 Accepts]: Start accepts. Automaton has 273285 states and 1180560 transitions. Word has length 61 [2018-12-02 22:31:02,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:31:02,942 INFO L480 AbstractCegarLoop]: Abstraction has 273285 states and 1180560 transitions. [2018-12-02 22:31:02,942 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 22:31:02,942 INFO L276 IsEmpty]: Start isEmpty. Operand 273285 states and 1180560 transitions. [2018-12-02 22:31:02,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-02 22:31:02,984 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:31:02,984 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 22:31:02,985 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 22:31:02,985 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:31:02,985 INFO L82 PathProgramCache]: Analyzing trace with hash 247832764, now seen corresponding path program 1 times [2018-12-02 22:31:02,985 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 22:31:02,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:31:02,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:31:02,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:31:02,986 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 22:31:02,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:31:03,029 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 22:31:03,029 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 22:31:03,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 22:31:03,029 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 22:31:03,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 22:31:03,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 22:31:03,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 22:31:03,030 INFO L87 Difference]: Start difference. First operand 273285 states and 1180560 transitions. Second operand 4 states. [2018-12-02 22:31:04,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:31:04,476 INFO L93 Difference]: Finished difference Result 238293 states and 1009124 transitions. [2018-12-02 22:31:04,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 22:31:04,476 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2018-12-02 22:31:04,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:31:05,061 INFO L225 Difference]: With dead ends: 238293 [2018-12-02 22:31:05,061 INFO L226 Difference]: Without dead ends: 230208 [2018-12-02 22:31:05,061 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 22:31:06,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230208 states. [2018-12-02 22:31:09,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230208 to 230208. [2018-12-02 22:31:09,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230208 states. [2018-12-02 22:31:09,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230208 states to 230208 states and 981402 transitions. [2018-12-02 22:31:09,918 INFO L78 Accepts]: Start accepts. Automaton has 230208 states and 981402 transitions. Word has length 61 [2018-12-02 22:31:09,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:31:09,918 INFO L480 AbstractCegarLoop]: Abstraction has 230208 states and 981402 transitions. [2018-12-02 22:31:09,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 22:31:09,918 INFO L276 IsEmpty]: Start isEmpty. Operand 230208 states and 981402 transitions. [2018-12-02 22:31:10,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-02 22:31:10,330 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:31:10,330 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 22:31:10,330 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 22:31:10,330 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:31:10,330 INFO L82 PathProgramCache]: Analyzing trace with hash -1622064650, now seen corresponding path program 1 times [2018-12-02 22:31:10,330 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 22:31:10,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:31:10,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:31:10,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:31:10,332 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 22:31:10,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:31:10,375 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 22:31:10,375 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 22:31:10,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 22:31:10,376 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 22:31:10,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 22:31:10,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 22:31:10,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 22:31:10,376 INFO L87 Difference]: Start difference. First operand 230208 states and 981402 transitions. Second operand 5 states. [2018-12-02 22:31:10,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:31:10,614 INFO L93 Difference]: Finished difference Result 55500 states and 215291 transitions. [2018-12-02 22:31:10,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 22:31:10,614 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 62 [2018-12-02 22:31:10,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:31:10,704 INFO L225 Difference]: With dead ends: 55500 [2018-12-02 22:31:10,704 INFO L226 Difference]: Without dead ends: 48584 [2018-12-02 22:31:10,704 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 22:31:10,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48584 states. [2018-12-02 22:31:11,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48584 to 48344. [2018-12-02 22:31:11,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48344 states. [2018-12-02 22:31:11,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48344 states to 48344 states and 187078 transitions. [2018-12-02 22:31:11,369 INFO L78 Accepts]: Start accepts. Automaton has 48344 states and 187078 transitions. Word has length 62 [2018-12-02 22:31:11,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:31:11,370 INFO L480 AbstractCegarLoop]: Abstraction has 48344 states and 187078 transitions. [2018-12-02 22:31:11,370 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 22:31:11,370 INFO L276 IsEmpty]: Start isEmpty. Operand 48344 states and 187078 transitions. [2018-12-02 22:31:11,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-02 22:31:11,385 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:31:11,385 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 22:31:11,385 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 22:31:11,386 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:31:11,386 INFO L82 PathProgramCache]: Analyzing trace with hash -34559289, now seen corresponding path program 1 times [2018-12-02 22:31:11,386 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 22:31:11,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:31:11,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:31:11,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:31:11,387 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 22:31:11,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:31:11,418 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 22:31:11,419 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 22:31:11,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 22:31:11,419 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 22:31:11,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 22:31:11,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 22:31:11,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 22:31:11,420 INFO L87 Difference]: Start difference. First operand 48344 states and 187078 transitions. Second operand 4 states. [2018-12-02 22:31:11,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:31:11,705 INFO L93 Difference]: Finished difference Result 56631 states and 218625 transitions. [2018-12-02 22:31:11,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 22:31:11,706 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2018-12-02 22:31:11,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:31:11,813 INFO L225 Difference]: With dead ends: 56631 [2018-12-02 22:31:11,813 INFO L226 Difference]: Without dead ends: 56631 [2018-12-02 22:31:11,814 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 22:31:11,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56631 states. [2018-12-02 22:31:13,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56631 to 51431. [2018-12-02 22:31:13,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51431 states. [2018-12-02 22:31:13,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51431 states to 51431 states and 198665 transitions. [2018-12-02 22:31:13,581 INFO L78 Accepts]: Start accepts. Automaton has 51431 states and 198665 transitions. Word has length 72 [2018-12-02 22:31:13,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:31:13,581 INFO L480 AbstractCegarLoop]: Abstraction has 51431 states and 198665 transitions. [2018-12-02 22:31:13,581 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 22:31:13,582 INFO L276 IsEmpty]: Start isEmpty. Operand 51431 states and 198665 transitions. [2018-12-02 22:31:13,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-02 22:31:13,600 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:31:13,600 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] [2018-12-02 22:31:13,600 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 22:31:13,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:31:13,600 INFO L82 PathProgramCache]: Analyzing trace with hash 1708251046, now seen corresponding path program 1 times [2018-12-02 22:31:13,601 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 22:31:13,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:31:13,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:31:13,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:31:13,602 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 22:31:13,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:31:13,649 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 22:31:13,649 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 22:31:13,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 22:31:13,650 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 22:31:13,650 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 22:31:13,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 22:31:13,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 22:31:13,650 INFO L87 Difference]: Start difference. First operand 51431 states and 198665 transitions. Second operand 6 states. [2018-12-02 22:31:13,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:31:13,714 INFO L93 Difference]: Finished difference Result 14279 states and 47593 transitions. [2018-12-02 22:31:13,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 22:31:13,715 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 72 [2018-12-02 22:31:13,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:31:13,728 INFO L225 Difference]: With dead ends: 14279 [2018-12-02 22:31:13,729 INFO L226 Difference]: Without dead ends: 12023 [2018-12-02 22:31:13,729 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-12-02 22:31:13,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12023 states. [2018-12-02 22:31:13,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12023 to 11433. [2018-12-02 22:31:13,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11433 states. [2018-12-02 22:31:13,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11433 states to 11433 states and 37545 transitions. [2018-12-02 22:31:13,848 INFO L78 Accepts]: Start accepts. Automaton has 11433 states and 37545 transitions. Word has length 72 [2018-12-02 22:31:13,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:31:13,848 INFO L480 AbstractCegarLoop]: Abstraction has 11433 states and 37545 transitions. [2018-12-02 22:31:13,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 22:31:13,848 INFO L276 IsEmpty]: Start isEmpty. Operand 11433 states and 37545 transitions. [2018-12-02 22:31:13,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-02 22:31:13,859 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:31:13,859 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 22:31:13,859 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 22:31:13,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:31:13,860 INFO L82 PathProgramCache]: Analyzing trace with hash 1409942006, now seen corresponding path program 1 times [2018-12-02 22:31:13,860 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 22:31:13,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:31:13,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:31:13,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:31:13,861 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 22:31:13,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:31:13,905 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 22:31:13,906 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 22:31:13,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 22:31:13,906 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 22:31:13,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 22:31:13,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 22:31:13,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 22:31:13,906 INFO L87 Difference]: Start difference. First operand 11433 states and 37545 transitions. Second operand 4 states. [2018-12-02 22:31:14,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:31:14,044 INFO L93 Difference]: Finished difference Result 15878 states and 51191 transitions. [2018-12-02 22:31:14,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 22:31:14,044 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2018-12-02 22:31:14,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:31:14,061 INFO L225 Difference]: With dead ends: 15878 [2018-12-02 22:31:14,062 INFO L226 Difference]: Without dead ends: 15878 [2018-12-02 22:31:14,062 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 22:31:14,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15878 states. [2018-12-02 22:31:14,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15878 to 13895. [2018-12-02 22:31:14,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13895 states. [2018-12-02 22:31:14,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13895 states to 13895 states and 45044 transitions. [2018-12-02 22:31:14,214 INFO L78 Accepts]: Start accepts. Automaton has 13895 states and 45044 transitions. Word has length 91 [2018-12-02 22:31:14,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:31:14,214 INFO L480 AbstractCegarLoop]: Abstraction has 13895 states and 45044 transitions. [2018-12-02 22:31:14,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 22:31:14,214 INFO L276 IsEmpty]: Start isEmpty. Operand 13895 states and 45044 transitions. [2018-12-02 22:31:14,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-02 22:31:14,227 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:31:14,227 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 22:31:14,227 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 22:31:14,227 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:31:14,228 INFO L82 PathProgramCache]: Analyzing trace with hash -1159544393, now seen corresponding path program 1 times [2018-12-02 22:31:14,228 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 22:31:14,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:31:14,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:31:14,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:31:14,229 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 22:31:14,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:31:14,294 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 22:31:14,294 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 22:31:14,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 22:31:14,295 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 22:31:14,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 22:31:14,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 22:31:14,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 22:31:14,295 INFO L87 Difference]: Start difference. First operand 13895 states and 45044 transitions. Second operand 6 states. [2018-12-02 22:31:14,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:31:14,630 INFO L93 Difference]: Finished difference Result 18245 states and 58549 transitions. [2018-12-02 22:31:14,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 22:31:14,630 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2018-12-02 22:31:14,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:31:14,649 INFO L225 Difference]: With dead ends: 18245 [2018-12-02 22:31:14,649 INFO L226 Difference]: Without dead ends: 17810 [2018-12-02 22:31:14,649 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-02 22:31:14,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17810 states. [2018-12-02 22:31:14,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17810 to 16895. [2018-12-02 22:31:14,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16895 states. [2018-12-02 22:31:14,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16895 states to 16895 states and 54549 transitions. [2018-12-02 22:31:14,828 INFO L78 Accepts]: Start accepts. Automaton has 16895 states and 54549 transitions. Word has length 91 [2018-12-02 22:31:14,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:31:14,828 INFO L480 AbstractCegarLoop]: Abstraction has 16895 states and 54549 transitions. [2018-12-02 22:31:14,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 22:31:14,828 INFO L276 IsEmpty]: Start isEmpty. Operand 16895 states and 54549 transitions. [2018-12-02 22:31:14,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-02 22:31:14,843 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:31:14,843 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 22:31:14,843 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 22:31:14,844 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:31:14,844 INFO L82 PathProgramCache]: Analyzing trace with hash 1395330258, now seen corresponding path program 2 times [2018-12-02 22:31:14,844 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 22:31:14,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:31:14,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:31:14,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:31:14,845 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 22:31:14,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:31:14,920 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 22:31:14,920 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 22:31:14,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 22:31:14,920 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 22:31:14,921 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 22:31:14,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 22:31:14,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-02 22:31:14,921 INFO L87 Difference]: Start difference. First operand 16895 states and 54549 transitions. Second operand 7 states. [2018-12-02 22:31:15,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:31:15,289 INFO L93 Difference]: Finished difference Result 21628 states and 70031 transitions. [2018-12-02 22:31:15,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 22:31:15,289 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 91 [2018-12-02 22:31:15,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:31:15,315 INFO L225 Difference]: With dead ends: 21628 [2018-12-02 22:31:15,315 INFO L226 Difference]: Without dead ends: 21628 [2018-12-02 22:31:15,315 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 22:31:15,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21628 states. [2018-12-02 22:31:15,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21628 to 17725. [2018-12-02 22:31:15,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17725 states. [2018-12-02 22:31:15,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17725 states to 17725 states and 57628 transitions. [2018-12-02 22:31:15,608 INFO L78 Accepts]: Start accepts. Automaton has 17725 states and 57628 transitions. Word has length 91 [2018-12-02 22:31:15,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:31:15,608 INFO L480 AbstractCegarLoop]: Abstraction has 17725 states and 57628 transitions. [2018-12-02 22:31:15,608 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 22:31:15,608 INFO L276 IsEmpty]: Start isEmpty. Operand 17725 states and 57628 transitions. [2018-12-02 22:31:15,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-02 22:31:15,624 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:31:15,624 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 22:31:15,624 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 22:31:15,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:31:15,624 INFO L82 PathProgramCache]: Analyzing trace with hash -829778632, now seen corresponding path program 1 times [2018-12-02 22:31:15,624 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 22:31:15,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:31:15,625 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 22:31:15,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:31:15,625 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 22:31:15,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:31:15,682 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 22:31:15,682 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 22:31:15,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 22:31:15,682 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 22:31:15,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 22:31:15,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 22:31:15,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 22:31:15,683 INFO L87 Difference]: Start difference. First operand 17725 states and 57628 transitions. Second operand 5 states. [2018-12-02 22:31:15,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:31:15,859 INFO L93 Difference]: Finished difference Result 21707 states and 69733 transitions. [2018-12-02 22:31:15,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 22:31:15,859 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2018-12-02 22:31:15,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:31:15,882 INFO L225 Difference]: With dead ends: 21707 [2018-12-02 22:31:15,883 INFO L226 Difference]: Without dead ends: 21587 [2018-12-02 22:31:15,883 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 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 22:31:15,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21587 states. [2018-12-02 22:31:16,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21587 to 18260. [2018-12-02 22:31:16,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18260 states. [2018-12-02 22:31:16,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18260 states to 18260 states and 59176 transitions. [2018-12-02 22:31:16,089 INFO L78 Accepts]: Start accepts. Automaton has 18260 states and 59176 transitions. Word has length 91 [2018-12-02 22:31:16,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:31:16,089 INFO L480 AbstractCegarLoop]: Abstraction has 18260 states and 59176 transitions. [2018-12-02 22:31:16,089 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 22:31:16,089 INFO L276 IsEmpty]: Start isEmpty. Operand 18260 states and 59176 transitions. [2018-12-02 22:31:16,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-02 22:31:16,106 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:31:16,107 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 22:31:16,107 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 22:31:16,107 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:31:16,107 INFO L82 PathProgramCache]: Analyzing trace with hash 1233112668, now seen corresponding path program 3 times [2018-12-02 22:31:16,107 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 22:31:16,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:31:16,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:31:16,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:31:16,108 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 22:31:16,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:31:16,167 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 22:31:16,167 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 22:31:16,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 22:31:16,168 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 22:31:16,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 22:31:16,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 22:31:16,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-02 22:31:16,168 INFO L87 Difference]: Start difference. First operand 18260 states and 59176 transitions. Second operand 7 states. [2018-12-02 22:31:16,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:31:16,487 INFO L93 Difference]: Finished difference Result 31458 states and 102091 transitions. [2018-12-02 22:31:16,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 22:31:16,488 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 91 [2018-12-02 22:31:16,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:31:16,525 INFO L225 Difference]: With dead ends: 31458 [2018-12-02 22:31:16,525 INFO L226 Difference]: Without dead ends: 31458 [2018-12-02 22:31:16,526 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 22:31:16,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31458 states. [2018-12-02 22:31:16,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31458 to 20931. [2018-12-02 22:31:16,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20931 states. [2018-12-02 22:31:16,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20931 states to 20931 states and 68313 transitions. [2018-12-02 22:31:16,810 INFO L78 Accepts]: Start accepts. Automaton has 20931 states and 68313 transitions. Word has length 91 [2018-12-02 22:31:16,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:31:16,810 INFO L480 AbstractCegarLoop]: Abstraction has 20931 states and 68313 transitions. [2018-12-02 22:31:16,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 22:31:16,810 INFO L276 IsEmpty]: Start isEmpty. Operand 20931 states and 68313 transitions. [2018-12-02 22:31:16,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-02 22:31:16,830 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:31:16,830 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 22:31:16,830 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 22:31:16,831 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:31:16,831 INFO L82 PathProgramCache]: Analyzing trace with hash 2120616349, now seen corresponding path program 1 times [2018-12-02 22:31:16,831 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 22:31:16,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:31:16,832 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 22:31:16,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:31:16,832 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 22:31:16,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:31:16,888 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 22:31:16,888 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 22:31:16,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 22:31:16,888 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 22:31:16,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 22:31:16,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 22:31:16,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 22:31:16,889 INFO L87 Difference]: Start difference. First operand 20931 states and 68313 transitions. Second operand 6 states. [2018-12-02 22:31:17,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:31:17,116 INFO L93 Difference]: Finished difference Result 29491 states and 95659 transitions. [2018-12-02 22:31:17,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 22:31:17,117 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2018-12-02 22:31:17,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:31:17,153 INFO L225 Difference]: With dead ends: 29491 [2018-12-02 22:31:17,153 INFO L226 Difference]: Without dead ends: 29491 [2018-12-02 22:31:17,154 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 22:31:17,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29491 states. [2018-12-02 22:31:17,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29491 to 23426. [2018-12-02 22:31:17,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23426 states. [2018-12-02 22:31:17,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23426 states to 23426 states and 76389 transitions. [2018-12-02 22:31:17,446 INFO L78 Accepts]: Start accepts. Automaton has 23426 states and 76389 transitions. Word has length 91 [2018-12-02 22:31:17,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:31:17,446 INFO L480 AbstractCegarLoop]: Abstraction has 23426 states and 76389 transitions. [2018-12-02 22:31:17,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 22:31:17,446 INFO L276 IsEmpty]: Start isEmpty. Operand 23426 states and 76389 transitions. [2018-12-02 22:31:17,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-02 22:31:17,467 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:31:17,467 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 22:31:17,467 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 22:31:17,467 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:31:17,467 INFO L82 PathProgramCache]: Analyzing trace with hash -844096675, now seen corresponding path program 1 times [2018-12-02 22:31:17,467 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 22:31:17,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:31:17,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:31:17,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:31:17,469 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 22:31:17,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:31:17,539 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 22:31:17,539 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 22:31:17,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 22:31:17,540 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 22:31:17,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 22:31:17,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 22:31:17,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 22:31:17,540 INFO L87 Difference]: Start difference. First operand 23426 states and 76389 transitions. Second operand 6 states. [2018-12-02 22:31:17,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:31:17,740 INFO L93 Difference]: Finished difference Result 22594 states and 72725 transitions. [2018-12-02 22:31:17,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 22:31:17,740 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2018-12-02 22:31:17,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:31:17,765 INFO L225 Difference]: With dead ends: 22594 [2018-12-02 22:31:17,765 INFO L226 Difference]: Without dead ends: 22594 [2018-12-02 22:31:17,765 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 22:31:17,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22594 states. [2018-12-02 22:31:17,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22594 to 17111. [2018-12-02 22:31:17,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17111 states. [2018-12-02 22:31:17,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17111 states to 17111 states and 55509 transitions. [2018-12-02 22:31:17,979 INFO L78 Accepts]: Start accepts. Automaton has 17111 states and 55509 transitions. Word has length 91 [2018-12-02 22:31:17,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:31:17,979 INFO L480 AbstractCegarLoop]: Abstraction has 17111 states and 55509 transitions. [2018-12-02 22:31:17,979 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 22:31:17,979 INFO L276 IsEmpty]: Start isEmpty. Operand 17111 states and 55509 transitions. [2018-12-02 22:31:17,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-02 22:31:17,994 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:31:17,995 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:31:17,995 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 22:31:17,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:31:17,995 INFO L82 PathProgramCache]: Analyzing trace with hash -75405535, now seen corresponding path program 1 times [2018-12-02 22:31:17,995 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 22:31:17,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:31:17,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:31:17,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:31:17,996 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 22:31:18,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:31:18,071 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 22:31:18,071 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 22:31:18,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 22:31:18,071 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 22:31:18,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 22:31:18,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 22:31:18,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-02 22:31:18,072 INFO L87 Difference]: Start difference. First operand 17111 states and 55509 transitions. Second operand 7 states. [2018-12-02 22:31:18,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:31:18,296 INFO L93 Difference]: Finished difference Result 18441 states and 58783 transitions. [2018-12-02 22:31:18,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 22:31:18,297 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2018-12-02 22:31:18,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:31:18,317 INFO L225 Difference]: With dead ends: 18441 [2018-12-02 22:31:18,317 INFO L226 Difference]: Without dead ends: 18441 [2018-12-02 22:31:18,317 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2018-12-02 22:31:18,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18441 states. [2018-12-02 22:31:18,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18441 to 14731. [2018-12-02 22:31:18,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14731 states. [2018-12-02 22:31:18,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14731 states to 14731 states and 46785 transitions. [2018-12-02 22:31:18,487 INFO L78 Accepts]: Start accepts. Automaton has 14731 states and 46785 transitions. Word has length 93 [2018-12-02 22:31:18,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:31:18,487 INFO L480 AbstractCegarLoop]: Abstraction has 14731 states and 46785 transitions. [2018-12-02 22:31:18,487 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 22:31:18,487 INFO L276 IsEmpty]: Start isEmpty. Operand 14731 states and 46785 transitions. [2018-12-02 22:31:18,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-02 22:31:18,501 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:31:18,501 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 22:31:18,501 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 22:31:18,501 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:31:18,501 INFO L82 PathProgramCache]: Analyzing trace with hash 886208482, now seen corresponding path program 1 times [2018-12-02 22:31:18,501 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 22:31:18,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:31:18,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:31:18,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:31:18,502 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 22:31:18,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:31:18,590 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 22:31:18,590 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 22:31:18,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 22:31:18,590 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 22:31:18,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 22:31:18,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 22:31:18,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-02 22:31:18,591 INFO L87 Difference]: Start difference. First operand 14731 states and 46785 transitions. Second operand 8 states. [2018-12-02 22:31:18,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:31:18,830 INFO L93 Difference]: Finished difference Result 16988 states and 53438 transitions. [2018-12-02 22:31:18,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-02 22:31:18,830 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 93 [2018-12-02 22:31:18,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:31:18,851 INFO L225 Difference]: With dead ends: 16988 [2018-12-02 22:31:18,851 INFO L226 Difference]: Without dead ends: 16988 [2018-12-02 22:31:18,851 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2018-12-02 22:31:18,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16988 states. [2018-12-02 22:31:18,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16988 to 16344. [2018-12-02 22:31:18,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16344 states. [2018-12-02 22:31:19,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16344 states to 16344 states and 51641 transitions. [2018-12-02 22:31:19,024 INFO L78 Accepts]: Start accepts. Automaton has 16344 states and 51641 transitions. Word has length 93 [2018-12-02 22:31:19,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:31:19,024 INFO L480 AbstractCegarLoop]: Abstraction has 16344 states and 51641 transitions. [2018-12-02 22:31:19,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 22:31:19,024 INFO L276 IsEmpty]: Start isEmpty. Operand 16344 states and 51641 transitions. [2018-12-02 22:31:19,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-02 22:31:19,039 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:31:19,039 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 22:31:19,039 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 22:31:19,039 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:31:19,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1773712163, now seen corresponding path program 1 times [2018-12-02 22:31:19,039 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 22:31:19,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:31:19,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:31:19,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:31:19,040 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 22:31:19,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:31:19,136 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 22:31:19,137 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 22:31:19,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-02 22:31:19,137 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 22:31:19,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 22:31:19,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 22:31:19,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-12-02 22:31:19,137 INFO L87 Difference]: Start difference. First operand 16344 states and 51641 transitions. Second operand 10 states. [2018-12-02 22:31:19,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:31:19,950 INFO L93 Difference]: Finished difference Result 30335 states and 95605 transitions. [2018-12-02 22:31:19,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 22:31:19,951 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 93 [2018-12-02 22:31:19,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:31:19,981 INFO L225 Difference]: With dead ends: 30335 [2018-12-02 22:31:19,981 INFO L226 Difference]: Without dead ends: 20914 [2018-12-02 22:31:19,981 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2018-12-02 22:31:20,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20914 states. [2018-12-02 22:31:20,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20914 to 17254. [2018-12-02 22:31:20,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17254 states. [2018-12-02 22:31:20,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17254 states to 17254 states and 54264 transitions. [2018-12-02 22:31:20,168 INFO L78 Accepts]: Start accepts. Automaton has 17254 states and 54264 transitions. Word has length 93 [2018-12-02 22:31:20,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:31:20,168 INFO L480 AbstractCegarLoop]: Abstraction has 17254 states and 54264 transitions. [2018-12-02 22:31:20,168 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 22:31:20,168 INFO L276 IsEmpty]: Start isEmpty. Operand 17254 states and 54264 transitions. [2018-12-02 22:31:20,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-02 22:31:20,183 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:31:20,183 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 22:31:20,183 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 22:31:20,183 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:31:20,183 INFO L82 PathProgramCache]: Analyzing trace with hash 530462971, now seen corresponding path program 2 times [2018-12-02 22:31:20,183 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 22:31:20,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:31:20,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:31:20,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:31:20,184 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 22:31:20,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:31:20,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 22:31:20,264 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 22:31:20,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-02 22:31:20,264 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 22:31:20,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 22:31:20,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 22:31:20,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-02 22:31:20,265 INFO L87 Difference]: Start difference. First operand 17254 states and 54264 transitions. Second operand 10 states. [2018-12-02 22:31:20,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:31:20,913 INFO L93 Difference]: Finished difference Result 32450 states and 102165 transitions. [2018-12-02 22:31:20,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 22:31:20,914 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 93 [2018-12-02 22:31:20,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:31:20,939 INFO L225 Difference]: With dead ends: 32450 [2018-12-02 22:31:20,939 INFO L226 Difference]: Without dead ends: 15314 [2018-12-02 22:31:20,940 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2018-12-02 22:31:20,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15314 states. [2018-12-02 22:31:21,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15314 to 15314. [2018-12-02 22:31:21,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15314 states. [2018-12-02 22:31:21,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15314 states to 15314 states and 48036 transitions. [2018-12-02 22:31:21,124 INFO L78 Accepts]: Start accepts. Automaton has 15314 states and 48036 transitions. Word has length 93 [2018-12-02 22:31:21,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:31:21,124 INFO L480 AbstractCegarLoop]: Abstraction has 15314 states and 48036 transitions. [2018-12-02 22:31:21,124 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 22:31:21,124 INFO L276 IsEmpty]: Start isEmpty. Operand 15314 states and 48036 transitions. [2018-12-02 22:31:21,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-02 22:31:21,138 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:31:21,138 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 22:31:21,138 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 22:31:21,138 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:31:21,138 INFO L82 PathProgramCache]: Analyzing trace with hash -1667491465, now seen corresponding path program 3 times [2018-12-02 22:31:21,138 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 22:31:21,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:31:21,139 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 22:31:21,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:31:21,139 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 22:31:21,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:31:21,187 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 22:31:21,188 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 22:31:21,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 22:31:21,188 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 22:31:21,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 22:31:21,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 22:31:21,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 22:31:21,189 INFO L87 Difference]: Start difference. First operand 15314 states and 48036 transitions. Second operand 7 states. [2018-12-02 22:31:21,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:31:21,542 INFO L93 Difference]: Finished difference Result 26707 states and 84110 transitions. [2018-12-02 22:31:21,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 22:31:21,542 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2018-12-02 22:31:21,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:31:21,554 INFO L225 Difference]: With dead ends: 26707 [2018-12-02 22:31:21,555 INFO L226 Difference]: Without dead ends: 10415 [2018-12-02 22:31:21,555 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-12-02 22:31:21,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10415 states. [2018-12-02 22:31:21,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10415 to 10415. [2018-12-02 22:31:21,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10415 states. [2018-12-02 22:31:21,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10415 states to 10415 states and 32764 transitions. [2018-12-02 22:31:21,662 INFO L78 Accepts]: Start accepts. Automaton has 10415 states and 32764 transitions. Word has length 93 [2018-12-02 22:31:21,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:31:21,662 INFO L480 AbstractCegarLoop]: Abstraction has 10415 states and 32764 transitions. [2018-12-02 22:31:21,662 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 22:31:21,662 INFO L276 IsEmpty]: Start isEmpty. Operand 10415 states and 32764 transitions. [2018-12-02 22:31:21,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-02 22:31:21,671 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:31:21,671 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 22:31:21,671 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 22:31:21,671 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:31:21,671 INFO L82 PathProgramCache]: Analyzing trace with hash 1558601563, now seen corresponding path program 4 times [2018-12-02 22:31:21,671 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 22:31:21,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:31:21,672 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 22:31:21,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:31:21,672 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 22:31:21,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:31:21,755 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 22:31:21,755 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 22:31:21,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-02 22:31:21,755 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 22:31:21,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 22:31:21,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 22:31:21,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-02 22:31:21,756 INFO L87 Difference]: Start difference. First operand 10415 states and 32764 transitions. Second operand 11 states. [2018-12-02 22:31:22,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:31:22,300 INFO L93 Difference]: Finished difference Result 18734 states and 58484 transitions. [2018-12-02 22:31:22,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 22:31:22,300 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 93 [2018-12-02 22:31:22,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:31:22,312 INFO L225 Difference]: With dead ends: 18734 [2018-12-02 22:31:22,312 INFO L226 Difference]: Without dead ends: 11916 [2018-12-02 22:31:22,312 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 22:31:22,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11916 states. [2018-12-02 22:31:22,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11916 to 10424. [2018-12-02 22:31:22,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10424 states. [2018-12-02 22:31:22,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10424 states to 10424 states and 32775 transitions. [2018-12-02 22:31:22,414 INFO L78 Accepts]: Start accepts. Automaton has 10424 states and 32775 transitions. Word has length 93 [2018-12-02 22:31:22,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:31:22,414 INFO L480 AbstractCegarLoop]: Abstraction has 10424 states and 32775 transitions. [2018-12-02 22:31:22,414 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 22:31:22,414 INFO L276 IsEmpty]: Start isEmpty. Operand 10424 states and 32775 transitions. [2018-12-02 22:31:22,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-02 22:31:22,422 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:31:22,422 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 22:31:22,422 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 22:31:22,422 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:31:22,422 INFO L82 PathProgramCache]: Analyzing trace with hash -260946119, now seen corresponding path program 5 times [2018-12-02 22:31:22,422 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 22:31:22,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:31:22,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:31:22,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:31:22,423 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 22:31:22,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 22:31:22,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 22:31:22,460 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 22:31:22,533 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-02 22:31:22,534 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 10:31:22 BasicIcfg [2018-12-02 22:31:22,534 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 22:31:22,534 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 22:31:22,534 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 22:31:22,534 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 22:31:22,534 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 10:29:45" (3/4) ... [2018-12-02 22:31:22,536 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-02 22:31:22,616 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_842da144-4e49-4258-a87f-126cac75161e/bin-2019/utaipan/witness.graphml [2018-12-02 22:31:22,616 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 22:31:22,617 INFO L168 Benchmark]: Toolchain (without parser) took 98259.93 ms. Allocated memory was 1.0 GB in the beginning and 7.3 GB in the end (delta: 6.3 GB). Free memory was 953.5 MB in the beginning and 5.3 GB in the end (delta: -4.4 GB). Peak memory consumption was 1.9 GB. Max. memory is 11.5 GB. [2018-12-02 22:31:22,618 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 22:31:22,618 INFO L168 Benchmark]: CACSL2BoogieTranslator took 317.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 953.5 MB in the beginning and 1.1 GB in the end (delta: -168.0 MB). Peak memory consumption was 31.5 MB. Max. memory is 11.5 GB. [2018-12-02 22:31:22,618 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.32 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-12-02 22:31:22,618 INFO L168 Benchmark]: Boogie Preprocessor took 19.61 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 22:31:22,618 INFO L168 Benchmark]: RCFGBuilder took 325.21 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 49.0 MB). Peak memory consumption was 49.0 MB. Max. memory is 11.5 GB. [2018-12-02 22:31:22,618 INFO L168 Benchmark]: TraceAbstraction took 97481.31 ms. Allocated memory was 1.2 GB in the beginning and 7.3 GB in the end (delta: 6.2 GB). Free memory was 1.1 GB in the beginning and 5.4 GB in the end (delta: -4.3 GB). Peak memory consumption was 1.8 GB. Max. memory is 11.5 GB. [2018-12-02 22:31:22,619 INFO L168 Benchmark]: Witness Printer took 82.26 ms. Allocated memory is still 7.3 GB. Free memory was 5.4 GB in the beginning and 5.3 GB in the end (delta: 56.9 MB). Peak memory consumption was 56.9 MB. Max. memory is 11.5 GB. [2018-12-02 22:31:22,620 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 317.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 953.5 MB in the beginning and 1.1 GB in the end (delta: -168.0 MB). Peak memory consumption was 31.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 31.32 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.61 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 325.21 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 49.0 MB). Peak memory consumption was 49.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 97481.31 ms. Allocated memory was 1.2 GB in the beginning and 7.3 GB in the end (delta: 6.2 GB). Free memory was 1.1 GB in the beginning and 5.4 GB in the end (delta: -4.3 GB). Peak memory consumption was 1.8 GB. Max. memory is 11.5 GB. * Witness Printer took 82.26 ms. Allocated memory is still 7.3 GB. Free memory was 5.4 GB in the beginning and 5.3 GB in the end (delta: 56.9 MB). Peak memory consumption was 56.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L672] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L674] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L676] -1 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0] [L678] -1 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L680] -1 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0] [L681] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0] [L682] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L684] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L686] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L687] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L688] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L689] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L690] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L691] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L692] -1 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L693] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0] [L694] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L695] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L696] -1 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L697] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L698] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L699] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L700] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L701] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L702] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L704] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L705] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L706] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L796] -1 pthread_t t1012; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L797] FCALL, FORK -1 pthread_create(&t1012, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L798] -1 pthread_t t1013; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L799] FCALL, FORK -1 pthread_create(&t1013, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L800] -1 pthread_t t1014; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L801] FCALL, FORK -1 pthread_create(&t1014, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L753] 0 y$w_buff1 = y$w_buff0 [L754] 0 y$w_buff0 = 1 [L755] 0 y$w_buff1_used = y$w_buff0_used [L756] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L758] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L759] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L760] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L761] 0 y$r_buff1_thd3 = y$r_buff0_thd3 [L762] 0 y$r_buff0_thd3 = (_Bool)1 [L765] 0 z = 1 [L768] 0 __unbuffered_p2_EAX = z [L771] 0 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L774] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L710] 1 a = 1 [L713] 1 x = 1 [L718] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L725] 2 x = 2 [L728] 2 weak$$choice0 = __VERIFIER_nondet_pointer() [L729] 2 weak$$choice2 = __VERIFIER_nondet_pointer() [L730] 2 y$flush_delayed = weak$$choice2 [L731] 2 y$mem_tmp = y VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L732] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L774] 0 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L775] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L775] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L776] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L732] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L776] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L777] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L733] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L733] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L734] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L734] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L735] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L735] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L736] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L736] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L777] 0 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L778] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L778] 0 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L781] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L737] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L737] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L738] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L738] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L739] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L740] EXPR 2 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L740] 2 y = y$flush_delayed ? y$mem_tmp : y [L741] 2 y$flush_delayed = (_Bool)0 [L746] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L803] -1 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L807] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L807] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L807] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L807] -1 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L808] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L808] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L809] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L809] -1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L810] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L810] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L811] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L811] -1 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L814] -1 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 219 locations, 3 error locations. UNSAFE Result, 97.3s OverallTime, 24 OverallIterations, 1 TraceHistogramMax, 27.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6782 SDtfs, 8798 SDslu, 19130 SDs, 0 SdLazy, 6783 SolverSat, 302 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 257 GetRequests, 66 SyntacticMatches, 14 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=273285occurred in iteration=6, 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: 46.9s AutomataMinimizationTime, 23 MinimizatonAttempts, 590574 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 1889 NumberOfCodeBlocks, 1889 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 1773 ConstructedInterpolants, 0 QuantifiedInterpolants, 358777 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 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...