./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix022_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_2b821743-c9b6-4d51-b616-d736463dfd00/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_2b821743-c9b6-4d51-b616-d736463dfd00/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_2b821743-c9b6-4d51-b616-d736463dfd00/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_2b821743-c9b6-4d51-b616-d736463dfd00/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix022_pso.opt_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_2b821743-c9b6-4d51-b616-d736463dfd00/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_2b821743-c9b6-4d51-b616-d736463dfd00/bin-2019/uautomizer --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7f023635c87a3256e501da0baa2258f1eabc71ba .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 05:19:43,009 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 05:19:43,010 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 05:19:43,017 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 05:19:43,018 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 05:19:43,018 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 05:19:43,019 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 05:19:43,020 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 05:19:43,021 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 05:19:43,022 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 05:19:43,023 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 05:19:43,023 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 05:19:43,023 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 05:19:43,024 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 05:19:43,025 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 05:19:43,025 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 05:19:43,026 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 05:19:43,027 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 05:19:43,028 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 05:19:43,029 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 05:19:43,029 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 05:19:43,030 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 05:19:43,031 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 05:19:43,031 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 05:19:43,031 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 05:19:43,031 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 05:19:43,032 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 05:19:43,032 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 05:19:43,033 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 05:19:43,033 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 05:19:43,033 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 05:19:43,034 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 05:19:43,034 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 05:19:43,034 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 05:19:43,034 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 05:19:43,035 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 05:19:43,035 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_2b821743-c9b6-4d51-b616-d736463dfd00/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-02 05:19:43,042 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 05:19:43,042 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 05:19:43,043 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 05:19:43,043 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 05:19:43,043 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 05:19:43,043 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 05:19:43,044 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 05:19:43,044 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 05:19:43,044 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 05:19:43,044 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 05:19:43,044 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 05:19:43,044 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 05:19:43,045 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 05:19:43,045 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 05:19:43,045 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 05:19:43,045 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 05:19:43,045 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 05:19:43,045 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 05:19:43,045 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 05:19:43,046 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 05:19:43,046 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 05:19:43,046 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 05:19:43,046 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 05:19:43,046 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 05:19:43,046 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 05:19:43,046 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 05:19:43,047 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 05:19:43,047 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 05:19:43,047 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 05:19:43,047 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 05:19:43,047 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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_2b821743-c9b6-4d51-b616-d736463dfd00/bin-2019/uautomizer 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 -> Automizer 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 -> 7f023635c87a3256e501da0baa2258f1eabc71ba [2018-12-02 05:19:43,071 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 05:19:43,078 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 05:19:43,080 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 05:19:43,081 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 05:19:43,081 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 05:19:43,082 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_2b821743-c9b6-4d51-b616-d736463dfd00/bin-2019/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix022_pso.opt_false-unreach-call.i [2018-12-02 05:19:43,119 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2b821743-c9b6-4d51-b616-d736463dfd00/bin-2019/uautomizer/data/212a3d607/c62804308bd94622bc8bf5314a80d9cc/FLAGb37188d6c [2018-12-02 05:19:43,533 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 05:19:43,534 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_2b821743-c9b6-4d51-b616-d736463dfd00/sv-benchmarks/c/pthread-wmm/mix022_pso.opt_false-unreach-call.i [2018-12-02 05:19:43,541 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2b821743-c9b6-4d51-b616-d736463dfd00/bin-2019/uautomizer/data/212a3d607/c62804308bd94622bc8bf5314a80d9cc/FLAGb37188d6c [2018-12-02 05:19:43,550 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_2b821743-c9b6-4d51-b616-d736463dfd00/bin-2019/uautomizer/data/212a3d607/c62804308bd94622bc8bf5314a80d9cc [2018-12-02 05:19:43,551 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 05:19:43,552 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 05:19:43,552 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 05:19:43,553 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 05:19:43,554 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 05:19:43,555 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 05:19:43" (1/1) ... [2018-12-02 05:19:43,556 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55da98ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:19:43, skipping insertion in model container [2018-12-02 05:19:43,557 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 05:19:43" (1/1) ... [2018-12-02 05:19:43,561 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 05:19:43,582 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 05:19:43,759 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 05:19:43,766 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 05:19:43,841 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 05:19:43,871 INFO L195 MainTranslator]: Completed translation [2018-12-02 05:19:43,871 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:19:43 WrapperNode [2018-12-02 05:19:43,871 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 05:19:43,872 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 05:19:43,872 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 05:19:43,872 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 05:19:43,878 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:19:43" (1/1) ... [2018-12-02 05:19:43,888 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:19:43" (1/1) ... [2018-12-02 05:19:43,904 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 05:19:43,904 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 05:19:43,904 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 05:19:43,904 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 05:19:43,911 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:19:43" (1/1) ... [2018-12-02 05:19:43,911 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:19:43" (1/1) ... [2018-12-02 05:19:43,914 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:19:43" (1/1) ... [2018-12-02 05:19:43,914 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:19:43" (1/1) ... [2018-12-02 05:19:43,920 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:19:43" (1/1) ... [2018-12-02 05:19:43,923 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:19:43" (1/1) ... [2018-12-02 05:19:43,924 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:19:43" (1/1) ... [2018-12-02 05:19:43,926 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 05:19:43,926 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 05:19:43,926 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 05:19:43,927 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 05:19:43,927 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:19:43" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b821743-c9b6-4d51-b616-d736463dfd00/bin-2019/uautomizer/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 05:19:43,959 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 05:19:43,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 05:19:43,959 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-02 05:19:43,959 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 05:19:43,959 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-02 05:19:43,959 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-02 05:19:43,959 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-02 05:19:43,959 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-02 05:19:43,959 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-02 05:19:43,959 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 05:19:43,959 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 05:19:43,960 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 05:19:44,290 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 05:19:44,291 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-02 05:19:44,291 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:19:44 BoogieIcfgContainer [2018-12-02 05:19:44,291 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 05:19:44,292 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 05:19:44,292 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 05:19:44,294 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 05:19:44,294 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 05:19:43" (1/3) ... [2018-12-02 05:19:44,295 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1641674 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 05:19:44, skipping insertion in model container [2018-12-02 05:19:44,295 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:19:43" (2/3) ... [2018-12-02 05:19:44,295 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1641674 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 05:19:44, skipping insertion in model container [2018-12-02 05:19:44,295 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:19:44" (3/3) ... [2018-12-02 05:19:44,296 INFO L112 eAbstractionObserver]: Analyzing ICFG mix022_pso.opt_false-unreach-call.i [2018-12-02 05:19:44,323 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,323 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,323 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,323 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,323 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,324 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,324 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,324 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,324 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,324 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,325 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,325 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,325 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,325 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,325 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,325 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,326 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,326 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,326 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,326 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,326 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,326 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,327 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,327 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,327 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,327 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,327 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,327 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,328 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,328 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,328 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,328 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,328 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,328 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,328 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,329 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,329 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,329 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,329 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,329 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,329 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,329 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,330 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,330 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,330 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,330 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,330 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,330 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,330 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,330 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,330 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,330 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,330 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,331 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,331 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,331 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,331 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,331 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,331 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,332 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,332 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,332 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,332 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,332 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,333 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,333 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,333 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,333 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,333 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,334 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,334 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,334 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,334 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,334 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,334 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,334 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,335 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,335 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,335 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,335 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,335 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,335 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,335 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,336 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,336 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,336 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,336 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,336 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,336 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,336 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,337 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,337 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,337 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,337 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,337 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,337 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,337 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,338 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,338 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,338 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,338 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,338 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,338 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,338 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,339 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,339 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,339 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,339 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,339 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,339 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,340 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,340 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,340 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,340 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,340 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,340 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,340 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,341 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,341 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,341 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,341 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,341 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,341 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,341 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,342 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,342 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,342 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,342 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,342 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,342 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,342 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,343 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,343 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,343 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,343 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,343 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,343 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,343 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,343 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,344 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,344 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,344 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,344 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,344 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,344 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,344 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,345 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,345 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,345 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,345 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,345 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,345 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,346 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,346 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,346 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,346 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,346 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,346 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,346 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,346 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,347 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,347 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,347 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,347 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:19:44,351 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-02 05:19:44,351 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 05:19:44,359 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-02 05:19:44,373 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-02 05:19:44,388 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 05:19:44,388 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 05:19:44,389 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 05:19:44,389 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 05:19:44,389 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 05:19:44,389 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 05:19:44,389 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 05:19:44,389 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 05:19:44,389 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 05:19:44,398 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 142places, 180 transitions [2018-12-02 05:19:45,845 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 34806 states. [2018-12-02 05:19:45,846 INFO L276 IsEmpty]: Start isEmpty. Operand 34806 states. [2018-12-02 05:19:45,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-02 05:19:45,851 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:19:45,851 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] [2018-12-02 05:19:45,852 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:19:45,855 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:19:45,856 INFO L82 PathProgramCache]: Analyzing trace with hash 2100747441, now seen corresponding path program 1 times [2018-12-02 05:19:45,857 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:19:45,857 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:19:45,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:19:45,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:19:45,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:19:45,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:19:45,993 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 05:19:45,994 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:19:45,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 05:19:45,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 05:19:46,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 05:19:46,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 05:19:46,006 INFO L87 Difference]: Start difference. First operand 34806 states. Second operand 4 states. [2018-12-02 05:19:46,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:19:46,470 INFO L93 Difference]: Finished difference Result 60790 states and 234493 transitions. [2018-12-02 05:19:46,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 05:19:46,472 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2018-12-02 05:19:46,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:19:46,616 INFO L225 Difference]: With dead ends: 60790 [2018-12-02 05:19:46,616 INFO L226 Difference]: Without dead ends: 44270 [2018-12-02 05:19:46,617 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 05:19:46,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44270 states. [2018-12-02 05:19:47,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44270 to 27338. [2018-12-02 05:19:47,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27338 states. [2018-12-02 05:19:47,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27338 states to 27338 states and 105499 transitions. [2018-12-02 05:19:47,390 INFO L78 Accepts]: Start accepts. Automaton has 27338 states and 105499 transitions. Word has length 33 [2018-12-02 05:19:47,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:19:47,391 INFO L480 AbstractCegarLoop]: Abstraction has 27338 states and 105499 transitions. [2018-12-02 05:19:47,391 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 05:19:47,391 INFO L276 IsEmpty]: Start isEmpty. Operand 27338 states and 105499 transitions. [2018-12-02 05:19:47,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-02 05:19:47,395 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:19:47,395 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:19:47,395 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:19:47,395 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:19:47,395 INFO L82 PathProgramCache]: Analyzing trace with hash 1664977985, now seen corresponding path program 1 times [2018-12-02 05:19:47,395 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:19:47,396 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:19:47,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:19:47,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:19:47,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:19:47,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:19:47,452 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 05:19:47,452 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:19:47,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 05:19:47,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 05:19:47,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 05:19:47,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 05:19:47,454 INFO L87 Difference]: Start difference. First operand 27338 states and 105499 transitions. Second operand 4 states. [2018-12-02 05:19:47,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:19:47,519 INFO L93 Difference]: Finished difference Result 8528 states and 28344 transitions. [2018-12-02 05:19:47,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 05:19:47,519 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2018-12-02 05:19:47,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:19:47,534 INFO L225 Difference]: With dead ends: 8528 [2018-12-02 05:19:47,534 INFO L226 Difference]: Without dead ends: 7466 [2018-12-02 05:19:47,535 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 05:19:47,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7466 states. [2018-12-02 05:19:47,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7466 to 7466. [2018-12-02 05:19:47,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7466 states. [2018-12-02 05:19:47,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7466 states to 7466 states and 24636 transitions. [2018-12-02 05:19:47,624 INFO L78 Accepts]: Start accepts. Automaton has 7466 states and 24636 transitions. Word has length 45 [2018-12-02 05:19:47,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:19:47,624 INFO L480 AbstractCegarLoop]: Abstraction has 7466 states and 24636 transitions. [2018-12-02 05:19:47,624 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 05:19:47,624 INFO L276 IsEmpty]: Start isEmpty. Operand 7466 states and 24636 transitions. [2018-12-02 05:19:47,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-02 05:19:47,625 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:19:47,625 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:19:47,625 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:19:47,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:19:47,626 INFO L82 PathProgramCache]: Analyzing trace with hash 1909915460, now seen corresponding path program 1 times [2018-12-02 05:19:47,626 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:19:47,626 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:19:47,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:19:47,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:19:47,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:19:47,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:19:47,679 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 05:19:47,679 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:19:47,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 05:19:47,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 05:19:47,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 05:19:47,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:19:47,680 INFO L87 Difference]: Start difference. First operand 7466 states and 24636 transitions. Second operand 5 states. [2018-12-02 05:19:47,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:19:47,899 INFO L93 Difference]: Finished difference Result 13998 states and 45805 transitions. [2018-12-02 05:19:47,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 05:19:47,899 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2018-12-02 05:19:47,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:19:47,928 INFO L225 Difference]: With dead ends: 13998 [2018-12-02 05:19:47,929 INFO L226 Difference]: Without dead ends: 13930 [2018-12-02 05:19:47,929 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 05:19:47,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13930 states. [2018-12-02 05:19:48,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13930 to 9441. [2018-12-02 05:19:48,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9441 states. [2018-12-02 05:19:48,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9441 states to 9441 states and 30542 transitions. [2018-12-02 05:19:48,086 INFO L78 Accepts]: Start accepts. Automaton has 9441 states and 30542 transitions. Word has length 46 [2018-12-02 05:19:48,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:19:48,087 INFO L480 AbstractCegarLoop]: Abstraction has 9441 states and 30542 transitions. [2018-12-02 05:19:48,088 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 05:19:48,088 INFO L276 IsEmpty]: Start isEmpty. Operand 9441 states and 30542 transitions. [2018-12-02 05:19:48,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-02 05:19:48,089 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:19:48,089 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 05:19:48,089 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:19:48,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:19:48,089 INFO L82 PathProgramCache]: Analyzing trace with hash -1845061814, now seen corresponding path program 1 times [2018-12-02 05:19:48,089 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:19:48,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:19:48,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:19:48,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:19:48,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:19:48,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:19:48,116 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 05:19:48,116 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:19:48,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 05:19:48,116 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 05:19:48,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 05:19:48,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 05:19:48,116 INFO L87 Difference]: Start difference. First operand 9441 states and 30542 transitions. Second operand 3 states. [2018-12-02 05:19:48,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:19:48,180 INFO L93 Difference]: Finished difference Result 13279 states and 42641 transitions. [2018-12-02 05:19:48,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 05:19:48,180 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2018-12-02 05:19:48,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:19:48,197 INFO L225 Difference]: With dead ends: 13279 [2018-12-02 05:19:48,198 INFO L226 Difference]: Without dead ends: 13279 [2018-12-02 05:19:48,198 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 05:19:48,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13279 states. [2018-12-02 05:19:48,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13279 to 9845. [2018-12-02 05:19:48,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9845 states. [2018-12-02 05:19:48,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9845 states to 9845 states and 31508 transitions. [2018-12-02 05:19:48,326 INFO L78 Accepts]: Start accepts. Automaton has 9845 states and 31508 transitions. Word has length 48 [2018-12-02 05:19:48,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:19:48,327 INFO L480 AbstractCegarLoop]: Abstraction has 9845 states and 31508 transitions. [2018-12-02 05:19:48,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 05:19:48,327 INFO L276 IsEmpty]: Start isEmpty. Operand 9845 states and 31508 transitions. [2018-12-02 05:19:48,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-02 05:19:48,328 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:19:48,328 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] [2018-12-02 05:19:48,328 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:19:48,328 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:19:48,328 INFO L82 PathProgramCache]: Analyzing trace with hash 484350805, now seen corresponding path program 1 times [2018-12-02 05:19:48,328 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:19:48,328 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:19:48,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:19:48,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:19:48,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:19:48,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:19:48,395 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 05:19:48,395 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:19:48,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 05:19:48,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 05:19:48,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 05:19:48,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-02 05:19:48,395 INFO L87 Difference]: Start difference. First operand 9845 states and 31508 transitions. Second operand 7 states. [2018-12-02 05:19:48,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:19:48,744 INFO L93 Difference]: Finished difference Result 12285 states and 38673 transitions. [2018-12-02 05:19:48,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 05:19:48,744 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2018-12-02 05:19:48,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:19:48,757 INFO L225 Difference]: With dead ends: 12285 [2018-12-02 05:19:48,757 INFO L226 Difference]: Without dead ends: 12213 [2018-12-02 05:19:48,758 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-12-02 05:19:48,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12213 states. [2018-12-02 05:19:48,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12213 to 10849. [2018-12-02 05:19:48,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10849 states. [2018-12-02 05:19:48,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10849 states to 10849 states and 34563 transitions. [2018-12-02 05:19:48,925 INFO L78 Accepts]: Start accepts. Automaton has 10849 states and 34563 transitions. Word has length 52 [2018-12-02 05:19:48,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:19:48,925 INFO L480 AbstractCegarLoop]: Abstraction has 10849 states and 34563 transitions. [2018-12-02 05:19:48,925 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 05:19:48,925 INFO L276 IsEmpty]: Start isEmpty. Operand 10849 states and 34563 transitions. [2018-12-02 05:19:48,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-02 05:19:48,928 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:19:48,928 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] [2018-12-02 05:19:48,928 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:19:48,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:19:48,928 INFO L82 PathProgramCache]: Analyzing trace with hash 1383304625, now seen corresponding path program 1 times [2018-12-02 05:19:48,928 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:19:48,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:19:48,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:19:48,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:19:48,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:19:48,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:19:48,980 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 05:19:48,981 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:19:48,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 05:19:48,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 05:19:48,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 05:19:48,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 05:19:48,981 INFO L87 Difference]: Start difference. First operand 10849 states and 34563 transitions. Second operand 4 states. [2018-12-02 05:19:49,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:19:49,078 INFO L93 Difference]: Finished difference Result 12396 states and 39572 transitions. [2018-12-02 05:19:49,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 05:19:49,078 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2018-12-02 05:19:49,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:19:49,092 INFO L225 Difference]: With dead ends: 12396 [2018-12-02 05:19:49,092 INFO L226 Difference]: Without dead ends: 12396 [2018-12-02 05:19:49,092 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:19:49,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12396 states. [2018-12-02 05:19:49,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12396 to 11369. [2018-12-02 05:19:49,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11369 states. [2018-12-02 05:19:49,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11369 states to 11369 states and 36236 transitions. [2018-12-02 05:19:49,213 INFO L78 Accepts]: Start accepts. Automaton has 11369 states and 36236 transitions. Word has length 60 [2018-12-02 05:19:49,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:19:49,214 INFO L480 AbstractCegarLoop]: Abstraction has 11369 states and 36236 transitions. [2018-12-02 05:19:49,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 05:19:49,214 INFO L276 IsEmpty]: Start isEmpty. Operand 11369 states and 36236 transitions. [2018-12-02 05:19:49,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-02 05:19:49,217 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:19:49,217 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] [2018-12-02 05:19:49,217 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:19:49,217 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:19:49,217 INFO L82 PathProgramCache]: Analyzing trace with hash -1168852336, now seen corresponding path program 1 times [2018-12-02 05:19:49,217 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:19:49,217 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:19:49,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:19:49,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:19:49,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:19:49,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:19:49,267 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 05:19:49,267 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:19:49,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 05:19:49,268 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 05:19:49,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 05:19:49,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 05:19:49,268 INFO L87 Difference]: Start difference. First operand 11369 states and 36236 transitions. Second operand 6 states. [2018-12-02 05:19:49,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:19:49,519 INFO L93 Difference]: Finished difference Result 20969 states and 66486 transitions. [2018-12-02 05:19:49,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 05:19:49,520 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2018-12-02 05:19:49,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:19:49,543 INFO L225 Difference]: With dead ends: 20969 [2018-12-02 05:19:49,543 INFO L226 Difference]: Without dead ends: 20898 [2018-12-02 05:19:49,543 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-12-02 05:19:49,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20898 states. [2018-12-02 05:19:49,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20898 to 13755. [2018-12-02 05:19:49,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13755 states. [2018-12-02 05:19:49,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13755 states to 13755 states and 43280 transitions. [2018-12-02 05:19:49,731 INFO L78 Accepts]: Start accepts. Automaton has 13755 states and 43280 transitions. Word has length 60 [2018-12-02 05:19:49,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:19:49,731 INFO L480 AbstractCegarLoop]: Abstraction has 13755 states and 43280 transitions. [2018-12-02 05:19:49,732 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 05:19:49,732 INFO L276 IsEmpty]: Start isEmpty. Operand 13755 states and 43280 transitions. [2018-12-02 05:19:49,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-02 05:19:49,736 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:19:49,736 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 05:19:49,736 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:19:49,737 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:19:49,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1208126989, now seen corresponding path program 1 times [2018-12-02 05:19:49,737 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:19:49,737 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:19:49,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:19:49,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:19:49,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:19:49,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:19:49,777 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 05:19:49,777 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:19:49,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 05:19:49,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 05:19:49,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 05:19:49,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 05:19:49,778 INFO L87 Difference]: Start difference. First operand 13755 states and 43280 transitions. Second operand 4 states. [2018-12-02 05:19:50,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:19:50,042 INFO L93 Difference]: Finished difference Result 23352 states and 74493 transitions. [2018-12-02 05:19:50,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 05:19:50,042 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2018-12-02 05:19:50,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:19:50,072 INFO L225 Difference]: With dead ends: 23352 [2018-12-02 05:19:50,072 INFO L226 Difference]: Without dead ends: 23352 [2018-12-02 05:19:50,073 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 05:19:50,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23352 states. [2018-12-02 05:19:50,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23352 to 14523. [2018-12-02 05:19:50,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14523 states. [2018-12-02 05:19:50,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14523 states to 14523 states and 45664 transitions. [2018-12-02 05:19:50,336 INFO L78 Accepts]: Start accepts. Automaton has 14523 states and 45664 transitions. Word has length 64 [2018-12-02 05:19:50,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:19:50,336 INFO L480 AbstractCegarLoop]: Abstraction has 14523 states and 45664 transitions. [2018-12-02 05:19:50,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 05:19:50,336 INFO L276 IsEmpty]: Start isEmpty. Operand 14523 states and 45664 transitions. [2018-12-02 05:19:50,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-02 05:19:50,340 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:19:50,340 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 05:19:50,340 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:19:50,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:19:50,340 INFO L82 PathProgramCache]: Analyzing trace with hash -914723982, now seen corresponding path program 1 times [2018-12-02 05:19:50,340 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:19:50,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:19:50,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:19:50,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:19:50,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:19:50,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:19:50,374 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 05:19:50,374 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:19:50,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 05:19:50,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 05:19:50,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 05:19:50,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 05:19:50,375 INFO L87 Difference]: Start difference. First operand 14523 states and 45664 transitions. Second operand 4 states. [2018-12-02 05:19:50,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:19:50,561 INFO L93 Difference]: Finished difference Result 18411 states and 56991 transitions. [2018-12-02 05:19:50,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 05:19:50,562 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2018-12-02 05:19:50,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:19:50,583 INFO L225 Difference]: With dead ends: 18411 [2018-12-02 05:19:50,583 INFO L226 Difference]: Without dead ends: 18411 [2018-12-02 05:19:50,583 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 05:19:50,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18411 states. [2018-12-02 05:19:50,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18411 to 16569. [2018-12-02 05:19:50,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16569 states. [2018-12-02 05:19:50,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16569 states to 16569 states and 51537 transitions. [2018-12-02 05:19:50,764 INFO L78 Accepts]: Start accepts. Automaton has 16569 states and 51537 transitions. Word has length 64 [2018-12-02 05:19:50,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:19:50,765 INFO L480 AbstractCegarLoop]: Abstraction has 16569 states and 51537 transitions. [2018-12-02 05:19:50,765 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 05:19:50,765 INFO L276 IsEmpty]: Start isEmpty. Operand 16569 states and 51537 transitions. [2018-12-02 05:19:50,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-02 05:19:50,771 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:19:50,771 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 05:19:50,771 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:19:50,771 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:19:50,771 INFO L82 PathProgramCache]: Analyzing trace with hash 46890035, now seen corresponding path program 1 times [2018-12-02 05:19:50,771 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:19:50,771 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:19:50,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:19:50,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:19:50,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:19:50,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:19:50,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:19:50,791 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:19:50,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 05:19:50,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 05:19:50,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 05:19:50,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 05:19:50,791 INFO L87 Difference]: Start difference. First operand 16569 states and 51537 transitions. Second operand 3 states. [2018-12-02 05:19:50,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:19:50,934 INFO L93 Difference]: Finished difference Result 17193 states and 53232 transitions. [2018-12-02 05:19:50,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 05:19:50,934 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2018-12-02 05:19:50,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:19:50,952 INFO L225 Difference]: With dead ends: 17193 [2018-12-02 05:19:50,953 INFO L226 Difference]: Without dead ends: 17193 [2018-12-02 05:19:50,953 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 05:19:50,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17193 states. [2018-12-02 05:19:51,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17193 to 16901. [2018-12-02 05:19:51,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16901 states. [2018-12-02 05:19:51,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16901 states to 16901 states and 52431 transitions. [2018-12-02 05:19:51,123 INFO L78 Accepts]: Start accepts. Automaton has 16901 states and 52431 transitions. Word has length 64 [2018-12-02 05:19:51,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:19:51,123 INFO L480 AbstractCegarLoop]: Abstraction has 16901 states and 52431 transitions. [2018-12-02 05:19:51,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 05:19:51,123 INFO L276 IsEmpty]: Start isEmpty. Operand 16901 states and 52431 transitions. [2018-12-02 05:19:51,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-02 05:19:51,129 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:19:51,129 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 05:19:51,129 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:19:51,129 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:19:51,129 INFO L82 PathProgramCache]: Analyzing trace with hash -859455011, now seen corresponding path program 1 times [2018-12-02 05:19:51,129 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:19:51,129 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:19:51,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:19:51,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:19:51,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:19:51,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:19:51,184 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 05:19:51,184 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:19:51,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 05:19:51,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 05:19:51,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 05:19:51,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 05:19:51,185 INFO L87 Difference]: Start difference. First operand 16901 states and 52431 transitions. Second operand 6 states. [2018-12-02 05:19:51,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:19:51,811 INFO L93 Difference]: Finished difference Result 20789 states and 63395 transitions. [2018-12-02 05:19:51,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 05:19:51,812 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2018-12-02 05:19:51,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:19:51,833 INFO L225 Difference]: With dead ends: 20789 [2018-12-02 05:19:51,833 INFO L226 Difference]: Without dead ends: 20789 [2018-12-02 05:19:51,834 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 05:19:51,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20789 states. [2018-12-02 05:19:52,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20789 to 19521. [2018-12-02 05:19:52,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19521 states. [2018-12-02 05:19:52,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19521 states to 19521 states and 60007 transitions. [2018-12-02 05:19:52,054 INFO L78 Accepts]: Start accepts. Automaton has 19521 states and 60007 transitions. Word has length 66 [2018-12-02 05:19:52,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:19:52,055 INFO L480 AbstractCegarLoop]: Abstraction has 19521 states and 60007 transitions. [2018-12-02 05:19:52,055 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 05:19:52,055 INFO L276 IsEmpty]: Start isEmpty. Operand 19521 states and 60007 transitions. [2018-12-02 05:19:52,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-02 05:19:52,062 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:19:52,062 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 05:19:52,062 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:19:52,062 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:19:52,062 INFO L82 PathProgramCache]: Analyzing trace with hash 102159006, now seen corresponding path program 1 times [2018-12-02 05:19:52,063 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:19:52,063 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:19:52,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:19:52,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:19:52,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:19:52,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:19:52,129 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 05:19:52,129 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:19:52,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 05:19:52,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 05:19:52,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 05:19:52,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 05:19:52,130 INFO L87 Difference]: Start difference. First operand 19521 states and 60007 transitions. Second operand 6 states. [2018-12-02 05:19:52,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:19:52,398 INFO L93 Difference]: Finished difference Result 22441 states and 66578 transitions. [2018-12-02 05:19:52,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 05:19:52,398 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2018-12-02 05:19:52,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:19:52,421 INFO L225 Difference]: With dead ends: 22441 [2018-12-02 05:19:52,421 INFO L226 Difference]: Without dead ends: 22441 [2018-12-02 05:19:52,421 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 05:19:52,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22441 states. [2018-12-02 05:19:52,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22441 to 20085. [2018-12-02 05:19:52,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20085 states. [2018-12-02 05:19:52,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20085 states to 20085 states and 60622 transitions. [2018-12-02 05:19:52,635 INFO L78 Accepts]: Start accepts. Automaton has 20085 states and 60622 transitions. Word has length 66 [2018-12-02 05:19:52,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:19:52,635 INFO L480 AbstractCegarLoop]: Abstraction has 20085 states and 60622 transitions. [2018-12-02 05:19:52,635 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 05:19:52,635 INFO L276 IsEmpty]: Start isEmpty. Operand 20085 states and 60622 transitions. [2018-12-02 05:19:52,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-02 05:19:52,642 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:19:52,642 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 05:19:52,642 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:19:52,643 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:19:52,643 INFO L82 PathProgramCache]: Analyzing trace with hash 1346923487, now seen corresponding path program 1 times [2018-12-02 05:19:52,643 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:19:52,643 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:19:52,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:19:52,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:19:52,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:19:52,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:19:52,689 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 05:19:52,689 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:19:52,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 05:19:52,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 05:19:52,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 05:19:52,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:19:52,690 INFO L87 Difference]: Start difference. First operand 20085 states and 60622 transitions. Second operand 5 states. [2018-12-02 05:19:52,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:19:52,910 INFO L93 Difference]: Finished difference Result 26432 states and 79262 transitions. [2018-12-02 05:19:52,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 05:19:52,911 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2018-12-02 05:19:52,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:19:52,940 INFO L225 Difference]: With dead ends: 26432 [2018-12-02 05:19:52,940 INFO L226 Difference]: Without dead ends: 26432 [2018-12-02 05:19:52,940 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-02 05:19:52,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26432 states. [2018-12-02 05:19:53,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26432 to 23813. [2018-12-02 05:19:53,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23813 states. [2018-12-02 05:19:53,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23813 states to 23813 states and 71372 transitions. [2018-12-02 05:19:53,198 INFO L78 Accepts]: Start accepts. Automaton has 23813 states and 71372 transitions. Word has length 66 [2018-12-02 05:19:53,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:19:53,198 INFO L480 AbstractCegarLoop]: Abstraction has 23813 states and 71372 transitions. [2018-12-02 05:19:53,198 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 05:19:53,198 INFO L276 IsEmpty]: Start isEmpty. Operand 23813 states and 71372 transitions. [2018-12-02 05:19:53,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-02 05:19:53,206 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:19:53,206 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 05:19:53,206 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:19:53,206 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:19:53,206 INFO L82 PathProgramCache]: Analyzing trace with hash 836389310, now seen corresponding path program 1 times [2018-12-02 05:19:53,206 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:19:53,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:19:53,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:19:53,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:19:53,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:19:53,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:19:53,251 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 05:19:53,251 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:19:53,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 05:19:53,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 05:19:53,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 05:19:53,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:19:53,252 INFO L87 Difference]: Start difference. First operand 23813 states and 71372 transitions. Second operand 5 states. [2018-12-02 05:19:53,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:19:53,565 INFO L93 Difference]: Finished difference Result 33063 states and 98211 transitions. [2018-12-02 05:19:53,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 05:19:53,565 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2018-12-02 05:19:53,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:19:53,607 INFO L225 Difference]: With dead ends: 33063 [2018-12-02 05:19:53,607 INFO L226 Difference]: Without dead ends: 33063 [2018-12-02 05:19:53,608 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 05:19:53,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33063 states. [2018-12-02 05:19:53,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33063 to 29343. [2018-12-02 05:19:53,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29343 states. [2018-12-02 05:19:53,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29343 states to 29343 states and 87599 transitions. [2018-12-02 05:19:53,960 INFO L78 Accepts]: Start accepts. Automaton has 29343 states and 87599 transitions. Word has length 66 [2018-12-02 05:19:53,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:19:53,961 INFO L480 AbstractCegarLoop]: Abstraction has 29343 states and 87599 transitions. [2018-12-02 05:19:53,961 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 05:19:53,961 INFO L276 IsEmpty]: Start isEmpty. Operand 29343 states and 87599 transitions. [2018-12-02 05:19:53,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-02 05:19:53,970 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:19:53,970 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 05:19:53,970 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:19:53,970 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:19:53,970 INFO L82 PathProgramCache]: Analyzing trace with hash -971065153, now seen corresponding path program 1 times [2018-12-02 05:19:53,970 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:19:53,970 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:19:53,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:19:53,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:19:53,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:19:53,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:19:54,002 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 05:19:54,002 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:19:54,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 05:19:54,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 05:19:54,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 05:19:54,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 05:19:54,003 INFO L87 Difference]: Start difference. First operand 29343 states and 87599 transitions. Second operand 4 states. [2018-12-02 05:19:54,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:19:54,359 INFO L93 Difference]: Finished difference Result 38903 states and 116585 transitions. [2018-12-02 05:19:54,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 05:19:54,359 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2018-12-02 05:19:54,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:19:54,400 INFO L225 Difference]: With dead ends: 38903 [2018-12-02 05:19:54,400 INFO L226 Difference]: Without dead ends: 38671 [2018-12-02 05:19:54,400 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:19:54,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38671 states. [2018-12-02 05:19:54,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38671 to 35807. [2018-12-02 05:19:54,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35807 states. [2018-12-02 05:19:54,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35807 states to 35807 states and 107399 transitions. [2018-12-02 05:19:54,781 INFO L78 Accepts]: Start accepts. Automaton has 35807 states and 107399 transitions. Word has length 66 [2018-12-02 05:19:54,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:19:54,781 INFO L480 AbstractCegarLoop]: Abstraction has 35807 states and 107399 transitions. [2018-12-02 05:19:54,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 05:19:54,781 INFO L276 IsEmpty]: Start isEmpty. Operand 35807 states and 107399 transitions. [2018-12-02 05:19:54,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-02 05:19:54,791 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:19:54,791 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 05:19:54,791 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:19:54,792 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:19:54,792 INFO L82 PathProgramCache]: Analyzing trace with hash 1526950784, now seen corresponding path program 1 times [2018-12-02 05:19:54,792 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:19:54,792 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:19:54,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:19:54,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:19:54,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:19:54,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:19:54,866 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 05:19:54,866 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:19:54,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-02 05:19:54,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 05:19:54,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 05:19:54,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-12-02 05:19:54,867 INFO L87 Difference]: Start difference. First operand 35807 states and 107399 transitions. Second operand 9 states. [2018-12-02 05:19:55,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:19:55,513 INFO L93 Difference]: Finished difference Result 44023 states and 131291 transitions. [2018-12-02 05:19:55,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 05:19:55,513 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2018-12-02 05:19:55,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:19:55,558 INFO L225 Difference]: With dead ends: 44023 [2018-12-02 05:19:55,558 INFO L226 Difference]: Without dead ends: 44023 [2018-12-02 05:19:55,559 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-12-02 05:19:55,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44023 states. [2018-12-02 05:19:55,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44023 to 38973. [2018-12-02 05:19:55,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38973 states. [2018-12-02 05:19:56,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38973 states to 38973 states and 116711 transitions. [2018-12-02 05:19:56,001 INFO L78 Accepts]: Start accepts. Automaton has 38973 states and 116711 transitions. Word has length 66 [2018-12-02 05:19:56,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:19:56,001 INFO L480 AbstractCegarLoop]: Abstraction has 38973 states and 116711 transitions. [2018-12-02 05:19:56,001 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 05:19:56,001 INFO L276 IsEmpty]: Start isEmpty. Operand 38973 states and 116711 transitions. [2018-12-02 05:19:56,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-02 05:19:56,009 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:19:56,009 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 05:19:56,009 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:19:56,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:19:56,009 INFO L82 PathProgramCache]: Analyzing trace with hash -1880512831, now seen corresponding path program 1 times [2018-12-02 05:19:56,009 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:19:56,010 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:19:56,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:19:56,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:19:56,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:19:56,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:19:56,045 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 05:19:56,046 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:19:56,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 05:19:56,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 05:19:56,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 05:19:56,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:19:56,047 INFO L87 Difference]: Start difference. First operand 38973 states and 116711 transitions. Second operand 5 states. [2018-12-02 05:19:56,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:19:56,081 INFO L93 Difference]: Finished difference Result 9637 states and 23357 transitions. [2018-12-02 05:19:56,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 05:19:56,081 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2018-12-02 05:19:56,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:19:56,087 INFO L225 Difference]: With dead ends: 9637 [2018-12-02 05:19:56,087 INFO L226 Difference]: Without dead ends: 7669 [2018-12-02 05:19:56,087 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 05:19:56,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7669 states. [2018-12-02 05:19:56,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7669 to 6276. [2018-12-02 05:19:56,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6276 states. [2018-12-02 05:19:56,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6276 states to 6276 states and 14833 transitions. [2018-12-02 05:19:56,138 INFO L78 Accepts]: Start accepts. Automaton has 6276 states and 14833 transitions. Word has length 66 [2018-12-02 05:19:56,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:19:56,139 INFO L480 AbstractCegarLoop]: Abstraction has 6276 states and 14833 transitions. [2018-12-02 05:19:56,139 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 05:19:56,139 INFO L276 IsEmpty]: Start isEmpty. Operand 6276 states and 14833 transitions. [2018-12-02 05:19:56,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-02 05:19:56,142 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:19:56,142 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 05:19:56,142 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:19:56,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:19:56,142 INFO L82 PathProgramCache]: Analyzing trace with hash -1184013087, now seen corresponding path program 1 times [2018-12-02 05:19:56,142 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:19:56,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:19:56,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:19:56,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:19:56,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:19:56,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:19:56,157 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 05:19:56,157 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:19:56,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 05:19:56,157 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 05:19:56,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 05:19:56,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 05:19:56,158 INFO L87 Difference]: Start difference. First operand 6276 states and 14833 transitions. Second operand 3 states. [2018-12-02 05:19:56,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:19:56,181 INFO L93 Difference]: Finished difference Result 8733 states and 20570 transitions. [2018-12-02 05:19:56,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 05:19:56,181 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-12-02 05:19:56,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:19:56,187 INFO L225 Difference]: With dead ends: 8733 [2018-12-02 05:19:56,187 INFO L226 Difference]: Without dead ends: 8733 [2018-12-02 05:19:56,187 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 05:19:56,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8733 states. [2018-12-02 05:19:56,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8733 to 6213. [2018-12-02 05:19:56,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6213 states. [2018-12-02 05:19:56,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6213 states to 6213 states and 14371 transitions. [2018-12-02 05:19:56,241 INFO L78 Accepts]: Start accepts. Automaton has 6213 states and 14371 transitions. Word has length 66 [2018-12-02 05:19:56,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:19:56,241 INFO L480 AbstractCegarLoop]: Abstraction has 6213 states and 14371 transitions. [2018-12-02 05:19:56,241 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 05:19:56,241 INFO L276 IsEmpty]: Start isEmpty. Operand 6213 states and 14371 transitions. [2018-12-02 05:19:56,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-02 05:19:56,245 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:19:56,245 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:19:56,245 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:19:56,245 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:19:56,246 INFO L82 PathProgramCache]: Analyzing trace with hash 280585492, now seen corresponding path program 1 times [2018-12-02 05:19:56,246 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:19:56,246 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:19:56,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:19:56,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:19:56,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:19:56,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:19:56,292 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 05:19:56,292 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:19:56,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 05:19:56,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 05:19:56,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 05:19:56,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:19:56,293 INFO L87 Difference]: Start difference. First operand 6213 states and 14371 transitions. Second operand 5 states. [2018-12-02 05:19:56,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:19:56,403 INFO L93 Difference]: Finished difference Result 7383 states and 17012 transitions. [2018-12-02 05:19:56,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 05:19:56,403 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2018-12-02 05:19:56,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:19:56,408 INFO L225 Difference]: With dead ends: 7383 [2018-12-02 05:19:56,408 INFO L226 Difference]: Without dead ends: 7383 [2018-12-02 05:19:56,408 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-02 05:19:56,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7383 states. [2018-12-02 05:19:56,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7383 to 6657. [2018-12-02 05:19:56,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6657 states. [2018-12-02 05:19:56,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6657 states to 6657 states and 15375 transitions. [2018-12-02 05:19:56,457 INFO L78 Accepts]: Start accepts. Automaton has 6657 states and 15375 transitions. Word has length 72 [2018-12-02 05:19:56,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:19:56,457 INFO L480 AbstractCegarLoop]: Abstraction has 6657 states and 15375 transitions. [2018-12-02 05:19:56,457 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 05:19:56,458 INFO L276 IsEmpty]: Start isEmpty. Operand 6657 states and 15375 transitions. [2018-12-02 05:19:56,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-02 05:19:56,461 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:19:56,461 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:19:56,461 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:19:56,461 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:19:56,461 INFO L82 PathProgramCache]: Analyzing trace with hash 2023395827, now seen corresponding path program 1 times [2018-12-02 05:19:56,461 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:19:56,461 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:19:56,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:19:56,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:19:56,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:19:56,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:19:56,559 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 05:19:56,559 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:19:56,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-02 05:19:56,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 05:19:56,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 05:19:56,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-12-02 05:19:56,560 INFO L87 Difference]: Start difference. First operand 6657 states and 15375 transitions. Second operand 9 states. [2018-12-02 05:19:56,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:19:56,884 INFO L93 Difference]: Finished difference Result 8851 states and 20272 transitions. [2018-12-02 05:19:56,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-02 05:19:56,885 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 72 [2018-12-02 05:19:56,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:19:56,890 INFO L225 Difference]: With dead ends: 8851 [2018-12-02 05:19:56,891 INFO L226 Difference]: Without dead ends: 8732 [2018-12-02 05:19:56,891 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-12-02 05:19:56,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8732 states. [2018-12-02 05:19:56,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8732 to 6746. [2018-12-02 05:19:56,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6746 states. [2018-12-02 05:19:56,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6746 states to 6746 states and 15444 transitions. [2018-12-02 05:19:56,944 INFO L78 Accepts]: Start accepts. Automaton has 6746 states and 15444 transitions. Word has length 72 [2018-12-02 05:19:56,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:19:56,944 INFO L480 AbstractCegarLoop]: Abstraction has 6746 states and 15444 transitions. [2018-12-02 05:19:56,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 05:19:56,944 INFO L276 IsEmpty]: Start isEmpty. Operand 6746 states and 15444 transitions. [2018-12-02 05:19:56,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-02 05:19:56,948 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:19:56,949 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:19:56,949 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:19:56,949 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:19:56,949 INFO L82 PathProgramCache]: Analyzing trace with hash 1917824602, now seen corresponding path program 1 times [2018-12-02 05:19:56,949 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:19:56,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:19:56,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:19:56,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:19:56,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:19:56,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:19:56,981 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 05:19:56,981 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:19:56,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 05:19:56,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 05:19:56,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 05:19:56,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 05:19:56,982 INFO L87 Difference]: Start difference. First operand 6746 states and 15444 transitions. Second operand 3 states. [2018-12-02 05:19:57,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:19:57,104 INFO L93 Difference]: Finished difference Result 8422 states and 18970 transitions. [2018-12-02 05:19:57,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 05:19:57,105 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 91 [2018-12-02 05:19:57,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:19:57,110 INFO L225 Difference]: With dead ends: 8422 [2018-12-02 05:19:57,110 INFO L226 Difference]: Without dead ends: 8422 [2018-12-02 05:19:57,111 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 05:19:57,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8422 states. [2018-12-02 05:19:57,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8422 to 7857. [2018-12-02 05:19:57,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7857 states. [2018-12-02 05:19:57,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7857 states to 7857 states and 17760 transitions. [2018-12-02 05:19:57,170 INFO L78 Accepts]: Start accepts. Automaton has 7857 states and 17760 transitions. Word has length 91 [2018-12-02 05:19:57,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:19:57,170 INFO L480 AbstractCegarLoop]: Abstraction has 7857 states and 17760 transitions. [2018-12-02 05:19:57,170 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 05:19:57,170 INFO L276 IsEmpty]: Start isEmpty. Operand 7857 states and 17760 transitions. [2018-12-02 05:19:57,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-02 05:19:57,175 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:19:57,175 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:19:57,175 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:19:57,175 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:19:57,175 INFO L82 PathProgramCache]: Analyzing trace with hash 1154554199, now seen corresponding path program 1 times [2018-12-02 05:19:57,176 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:19:57,176 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:19:57,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:19:57,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:19:57,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:19:57,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:19:57,208 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 05:19:57,208 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:19:57,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 05:19:57,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 05:19:57,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 05:19:57,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 05:19:57,209 INFO L87 Difference]: Start difference. First operand 7857 states and 17760 transitions. Second operand 4 states. [2018-12-02 05:19:57,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:19:57,277 INFO L93 Difference]: Finished difference Result 8431 states and 19074 transitions. [2018-12-02 05:19:57,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 05:19:57,277 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2018-12-02 05:19:57,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:19:57,282 INFO L225 Difference]: With dead ends: 8431 [2018-12-02 05:19:57,282 INFO L226 Difference]: Without dead ends: 8431 [2018-12-02 05:19:57,283 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 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 05:19:57,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8431 states. [2018-12-02 05:19:57,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8431 to 7772. [2018-12-02 05:19:57,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7772 states. [2018-12-02 05:19:57,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7772 states to 7772 states and 17676 transitions. [2018-12-02 05:19:57,350 INFO L78 Accepts]: Start accepts. Automaton has 7772 states and 17676 transitions. Word has length 91 [2018-12-02 05:19:57,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:19:57,350 INFO L480 AbstractCegarLoop]: Abstraction has 7772 states and 17676 transitions. [2018-12-02 05:19:57,350 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 05:19:57,350 INFO L276 IsEmpty]: Start isEmpty. Operand 7772 states and 17676 transitions. [2018-12-02 05:19:57,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-02 05:19:57,357 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:19:57,358 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:19:57,358 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:19:57,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:19:57,358 INFO L82 PathProgramCache]: Analyzing trace with hash -1775857056, now seen corresponding path program 1 times [2018-12-02 05:19:57,358 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:19:57,358 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:19:57,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:19:57,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:19:57,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:19:57,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:19:57,405 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 05:19:57,405 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:19:57,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 05:19:57,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 05:19:57,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 05:19:57,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:19:57,406 INFO L87 Difference]: Start difference. First operand 7772 states and 17676 transitions. Second operand 5 states. [2018-12-02 05:19:57,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:19:57,470 INFO L93 Difference]: Finished difference Result 8948 states and 20243 transitions. [2018-12-02 05:19:57,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 05:19:57,470 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2018-12-02 05:19:57,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:19:57,476 INFO L225 Difference]: With dead ends: 8948 [2018-12-02 05:19:57,476 INFO L226 Difference]: Without dead ends: 8948 [2018-12-02 05:19:57,476 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-02 05:19:57,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8948 states. [2018-12-02 05:19:57,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8948 to 6902. [2018-12-02 05:19:57,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6902 states. [2018-12-02 05:19:57,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6902 states to 6902 states and 15741 transitions. [2018-12-02 05:19:57,531 INFO L78 Accepts]: Start accepts. Automaton has 6902 states and 15741 transitions. Word has length 93 [2018-12-02 05:19:57,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:19:57,532 INFO L480 AbstractCegarLoop]: Abstraction has 6902 states and 15741 transitions. [2018-12-02 05:19:57,532 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 05:19:57,532 INFO L276 IsEmpty]: Start isEmpty. Operand 6902 states and 15741 transitions. [2018-12-02 05:19:57,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-02 05:19:57,537 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:19:57,538 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:19:57,538 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:19:57,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:19:57,538 INFO L82 PathProgramCache]: Analyzing trace with hash -2030593601, now seen corresponding path program 1 times [2018-12-02 05:19:57,538 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:19:57,538 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:19:57,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:19:57,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:19:57,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:19:57,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:19:57,579 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 05:19:57,579 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:19:57,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 05:19:57,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 05:19:57,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 05:19:57,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:19:57,580 INFO L87 Difference]: Start difference. First operand 6902 states and 15741 transitions. Second operand 5 states. [2018-12-02 05:19:57,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:19:57,854 INFO L93 Difference]: Finished difference Result 11458 states and 26340 transitions. [2018-12-02 05:19:57,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 05:19:57,855 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2018-12-02 05:19:57,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:19:57,860 INFO L225 Difference]: With dead ends: 11458 [2018-12-02 05:19:57,861 INFO L226 Difference]: Without dead ends: 11380 [2018-12-02 05:19:57,861 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-02 05:19:57,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11380 states. [2018-12-02 05:19:57,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11380 to 8056. [2018-12-02 05:19:57,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8056 states. [2018-12-02 05:19:57,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8056 states to 8056 states and 18403 transitions. [2018-12-02 05:19:57,927 INFO L78 Accepts]: Start accepts. Automaton has 8056 states and 18403 transitions. Word has length 93 [2018-12-02 05:19:57,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:19:57,927 INFO L480 AbstractCegarLoop]: Abstraction has 8056 states and 18403 transitions. [2018-12-02 05:19:57,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 05:19:57,927 INFO L276 IsEmpty]: Start isEmpty. Operand 8056 states and 18403 transitions. [2018-12-02 05:19:57,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-02 05:19:57,932 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:19:57,932 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:19:57,933 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:19:57,933 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:19:57,933 INFO L82 PathProgramCache]: Analyzing trace with hash -785829120, now seen corresponding path program 1 times [2018-12-02 05:19:57,933 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:19:57,933 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:19:57,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:19:57,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:19:57,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:19:57,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:19:57,982 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 05:19:57,982 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:19:57,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 05:19:57,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 05:19:57,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 05:19:57,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 05:19:57,983 INFO L87 Difference]: Start difference. First operand 8056 states and 18403 transitions. Second operand 6 states. [2018-12-02 05:19:58,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:19:58,164 INFO L93 Difference]: Finished difference Result 10204 states and 23157 transitions. [2018-12-02 05:19:58,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 05:19:58,165 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2018-12-02 05:19:58,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:19:58,171 INFO L225 Difference]: With dead ends: 10204 [2018-12-02 05:19:58,171 INFO L226 Difference]: Without dead ends: 10125 [2018-12-02 05:19:58,171 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-12-02 05:19:58,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10125 states. [2018-12-02 05:19:58,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10125 to 7529. [2018-12-02 05:19:58,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7529 states. [2018-12-02 05:19:58,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7529 states to 7529 states and 17293 transitions. [2018-12-02 05:19:58,232 INFO L78 Accepts]: Start accepts. Automaton has 7529 states and 17293 transitions. Word has length 93 [2018-12-02 05:19:58,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:19:58,233 INFO L480 AbstractCegarLoop]: Abstraction has 7529 states and 17293 transitions. [2018-12-02 05:19:58,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 05:19:58,233 INFO L276 IsEmpty]: Start isEmpty. Operand 7529 states and 17293 transitions. [2018-12-02 05:19:58,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-02 05:19:58,238 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:19:58,238 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:19:58,238 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:19:58,238 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:19:58,238 INFO L82 PathProgramCache]: Analyzing trace with hash -1879438691, now seen corresponding path program 1 times [2018-12-02 05:19:58,238 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:19:58,238 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:19:58,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:19:58,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:19:58,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:19:58,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:19:58,351 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 05:19:58,351 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:19:58,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-02 05:19:58,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 05:19:58,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 05:19:58,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-02 05:19:58,352 INFO L87 Difference]: Start difference. First operand 7529 states and 17293 transitions. Second operand 9 states. [2018-12-02 05:19:58,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:19:58,672 INFO L93 Difference]: Finished difference Result 10604 states and 24259 transitions. [2018-12-02 05:19:58,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-02 05:19:58,672 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 93 [2018-12-02 05:19:58,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:19:58,679 INFO L225 Difference]: With dead ends: 10604 [2018-12-02 05:19:58,679 INFO L226 Difference]: Without dead ends: 10572 [2018-12-02 05:19:58,679 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2018-12-02 05:19:58,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10572 states. [2018-12-02 05:19:58,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10572 to 9100. [2018-12-02 05:19:58,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9100 states. [2018-12-02 05:19:58,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9100 states to 9100 states and 20773 transitions. [2018-12-02 05:19:58,750 INFO L78 Accepts]: Start accepts. Automaton has 9100 states and 20773 transitions. Word has length 93 [2018-12-02 05:19:58,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:19:58,751 INFO L480 AbstractCegarLoop]: Abstraction has 9100 states and 20773 transitions. [2018-12-02 05:19:58,751 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 05:19:58,751 INFO L276 IsEmpty]: Start isEmpty. Operand 9100 states and 20773 transitions. [2018-12-02 05:19:58,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-02 05:19:58,757 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:19:58,757 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:19:58,757 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:19:58,757 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:19:58,757 INFO L82 PathProgramCache]: Analyzing trace with hash 618577246, now seen corresponding path program 1 times [2018-12-02 05:19:58,757 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:19:58,758 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:19:58,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:19:58,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:19:58,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:19:58,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:19:58,815 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 05:19:58,815 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:19:58,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 05:19:58,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 05:19:58,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 05:19:58,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-02 05:19:58,816 INFO L87 Difference]: Start difference. First operand 9100 states and 20773 transitions. Second operand 8 states. [2018-12-02 05:19:59,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:19:59,073 INFO L93 Difference]: Finished difference Result 14198 states and 32836 transitions. [2018-12-02 05:19:59,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 05:19:59,074 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 93 [2018-12-02 05:19:59,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:19:59,083 INFO L225 Difference]: With dead ends: 14198 [2018-12-02 05:19:59,083 INFO L226 Difference]: Without dead ends: 14198 [2018-12-02 05:19:59,083 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-12-02 05:19:59,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14198 states. [2018-12-02 05:19:59,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14198 to 9690. [2018-12-02 05:19:59,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9690 states. [2018-12-02 05:19:59,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9690 states to 9690 states and 22304 transitions. [2018-12-02 05:19:59,173 INFO L78 Accepts]: Start accepts. Automaton has 9690 states and 22304 transitions. Word has length 93 [2018-12-02 05:19:59,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:19:59,173 INFO L480 AbstractCegarLoop]: Abstraction has 9690 states and 22304 transitions. [2018-12-02 05:19:59,173 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 05:19:59,174 INFO L276 IsEmpty]: Start isEmpty. Operand 9690 states and 22304 transitions. [2018-12-02 05:19:59,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-02 05:19:59,180 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:19:59,181 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:19:59,181 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:19:59,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:19:59,181 INFO L82 PathProgramCache]: Analyzing trace with hash 1506080927, now seen corresponding path program 1 times [2018-12-02 05:19:59,181 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:19:59,181 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:19:59,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:19:59,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:19:59,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:19:59,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:19:59,268 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 05:19:59,269 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:19:59,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-02 05:19:59,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 05:19:59,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 05:19:59,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-12-02 05:19:59,269 INFO L87 Difference]: Start difference. First operand 9690 states and 22304 transitions. Second operand 10 states. [2018-12-02 05:19:59,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:19:59,646 INFO L93 Difference]: Finished difference Result 13585 states and 31399 transitions. [2018-12-02 05:19:59,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-02 05:19:59,646 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 93 [2018-12-02 05:19:59,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:19:59,655 INFO L225 Difference]: With dead ends: 13585 [2018-12-02 05:19:59,655 INFO L226 Difference]: Without dead ends: 13585 [2018-12-02 05:19:59,655 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2018-12-02 05:19:59,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13585 states. [2018-12-02 05:19:59,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13585 to 10925. [2018-12-02 05:19:59,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10925 states. [2018-12-02 05:19:59,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10925 states to 10925 states and 24988 transitions. [2018-12-02 05:19:59,742 INFO L78 Accepts]: Start accepts. Automaton has 10925 states and 24988 transitions. Word has length 93 [2018-12-02 05:19:59,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:19:59,742 INFO L480 AbstractCegarLoop]: Abstraction has 10925 states and 24988 transitions. [2018-12-02 05:19:59,742 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 05:19:59,743 INFO L276 IsEmpty]: Start isEmpty. Operand 10925 states and 24988 transitions. [2018-12-02 05:19:59,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-02 05:19:59,749 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:19:59,750 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:19:59,750 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:19:59,750 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:19:59,750 INFO L82 PathProgramCache]: Analyzing trace with hash -225894625, now seen corresponding path program 1 times [2018-12-02 05:19:59,750 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:19:59,750 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:19:59,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:19:59,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:19:59,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:19:59,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:19:59,801 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 05:19:59,801 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:19:59,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 05:19:59,802 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 05:19:59,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 05:19:59,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 05:19:59,802 INFO L87 Difference]: Start difference. First operand 10925 states and 24988 transitions. Second operand 6 states. [2018-12-02 05:19:59,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:19:59,873 INFO L93 Difference]: Finished difference Result 10445 states and 23532 transitions. [2018-12-02 05:19:59,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 05:19:59,873 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2018-12-02 05:19:59,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:19:59,880 INFO L225 Difference]: With dead ends: 10445 [2018-12-02 05:19:59,880 INFO L226 Difference]: Without dead ends: 10445 [2018-12-02 05:19:59,880 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-02 05:19:59,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10445 states. [2018-12-02 05:19:59,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10445 to 7076. [2018-12-02 05:19:59,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7076 states. [2018-12-02 05:19:59,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7076 states to 7076 states and 15970 transitions. [2018-12-02 05:19:59,946 INFO L78 Accepts]: Start accepts. Automaton has 7076 states and 15970 transitions. Word has length 93 [2018-12-02 05:19:59,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:19:59,946 INFO L480 AbstractCegarLoop]: Abstraction has 7076 states and 15970 transitions. [2018-12-02 05:19:59,946 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 05:19:59,946 INFO L276 IsEmpty]: Start isEmpty. Operand 7076 states and 15970 transitions. [2018-12-02 05:19:59,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-02 05:19:59,951 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:19:59,951 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:19:59,951 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:19:59,951 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:19:59,951 INFO L82 PathProgramCache]: Analyzing trace with hash -1574972597, now seen corresponding path program 1 times [2018-12-02 05:19:59,951 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:19:59,951 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:19:59,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:19:59,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:19:59,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:19:59,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:20:00,034 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 05:20:00,035 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:20:00,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-02 05:20:00,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 05:20:00,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 05:20:00,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-12-02 05:20:00,035 INFO L87 Difference]: Start difference. First operand 7076 states and 15970 transitions. Second operand 9 states. [2018-12-02 05:20:00,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:20:00,299 INFO L93 Difference]: Finished difference Result 8470 states and 18890 transitions. [2018-12-02 05:20:00,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-02 05:20:00,300 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 95 [2018-12-02 05:20:00,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:20:00,305 INFO L225 Difference]: With dead ends: 8470 [2018-12-02 05:20:00,305 INFO L226 Difference]: Without dead ends: 8470 [2018-12-02 05:20:00,305 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2018-12-02 05:20:00,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8470 states. [2018-12-02 05:20:00,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8470 to 8203. [2018-12-02 05:20:00,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8203 states. [2018-12-02 05:20:00,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8203 states to 8203 states and 18365 transitions. [2018-12-02 05:20:00,362 INFO L78 Accepts]: Start accepts. Automaton has 8203 states and 18365 transitions. Word has length 95 [2018-12-02 05:20:00,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:20:00,362 INFO L480 AbstractCegarLoop]: Abstraction has 8203 states and 18365 transitions. [2018-12-02 05:20:00,362 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 05:20:00,363 INFO L276 IsEmpty]: Start isEmpty. Operand 8203 states and 18365 transitions. [2018-12-02 05:20:00,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-02 05:20:00,368 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:20:00,368 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:20:00,368 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:20:00,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:20:00,368 INFO L82 PathProgramCache]: Analyzing trace with hash -687468916, now seen corresponding path program 1 times [2018-12-02 05:20:00,368 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:20:00,368 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:20:00,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:20:00,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:20:00,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:20:00,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:20:00,466 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 05:20:00,466 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:20:00,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-02 05:20:00,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 05:20:00,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 05:20:00,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-02 05:20:00,466 INFO L87 Difference]: Start difference. First operand 8203 states and 18365 transitions. Second operand 11 states. [2018-12-02 05:20:01,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:20:01,243 INFO L93 Difference]: Finished difference Result 15169 states and 34143 transitions. [2018-12-02 05:20:01,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-02 05:20:01,243 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 95 [2018-12-02 05:20:01,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:20:01,250 INFO L225 Difference]: With dead ends: 15169 [2018-12-02 05:20:01,250 INFO L226 Difference]: Without dead ends: 10493 [2018-12-02 05:20:01,250 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2018-12-02 05:20:01,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10493 states. [2018-12-02 05:20:01,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10493 to 7872. [2018-12-02 05:20:01,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7872 states. [2018-12-02 05:20:01,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7872 states to 7872 states and 17618 transitions. [2018-12-02 05:20:01,312 INFO L78 Accepts]: Start accepts. Automaton has 7872 states and 17618 transitions. Word has length 95 [2018-12-02 05:20:01,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:20:01,313 INFO L480 AbstractCegarLoop]: Abstraction has 7872 states and 17618 transitions. [2018-12-02 05:20:01,313 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 05:20:01,313 INFO L276 IsEmpty]: Start isEmpty. Operand 7872 states and 17618 transitions. [2018-12-02 05:20:01,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-02 05:20:01,318 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:20:01,318 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:20:01,318 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:20:01,318 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:20:01,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1086118301, now seen corresponding path program 1 times [2018-12-02 05:20:01,318 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:20:01,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:20:01,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:20:01,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:20:01,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:20:01,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:20:01,380 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 05:20:01,380 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:20:01,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 05:20:01,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 05:20:01,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 05:20:01,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 05:20:01,381 INFO L87 Difference]: Start difference. First operand 7872 states and 17618 transitions. Second operand 6 states. [2018-12-02 05:20:01,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:20:01,508 INFO L93 Difference]: Finished difference Result 8841 states and 19530 transitions. [2018-12-02 05:20:01,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 05:20:01,508 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2018-12-02 05:20:01,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:20:01,514 INFO L225 Difference]: With dead ends: 8841 [2018-12-02 05:20:01,514 INFO L226 Difference]: Without dead ends: 8784 [2018-12-02 05:20:01,514 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 05:20:01,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8784 states. [2018-12-02 05:20:01,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8784 to 7838. [2018-12-02 05:20:01,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7838 states. [2018-12-02 05:20:01,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7838 states to 7838 states and 17402 transitions. [2018-12-02 05:20:01,572 INFO L78 Accepts]: Start accepts. Automaton has 7838 states and 17402 transitions. Word has length 95 [2018-12-02 05:20:01,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:20:01,572 INFO L480 AbstractCegarLoop]: Abstraction has 7838 states and 17402 transitions. [2018-12-02 05:20:01,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 05:20:01,573 INFO L276 IsEmpty]: Start isEmpty. Operand 7838 states and 17402 transitions. [2018-12-02 05:20:01,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-02 05:20:01,578 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:20:01,578 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:20:01,578 INFO L423 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:20:01,578 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:20:01,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1904255005, now seen corresponding path program 2 times [2018-12-02 05:20:01,578 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:20:01,578 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:20:01,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:20:01,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:20:01,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:20:01,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:20:01,622 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 05:20:01,623 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:20:01,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 05:20:01,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 05:20:01,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 05:20:01,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 05:20:01,623 INFO L87 Difference]: Start difference. First operand 7838 states and 17402 transitions. Second operand 6 states. [2018-12-02 05:20:01,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:20:01,728 INFO L93 Difference]: Finished difference Result 8050 states and 17786 transitions. [2018-12-02 05:20:01,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 05:20:01,728 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2018-12-02 05:20:01,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:20:01,733 INFO L225 Difference]: With dead ends: 8050 [2018-12-02 05:20:01,733 INFO L226 Difference]: Without dead ends: 8050 [2018-12-02 05:20:01,733 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-02 05:20:01,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8050 states. [2018-12-02 05:20:01,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8050 to 7760. [2018-12-02 05:20:01,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7760 states. [2018-12-02 05:20:01,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7760 states to 7760 states and 17185 transitions. [2018-12-02 05:20:01,785 INFO L78 Accepts]: Start accepts. Automaton has 7760 states and 17185 transitions. Word has length 95 [2018-12-02 05:20:01,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:20:01,785 INFO L480 AbstractCegarLoop]: Abstraction has 7760 states and 17185 transitions. [2018-12-02 05:20:01,785 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 05:20:01,785 INFO L276 IsEmpty]: Start isEmpty. Operand 7760 states and 17185 transitions. [2018-12-02 05:20:01,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-02 05:20:01,790 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:20:01,790 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:20:01,790 INFO L423 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:20:01,791 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:20:01,791 INFO L82 PathProgramCache]: Analyzing trace with hash 1415884062, now seen corresponding path program 2 times [2018-12-02 05:20:01,791 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:20:01,791 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:20:01,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:20:01,791 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 05:20:01,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:20:01,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 05:20:01,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 05:20:01,831 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 05:20:01,892 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-02 05:20:01,893 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 05:20:01 BasicIcfg [2018-12-02 05:20:01,893 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 05:20:01,894 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 05:20:01,894 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 05:20:01,894 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 05:20:01,894 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:19:44" (3/4) ... [2018-12-02 05:20:01,896 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-02 05:20:01,963 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_2b821743-c9b6-4d51-b616-d736463dfd00/bin-2019/uautomizer/witness.graphml [2018-12-02 05:20:01,963 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 05:20:01,964 INFO L168 Benchmark]: Toolchain (without parser) took 18412.02 ms. Allocated memory was 1.0 GB in the beginning and 2.7 GB in the end (delta: 1.7 GB). Free memory was 951.7 MB in the beginning and 1.9 GB in the end (delta: -929.6 MB). Peak memory consumption was 763.4 MB. Max. memory is 11.5 GB. [2018-12-02 05:20:01,964 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 05:20:01,965 INFO L168 Benchmark]: CACSL2BoogieTranslator took 319.22 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.7 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -139.0 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. [2018-12-02 05:20:01,965 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.93 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-02 05:20:01,965 INFO L168 Benchmark]: Boogie Preprocessor took 22.19 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 05:20:01,965 INFO L168 Benchmark]: RCFGBuilder took 364.74 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 47.7 MB). Peak memory consumption was 47.7 MB. Max. memory is 11.5 GB. [2018-12-02 05:20:01,965 INFO L168 Benchmark]: TraceAbstraction took 17601.78 ms. Allocated memory was 1.1 GB in the beginning and 2.7 GB in the end (delta: 1.6 GB). Free memory was 1.0 GB in the beginning and 1.9 GB in the end (delta: -878.7 MB). Peak memory consumption was 701.5 MB. Max. memory is 11.5 GB. [2018-12-02 05:20:01,965 INFO L168 Benchmark]: Witness Printer took 69.32 ms. Allocated memory is still 2.7 GB. Free memory was 1.9 GB in the beginning and 1.9 GB in the end (delta: 35.1 MB). Peak memory consumption was 35.1 MB. Max. memory is 11.5 GB. [2018-12-02 05:20:01,966 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 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 319.22 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.7 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -139.0 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 31.93 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.19 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 364.74 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 47.7 MB). Peak memory consumption was 47.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 17601.78 ms. Allocated memory was 1.1 GB in the beginning and 2.7 GB in the end (delta: 1.6 GB). Free memory was 1.0 GB in the beginning and 1.9 GB in the end (delta: -878.7 MB). Peak memory consumption was 701.5 MB. Max. memory is 11.5 GB. * Witness Printer took 69.32 ms. Allocated memory is still 2.7 GB. Free memory was 1.9 GB in the beginning and 1.9 GB in the end (delta: 35.1 MB). Peak memory consumption was 35.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L671] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L673] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L675] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L676] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L677] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L679] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L681] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L682] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L683] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L684] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L685] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L686] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L687] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L688] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L689] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L690] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L691] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L692] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L693] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L694] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L695] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L696] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L697] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L773] -1 pthread_t t593; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L774] FCALL, FORK -1 pthread_create(&t593, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L701] 0 y$w_buff1 = y$w_buff0 [L702] 0 y$w_buff0 = 1 [L703] 0 y$w_buff1_used = y$w_buff0_used [L704] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L706] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L707] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L708] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L709] 0 y$r_buff0_thd1 = (_Bool)1 [L712] 0 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L715] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L775] -1 pthread_t t594; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L776] FCALL, FORK -1 pthread_create(&t594, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L729] 1 x = 2 [L732] 1 __unbuffered_p1_EAX = x [L735] 1 weak$$choice0 = __VERIFIER_nondet_pointer() [L736] 1 weak$$choice2 = __VERIFIER_nondet_pointer() [L737] 1 y$flush_delayed = weak$$choice2 [L738] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L739] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L739] 1 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L740] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L740] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L741] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L741] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L742] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L742] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L743] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L743] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L744] EXPR 1 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L744] 1 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L745] EXPR 1 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L745] 1 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L746] 1 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L747] EXPR 1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L715] 0 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L747] 1 y = y$flush_delayed ? y$mem_tmp : y [L748] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L716] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L716] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L717] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L717] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L718] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L718] 0 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L719] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L719] 0 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L722] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L751] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L751] EXPR 1 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L751] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L751] 1 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L752] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L752] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L753] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0] [L753] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L754] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L754] 1 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L755] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L755] 1 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L778] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L782] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L782] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L782] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L782] -1 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L783] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L783] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L784] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L784] -1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L785] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L785] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L786] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L786] -1 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L789] -1 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 222 locations, 3 error locations. UNSAFE Result, 17.5s OverallTime, 34 OverallIterations, 1 TraceHistogramMax, 8.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 8837 SDtfs, 10264 SDslu, 21529 SDs, 0 SdLazy, 9963 SolverSat, 483 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 361 GetRequests, 91 SyntacticMatches, 32 SemanticMatches, 238 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 336 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=38973occurred in iteration=16, 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: 5.1s AutomataMinimizationTime, 33 MinimizatonAttempts, 95177 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 2516 NumberOfCodeBlocks, 2516 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 2388 ConstructedInterpolants, 0 QuantifiedInterpolants, 520665 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 33 InterpolantComputations, 33 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...