./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix034_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_4bda6a0c-d4c3-4fff-8a0c-afd9687cf215/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_4bda6a0c-d4c3-4fff-8a0c-afd9687cf215/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_4bda6a0c-d4c3-4fff-8a0c-afd9687cf215/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_4bda6a0c-d4c3-4fff-8a0c-afd9687cf215/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix034_pso.opt_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_4bda6a0c-d4c3-4fff-8a0c-afd9687cf215/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_4bda6a0c-d4c3-4fff-8a0c-afd9687cf215/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 a0aadc218f30dac73b58b60a933c7600da7e7cd4 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 01:37:24,792 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 01:37:24,793 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 01:37:24,799 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 01:37:24,799 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 01:37:24,800 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 01:37:24,800 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 01:37:24,801 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 01:37:24,802 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 01:37:24,802 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 01:37:24,803 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 01:37:24,803 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 01:37:24,803 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 01:37:24,804 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 01:37:24,804 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 01:37:24,805 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 01:37:24,805 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 01:37:24,806 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 01:37:24,807 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 01:37:24,808 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 01:37:24,808 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 01:37:24,809 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 01:37:24,810 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 01:37:24,810 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 01:37:24,810 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 01:37:24,811 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 01:37:24,812 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 01:37:24,812 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 01:37:24,812 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 01:37:24,813 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 01:37:24,813 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 01:37:24,814 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 01:37:24,814 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 01:37:24,814 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 01:37:24,814 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 01:37:24,815 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 01:37:24,815 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_4bda6a0c-d4c3-4fff-8a0c-afd9687cf215/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-02 01:37:24,823 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 01:37:24,823 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 01:37:24,824 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 01:37:24,824 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 01:37:24,824 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 01:37:24,824 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 01:37:24,824 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 01:37:24,824 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 01:37:24,824 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 01:37:24,825 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 01:37:24,825 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 01:37:24,825 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 01:37:24,825 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 01:37:24,825 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 01:37:24,825 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 01:37:24,826 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 01:37:24,826 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 01:37:24,826 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 01:37:24,826 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 01:37:24,826 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 01:37:24,826 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 01:37:24,826 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 01:37:24,826 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 01:37:24,826 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 01:37:24,826 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 01:37:24,826 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 01:37:24,827 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 01:37:24,827 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 01:37:24,827 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 01:37:24,827 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 01:37:24,827 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 01:37:24,827 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 01:37:24,827 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 01:37:24,827 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 01:37:24,827 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 01:37:24,827 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-02 01:37:24,827 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_4bda6a0c-d4c3-4fff-8a0c-afd9687cf215/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 -> a0aadc218f30dac73b58b60a933c7600da7e7cd4 [2018-12-02 01:37:24,845 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 01:37:24,852 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 01:37:24,854 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 01:37:24,854 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 01:37:24,855 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 01:37:24,855 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_4bda6a0c-d4c3-4fff-8a0c-afd9687cf215/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/mix034_pso.opt_false-unreach-call.i [2018-12-02 01:37:24,889 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4bda6a0c-d4c3-4fff-8a0c-afd9687cf215/bin-2019/utaipan/data/ea97181db/40ed00788f8a4cfd86c57fd7465bbbbd/FLAG8089a1437 [2018-12-02 01:37:25,350 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 01:37:25,350 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_4bda6a0c-d4c3-4fff-8a0c-afd9687cf215/sv-benchmarks/c/pthread-wmm/mix034_pso.opt_false-unreach-call.i [2018-12-02 01:37:25,357 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4bda6a0c-d4c3-4fff-8a0c-afd9687cf215/bin-2019/utaipan/data/ea97181db/40ed00788f8a4cfd86c57fd7465bbbbd/FLAG8089a1437 [2018-12-02 01:37:25,365 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_4bda6a0c-d4c3-4fff-8a0c-afd9687cf215/bin-2019/utaipan/data/ea97181db/40ed00788f8a4cfd86c57fd7465bbbbd [2018-12-02 01:37:25,366 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 01:37:25,367 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 01:37:25,368 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 01:37:25,368 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 01:37:25,370 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 01:37:25,370 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 01:37:25" (1/1) ... [2018-12-02 01:37:25,372 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 01:37:25, skipping insertion in model container [2018-12-02 01:37:25,372 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 01:37:25" (1/1) ... [2018-12-02 01:37:25,377 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 01:37:25,402 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 01:37:25,593 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 01:37:25,600 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 01:37:25,674 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 01:37:25,704 INFO L195 MainTranslator]: Completed translation [2018-12-02 01:37:25,704 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:37:25 WrapperNode [2018-12-02 01:37:25,705 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 01:37:25,705 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 01:37:25,705 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 01:37:25,705 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 01:37:25,710 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:37:25" (1/1) ... [2018-12-02 01:37:25,720 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:37:25" (1/1) ... [2018-12-02 01:37:25,736 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 01:37:25,736 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 01:37:25,736 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 01:37:25,736 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 01:37:25,742 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:37:25" (1/1) ... [2018-12-02 01:37:25,742 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:37:25" (1/1) ... [2018-12-02 01:37:25,744 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:37:25" (1/1) ... [2018-12-02 01:37:25,745 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:37:25" (1/1) ... [2018-12-02 01:37:25,750 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:37:25" (1/1) ... [2018-12-02 01:37:25,752 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:37:25" (1/1) ... [2018-12-02 01:37:25,753 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:37:25" (1/1) ... [2018-12-02 01:37:25,755 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 01:37:25,756 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 01:37:25,756 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 01:37:25,756 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 01:37:25,756 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:37:25" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4bda6a0c-d4c3-4fff-8a0c-afd9687cf215/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 01:37:25,788 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 01:37:25,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 01:37:25,788 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-02 01:37:25,788 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 01:37:25,789 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-02 01:37:25,789 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-02 01:37:25,789 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-02 01:37:25,789 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-02 01:37:25,789 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-02 01:37:25,789 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 01:37:25,789 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 01:37:25,790 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 01:37:26,085 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 01:37:26,086 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-02 01:37:26,086 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:37:26 BoogieIcfgContainer [2018-12-02 01:37:26,086 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 01:37:26,086 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 01:37:26,087 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 01:37:26,089 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 01:37:26,090 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 01:37:25" (1/3) ... [2018-12-02 01:37:26,090 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45c72ede and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 01:37:26, skipping insertion in model container [2018-12-02 01:37:26,090 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:37:25" (2/3) ... [2018-12-02 01:37:26,091 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45c72ede and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 01:37:26, skipping insertion in model container [2018-12-02 01:37:26,091 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:37:26" (3/3) ... [2018-12-02 01:37:26,092 INFO L112 eAbstractionObserver]: Analyzing ICFG mix034_pso.opt_false-unreach-call.i [2018-12-02 01:37:26,117 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:37:26,117 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:37:26,117 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:37:26,117 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:37:26,117 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:37:26,117 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:37:26,117 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:37:26,117 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:37:26,117 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:37:26,118 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:37:26,118 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:37:26,118 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:37:26,118 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:37:26,118 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:37:26,118 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:37:26,118 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:37:26,118 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:37:26,118 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:37:26,118 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:37:26,119 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:37:26,119 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:37:26,119 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:37:26,119 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:37:26,119 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:37:26,119 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:37:26,119 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:37:26,119 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:37:26,119 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:37:26,119 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:37:26,120 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:37:26,120 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:37:26,120 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:37:26,120 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:37:26,120 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:37:26,120 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:37:26,121 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:37:26,121 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:37:26,121 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:37:26,121 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:37:26,121 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:37:26,121 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:37:26,121 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:37:26,121 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:37:26,121 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:37:26,121 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:37:26,122 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:37:26,122 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:37:26,122 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:37:26,122 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:37:26,122 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:37:26,122 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:37:26,123 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:37:26,123 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:37:26,123 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:37:26,123 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:37:26,123 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:37:26,123 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:37:26,123 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:37:26,124 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:37:26,124 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:37:26,124 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:37:26,124 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:37:26,124 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:37:26,124 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:37:26,125 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:37:26,125 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:37:26,125 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:37:26,125 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:37:26,125 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:37:26,125 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:37:26,126 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:37:26,126 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:37:26,126 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:37:26,126 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:37:26,126 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:37:26,126 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:37:26,127 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:37:26,127 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:37:26,127 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:37:26,127 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:37:26,127 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:37:26,127 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:37:26,127 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:37:26,128 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:37:26,128 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:37:26,128 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:37:26,128 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:37:26,128 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:37:26,128 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:37:26,128 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:37:26,129 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:37:26,129 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:37:26,129 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:37:26,129 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:37:26,129 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:37:26,129 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:37:26,129 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:37:26,129 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:37:26,130 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:37:26,130 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:37:26,130 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:37:26,130 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:37:26,130 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:37:26,130 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:37:26,131 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:37:26,131 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:37:26,131 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:37:26,131 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:37:26,131 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:37:26,132 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:37:26,132 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:37:26,132 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:37:26,132 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:37:26,132 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:37:26,132 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:37:26,132 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:37:26,133 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:37:26,133 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:37:26,133 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:37:26,133 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:37:26,133 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:37:26,133 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:37:26,133 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:37:26,134 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:37:26,134 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:37:26,134 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:37:26,134 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:37:26,134 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:37:26,134 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:37:26,135 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:37:26,135 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:37:26,135 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:37:26,135 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:37:26,135 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:37:26,135 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:37:26,135 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:37:26,140 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-02 01:37:26,140 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 01:37:26,147 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-02 01:37:26,157 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-02 01:37:26,171 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 01:37:26,171 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 01:37:26,171 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 01:37:26,171 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 01:37:26,172 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 01:37:26,172 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 01:37:26,172 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 01:37:26,172 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 01:37:26,178 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 132places, 164 transitions [2018-12-02 01:37:27,291 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 27856 states. [2018-12-02 01:37:27,292 INFO L276 IsEmpty]: Start isEmpty. Operand 27856 states. [2018-12-02 01:37:27,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-02 01:37:27,298 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:37:27,298 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] [2018-12-02 01:37:27,299 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:37:27,303 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:37:27,303 INFO L82 PathProgramCache]: Analyzing trace with hash 180674909, now seen corresponding path program 1 times [2018-12-02 01:37:27,304 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:37:27,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:37:27,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:37:27,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:37:27,338 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:37:27,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:37:27,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:37:27,456 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:37:27,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:37:27,456 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:37:27,459 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:37:27,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:37:27,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:37:27,468 INFO L87 Difference]: Start difference. First operand 27856 states. Second operand 4 states. [2018-12-02 01:37:27,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:37:27,839 INFO L93 Difference]: Finished difference Result 47768 states and 183119 transitions. [2018-12-02 01:37:27,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:37:27,840 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2018-12-02 01:37:27,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:37:27,975 INFO L225 Difference]: With dead ends: 47768 [2018-12-02 01:37:27,975 INFO L226 Difference]: Without dead ends: 34608 [2018-12-02 01:37:27,976 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 01:37:28,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34608 states. [2018-12-02 01:37:28,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34608 to 21756. [2018-12-02 01:37:28,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21756 states. [2018-12-02 01:37:28,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21756 states to 21756 states and 83441 transitions. [2018-12-02 01:37:28,615 INFO L78 Accepts]: Start accepts. Automaton has 21756 states and 83441 transitions. Word has length 39 [2018-12-02 01:37:28,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:37:28,616 INFO L480 AbstractCegarLoop]: Abstraction has 21756 states and 83441 transitions. [2018-12-02 01:37:28,616 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:37:28,616 INFO L276 IsEmpty]: Start isEmpty. Operand 21756 states and 83441 transitions. [2018-12-02 01:37:28,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-02 01:37:28,620 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:37:28,621 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:37:28,621 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:37:28,621 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:37:28,621 INFO L82 PathProgramCache]: Analyzing trace with hash 2098734837, now seen corresponding path program 1 times [2018-12-02 01:37:28,621 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:37:28,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:37:28,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:37:28,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:37:28,624 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:37:28,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:37:28,675 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 01:37:28,676 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:37:28,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 01:37:28,676 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:37:28,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 01:37:28,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 01:37:28,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:37:28,678 INFO L87 Difference]: Start difference. First operand 21756 states and 83441 transitions. Second operand 5 states. [2018-12-02 01:37:29,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:37:29,200 INFO L93 Difference]: Finished difference Result 47634 states and 173802 transitions. [2018-12-02 01:37:29,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 01:37:29,201 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2018-12-02 01:37:29,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:37:29,290 INFO L225 Difference]: With dead ends: 47634 [2018-12-02 01:37:29,290 INFO L226 Difference]: Without dead ends: 47066 [2018-12-02 01:37:29,291 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 01:37:29,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47066 states. [2018-12-02 01:37:29,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47066 to 31796. [2018-12-02 01:37:29,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31796 states. [2018-12-02 01:37:29,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31796 states to 31796 states and 116819 transitions. [2018-12-02 01:37:29,932 INFO L78 Accepts]: Start accepts. Automaton has 31796 states and 116819 transitions. Word has length 47 [2018-12-02 01:37:29,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:37:29,933 INFO L480 AbstractCegarLoop]: Abstraction has 31796 states and 116819 transitions. [2018-12-02 01:37:29,933 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 01:37:29,933 INFO L276 IsEmpty]: Start isEmpty. Operand 31796 states and 116819 transitions. [2018-12-02 01:37:29,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-02 01:37:29,936 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:37:29,936 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:37:29,936 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:37:29,936 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:37:29,936 INFO L82 PathProgramCache]: Analyzing trace with hash -7906472, now seen corresponding path program 1 times [2018-12-02 01:37:29,936 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:37:29,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:37:29,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:37:29,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:37:29,938 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:37:29,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:37:29,978 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 01:37:29,978 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:37:29,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 01:37:29,978 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:37:29,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 01:37:29,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 01:37:29,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:37:29,979 INFO L87 Difference]: Start difference. First operand 31796 states and 116819 transitions. Second operand 5 states. [2018-12-02 01:37:30,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:37:30,324 INFO L93 Difference]: Finished difference Result 63028 states and 229114 transitions. [2018-12-02 01:37:30,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 01:37:30,324 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2018-12-02 01:37:30,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:37:30,428 INFO L225 Difference]: With dead ends: 63028 [2018-12-02 01:37:30,429 INFO L226 Difference]: Without dead ends: 62564 [2018-12-02 01:37:30,429 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 01:37:30,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62564 states. [2018-12-02 01:37:31,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62564 to 35364. [2018-12-02 01:37:31,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35364 states. [2018-12-02 01:37:31,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35364 states to 35364 states and 128877 transitions. [2018-12-02 01:37:31,247 INFO L78 Accepts]: Start accepts. Automaton has 35364 states and 128877 transitions. Word has length 48 [2018-12-02 01:37:31,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:37:31,247 INFO L480 AbstractCegarLoop]: Abstraction has 35364 states and 128877 transitions. [2018-12-02 01:37:31,247 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 01:37:31,247 INFO L276 IsEmpty]: Start isEmpty. Operand 35364 states and 128877 transitions. [2018-12-02 01:37:31,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-02 01:37:31,251 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:37:31,251 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] [2018-12-02 01:37:31,251 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:37:31,251 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:37:31,251 INFO L82 PathProgramCache]: Analyzing trace with hash 1874387838, now seen corresponding path program 1 times [2018-12-02 01:37:31,251 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:37:31,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:37:31,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:37:31,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:37:31,253 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:37:31,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:37:31,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:37:31,279 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:37:31,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 01:37:31,279 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:37:31,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 01:37:31,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 01:37:31,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 01:37:31,280 INFO L87 Difference]: Start difference. First operand 35364 states and 128877 transitions. Second operand 3 states. [2018-12-02 01:37:31,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:37:31,424 INFO L93 Difference]: Finished difference Result 45910 states and 163945 transitions. [2018-12-02 01:37:31,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 01:37:31,425 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-12-02 01:37:31,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:37:31,493 INFO L225 Difference]: With dead ends: 45910 [2018-12-02 01:37:31,493 INFO L226 Difference]: Without dead ends: 45910 [2018-12-02 01:37:31,493 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 01:37:31,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45910 states. [2018-12-02 01:37:31,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45910 to 40247. [2018-12-02 01:37:31,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40247 states. [2018-12-02 01:37:32,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40247 states to 40247 states and 145215 transitions. [2018-12-02 01:37:32,213 INFO L78 Accepts]: Start accepts. Automaton has 40247 states and 145215 transitions. Word has length 50 [2018-12-02 01:37:32,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:37:32,213 INFO L480 AbstractCegarLoop]: Abstraction has 40247 states and 145215 transitions. [2018-12-02 01:37:32,213 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 01:37:32,214 INFO L276 IsEmpty]: Start isEmpty. Operand 40247 states and 145215 transitions. [2018-12-02 01:37:32,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-02 01:37:32,219 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:37:32,219 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 01:37:32,220 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:37:32,220 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:37:32,220 INFO L82 PathProgramCache]: Analyzing trace with hash -249286711, now seen corresponding path program 1 times [2018-12-02 01:37:32,220 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:37:32,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:37:32,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:37:32,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:37:32,221 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:37:32,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:37:32,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 01:37:32,265 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:37:32,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 01:37:32,265 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:37:32,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 01:37:32,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 01:37:32,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 01:37:32,265 INFO L87 Difference]: Start difference. First operand 40247 states and 145215 transitions. Second operand 6 states. [2018-12-02 01:37:32,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:37:32,709 INFO L93 Difference]: Finished difference Result 70850 states and 252355 transitions. [2018-12-02 01:37:32,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 01:37:32,709 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2018-12-02 01:37:32,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:37:32,825 INFO L225 Difference]: With dead ends: 70850 [2018-12-02 01:37:32,825 INFO L226 Difference]: Without dead ends: 70314 [2018-12-02 01:37:32,826 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 01:37:33,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70314 states. [2018-12-02 01:37:33,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70314 to 40898. [2018-12-02 01:37:33,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40898 states. [2018-12-02 01:37:33,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40898 states to 40898 states and 147668 transitions. [2018-12-02 01:37:33,551 INFO L78 Accepts]: Start accepts. Automaton has 40898 states and 147668 transitions. Word has length 54 [2018-12-02 01:37:33,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:37:33,551 INFO L480 AbstractCegarLoop]: Abstraction has 40898 states and 147668 transitions. [2018-12-02 01:37:33,551 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 01:37:33,551 INFO L276 IsEmpty]: Start isEmpty. Operand 40898 states and 147668 transitions. [2018-12-02 01:37:33,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-02 01:37:33,557 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:37:33,558 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 01:37:33,558 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:37:33,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:37:33,558 INFO L82 PathProgramCache]: Analyzing trace with hash 854385994, now seen corresponding path program 1 times [2018-12-02 01:37:33,558 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:37:33,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:37:33,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:37:33,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:37:33,559 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:37:33,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:37:33,624 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 01:37:33,624 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:37:33,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 01:37:33,625 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:37:33,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 01:37:33,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 01:37:33,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-02 01:37:33,626 INFO L87 Difference]: Start difference. First operand 40898 states and 147668 transitions. Second operand 6 states. [2018-12-02 01:37:34,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:37:34,175 INFO L93 Difference]: Finished difference Result 56599 states and 201648 transitions. [2018-12-02 01:37:34,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 01:37:34,175 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2018-12-02 01:37:34,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:37:34,265 INFO L225 Difference]: With dead ends: 56599 [2018-12-02 01:37:34,266 INFO L226 Difference]: Without dead ends: 55460 [2018-12-02 01:37:34,266 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-02 01:37:34,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55460 states. [2018-12-02 01:37:34,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55460 to 51955. [2018-12-02 01:37:34,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51955 states. [2018-12-02 01:37:34,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51955 states to 51955 states and 186007 transitions. [2018-12-02 01:37:34,999 INFO L78 Accepts]: Start accepts. Automaton has 51955 states and 186007 transitions. Word has length 54 [2018-12-02 01:37:34,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:37:34,999 INFO L480 AbstractCegarLoop]: Abstraction has 51955 states and 186007 transitions. [2018-12-02 01:37:34,999 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 01:37:34,999 INFO L276 IsEmpty]: Start isEmpty. Operand 51955 states and 186007 transitions. [2018-12-02 01:37:35,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-02 01:37:35,008 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:37:35,008 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 01:37:35,008 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:37:35,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:37:35,009 INFO L82 PathProgramCache]: Analyzing trace with hash -942565365, now seen corresponding path program 1 times [2018-12-02 01:37:35,009 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:37:35,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:37:35,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:37:35,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:37:35,010 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:37:35,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:37:35,063 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 01:37:35,063 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:37:35,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 01:37:35,064 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:37:35,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 01:37:35,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 01:37:35,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 01:37:35,064 INFO L87 Difference]: Start difference. First operand 51955 states and 186007 transitions. Second operand 7 states. [2018-12-02 01:37:35,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:37:35,719 INFO L93 Difference]: Finished difference Result 75638 states and 260104 transitions. [2018-12-02 01:37:35,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 01:37:35,719 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2018-12-02 01:37:35,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:37:35,838 INFO L225 Difference]: With dead ends: 75638 [2018-12-02 01:37:35,838 INFO L226 Difference]: Without dead ends: 75638 [2018-12-02 01:37:35,839 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-12-02 01:37:36,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75638 states. [2018-12-02 01:37:36,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75638 to 61473. [2018-12-02 01:37:36,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61473 states. [2018-12-02 01:37:36,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61473 states to 61473 states and 215184 transitions. [2018-12-02 01:37:36,801 INFO L78 Accepts]: Start accepts. Automaton has 61473 states and 215184 transitions. Word has length 54 [2018-12-02 01:37:36,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:37:36,801 INFO L480 AbstractCegarLoop]: Abstraction has 61473 states and 215184 transitions. [2018-12-02 01:37:36,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 01:37:36,801 INFO L276 IsEmpty]: Start isEmpty. Operand 61473 states and 215184 transitions. [2018-12-02 01:37:36,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-02 01:37:36,810 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:37:36,810 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 01:37:36,810 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:37:36,810 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:37:36,810 INFO L82 PathProgramCache]: Analyzing trace with hash -55061684, now seen corresponding path program 1 times [2018-12-02 01:37:36,810 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:37:36,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:37:36,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:37:36,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:37:36,812 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:37:36,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:37:36,842 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 01:37:36,842 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:37:36,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:37:36,843 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:37:36,843 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:37:36,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:37:36,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:37:36,843 INFO L87 Difference]: Start difference. First operand 61473 states and 215184 transitions. Second operand 4 states. [2018-12-02 01:37:36,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:37:36,914 INFO L93 Difference]: Finished difference Result 13778 states and 43274 transitions. [2018-12-02 01:37:36,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 01:37:36,914 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2018-12-02 01:37:36,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:37:36,927 INFO L225 Difference]: With dead ends: 13778 [2018-12-02 01:37:36,927 INFO L226 Difference]: Without dead ends: 12161 [2018-12-02 01:37:36,927 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 01:37:36,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12161 states. [2018-12-02 01:37:37,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12161 to 12113. [2018-12-02 01:37:37,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12113 states. [2018-12-02 01:37:37,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12113 states to 12113 states and 37958 transitions. [2018-12-02 01:37:37,042 INFO L78 Accepts]: Start accepts. Automaton has 12113 states and 37958 transitions. Word has length 54 [2018-12-02 01:37:37,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:37:37,042 INFO L480 AbstractCegarLoop]: Abstraction has 12113 states and 37958 transitions. [2018-12-02 01:37:37,042 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:37:37,042 INFO L276 IsEmpty]: Start isEmpty. Operand 12113 states and 37958 transitions. [2018-12-02 01:37:37,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-02 01:37:37,046 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:37:37,046 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:37:37,046 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:37:37,046 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:37:37,046 INFO L82 PathProgramCache]: Analyzing trace with hash 751631644, now seen corresponding path program 1 times [2018-12-02 01:37:37,046 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:37:37,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:37:37,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:37:37,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:37:37,047 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:37:37,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:37:37,091 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 01:37:37,091 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:37:37,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 01:37:37,091 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:37:37,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 01:37:37,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 01:37:37,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 01:37:37,092 INFO L87 Difference]: Start difference. First operand 12113 states and 37958 transitions. Second operand 6 states. [2018-12-02 01:37:37,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:37:37,444 INFO L93 Difference]: Finished difference Result 22006 states and 68473 transitions. [2018-12-02 01:37:37,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-02 01:37:37,444 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2018-12-02 01:37:37,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:37:37,469 INFO L225 Difference]: With dead ends: 22006 [2018-12-02 01:37:37,469 INFO L226 Difference]: Without dead ends: 21942 [2018-12-02 01:37:37,469 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-12-02 01:37:37,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21942 states. [2018-12-02 01:37:37,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21942 to 13082. [2018-12-02 01:37:37,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13082 states. [2018-12-02 01:37:37,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13082 states to 13082 states and 40746 transitions. [2018-12-02 01:37:37,643 INFO L78 Accepts]: Start accepts. Automaton has 13082 states and 40746 transitions. Word has length 64 [2018-12-02 01:37:37,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:37:37,643 INFO L480 AbstractCegarLoop]: Abstraction has 13082 states and 40746 transitions. [2018-12-02 01:37:37,643 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 01:37:37,643 INFO L276 IsEmpty]: Start isEmpty. Operand 13082 states and 40746 transitions. [2018-12-02 01:37:37,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-02 01:37:37,648 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:37:37,648 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] [2018-12-02 01:37:37,648 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:37:37,648 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:37:37,648 INFO L82 PathProgramCache]: Analyzing trace with hash 312014749, now seen corresponding path program 1 times [2018-12-02 01:37:37,648 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:37:37,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:37:37,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:37:37,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:37:37,650 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:37:37,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:37:37,687 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 01:37:37,687 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:37:37,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 01:37:37,687 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:37:37,687 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 01:37:37,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 01:37:37,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:37:37,688 INFO L87 Difference]: Start difference. First operand 13082 states and 40746 transitions. Second operand 5 states. [2018-12-02 01:37:37,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:37:37,874 INFO L93 Difference]: Finished difference Result 18936 states and 57626 transitions. [2018-12-02 01:37:37,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 01:37:37,874 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2018-12-02 01:37:37,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:37:37,893 INFO L225 Difference]: With dead ends: 18936 [2018-12-02 01:37:37,893 INFO L226 Difference]: Without dead ends: 18864 [2018-12-02 01:37:37,893 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-12-02 01:37:37,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18864 states. [2018-12-02 01:37:38,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18864 to 14593. [2018-12-02 01:37:38,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14593 states. [2018-12-02 01:37:38,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14593 states to 14593 states and 44939 transitions. [2018-12-02 01:37:38,050 INFO L78 Accepts]: Start accepts. Automaton has 14593 states and 44939 transitions. Word has length 66 [2018-12-02 01:37:38,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:37:38,050 INFO L480 AbstractCegarLoop]: Abstraction has 14593 states and 44939 transitions. [2018-12-02 01:37:38,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 01:37:38,050 INFO L276 IsEmpty]: Start isEmpty. Operand 14593 states and 44939 transitions. [2018-12-02 01:37:38,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-02 01:37:38,056 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:37:38,057 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] [2018-12-02 01:37:38,057 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:37:38,057 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:37:38,057 INFO L82 PathProgramCache]: Analyzing trace with hash 100663836, now seen corresponding path program 1 times [2018-12-02 01:37:38,057 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:37:38,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:37:38,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:37:38,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:37:38,058 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:37:38,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:37:38,088 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 01:37:38,088 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:37:38,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:37:38,088 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:37:38,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:37:38,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:37:38,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:37:38,089 INFO L87 Difference]: Start difference. First operand 14593 states and 44939 transitions. Second operand 4 states. [2018-12-02 01:37:38,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:37:38,255 INFO L93 Difference]: Finished difference Result 18063 states and 54942 transitions. [2018-12-02 01:37:38,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:37:38,256 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2018-12-02 01:37:38,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:37:38,276 INFO L225 Difference]: With dead ends: 18063 [2018-12-02 01:37:38,276 INFO L226 Difference]: Without dead ends: 18063 [2018-12-02 01:37:38,277 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 01:37:38,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18063 states. [2018-12-02 01:37:38,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18063 to 14853. [2018-12-02 01:37:38,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14853 states. [2018-12-02 01:37:38,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14853 states to 14853 states and 45667 transitions. [2018-12-02 01:37:38,468 INFO L78 Accepts]: Start accepts. Automaton has 14853 states and 45667 transitions. Word has length 66 [2018-12-02 01:37:38,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:37:38,469 INFO L480 AbstractCegarLoop]: Abstraction has 14853 states and 45667 transitions. [2018-12-02 01:37:38,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:37:38,469 INFO L276 IsEmpty]: Start isEmpty. Operand 14853 states and 45667 transitions. [2018-12-02 01:37:38,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-02 01:37:38,475 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:37:38,475 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] [2018-12-02 01:37:38,475 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:37:38,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:37:38,475 INFO L82 PathProgramCache]: Analyzing trace with hash -1976545507, now seen corresponding path program 1 times [2018-12-02 01:37:38,476 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:37:38,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:37:38,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:37:38,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:37:38,477 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:37:38,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:37:38,503 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 01:37:38,503 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:37:38,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 01:37:38,504 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:37:38,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 01:37:38,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 01:37:38,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 01:37:38,504 INFO L87 Difference]: Start difference. First operand 14853 states and 45667 transitions. Second operand 3 states. [2018-12-02 01:37:38,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:37:38,633 INFO L93 Difference]: Finished difference Result 15321 states and 46968 transitions. [2018-12-02 01:37:38,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 01:37:38,633 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-12-02 01:37:38,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:37:38,647 INFO L225 Difference]: With dead ends: 15321 [2018-12-02 01:37:38,647 INFO L226 Difference]: Without dead ends: 15321 [2018-12-02 01:37:38,648 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 01:37:38,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15321 states. [2018-12-02 01:37:38,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15321 to 15087. [2018-12-02 01:37:38,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15087 states. [2018-12-02 01:37:38,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15087 states to 15087 states and 46302 transitions. [2018-12-02 01:37:38,786 INFO L78 Accepts]: Start accepts. Automaton has 15087 states and 46302 transitions. Word has length 66 [2018-12-02 01:37:38,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:37:38,786 INFO L480 AbstractCegarLoop]: Abstraction has 15087 states and 46302 transitions. [2018-12-02 01:37:38,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 01:37:38,786 INFO L276 IsEmpty]: Start isEmpty. Operand 15087 states and 46302 transitions. [2018-12-02 01:37:38,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-02 01:37:38,794 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:37:38,794 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] [2018-12-02 01:37:38,794 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:37:38,794 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:37:38,794 INFO L82 PathProgramCache]: Analyzing trace with hash -4461880, now seen corresponding path program 1 times [2018-12-02 01:37:38,794 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:37:38,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:37:38,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:37:38,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:37:38,795 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:37:38,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:37:38,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:37:38,848 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:37:38,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 01:37:38,848 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:37:38,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 01:37:38,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 01:37:38,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 01:37:38,849 INFO L87 Difference]: Start difference. First operand 15087 states and 46302 transitions. Second operand 6 states. [2018-12-02 01:37:39,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:37:39,238 INFO L93 Difference]: Finished difference Result 18372 states and 55442 transitions. [2018-12-02 01:37:39,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 01:37:39,239 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2018-12-02 01:37:39,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:37:39,257 INFO L225 Difference]: With dead ends: 18372 [2018-12-02 01:37:39,257 INFO L226 Difference]: Without dead ends: 18372 [2018-12-02 01:37:39,258 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 01:37:39,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18372 states. [2018-12-02 01:37:39,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18372 to 16985. [2018-12-02 01:37:39,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16985 states. [2018-12-02 01:37:39,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16985 states to 16985 states and 51614 transitions. [2018-12-02 01:37:39,425 INFO L78 Accepts]: Start accepts. Automaton has 16985 states and 51614 transitions. Word has length 68 [2018-12-02 01:37:39,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:37:39,425 INFO L480 AbstractCegarLoop]: Abstraction has 16985 states and 51614 transitions. [2018-12-02 01:37:39,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 01:37:39,425 INFO L276 IsEmpty]: Start isEmpty. Operand 16985 states and 51614 transitions. [2018-12-02 01:37:39,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-02 01:37:39,434 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:37:39,434 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] [2018-12-02 01:37:39,434 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:37:39,434 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:37:39,434 INFO L82 PathProgramCache]: Analyzing trace with hash -2081671223, now seen corresponding path program 1 times [2018-12-02 01:37:39,434 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:37:39,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:37:39,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:37:39,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:37:39,435 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:37:39,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:37:39,501 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 01:37:39,501 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:37:39,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 01:37:39,501 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:37:39,501 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 01:37:39,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 01:37:39,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 01:37:39,501 INFO L87 Difference]: Start difference. First operand 16985 states and 51614 transitions. Second operand 6 states. [2018-12-02 01:37:39,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:37:39,706 INFO L93 Difference]: Finished difference Result 18713 states and 55989 transitions. [2018-12-02 01:37:39,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 01:37:39,707 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2018-12-02 01:37:39,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:37:39,726 INFO L225 Difference]: With dead ends: 18713 [2018-12-02 01:37:39,726 INFO L226 Difference]: Without dead ends: 18713 [2018-12-02 01:37:39,726 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-02 01:37:39,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18713 states. [2018-12-02 01:37:39,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18713 to 17253. [2018-12-02 01:37:39,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17253 states. [2018-12-02 01:37:39,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17253 states to 17253 states and 52053 transitions. [2018-12-02 01:37:39,889 INFO L78 Accepts]: Start accepts. Automaton has 17253 states and 52053 transitions. Word has length 68 [2018-12-02 01:37:39,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:37:39,890 INFO L480 AbstractCegarLoop]: Abstraction has 17253 states and 52053 transitions. [2018-12-02 01:37:39,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 01:37:39,890 INFO L276 IsEmpty]: Start isEmpty. Operand 17253 states and 52053 transitions. [2018-12-02 01:37:39,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-02 01:37:39,897 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:37:39,897 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] [2018-12-02 01:37:39,897 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:37:39,897 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:37:39,897 INFO L82 PathProgramCache]: Analyzing trace with hash -1870320310, now seen corresponding path program 1 times [2018-12-02 01:37:39,897 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:37:39,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:37:39,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:37:39,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:37:39,898 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:37:39,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:37:39,934 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 01:37:39,934 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:37:39,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 01:37:39,934 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:37:39,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 01:37:39,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 01:37:39,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:37:39,935 INFO L87 Difference]: Start difference. First operand 17253 states and 52053 transitions. Second operand 5 states. [2018-12-02 01:37:40,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:37:40,187 INFO L93 Difference]: Finished difference Result 25141 states and 75022 transitions. [2018-12-02 01:37:40,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 01:37:40,187 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2018-12-02 01:37:40,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:37:40,215 INFO L225 Difference]: With dead ends: 25141 [2018-12-02 01:37:40,215 INFO L226 Difference]: Without dead ends: 25141 [2018-12-02 01:37:40,215 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-02 01:37:40,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25141 states. [2018-12-02 01:37:40,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25141 to 19615. [2018-12-02 01:37:40,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19615 states. [2018-12-02 01:37:40,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19615 states to 19615 states and 58937 transitions. [2018-12-02 01:37:40,435 INFO L78 Accepts]: Start accepts. Automaton has 19615 states and 58937 transitions. Word has length 68 [2018-12-02 01:37:40,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:37:40,436 INFO L480 AbstractCegarLoop]: Abstraction has 19615 states and 58937 transitions. [2018-12-02 01:37:40,436 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 01:37:40,436 INFO L276 IsEmpty]: Start isEmpty. Operand 19615 states and 58937 transitions. [2018-12-02 01:37:40,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-02 01:37:40,444 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:37:40,444 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] [2018-12-02 01:37:40,444 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:37:40,445 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:37:40,445 INFO L82 PathProgramCache]: Analyzing trace with hash 617192523, now seen corresponding path program 1 times [2018-12-02 01:37:40,445 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:37:40,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:37:40,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:37:40,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:37:40,446 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:37:40,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:37:40,505 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 01:37:40,505 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:37:40,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 01:37:40,505 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:37:40,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 01:37:40,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 01:37:40,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 01:37:40,505 INFO L87 Difference]: Start difference. First operand 19615 states and 58937 transitions. Second operand 6 states. [2018-12-02 01:37:40,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:37:40,586 INFO L93 Difference]: Finished difference Result 18683 states and 52718 transitions. [2018-12-02 01:37:40,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 01:37:40,586 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2018-12-02 01:37:40,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:37:40,602 INFO L225 Difference]: With dead ends: 18683 [2018-12-02 01:37:40,602 INFO L226 Difference]: Without dead ends: 18683 [2018-12-02 01:37:40,602 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 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 01:37:40,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18683 states. [2018-12-02 01:37:40,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18683 to 15605. [2018-12-02 01:37:40,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15605 states. [2018-12-02 01:37:40,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15605 states to 15605 states and 44281 transitions. [2018-12-02 01:37:40,757 INFO L78 Accepts]: Start accepts. Automaton has 15605 states and 44281 transitions. Word has length 68 [2018-12-02 01:37:40,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:37:40,757 INFO L480 AbstractCegarLoop]: Abstraction has 15605 states and 44281 transitions. [2018-12-02 01:37:40,757 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 01:37:40,757 INFO L276 IsEmpty]: Start isEmpty. Operand 15605 states and 44281 transitions. [2018-12-02 01:37:40,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-02 01:37:40,763 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:37:40,763 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] [2018-12-02 01:37:40,763 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:37:40,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:37:40,763 INFO L82 PathProgramCache]: Analyzing trace with hash -292255155, now seen corresponding path program 1 times [2018-12-02 01:37:40,764 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:37:40,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:37:40,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:37:40,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:37:40,765 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:37:40,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:37:40,794 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 01:37:40,794 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:37:40,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 01:37:40,794 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:37:40,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 01:37:40,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 01:37:40,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:37:40,794 INFO L87 Difference]: Start difference. First operand 15605 states and 44281 transitions. Second operand 5 states. [2018-12-02 01:37:40,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:37:40,825 INFO L93 Difference]: Finished difference Result 4337 states and 10398 transitions. [2018-12-02 01:37:40,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 01:37:40,826 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2018-12-02 01:37:40,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:37:40,828 INFO L225 Difference]: With dead ends: 4337 [2018-12-02 01:37:40,828 INFO L226 Difference]: Without dead ends: 3471 [2018-12-02 01:37:40,829 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 01:37:40,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3471 states. [2018-12-02 01:37:40,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3471 to 2915. [2018-12-02 01:37:40,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2915 states. [2018-12-02 01:37:40,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2915 states to 2915 states and 6809 transitions. [2018-12-02 01:37:40,851 INFO L78 Accepts]: Start accepts. Automaton has 2915 states and 6809 transitions. Word has length 68 [2018-12-02 01:37:40,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:37:40,851 INFO L480 AbstractCegarLoop]: Abstraction has 2915 states and 6809 transitions. [2018-12-02 01:37:40,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 01:37:40,851 INFO L276 IsEmpty]: Start isEmpty. Operand 2915 states and 6809 transitions. [2018-12-02 01:37:40,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-02 01:37:40,853 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:37:40,853 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] [2018-12-02 01:37:40,853 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:37:40,854 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:37:40,854 INFO L82 PathProgramCache]: Analyzing trace with hash 431063603, now seen corresponding path program 1 times [2018-12-02 01:37:40,854 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:37:40,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:37:40,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:37:40,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:37:40,855 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:37:40,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:37:40,924 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 01:37:40,924 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:37:40,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 01:37:40,924 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:37:40,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 01:37:40,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 01:37:40,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 01:37:40,925 INFO L87 Difference]: Start difference. First operand 2915 states and 6809 transitions. Second operand 6 states. [2018-12-02 01:37:41,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:37:41,025 INFO L93 Difference]: Finished difference Result 3378 states and 7784 transitions. [2018-12-02 01:37:41,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 01:37:41,025 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 85 [2018-12-02 01:37:41,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:37:41,027 INFO L225 Difference]: With dead ends: 3378 [2018-12-02 01:37:41,027 INFO L226 Difference]: Without dead ends: 3320 [2018-12-02 01:37:41,028 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-02 01:37:41,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3320 states. [2018-12-02 01:37:41,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3320 to 2739. [2018-12-02 01:37:41,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2739 states. [2018-12-02 01:37:41,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2739 states to 2739 states and 6296 transitions. [2018-12-02 01:37:41,047 INFO L78 Accepts]: Start accepts. Automaton has 2739 states and 6296 transitions. Word has length 85 [2018-12-02 01:37:41,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:37:41,048 INFO L480 AbstractCegarLoop]: Abstraction has 2739 states and 6296 transitions. [2018-12-02 01:37:41,048 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 01:37:41,048 INFO L276 IsEmpty]: Start isEmpty. Operand 2739 states and 6296 transitions. [2018-12-02 01:37:41,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-02 01:37:41,049 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:37:41,049 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:37:41,049 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:37:41,050 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:37:41,050 INFO L82 PathProgramCache]: Analyzing trace with hash -1646145740, now seen corresponding path program 1 times [2018-12-02 01:37:41,050 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:37:41,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:37:41,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:37:41,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:37:41,051 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:37:41,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:37:41,127 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 01:37:41,128 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:37:41,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-02 01:37:41,128 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:37:41,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 01:37:41,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 01:37:41,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-02 01:37:41,129 INFO L87 Difference]: Start difference. First operand 2739 states and 6296 transitions. Second operand 10 states. [2018-12-02 01:37:41,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:37:41,433 INFO L93 Difference]: Finished difference Result 7385 states and 17158 transitions. [2018-12-02 01:37:41,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 01:37:41,433 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 85 [2018-12-02 01:37:41,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:37:41,435 INFO L225 Difference]: With dead ends: 7385 [2018-12-02 01:37:41,435 INFO L226 Difference]: Without dead ends: 2152 [2018-12-02 01:37:41,435 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=124, Invalid=296, Unknown=0, NotChecked=0, Total=420 [2018-12-02 01:37:41,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2152 states. [2018-12-02 01:37:41,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2152 to 2152. [2018-12-02 01:37:41,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2152 states. [2018-12-02 01:37:41,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2152 states to 2152 states and 4978 transitions. [2018-12-02 01:37:41,448 INFO L78 Accepts]: Start accepts. Automaton has 2152 states and 4978 transitions. Word has length 85 [2018-12-02 01:37:41,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:37:41,448 INFO L480 AbstractCegarLoop]: Abstraction has 2152 states and 4978 transitions. [2018-12-02 01:37:41,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 01:37:41,448 INFO L276 IsEmpty]: Start isEmpty. Operand 2152 states and 4978 transitions. [2018-12-02 01:37:41,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-02 01:37:41,450 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:37:41,450 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] [2018-12-02 01:37:41,450 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:37:41,450 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:37:41,450 INFO L82 PathProgramCache]: Analyzing trace with hash -1642863003, now seen corresponding path program 2 times [2018-12-02 01:37:41,450 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:37:41,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:37:41,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:37:41,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:37:41,451 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:37:41,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:37:41,518 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 01:37:41,519 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:37:41,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 01:37:41,519 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:37:41,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 01:37:41,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 01:37:41,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-02 01:37:41,519 INFO L87 Difference]: Start difference. First operand 2152 states and 4978 transitions. Second operand 7 states. [2018-12-02 01:37:41,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:37:41,719 INFO L93 Difference]: Finished difference Result 2501 states and 5730 transitions. [2018-12-02 01:37:41,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 01:37:41,719 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 85 [2018-12-02 01:37:41,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:37:41,722 INFO L225 Difference]: With dead ends: 2501 [2018-12-02 01:37:41,722 INFO L226 Difference]: Without dead ends: 2501 [2018-12-02 01:37:41,722 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 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 01:37:41,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2501 states. [2018-12-02 01:37:41,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2501 to 2096. [2018-12-02 01:37:41,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2096 states. [2018-12-02 01:37:41,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2096 states to 2096 states and 4860 transitions. [2018-12-02 01:37:41,738 INFO L78 Accepts]: Start accepts. Automaton has 2096 states and 4860 transitions. Word has length 85 [2018-12-02 01:37:41,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:37:41,738 INFO L480 AbstractCegarLoop]: Abstraction has 2096 states and 4860 transitions. [2018-12-02 01:37:41,738 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 01:37:41,738 INFO L276 IsEmpty]: Start isEmpty. Operand 2096 states and 4860 transitions. [2018-12-02 01:37:41,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-02 01:37:41,739 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:37:41,739 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] [2018-12-02 01:37:41,739 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:37:41,739 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:37:41,739 INFO L82 PathProgramCache]: Analyzing trace with hash -1183705260, now seen corresponding path program 2 times [2018-12-02 01:37:41,740 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:37:41,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:37:41,740 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 01:37:41,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:37:41,740 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:37:41,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:37:41,842 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 01:37:41,842 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:37:41,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-02 01:37:41,842 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:37:41,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 01:37:41,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 01:37:41,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-02 01:37:41,843 INFO L87 Difference]: Start difference. First operand 2096 states and 4860 transitions. Second operand 11 states. [2018-12-02 01:37:42,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:37:42,359 INFO L93 Difference]: Finished difference Result 3613 states and 8353 transitions. [2018-12-02 01:37:42,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 01:37:42,359 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 85 [2018-12-02 01:37:42,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:37:42,361 INFO L225 Difference]: With dead ends: 3613 [2018-12-02 01:37:42,361 INFO L226 Difference]: Without dead ends: 2360 [2018-12-02 01:37:42,361 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 01:37:42,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2360 states. [2018-12-02 01:37:42,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2360 to 2145. [2018-12-02 01:37:42,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2145 states. [2018-12-02 01:37:42,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2145 states to 2145 states and 4915 transitions. [2018-12-02 01:37:42,376 INFO L78 Accepts]: Start accepts. Automaton has 2145 states and 4915 transitions. Word has length 85 [2018-12-02 01:37:42,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:37:42,376 INFO L480 AbstractCegarLoop]: Abstraction has 2145 states and 4915 transitions. [2018-12-02 01:37:42,376 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 01:37:42,376 INFO L276 IsEmpty]: Start isEmpty. Operand 2145 states and 4915 transitions. [2018-12-02 01:37:42,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-02 01:37:42,377 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:37:42,378 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] [2018-12-02 01:37:42,378 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:37:42,378 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:37:42,378 INFO L82 PathProgramCache]: Analyzing trace with hash -783897228, now seen corresponding path program 3 times [2018-12-02 01:37:42,378 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:37:42,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:37:42,379 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 01:37:42,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:37:42,380 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:37:42,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 01:37:42,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 01:37:42,423 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 01:37:42,507 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-02 01:37:42,508 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 01:37:42 BasicIcfg [2018-12-02 01:37:42,509 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 01:37:42,509 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 01:37:42,509 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 01:37:42,509 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 01:37:42,509 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:37:26" (3/4) ... [2018-12-02 01:37:42,511 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-02 01:37:42,575 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_4bda6a0c-d4c3-4fff-8a0c-afd9687cf215/bin-2019/utaipan/witness.graphml [2018-12-02 01:37:42,575 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 01:37:42,575 INFO L168 Benchmark]: Toolchain (without parser) took 17208.70 ms. Allocated memory was 1.0 GB in the beginning and 3.5 GB in the end (delta: 2.5 GB). Free memory was 954.9 MB in the beginning and 2.8 GB in the end (delta: -1.8 GB). Peak memory consumption was 696.7 MB. Max. memory is 11.5 GB. [2018-12-02 01:37:42,576 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 01:37:42,576 INFO L168 Benchmark]: CACSL2BoogieTranslator took 336.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 954.9 MB in the beginning and 1.1 GB in the end (delta: -169.8 MB). Peak memory consumption was 31.4 MB. Max. memory is 11.5 GB. [2018-12-02 01:37:42,577 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.68 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: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2018-12-02 01:37:42,577 INFO L168 Benchmark]: Boogie Preprocessor took 19.62 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 01:37:42,577 INFO L168 Benchmark]: RCFGBuilder took 330.26 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: 40.8 MB). Peak memory consumption was 40.8 MB. Max. memory is 11.5 GB. [2018-12-02 01:37:42,577 INFO L168 Benchmark]: TraceAbstraction took 16422.23 ms. Allocated memory was 1.2 GB in the beginning and 3.5 GB in the end (delta: 2.4 GB). Free memory was 1.1 GB in the beginning and 2.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 623.2 MB. Max. memory is 11.5 GB. [2018-12-02 01:37:42,577 INFO L168 Benchmark]: Witness Printer took 66.12 ms. Allocated memory is still 3.5 GB. Free memory was 2.8 GB in the beginning and 2.8 GB in the end (delta: 47.1 MB). Peak memory consumption was 47.1 MB. Max. memory is 11.5 GB. [2018-12-02 01:37:42,578 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 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 336.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 954.9 MB in the beginning and 1.1 GB in the end (delta: -169.8 MB). Peak memory consumption was 31.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 30.68 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: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.62 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 330.26 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: 40.8 MB). Peak memory consumption was 40.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 16422.23 ms. Allocated memory was 1.2 GB in the beginning and 3.5 GB in the end (delta: 2.4 GB). Free memory was 1.1 GB in the beginning and 2.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 623.2 MB. Max. memory is 11.5 GB. * Witness Printer took 66.12 ms. Allocated memory is still 3.5 GB. Free memory was 2.8 GB in the beginning and 2.8 GB in the end (delta: 47.1 MB). Peak memory consumption was 47.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L672] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L674] -1 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L676] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L678] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L679] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L680] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L682] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L683] -1 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L684] -1 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L685] -1 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L686] -1 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L687] -1 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L688] -1 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L689] -1 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L690] -1 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L691] -1 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L692] -1 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L693] -1 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L694] -1 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L695] -1 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L696] -1 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L698] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L700] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L701] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L702] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L776] -1 pthread_t t905; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L777] FCALL, FORK -1 pthread_create(&t905, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L778] -1 pthread_t t906; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L779] FCALL, FORK -1 pthread_create(&t906, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L734] 0 x$w_buff1 = x$w_buff0 [L735] 0 x$w_buff0 = 1 [L736] 0 x$w_buff1_used = x$w_buff0_used [L737] 0 x$w_buff0_used = (_Bool)1 [L5] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L739] 0 x$r_buff1_thd0 = x$r_buff0_thd0 [L740] 0 x$r_buff1_thd1 = x$r_buff0_thd1 [L741] 0 x$r_buff1_thd2 = x$r_buff0_thd2 [L742] 0 x$r_buff0_thd2 = (_Bool)1 [L745] 0 y = 1 [L748] 0 __unbuffered_p1_EAX = y [L751] 0 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L754] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L706] 1 z = 1 [L709] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L710] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L711] 1 x$flush_delayed = weak$$choice2 [L712] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L713] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L754] 0 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L755] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L755] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L713] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L714] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L714] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L715] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L715] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L756] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L756] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L757] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L757] 0 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L758] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L758] 0 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L761] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L716] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L716] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L717] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L717] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L718] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L718] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L719] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L719] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L720] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L721] EXPR 1 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$flush_delayed ? x$mem_tmp : x=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L721] 1 x = x$flush_delayed ? x$mem_tmp : x [L722] 1 x$flush_delayed = (_Bool)0 [L727] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L781] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L785] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L785] EXPR -1 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L785] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L785] -1 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L786] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L786] -1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L787] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L787] -1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L788] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L788] -1 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L789] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L789] -1 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L792] -1 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L5] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L5] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 200 locations, 3 error locations. UNSAFE Result, 16.3s OverallTime, 22 OverallIterations, 1 TraceHistogramMax, 6.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5900 SDtfs, 7826 SDslu, 13023 SDs, 0 SdLazy, 5171 SolverSat, 360 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 195 GetRequests, 48 SyntacticMatches, 9 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=61473occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 6.7s AutomataMinimizationTime, 21 MinimizatonAttempts, 137902 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 1427 NumberOfCodeBlocks, 1427 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1321 ConstructedInterpolants, 0 QuantifiedInterpolants, 228572 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 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...