./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-wmm/mix009_tso.oepc_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 91b1670e Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/pthread-wmm/mix009_tso.oepc_false-unreach-call.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 7173ac970a23592e8fa4a1dea5ce9a310499eb31 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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.24-91b1670 [2018-11-28 19:43:11,800 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 19:43:11,802 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 19:43:11,815 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 19:43:11,816 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 19:43:11,817 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 19:43:11,819 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 19:43:11,821 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 19:43:11,823 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 19:43:11,824 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 19:43:11,825 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 19:43:11,825 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 19:43:11,826 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 19:43:11,828 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 19:43:11,829 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 19:43:11,830 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 19:43:11,831 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 19:43:11,833 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 19:43:11,836 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 19:43:11,837 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 19:43:11,839 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 19:43:11,840 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 19:43:11,843 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 19:43:11,844 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 19:43:11,844 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 19:43:11,845 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 19:43:11,846 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 19:43:11,847 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 19:43:11,848 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 19:43:11,850 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 19:43:11,850 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 19:43:11,851 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 19:43:11,851 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 19:43:11,851 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 19:43:11,852 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 19:43:11,853 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 19:43:11,854 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-28 19:43:11,871 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 19:43:11,871 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 19:43:11,872 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 19:43:11,873 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 19:43:11,873 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 19:43:11,873 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 19:43:11,874 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 19:43:11,874 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 19:43:11,874 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 19:43:11,874 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 19:43:11,874 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 19:43:11,875 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 19:43:11,876 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 19:43:11,876 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 19:43:11,876 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 19:43:11,876 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 19:43:11,877 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 19:43:11,877 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 19:43:11,877 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 19:43:11,877 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 19:43:11,877 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 19:43:11,878 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 19:43:11,879 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 19:43:11,879 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 19:43:11,879 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 19:43:11,879 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 19:43:11,879 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 19:43:11,879 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 19:43:11,880 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 19:43:11,881 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 19:43:11,881 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 7173ac970a23592e8fa4a1dea5ce9a310499eb31 [2018-11-28 19:43:11,926 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 19:43:11,948 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 19:43:11,955 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 19:43:11,957 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 19:43:11,958 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 19:43:11,958 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-wmm/mix009_tso.oepc_false-unreach-call.i [2018-11-28 19:43:12,034 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97365b1b4/53c497d89ab84478bd2d66b9803b4b21/FLAGb44f3ffbb [2018-11-28 19:43:12,611 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 19:43:12,612 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-wmm/mix009_tso.oepc_false-unreach-call.i [2018-11-28 19:43:12,629 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97365b1b4/53c497d89ab84478bd2d66b9803b4b21/FLAGb44f3ffbb [2018-11-28 19:43:12,853 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97365b1b4/53c497d89ab84478bd2d66b9803b4b21 [2018-11-28 19:43:12,857 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 19:43:12,858 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 19:43:12,859 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 19:43:12,859 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 19:43:12,863 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 19:43:12,864 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 07:43:12" (1/1) ... [2018-11-28 19:43:12,868 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4874b7fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:43:12, skipping insertion in model container [2018-11-28 19:43:12,868 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 07:43:12" (1/1) ... [2018-11-28 19:43:12,877 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 19:43:12,946 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 19:43:13,496 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 19:43:13,520 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 19:43:13,661 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 19:43:13,756 INFO L195 MainTranslator]: Completed translation [2018-11-28 19:43:13,757 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:43:13 WrapperNode [2018-11-28 19:43:13,757 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 19:43:13,758 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 19:43:13,758 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 19:43:13,759 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 19:43:13,768 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:43:13" (1/1) ... [2018-11-28 19:43:13,801 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:43:13" (1/1) ... [2018-11-28 19:43:13,847 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 19:43:13,852 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 19:43:13,852 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 19:43:13,852 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 19:43:13,868 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:43:13" (1/1) ... [2018-11-28 19:43:13,868 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:43:13" (1/1) ... [2018-11-28 19:43:13,883 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:43:13" (1/1) ... [2018-11-28 19:43:13,883 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:43:13" (1/1) ... [2018-11-28 19:43:13,908 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:43:13" (1/1) ... [2018-11-28 19:43:13,918 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:43:13" (1/1) ... [2018-11-28 19:43:13,926 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:43:13" (1/1) ... [2018-11-28 19:43:13,935 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 19:43:13,938 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 19:43:13,938 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 19:43:13,938 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 19:43:13,939 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:43:13" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-28 19:43:14,023 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 19:43:14,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 19:43:14,026 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-11-28 19:43:14,027 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 19:43:14,027 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-11-28 19:43:14,027 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-11-28 19:43:14,027 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-11-28 19:43:14,027 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-11-28 19:43:14,027 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-11-28 19:43:14,030 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 19:43:14,030 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 19:43:14,032 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-11-28 19:43:15,129 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 19:43:15,129 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-28 19:43:15,130 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 07:43:15 BoogieIcfgContainer [2018-11-28 19:43:15,130 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 19:43:15,131 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 19:43:15,131 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 19:43:15,135 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 19:43:15,136 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 07:43:12" (1/3) ... [2018-11-28 19:43:15,137 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@269158be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 07:43:15, skipping insertion in model container [2018-11-28 19:43:15,137 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:43:13" (2/3) ... [2018-11-28 19:43:15,137 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@269158be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 07:43:15, skipping insertion in model container [2018-11-28 19:43:15,138 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 07:43:15" (3/3) ... [2018-11-28 19:43:15,141 INFO L112 eAbstractionObserver]: Analyzing ICFG mix009_tso.oepc_false-unreach-call.i [2018-11-28 19:43:15,190 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,190 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,191 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,191 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,191 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,191 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,192 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,192 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,192 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,193 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,194 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,194 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,195 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,195 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,195 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,195 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,197 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,197 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,197 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,197 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,197 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,198 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,198 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,198 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,198 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,200 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,200 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,200 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,201 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,201 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,201 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,201 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,202 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,203 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,203 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,203 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,204 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,204 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,206 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,206 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,206 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,206 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,207 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,207 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,207 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,207 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,207 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,209 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,209 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,209 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,210 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,210 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,210 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,210 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,212 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,212 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,212 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,213 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,213 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,214 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,214 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,214 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,214 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,214 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,215 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,215 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,215 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,215 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,215 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,217 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,218 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,218 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,218 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,218 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,218 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,219 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,220 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,220 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,220 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,220 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,221 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,221 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,221 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,221 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,221 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,221 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,223 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,223 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,224 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,224 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,224 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,224 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,224 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,226 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,226 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,226 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,226 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,226 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,227 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,227 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,227 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,227 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,227 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,229 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,230 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,230 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,230 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,230 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,230 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,230 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,232 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,232 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,232 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,232 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,232 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,233 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,234 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,234 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,234 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,234 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,236 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,236 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,236 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,236 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,237 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,237 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,238 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,238 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,238 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,238 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,239 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,240 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,240 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,240 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,240 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,240 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,241 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,242 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,242 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,242 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,242 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,243 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,243 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,243 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,243 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,243 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,244 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,246 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,246 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,246 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,246 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,247 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,248 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,248 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,248 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,248 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,248 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,249 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,249 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,249 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,249 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,249 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,252 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,252 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:15,269 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-11-28 19:43:15,269 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 19:43:15,279 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-11-28 19:43:15,299 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-11-28 19:43:15,328 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 19:43:15,329 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 19:43:15,329 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 19:43:15,330 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 19:43:15,330 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 19:43:15,330 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 19:43:15,330 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 19:43:15,330 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 19:43:15,330 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 19:43:15,345 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 145places, 183 transitions [2018-11-28 19:43:18,191 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 34809 states. [2018-11-28 19:43:18,193 INFO L276 IsEmpty]: Start isEmpty. Operand 34809 states. [2018-11-28 19:43:18,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-28 19:43:18,202 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:43:18,204 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] [2018-11-28 19:43:18,207 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:43:18,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:43:18,214 INFO L82 PathProgramCache]: Analyzing trace with hash 787354290, now seen corresponding path program 1 times [2018-11-28 19:43:18,217 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:43:18,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:43:18,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:18,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:43:18,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:18,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:43:18,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:43:18,540 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:43:18,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 19:43:18,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 19:43:18,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 19:43:18,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 19:43:18,561 INFO L87 Difference]: Start difference. First operand 34809 states. Second operand 4 states. [2018-11-28 19:43:20,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:43:20,171 INFO L93 Difference]: Finished difference Result 60793 states and 234496 transitions. [2018-11-28 19:43:20,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 19:43:20,175 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2018-11-28 19:43:20,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:43:20,524 INFO L225 Difference]: With dead ends: 60793 [2018-11-28 19:43:20,524 INFO L226 Difference]: Without dead ends: 44273 [2018-11-28 19:43:20,528 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-11-28 19:43:20,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44273 states. [2018-11-28 19:43:22,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44273 to 27341. [2018-11-28 19:43:22,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27341 states. [2018-11-28 19:43:22,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27341 states to 27341 states and 105502 transitions. [2018-11-28 19:43:22,296 INFO L78 Accepts]: Start accepts. Automaton has 27341 states and 105502 transitions. Word has length 36 [2018-11-28 19:43:22,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:43:22,297 INFO L480 AbstractCegarLoop]: Abstraction has 27341 states and 105502 transitions. [2018-11-28 19:43:22,297 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 19:43:22,297 INFO L276 IsEmpty]: Start isEmpty. Operand 27341 states and 105502 transitions. [2018-11-28 19:43:22,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-28 19:43:22,309 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:43:22,309 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 19:43:22,310 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:43:22,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:43:22,310 INFO L82 PathProgramCache]: Analyzing trace with hash 901056929, now seen corresponding path program 1 times [2018-11-28 19:43:22,310 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:43:22,310 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:43:22,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:22,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:43:22,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:22,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:43:22,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:43:22,427 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:43:22,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 19:43:22,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 19:43:22,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 19:43:22,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 19:43:22,430 INFO L87 Difference]: Start difference. First operand 27341 states and 105502 transitions. Second operand 4 states. [2018-11-28 19:43:22,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:43:22,809 INFO L93 Difference]: Finished difference Result 8531 states and 28347 transitions. [2018-11-28 19:43:22,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 19:43:22,810 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2018-11-28 19:43:22,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:43:22,853 INFO L225 Difference]: With dead ends: 8531 [2018-11-28 19:43:22,853 INFO L226 Difference]: Without dead ends: 7469 [2018-11-28 19:43:22,854 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-11-28 19:43:22,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7469 states. [2018-11-28 19:43:23,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7469 to 7469. [2018-11-28 19:43:23,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7469 states. [2018-11-28 19:43:23,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7469 states to 7469 states and 24639 transitions. [2018-11-28 19:43:23,087 INFO L78 Accepts]: Start accepts. Automaton has 7469 states and 24639 transitions. Word has length 48 [2018-11-28 19:43:23,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:43:23,089 INFO L480 AbstractCegarLoop]: Abstraction has 7469 states and 24639 transitions. [2018-11-28 19:43:23,089 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 19:43:23,089 INFO L276 IsEmpty]: Start isEmpty. Operand 7469 states and 24639 transitions. [2018-11-28 19:43:23,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-28 19:43:23,093 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:43:23,093 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 19:43:23,094 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:43:23,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:43:23,094 INFO L82 PathProgramCache]: Analyzing trace with hash 2027995578, now seen corresponding path program 1 times [2018-11-28 19:43:23,095 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:43:23,096 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:43:23,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:23,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:43:23,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:23,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:43:23,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:43:23,425 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:43:23,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 19:43:23,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 19:43:23,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 19:43:23,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 19:43:23,426 INFO L87 Difference]: Start difference. First operand 7469 states and 24639 transitions. Second operand 5 states. [2018-11-28 19:43:24,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:43:24,566 INFO L93 Difference]: Finished difference Result 14001 states and 45808 transitions. [2018-11-28 19:43:24,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 19:43:24,570 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2018-11-28 19:43:24,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:43:24,635 INFO L225 Difference]: With dead ends: 14001 [2018-11-28 19:43:24,636 INFO L226 Difference]: Without dead ends: 13933 [2018-11-28 19:43:24,636 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-28 19:43:24,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13933 states. [2018-11-28 19:43:24,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13933 to 9444. [2018-11-28 19:43:24,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9444 states. [2018-11-28 19:43:25,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9444 states to 9444 states and 30545 transitions. [2018-11-28 19:43:25,215 INFO L78 Accepts]: Start accepts. Automaton has 9444 states and 30545 transitions. Word has length 49 [2018-11-28 19:43:25,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:43:25,217 INFO L480 AbstractCegarLoop]: Abstraction has 9444 states and 30545 transitions. [2018-11-28 19:43:25,217 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 19:43:25,217 INFO L276 IsEmpty]: Start isEmpty. Operand 9444 states and 30545 transitions. [2018-11-28 19:43:25,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-28 19:43:25,220 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:43:25,220 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] [2018-11-28 19:43:25,221 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:43:25,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:43:25,221 INFO L82 PathProgramCache]: Analyzing trace with hash -39217920, now seen corresponding path program 1 times [2018-11-28 19:43:25,221 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:43:25,221 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:43:25,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:25,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:43:25,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:25,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:43:25,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:43:25,330 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:43:25,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 19:43:25,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 19:43:25,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 19:43:25,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 19:43:25,332 INFO L87 Difference]: Start difference. First operand 9444 states and 30545 transitions. Second operand 3 states. [2018-11-28 19:43:25,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:43:25,465 INFO L93 Difference]: Finished difference Result 13282 states and 42644 transitions. [2018-11-28 19:43:25,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 19:43:25,467 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2018-11-28 19:43:25,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:43:25,499 INFO L225 Difference]: With dead ends: 13282 [2018-11-28 19:43:25,500 INFO L226 Difference]: Without dead ends: 13282 [2018-11-28 19:43:25,500 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-11-28 19:43:25,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13282 states. [2018-11-28 19:43:25,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13282 to 9848. [2018-11-28 19:43:25,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9848 states. [2018-11-28 19:43:25,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9848 states to 9848 states and 31511 transitions. [2018-11-28 19:43:25,758 INFO L78 Accepts]: Start accepts. Automaton has 9848 states and 31511 transitions. Word has length 51 [2018-11-28 19:43:25,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:43:25,758 INFO L480 AbstractCegarLoop]: Abstraction has 9848 states and 31511 transitions. [2018-11-28 19:43:25,758 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 19:43:25,759 INFO L276 IsEmpty]: Start isEmpty. Operand 9848 states and 31511 transitions. [2018-11-28 19:43:25,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-28 19:43:25,762 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:43:25,763 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 19:43:25,763 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:43:25,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:43:25,763 INFO L82 PathProgramCache]: Analyzing trace with hash -557670517, now seen corresponding path program 1 times [2018-11-28 19:43:25,764 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:43:25,764 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:43:25,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:25,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:43:25,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:25,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:43:26,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-11-28 19:43:26,117 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:43:26,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 19:43:26,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 19:43:26,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 19:43:26,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 19:43:26,119 INFO L87 Difference]: Start difference. First operand 9848 states and 31511 transitions. Second operand 6 states. [2018-11-28 19:43:26,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:43:26,940 INFO L93 Difference]: Finished difference Result 14206 states and 45067 transitions. [2018-11-28 19:43:26,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 19:43:26,941 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2018-11-28 19:43:26,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:43:26,971 INFO L225 Difference]: With dead ends: 14206 [2018-11-28 19:43:26,971 INFO L226 Difference]: Without dead ends: 14134 [2018-11-28 19:43:26,971 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-11-28 19:43:27,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14134 states. [2018-11-28 19:43:27,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14134 to 10852. [2018-11-28 19:43:27,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10852 states. [2018-11-28 19:43:27,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10852 states to 10852 states and 34566 transitions. [2018-11-28 19:43:27,222 INFO L78 Accepts]: Start accepts. Automaton has 10852 states and 34566 transitions. Word has length 55 [2018-11-28 19:43:27,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:43:27,222 INFO L480 AbstractCegarLoop]: Abstraction has 10852 states and 34566 transitions. [2018-11-28 19:43:27,223 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 19:43:27,223 INFO L276 IsEmpty]: Start isEmpty. Operand 10852 states and 34566 transitions. [2018-11-28 19:43:27,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-28 19:43:27,228 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:43:27,229 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 19:43:27,229 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:43:27,229 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:43:27,229 INFO L82 PathProgramCache]: Analyzing trace with hash -3940633, now seen corresponding path program 1 times [2018-11-28 19:43:27,229 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:43:27,230 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:43:27,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:27,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:43:27,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:27,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:43:27,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:43:27,438 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:43:27,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 19:43:27,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 19:43:27,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 19:43:27,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 19:43:27,440 INFO L87 Difference]: Start difference. First operand 10852 states and 34566 transitions. Second operand 4 states. [2018-11-28 19:43:28,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:43:28,228 INFO L93 Difference]: Finished difference Result 12399 states and 39575 transitions. [2018-11-28 19:43:28,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 19:43:28,229 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2018-11-28 19:43:28,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:43:28,253 INFO L225 Difference]: With dead ends: 12399 [2018-11-28 19:43:28,253 INFO L226 Difference]: Without dead ends: 12399 [2018-11-28 19:43:28,254 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 19:43:28,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12399 states. [2018-11-28 19:43:28,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12399 to 11372. [2018-11-28 19:43:28,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11372 states. [2018-11-28 19:43:28,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11372 states to 11372 states and 36239 transitions. [2018-11-28 19:43:28,535 INFO L78 Accepts]: Start accepts. Automaton has 11372 states and 36239 transitions. Word has length 63 [2018-11-28 19:43:28,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:43:28,535 INFO L480 AbstractCegarLoop]: Abstraction has 11372 states and 36239 transitions. [2018-11-28 19:43:28,535 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 19:43:28,537 INFO L276 IsEmpty]: Start isEmpty. Operand 11372 states and 36239 transitions. [2018-11-28 19:43:28,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-28 19:43:28,546 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:43:28,546 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 19:43:28,546 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:43:28,547 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:43:28,547 INFO L82 PathProgramCache]: Analyzing trace with hash 1738869702, now seen corresponding path program 1 times [2018-11-28 19:43:28,547 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:43:28,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:43:28,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:28,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:43:28,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:28,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:43:28,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:43:28,878 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:43:28,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 19:43:28,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 19:43:28,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 19:43:28,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 19:43:28,880 INFO L87 Difference]: Start difference. First operand 11372 states and 36239 transitions. Second operand 6 states. [2018-11-28 19:43:29,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:43:29,845 INFO L93 Difference]: Finished difference Result 20972 states and 66489 transitions. [2018-11-28 19:43:29,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 19:43:29,846 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 63 [2018-11-28 19:43:29,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:43:29,888 INFO L225 Difference]: With dead ends: 20972 [2018-11-28 19:43:29,889 INFO L226 Difference]: Without dead ends: 20901 [2018-11-28 19:43:29,889 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-11-28 19:43:29,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20901 states. [2018-11-28 19:43:30,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20901 to 13758. [2018-11-28 19:43:30,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13758 states. [2018-11-28 19:43:30,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13758 states to 13758 states and 43283 transitions. [2018-11-28 19:43:30,517 INFO L78 Accepts]: Start accepts. Automaton has 13758 states and 43283 transitions. Word has length 63 [2018-11-28 19:43:30,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:43:30,518 INFO L480 AbstractCegarLoop]: Abstraction has 13758 states and 43283 transitions. [2018-11-28 19:43:30,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 19:43:30,518 INFO L276 IsEmpty]: Start isEmpty. Operand 13758 states and 43283 transitions. [2018-11-28 19:43:30,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-28 19:43:30,530 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:43:30,530 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 19:43:30,531 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:43:30,531 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:43:30,531 INFO L82 PathProgramCache]: Analyzing trace with hash 109789944, now seen corresponding path program 1 times [2018-11-28 19:43:30,531 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:43:30,531 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:43:30,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:30,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:43:30,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:30,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:43:30,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:43:30,704 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:43:30,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 19:43:30,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 19:43:30,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 19:43:30,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 19:43:30,705 INFO L87 Difference]: Start difference. First operand 13758 states and 43283 transitions. Second operand 4 states. [2018-11-28 19:43:31,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:43:31,195 INFO L93 Difference]: Finished difference Result 19950 states and 63167 transitions. [2018-11-28 19:43:31,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 19:43:31,196 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2018-11-28 19:43:31,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:43:31,231 INFO L225 Difference]: With dead ends: 19950 [2018-11-28 19:43:31,231 INFO L226 Difference]: Without dead ends: 19950 [2018-11-28 19:43:31,231 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 19:43:31,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19950 states. [2018-11-28 19:43:31,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19950 to 17922. [2018-11-28 19:43:31,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17922 states. [2018-11-28 19:43:31,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17922 states to 17922 states and 57082 transitions. [2018-11-28 19:43:31,550 INFO L78 Accepts]: Start accepts. Automaton has 17922 states and 57082 transitions. Word has length 67 [2018-11-28 19:43:31,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:43:31,551 INFO L480 AbstractCegarLoop]: Abstraction has 17922 states and 57082 transitions. [2018-11-28 19:43:31,551 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 19:43:31,551 INFO L276 IsEmpty]: Start isEmpty. Operand 17922 states and 57082 transitions. [2018-11-28 19:43:31,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-28 19:43:31,564 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:43:31,564 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 19:43:31,564 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:43:31,565 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:43:31,565 INFO L82 PathProgramCache]: Analyzing trace with hash -1697664519, now seen corresponding path program 1 times [2018-11-28 19:43:31,565 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:43:31,565 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:43:31,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:31,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:43:31,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:31,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:43:31,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:43:31,755 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:43:31,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 19:43:31,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 19:43:31,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 19:43:31,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 19:43:31,756 INFO L87 Difference]: Start difference. First operand 17922 states and 57082 transitions. Second operand 4 states. [2018-11-28 19:43:32,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:43:32,272 INFO L93 Difference]: Finished difference Result 22122 states and 69359 transitions. [2018-11-28 19:43:32,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 19:43:32,274 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2018-11-28 19:43:32,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:43:32,313 INFO L225 Difference]: With dead ends: 22122 [2018-11-28 19:43:32,313 INFO L226 Difference]: Without dead ends: 22122 [2018-11-28 19:43:32,313 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 19:43:32,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22122 states. [2018-11-28 19:43:32,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22122 to 20008. [2018-11-28 19:43:32,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20008 states. [2018-11-28 19:43:32,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20008 states to 20008 states and 63081 transitions. [2018-11-28 19:43:32,661 INFO L78 Accepts]: Start accepts. Automaton has 20008 states and 63081 transitions. Word has length 67 [2018-11-28 19:43:32,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:43:32,662 INFO L480 AbstractCegarLoop]: Abstraction has 20008 states and 63081 transitions. [2018-11-28 19:43:32,662 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 19:43:32,662 INFO L276 IsEmpty]: Start isEmpty. Operand 20008 states and 63081 transitions. [2018-11-28 19:43:32,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-28 19:43:32,685 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:43:32,685 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 19:43:32,686 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:43:32,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:43:32,687 INFO L82 PathProgramCache]: Analyzing trace with hash 520093434, now seen corresponding path program 1 times [2018-11-28 19:43:32,687 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:43:32,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:43:32,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:32,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:43:32,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:32,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:43:32,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:43:32,764 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:43:32,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 19:43:32,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 19:43:32,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 19:43:32,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 19:43:32,765 INFO L87 Difference]: Start difference. First operand 20008 states and 63081 transitions. Second operand 3 states. [2018-11-28 19:43:33,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:43:33,065 INFO L93 Difference]: Finished difference Result 20728 states and 65064 transitions. [2018-11-28 19:43:33,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 19:43:33,066 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2018-11-28 19:43:33,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:43:33,107 INFO L225 Difference]: With dead ends: 20728 [2018-11-28 19:43:33,108 INFO L226 Difference]: Without dead ends: 20728 [2018-11-28 19:43:33,108 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-11-28 19:43:33,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20728 states. [2018-11-28 19:43:33,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20728 to 20404. [2018-11-28 19:43:33,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20404 states. [2018-11-28 19:43:33,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20404 states to 20404 states and 64159 transitions. [2018-11-28 19:43:33,723 INFO L78 Accepts]: Start accepts. Automaton has 20404 states and 64159 transitions. Word has length 67 [2018-11-28 19:43:33,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:43:33,723 INFO L480 AbstractCegarLoop]: Abstraction has 20404 states and 64159 transitions. [2018-11-28 19:43:33,723 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 19:43:33,724 INFO L276 IsEmpty]: Start isEmpty. Operand 20404 states and 64159 transitions. [2018-11-28 19:43:33,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-28 19:43:33,736 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:43:33,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, 1, 1, 1, 1, 1] [2018-11-28 19:43:33,737 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:43:33,737 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:43:33,737 INFO L82 PathProgramCache]: Analyzing trace with hash -981974209, now seen corresponding path program 1 times [2018-11-28 19:43:33,737 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:43:33,737 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:43:33,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:33,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:43:33,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:33,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:43:33,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:43:33,898 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:43:33,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 19:43:33,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 19:43:33,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 19:43:33,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 19:43:33,899 INFO L87 Difference]: Start difference. First operand 20404 states and 64159 transitions. Second operand 3 states. [2018-11-28 19:43:34,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:43:34,267 INFO L93 Difference]: Finished difference Result 25692 states and 80601 transitions. [2018-11-28 19:43:34,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 19:43:34,268 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2018-11-28 19:43:34,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:43:34,322 INFO L225 Difference]: With dead ends: 25692 [2018-11-28 19:43:34,323 INFO L226 Difference]: Without dead ends: 25692 [2018-11-28 19:43:34,323 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 19:43:34,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25692 states. [2018-11-28 19:43:34,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25692 to 24788. [2018-11-28 19:43:34,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24788 states. [2018-11-28 19:43:34,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24788 states to 24788 states and 77827 transitions. [2018-11-28 19:43:34,698 INFO L78 Accepts]: Start accepts. Automaton has 24788 states and 77827 transitions. Word has length 69 [2018-11-28 19:43:34,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:43:34,699 INFO L480 AbstractCegarLoop]: Abstraction has 24788 states and 77827 transitions. [2018-11-28 19:43:34,699 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 19:43:34,699 INFO L276 IsEmpty]: Start isEmpty. Operand 24788 states and 77827 transitions. [2018-11-28 19:43:34,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-28 19:43:34,712 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:43:34,712 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] [2018-11-28 19:43:34,712 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:43:34,713 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:43:34,713 INFO L82 PathProgramCache]: Analyzing trace with hash 814977150, now seen corresponding path program 1 times [2018-11-28 19:43:34,713 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:43:34,713 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:43:34,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:34,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:43:34,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:34,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:43:35,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:43:35,049 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:43:35,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 19:43:35,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 19:43:35,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 19:43:35,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-28 19:43:35,050 INFO L87 Difference]: Start difference. First operand 24788 states and 77827 transitions. Second operand 6 states. [2018-11-28 19:43:36,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:43:36,409 INFO L93 Difference]: Finished difference Result 29944 states and 92734 transitions. [2018-11-28 19:43:36,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 19:43:36,410 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2018-11-28 19:43:36,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:43:36,463 INFO L225 Difference]: With dead ends: 29944 [2018-11-28 19:43:36,463 INFO L226 Difference]: Without dead ends: 29944 [2018-11-28 19:43:36,464 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-28 19:43:36,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29944 states. [2018-11-28 19:43:36,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29944 to 28268. [2018-11-28 19:43:36,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28268 states. [2018-11-28 19:43:36,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28268 states to 28268 states and 88152 transitions. [2018-11-28 19:43:36,898 INFO L78 Accepts]: Start accepts. Automaton has 28268 states and 88152 transitions. Word has length 69 [2018-11-28 19:43:36,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:43:36,898 INFO L480 AbstractCegarLoop]: Abstraction has 28268 states and 88152 transitions. [2018-11-28 19:43:36,898 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 19:43:36,898 INFO L276 IsEmpty]: Start isEmpty. Operand 28268 states and 88152 transitions. [2018-11-28 19:43:36,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-28 19:43:36,911 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:43:36,911 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] [2018-11-28 19:43:36,912 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:43:36,912 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:43:36,912 INFO L82 PathProgramCache]: Analyzing trace with hash -1262232193, now seen corresponding path program 1 times [2018-11-28 19:43:36,912 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:43:36,912 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:43:36,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:36,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:43:36,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:36,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:43:37,354 WARN L180 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 10 [2018-11-28 19:43:37,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:43:37,502 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:43:37,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 19:43:37,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 19:43:37,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 19:43:37,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 19:43:37,503 INFO L87 Difference]: Start difference. First operand 28268 states and 88152 transitions. Second operand 6 states. [2018-11-28 19:43:38,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:43:38,380 INFO L93 Difference]: Finished difference Result 32012 states and 96857 transitions. [2018-11-28 19:43:38,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 19:43:38,382 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2018-11-28 19:43:38,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:43:38,442 INFO L225 Difference]: With dead ends: 32012 [2018-11-28 19:43:38,442 INFO L226 Difference]: Without dead ends: 32012 [2018-11-28 19:43:38,442 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-11-28 19:43:38,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32012 states. [2018-11-28 19:43:39,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32012 to 28944. [2018-11-28 19:43:39,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28944 states. [2018-11-28 19:43:39,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28944 states to 28944 states and 88943 transitions. [2018-11-28 19:43:39,417 INFO L78 Accepts]: Start accepts. Automaton has 28944 states and 88943 transitions. Word has length 69 [2018-11-28 19:43:39,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:43:39,418 INFO L480 AbstractCegarLoop]: Abstraction has 28944 states and 88943 transitions. [2018-11-28 19:43:39,418 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 19:43:39,418 INFO L276 IsEmpty]: Start isEmpty. Operand 28944 states and 88943 transitions. [2018-11-28 19:43:39,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-28 19:43:39,434 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:43:39,434 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 19:43:39,434 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:43:39,434 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:43:39,434 INFO L82 PathProgramCache]: Analyzing trace with hash -1050881280, now seen corresponding path program 1 times [2018-11-28 19:43:39,435 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:43:39,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:43:39,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:39,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:43:39,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:39,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:43:39,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:43:39,600 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:43:39,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 19:43:39,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 19:43:39,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 19:43:39,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 19:43:39,601 INFO L87 Difference]: Start difference. First operand 28944 states and 88943 transitions. Second operand 5 states. [2018-11-28 19:43:40,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:43:40,166 INFO L93 Difference]: Finished difference Result 35071 states and 107222 transitions. [2018-11-28 19:43:40,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 19:43:40,167 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2018-11-28 19:43:40,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:43:40,230 INFO L225 Difference]: With dead ends: 35071 [2018-11-28 19:43:40,230 INFO L226 Difference]: Without dead ends: 35071 [2018-11-28 19:43:40,231 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-28 19:43:40,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35071 states. [2018-11-28 19:43:40,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35071 to 31628. [2018-11-28 19:43:40,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31628 states. [2018-11-28 19:43:40,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31628 states to 31628 states and 96602 transitions. [2018-11-28 19:43:40,749 INFO L78 Accepts]: Start accepts. Automaton has 31628 states and 96602 transitions. Word has length 69 [2018-11-28 19:43:40,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:43:40,749 INFO L480 AbstractCegarLoop]: Abstraction has 31628 states and 96602 transitions. [2018-11-28 19:43:40,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 19:43:40,749 INFO L276 IsEmpty]: Start isEmpty. Operand 31628 states and 96602 transitions. [2018-11-28 19:43:40,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-28 19:43:40,764 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:43:40,765 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] [2018-11-28 19:43:40,765 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:43:40,765 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:43:40,765 INFO L82 PathProgramCache]: Analyzing trace with hash 936600480, now seen corresponding path program 1 times [2018-11-28 19:43:40,765 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:43:40,765 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:43:40,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:40,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:43:40,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:40,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:43:40,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:43:40,833 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:43:40,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 19:43:40,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 19:43:40,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 19:43:40,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 19:43:40,834 INFO L87 Difference]: Start difference. First operand 31628 states and 96602 transitions. Second operand 3 states. [2018-11-28 19:43:41,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:43:41,201 INFO L93 Difference]: Finished difference Result 42528 states and 128529 transitions. [2018-11-28 19:43:41,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 19:43:41,202 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2018-11-28 19:43:41,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:43:41,284 INFO L225 Difference]: With dead ends: 42528 [2018-11-28 19:43:41,284 INFO L226 Difference]: Without dead ends: 42528 [2018-11-28 19:43:41,285 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-11-28 19:43:41,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42528 states. [2018-11-28 19:43:41,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42528 to 32736. [2018-11-28 19:43:41,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32736 states. [2018-11-28 19:43:41,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32736 states to 32736 states and 99897 transitions. [2018-11-28 19:43:41,881 INFO L78 Accepts]: Start accepts. Automaton has 32736 states and 99897 transitions. Word has length 69 [2018-11-28 19:43:41,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:43:41,881 INFO L480 AbstractCegarLoop]: Abstraction has 32736 states and 99897 transitions. [2018-11-28 19:43:41,881 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 19:43:41,881 INFO L276 IsEmpty]: Start isEmpty. Operand 32736 states and 99897 transitions. [2018-11-28 19:43:41,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-28 19:43:41,896 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:43:41,896 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] [2018-11-28 19:43:41,897 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:43:41,897 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:43:41,897 INFO L82 PathProgramCache]: Analyzing trace with hash -870853983, now seen corresponding path program 1 times [2018-11-28 19:43:41,897 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:43:41,897 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:43:41,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:41,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:43:41,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:41,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:43:42,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:43:42,310 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:43:42,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 19:43:42,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 19:43:42,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 19:43:42,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-28 19:43:42,311 INFO L87 Difference]: Start difference. First operand 32736 states and 99897 transitions. Second operand 7 states. [2018-11-28 19:43:43,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:43:43,015 INFO L93 Difference]: Finished difference Result 29386 states and 84354 transitions. [2018-11-28 19:43:43,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 19:43:43,016 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 69 [2018-11-28 19:43:43,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:43:43,058 INFO L225 Difference]: With dead ends: 29386 [2018-11-28 19:43:43,058 INFO L226 Difference]: Without dead ends: 29386 [2018-11-28 19:43:43,059 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2018-11-28 19:43:43,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29386 states. [2018-11-28 19:43:43,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29386 to 24927. [2018-11-28 19:43:43,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24927 states. [2018-11-28 19:43:43,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24927 states to 24927 states and 71599 transitions. [2018-11-28 19:43:43,691 INFO L78 Accepts]: Start accepts. Automaton has 24927 states and 71599 transitions. Word has length 69 [2018-11-28 19:43:43,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:43:43,692 INFO L480 AbstractCegarLoop]: Abstraction has 24927 states and 71599 transitions. [2018-11-28 19:43:43,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 19:43:43,692 INFO L276 IsEmpty]: Start isEmpty. Operand 24927 states and 71599 transitions. [2018-11-28 19:43:43,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-28 19:43:43,702 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:43:43,702 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] [2018-11-28 19:43:43,703 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:43:43,703 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:43:43,703 INFO L82 PathProgramCache]: Analyzing trace with hash 16649698, now seen corresponding path program 1 times [2018-11-28 19:43:43,703 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:43:43,703 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:43:43,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:43,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:43:43,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:43,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:43:43,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:43:43,935 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:43:43,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 19:43:43,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 19:43:43,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 19:43:43,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-28 19:43:43,936 INFO L87 Difference]: Start difference. First operand 24927 states and 71599 transitions. Second operand 5 states. [2018-11-28 19:43:44,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:43:44,106 INFO L93 Difference]: Finished difference Result 7463 states and 17981 transitions. [2018-11-28 19:43:44,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 19:43:44,107 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2018-11-28 19:43:44,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:43:44,115 INFO L225 Difference]: With dead ends: 7463 [2018-11-28 19:43:44,115 INFO L226 Difference]: Without dead ends: 6138 [2018-11-28 19:43:44,116 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-28 19:43:44,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6138 states. [2018-11-28 19:43:44,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6138 to 5532. [2018-11-28 19:43:44,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5532 states. [2018-11-28 19:43:44,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5532 states to 5532 states and 12870 transitions. [2018-11-28 19:43:44,183 INFO L78 Accepts]: Start accepts. Automaton has 5532 states and 12870 transitions. Word has length 69 [2018-11-28 19:43:44,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:43:44,183 INFO L480 AbstractCegarLoop]: Abstraction has 5532 states and 12870 transitions. [2018-11-28 19:43:44,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 19:43:44,183 INFO L276 IsEmpty]: Start isEmpty. Operand 5532 states and 12870 transitions. [2018-11-28 19:43:44,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-28 19:43:44,189 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:43:44,189 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] [2018-11-28 19:43:44,189 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:43:44,189 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:43:44,189 INFO L82 PathProgramCache]: Analyzing trace with hash 916580311, now seen corresponding path program 1 times [2018-11-28 19:43:44,190 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:43:44,190 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:43:44,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:44,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:43:44,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:44,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:43:44,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:43:44,262 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:43:44,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 19:43:44,263 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 19:43:44,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 19:43:44,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 19:43:44,263 INFO L87 Difference]: Start difference. First operand 5532 states and 12870 transitions. Second operand 3 states. [2018-11-28 19:43:44,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:43:44,441 INFO L93 Difference]: Finished difference Result 7168 states and 16476 transitions. [2018-11-28 19:43:44,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 19:43:44,442 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2018-11-28 19:43:44,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:43:44,450 INFO L225 Difference]: With dead ends: 7168 [2018-11-28 19:43:44,450 INFO L226 Difference]: Without dead ends: 7168 [2018-11-28 19:43:44,451 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-11-28 19:43:44,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7168 states. [2018-11-28 19:43:44,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7168 to 5471. [2018-11-28 19:43:44,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5471 states. [2018-11-28 19:43:44,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5471 states to 5471 states and 12410 transitions. [2018-11-28 19:43:44,517 INFO L78 Accepts]: Start accepts. Automaton has 5471 states and 12410 transitions. Word has length 69 [2018-11-28 19:43:44,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:43:44,518 INFO L480 AbstractCegarLoop]: Abstraction has 5471 states and 12410 transitions. [2018-11-28 19:43:44,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 19:43:44,518 INFO L276 IsEmpty]: Start isEmpty. Operand 5471 states and 12410 transitions. [2018-11-28 19:43:44,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-11-28 19:43:44,523 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:43:44,523 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] [2018-11-28 19:43:44,524 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:43:44,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:43:44,524 INFO L82 PathProgramCache]: Analyzing trace with hash -1596601910, now seen corresponding path program 1 times [2018-11-28 19:43:44,524 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:43:44,524 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:43:44,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:44,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:43:44,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:44,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:43:44,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:43:44,623 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:43:44,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 19:43:44,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 19:43:44,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 19:43:44,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 19:43:44,624 INFO L87 Difference]: Start difference. First operand 5471 states and 12410 transitions. Second operand 5 states. [2018-11-28 19:43:44,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:43:44,822 INFO L93 Difference]: Finished difference Result 6625 states and 15015 transitions. [2018-11-28 19:43:44,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 19:43:44,823 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2018-11-28 19:43:44,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:43:44,832 INFO L225 Difference]: With dead ends: 6625 [2018-11-28 19:43:44,832 INFO L226 Difference]: Without dead ends: 6625 [2018-11-28 19:43:44,832 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-11-28 19:43:44,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6625 states. [2018-11-28 19:43:44,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6625 to 5915. [2018-11-28 19:43:44,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5915 states. [2018-11-28 19:43:44,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5915 states to 5915 states and 13414 transitions. [2018-11-28 19:43:44,901 INFO L78 Accepts]: Start accepts. Automaton has 5915 states and 13414 transitions. Word has length 75 [2018-11-28 19:43:44,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:43:44,902 INFO L480 AbstractCegarLoop]: Abstraction has 5915 states and 13414 transitions. [2018-11-28 19:43:44,902 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 19:43:44,902 INFO L276 IsEmpty]: Start isEmpty. Operand 5915 states and 13414 transitions. [2018-11-28 19:43:44,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-11-28 19:43:44,908 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:43:44,908 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] [2018-11-28 19:43:44,909 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:43:44,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:43:44,909 INFO L82 PathProgramCache]: Analyzing trace with hash 146208425, now seen corresponding path program 1 times [2018-11-28 19:43:44,909 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:43:44,909 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:43:44,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:44,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:43:44,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:44,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:43:45,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-11-28 19:43:45,035 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:43:45,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 19:43:45,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 19:43:45,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 19:43:45,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-28 19:43:45,036 INFO L87 Difference]: Start difference. First operand 5915 states and 13414 transitions. Second operand 7 states. [2018-11-28 19:43:45,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:43:45,695 INFO L93 Difference]: Finished difference Result 6842 states and 15342 transitions. [2018-11-28 19:43:45,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-28 19:43:45,696 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 75 [2018-11-28 19:43:45,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:43:45,705 INFO L225 Difference]: With dead ends: 6842 [2018-11-28 19:43:45,705 INFO L226 Difference]: Without dead ends: 6740 [2018-11-28 19:43:45,706 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2018-11-28 19:43:45,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6740 states. [2018-11-28 19:43:45,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6740 to 6012. [2018-11-28 19:43:45,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6012 states. [2018-11-28 19:43:45,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6012 states to 6012 states and 13507 transitions. [2018-11-28 19:43:45,774 INFO L78 Accepts]: Start accepts. Automaton has 6012 states and 13507 transitions. Word has length 75 [2018-11-28 19:43:45,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:43:45,774 INFO L480 AbstractCegarLoop]: Abstraction has 6012 states and 13507 transitions. [2018-11-28 19:43:45,774 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 19:43:45,774 INFO L276 IsEmpty]: Start isEmpty. Operand 6012 states and 13507 transitions. [2018-11-28 19:43:45,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-28 19:43:45,781 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:43:45,781 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 19:43:45,782 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:43:45,782 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:43:45,782 INFO L82 PathProgramCache]: Analyzing trace with hash -70158648, now seen corresponding path program 1 times [2018-11-28 19:43:45,782 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:43:45,782 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:43:45,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:45,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:43:45,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:45,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:43:45,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:43:45,954 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:43:45,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 19:43:45,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 19:43:45,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 19:43:45,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-11-28 19:43:45,955 INFO L87 Difference]: Start difference. First operand 6012 states and 13507 transitions. Second operand 7 states. [2018-11-28 19:43:46,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:43:46,656 INFO L93 Difference]: Finished difference Result 7492 states and 16836 transitions. [2018-11-28 19:43:46,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 19:43:46,657 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2018-11-28 19:43:46,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:43:46,667 INFO L225 Difference]: With dead ends: 7492 [2018-11-28 19:43:46,667 INFO L226 Difference]: Without dead ends: 7492 [2018-11-28 19:43:46,668 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-11-28 19:43:46,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7492 states. [2018-11-28 19:43:46,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7492 to 6152. [2018-11-28 19:43:46,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6152 states. [2018-11-28 19:43:46,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6152 states to 6152 states and 13895 transitions. [2018-11-28 19:43:46,750 INFO L78 Accepts]: Start accepts. Automaton has 6152 states and 13895 transitions. Word has length 96 [2018-11-28 19:43:46,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:43:46,751 INFO L480 AbstractCegarLoop]: Abstraction has 6152 states and 13895 transitions. [2018-11-28 19:43:46,751 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 19:43:46,751 INFO L276 IsEmpty]: Start isEmpty. Operand 6152 states and 13895 transitions. [2018-11-28 19:43:46,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-28 19:43:46,758 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:43:46,758 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 19:43:46,760 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:43:46,760 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:43:46,760 INFO L82 PathProgramCache]: Analyzing trace with hash 914288555, now seen corresponding path program 1 times [2018-11-28 19:43:46,761 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:43:46,761 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:43:46,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:46,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:43:46,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:46,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:43:46,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:43:46,866 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:43:46,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 19:43:46,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 19:43:46,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 19:43:46,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 19:43:46,867 INFO L87 Difference]: Start difference. First operand 6152 states and 13895 transitions. Second operand 4 states. [2018-11-28 19:43:46,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:43:46,986 INFO L93 Difference]: Finished difference Result 7319 states and 16393 transitions. [2018-11-28 19:43:46,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 19:43:46,987 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2018-11-28 19:43:46,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:43:46,995 INFO L225 Difference]: With dead ends: 7319 [2018-11-28 19:43:46,995 INFO L226 Difference]: Without dead ends: 7319 [2018-11-28 19:43:46,996 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-11-28 19:43:47,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7319 states. [2018-11-28 19:43:47,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7319 to 6509. [2018-11-28 19:43:47,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6509 states. [2018-11-28 19:43:47,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6509 states to 6509 states and 14665 transitions. [2018-11-28 19:43:47,065 INFO L78 Accepts]: Start accepts. Automaton has 6509 states and 14665 transitions. Word has length 96 [2018-11-28 19:43:47,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:43:47,065 INFO L480 AbstractCegarLoop]: Abstraction has 6509 states and 14665 transitions. [2018-11-28 19:43:47,065 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 19:43:47,066 INFO L276 IsEmpty]: Start isEmpty. Operand 6509 states and 14665 transitions. [2018-11-28 19:43:47,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-11-28 19:43:47,074 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:43:47,074 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 19:43:47,075 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:43:47,075 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:43:47,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1593425393, now seen corresponding path program 1 times [2018-11-28 19:43:47,075 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:43:47,075 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:43:47,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:47,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:43:47,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:47,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:43:47,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:43:47,310 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:43:47,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 19:43:47,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 19:43:47,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 19:43:47,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 19:43:47,311 INFO L87 Difference]: Start difference. First operand 6509 states and 14665 transitions. Second operand 5 states. [2018-11-28 19:43:47,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:43:47,434 INFO L93 Difference]: Finished difference Result 7016 states and 15753 transitions. [2018-11-28 19:43:47,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 19:43:47,435 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2018-11-28 19:43:47,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:43:47,442 INFO L225 Difference]: With dead ends: 7016 [2018-11-28 19:43:47,443 INFO L226 Difference]: Without dead ends: 7016 [2018-11-28 19:43:47,443 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-28 19:43:47,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7016 states. [2018-11-28 19:43:47,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7016 to 5405. [2018-11-28 19:43:47,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5405 states. [2018-11-28 19:43:47,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5405 states to 5405 states and 12181 transitions. [2018-11-28 19:43:47,509 INFO L78 Accepts]: Start accepts. Automaton has 5405 states and 12181 transitions. Word has length 98 [2018-11-28 19:43:47,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:43:47,510 INFO L480 AbstractCegarLoop]: Abstraction has 5405 states and 12181 transitions. [2018-11-28 19:43:47,510 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 19:43:47,510 INFO L276 IsEmpty]: Start isEmpty. Operand 5405 states and 12181 transitions. [2018-11-28 19:43:47,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-11-28 19:43:47,518 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:43:47,519 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 19:43:47,519 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:43:47,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:43:47,519 INFO L82 PathProgramCache]: Analyzing trace with hash 1604741520, now seen corresponding path program 1 times [2018-11-28 19:43:47,519 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:43:47,519 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:43:47,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:47,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:43:47,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:47,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:43:47,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:43:47,692 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:43:47,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 19:43:47,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 19:43:47,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 19:43:47,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 19:43:47,693 INFO L87 Difference]: Start difference. First operand 5405 states and 12181 transitions. Second operand 4 states. [2018-11-28 19:43:47,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:43:47,964 INFO L93 Difference]: Finished difference Result 6953 states and 15553 transitions. [2018-11-28 19:43:47,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 19:43:47,965 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2018-11-28 19:43:47,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:43:47,974 INFO L225 Difference]: With dead ends: 6953 [2018-11-28 19:43:47,974 INFO L226 Difference]: Without dead ends: 6886 [2018-11-28 19:43:47,975 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 19:43:47,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6886 states. [2018-11-28 19:43:48,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6886 to 6454. [2018-11-28 19:43:48,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6454 states. [2018-11-28 19:43:48,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6454 states to 6454 states and 14500 transitions. [2018-11-28 19:43:48,058 INFO L78 Accepts]: Start accepts. Automaton has 6454 states and 14500 transitions. Word has length 98 [2018-11-28 19:43:48,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:43:48,058 INFO L480 AbstractCegarLoop]: Abstraction has 6454 states and 14500 transitions. [2018-11-28 19:43:48,058 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 19:43:48,059 INFO L276 IsEmpty]: Start isEmpty. Operand 6454 states and 14500 transitions. [2018-11-28 19:43:48,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-11-28 19:43:48,067 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:43:48,068 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 19:43:48,068 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:43:48,068 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:43:48,068 INFO L82 PathProgramCache]: Analyzing trace with hash -472467823, now seen corresponding path program 1 times [2018-11-28 19:43:48,068 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:43:48,068 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:43:48,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:48,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:43:48,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:48,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:43:48,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:43:48,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:43:48,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 19:43:48,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 19:43:48,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 19:43:48,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-28 19:43:48,273 INFO L87 Difference]: Start difference. First operand 6454 states and 14500 transitions. Second operand 7 states. [2018-11-28 19:43:48,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:43:48,471 INFO L93 Difference]: Finished difference Result 8207 states and 18480 transitions. [2018-11-28 19:43:48,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 19:43:48,472 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 98 [2018-11-28 19:43:48,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:43:48,481 INFO L225 Difference]: With dead ends: 8207 [2018-11-28 19:43:48,481 INFO L226 Difference]: Without dead ends: 8207 [2018-11-28 19:43:48,482 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-11-28 19:43:48,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8207 states. [2018-11-28 19:43:48,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8207 to 6294. [2018-11-28 19:43:48,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6294 states. [2018-11-28 19:43:48,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6294 states to 6294 states and 14032 transitions. [2018-11-28 19:43:48,561 INFO L78 Accepts]: Start accepts. Automaton has 6294 states and 14032 transitions. Word has length 98 [2018-11-28 19:43:48,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:43:48,561 INFO L480 AbstractCegarLoop]: Abstraction has 6294 states and 14032 transitions. [2018-11-28 19:43:48,561 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 19:43:48,561 INFO L276 IsEmpty]: Start isEmpty. Operand 6294 states and 14032 transitions. [2018-11-28 19:43:48,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-11-28 19:43:48,569 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:43:48,569 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 19:43:48,570 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:43:48,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:43:48,570 INFO L82 PathProgramCache]: Analyzing trace with hash -261116910, now seen corresponding path program 1 times [2018-11-28 19:43:48,570 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:43:48,570 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:43:48,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:48,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:43:48,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:48,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:43:48,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:43:48,817 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:43:48,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-11-28 19:43:48,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-28 19:43:48,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-28 19:43:48,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-11-28 19:43:48,818 INFO L87 Difference]: Start difference. First operand 6294 states and 14032 transitions. Second operand 13 states. [2018-11-28 19:43:49,544 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-11-28 19:43:51,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:43:51,351 INFO L93 Difference]: Finished difference Result 9083 states and 19952 transitions. [2018-11-28 19:43:51,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-28 19:43:51,353 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 98 [2018-11-28 19:43:51,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:43:51,363 INFO L225 Difference]: With dead ends: 9083 [2018-11-28 19:43:51,364 INFO L226 Difference]: Without dead ends: 9083 [2018-11-28 19:43:51,364 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=155, Invalid=715, Unknown=0, NotChecked=0, Total=870 [2018-11-28 19:43:51,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9083 states. [2018-11-28 19:43:51,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9083 to 6689. [2018-11-28 19:43:51,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6689 states. [2018-11-28 19:43:51,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6689 states to 6689 states and 14822 transitions. [2018-11-28 19:43:51,454 INFO L78 Accepts]: Start accepts. Automaton has 6689 states and 14822 transitions. Word has length 98 [2018-11-28 19:43:51,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:43:51,454 INFO L480 AbstractCegarLoop]: Abstraction has 6689 states and 14822 transitions. [2018-11-28 19:43:51,454 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-28 19:43:51,454 INFO L276 IsEmpty]: Start isEmpty. Operand 6689 states and 14822 transitions. [2018-11-28 19:43:51,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-11-28 19:43:51,462 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:43:51,462 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 19:43:51,462 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:43:51,462 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:43:51,463 INFO L82 PathProgramCache]: Analyzing trace with hash 626386771, now seen corresponding path program 1 times [2018-11-28 19:43:51,463 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:43:51,463 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:43:51,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:51,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:43:51,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:51,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:43:51,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:43:51,711 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:43:51,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-28 19:43:51,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-28 19:43:51,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 19:43:51,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-28 19:43:51,713 INFO L87 Difference]: Start difference. First operand 6689 states and 14822 transitions. Second operand 11 states. [2018-11-28 19:43:53,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:43:53,909 INFO L93 Difference]: Finished difference Result 12839 states and 28577 transitions. [2018-11-28 19:43:53,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-28 19:43:53,911 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 98 [2018-11-28 19:43:53,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:43:53,922 INFO L225 Difference]: With dead ends: 12839 [2018-11-28 19:43:53,923 INFO L226 Difference]: Without dead ends: 8804 [2018-11-28 19:43:53,923 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=110, Invalid=490, Unknown=0, NotChecked=0, Total=600 [2018-11-28 19:43:53,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8804 states. [2018-11-28 19:43:54,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8804 to 6619. [2018-11-28 19:43:54,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6619 states. [2018-11-28 19:43:54,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6619 states to 6619 states and 14610 transitions. [2018-11-28 19:43:54,035 INFO L78 Accepts]: Start accepts. Automaton has 6619 states and 14610 transitions. Word has length 98 [2018-11-28 19:43:54,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:43:54,035 INFO L480 AbstractCegarLoop]: Abstraction has 6619 states and 14610 transitions. [2018-11-28 19:43:54,035 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-28 19:43:54,035 INFO L276 IsEmpty]: Start isEmpty. Operand 6619 states and 14610 transitions. [2018-11-28 19:43:54,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-11-28 19:43:54,044 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:43:54,044 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 19:43:54,045 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:43:54,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:43:54,045 INFO L82 PathProgramCache]: Analyzing trace with hash 1409272266, now seen corresponding path program 1 times [2018-11-28 19:43:54,045 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:43:54,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:43:54,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:54,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:43:54,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:54,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:43:54,776 WARN L180 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 16 [2018-11-28 19:43:54,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:43:54,813 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:43:54,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 19:43:54,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 19:43:54,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 19:43:54,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-28 19:43:54,815 INFO L87 Difference]: Start difference. First operand 6619 states and 14610 transitions. Second operand 6 states. [2018-11-28 19:43:55,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:43:55,874 INFO L93 Difference]: Finished difference Result 7414 states and 16175 transitions. [2018-11-28 19:43:55,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 19:43:55,875 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 98 [2018-11-28 19:43:55,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:43:55,885 INFO L225 Difference]: With dead ends: 7414 [2018-11-28 19:43:55,885 INFO L226 Difference]: Without dead ends: 7362 [2018-11-28 19:43:55,886 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-11-28 19:43:55,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7362 states. [2018-11-28 19:43:55,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7362 to 6450. [2018-11-28 19:43:55,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6450 states. [2018-11-28 19:43:55,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6450 states to 6450 states and 14093 transitions. [2018-11-28 19:43:55,979 INFO L78 Accepts]: Start accepts. Automaton has 6450 states and 14093 transitions. Word has length 98 [2018-11-28 19:43:55,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:43:55,980 INFO L480 AbstractCegarLoop]: Abstraction has 6450 states and 14093 transitions. [2018-11-28 19:43:55,980 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 19:43:55,980 INFO L276 IsEmpty]: Start isEmpty. Operand 6450 states and 14093 transitions. [2018-11-28 19:43:55,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-11-28 19:43:55,988 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:43:55,988 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 19:43:55,988 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:43:55,989 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:43:55,989 INFO L82 PathProgramCache]: Analyzing trace with hash -1777515745, now seen corresponding path program 1 times [2018-11-28 19:43:55,989 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:43:55,989 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:43:55,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:55,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:43:55,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:56,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:43:56,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:43:56,341 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:43:56,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 19:43:56,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 19:43:56,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 19:43:56,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 19:43:56,344 INFO L87 Difference]: Start difference. First operand 6450 states and 14093 transitions. Second operand 5 states. [2018-11-28 19:43:56,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:43:56,625 INFO L93 Difference]: Finished difference Result 7763 states and 16865 transitions. [2018-11-28 19:43:56,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 19:43:56,627 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2018-11-28 19:43:56,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:43:56,637 INFO L225 Difference]: With dead ends: 7763 [2018-11-28 19:43:56,637 INFO L226 Difference]: Without dead ends: 7687 [2018-11-28 19:43:56,637 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-28 19:43:56,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7687 states. [2018-11-28 19:43:56,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7687 to 6324. [2018-11-28 19:43:56,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6324 states. [2018-11-28 19:43:56,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6324 states to 6324 states and 13851 transitions. [2018-11-28 19:43:56,718 INFO L78 Accepts]: Start accepts. Automaton has 6324 states and 13851 transitions. Word has length 98 [2018-11-28 19:43:56,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:43:56,719 INFO L480 AbstractCegarLoop]: Abstraction has 6324 states and 13851 transitions. [2018-11-28 19:43:56,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 19:43:56,719 INFO L276 IsEmpty]: Start isEmpty. Operand 6324 states and 13851 transitions. [2018-11-28 19:43:56,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-11-28 19:43:56,727 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:43:56,727 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 19:43:56,728 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:43:56,728 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:43:56,728 INFO L82 PathProgramCache]: Analyzing trace with hash -1053394241, now seen corresponding path program 1 times [2018-11-28 19:43:56,728 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:43:56,728 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:43:56,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:56,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:43:56,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:56,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:43:56,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:43:56,901 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:43:56,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 19:43:56,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 19:43:56,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 19:43:56,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 19:43:56,902 INFO L87 Difference]: Start difference. First operand 6324 states and 13851 transitions. Second operand 6 states. [2018-11-28 19:43:57,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:43:57,107 INFO L93 Difference]: Finished difference Result 6640 states and 14466 transitions. [2018-11-28 19:43:57,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 19:43:57,108 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 98 [2018-11-28 19:43:57,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:43:57,115 INFO L225 Difference]: With dead ends: 6640 [2018-11-28 19:43:57,115 INFO L226 Difference]: Without dead ends: 6640 [2018-11-28 19:43:57,116 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-11-28 19:43:57,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6640 states. [2018-11-28 19:43:57,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6640 to 6204. [2018-11-28 19:43:57,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6204 states. [2018-11-28 19:43:57,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6204 states to 6204 states and 13576 transitions. [2018-11-28 19:43:57,186 INFO L78 Accepts]: Start accepts. Automaton has 6204 states and 13576 transitions. Word has length 98 [2018-11-28 19:43:57,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:43:57,186 INFO L480 AbstractCegarLoop]: Abstraction has 6204 states and 13576 transitions. [2018-11-28 19:43:57,187 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 19:43:57,187 INFO L276 IsEmpty]: Start isEmpty. Operand 6204 states and 13576 transitions. [2018-11-28 19:43:57,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-11-28 19:43:57,194 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:43:57,194 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 19:43:57,194 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:43:57,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:43:57,195 INFO L82 PathProgramCache]: Analyzing trace with hash 486588683, now seen corresponding path program 1 times [2018-11-28 19:43:57,195 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:43:57,195 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:43:57,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:57,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:43:57,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:57,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:43:57,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:43:57,670 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:43:57,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-28 19:43:57,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-28 19:43:57,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 19:43:57,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-11-28 19:43:57,671 INFO L87 Difference]: Start difference. First operand 6204 states and 13576 transitions. Second operand 12 states. [2018-11-28 19:43:58,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:43:58,617 INFO L93 Difference]: Finished difference Result 8439 states and 18375 transitions. [2018-11-28 19:43:58,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-28 19:43:58,618 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 98 [2018-11-28 19:43:58,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:43:58,628 INFO L225 Difference]: With dead ends: 8439 [2018-11-28 19:43:58,628 INFO L226 Difference]: Without dead ends: 8439 [2018-11-28 19:43:58,629 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=104, Invalid=402, Unknown=0, NotChecked=0, Total=506 [2018-11-28 19:43:58,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8439 states. [2018-11-28 19:43:58,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8439 to 6219. [2018-11-28 19:43:58,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6219 states. [2018-11-28 19:43:58,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6219 states to 6219 states and 13609 transitions. [2018-11-28 19:43:58,710 INFO L78 Accepts]: Start accepts. Automaton has 6219 states and 13609 transitions. Word has length 98 [2018-11-28 19:43:58,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:43:58,710 INFO L480 AbstractCegarLoop]: Abstraction has 6219 states and 13609 transitions. [2018-11-28 19:43:58,710 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-28 19:43:58,710 INFO L276 IsEmpty]: Start isEmpty. Operand 6219 states and 13609 transitions. [2018-11-28 19:43:58,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-11-28 19:43:58,721 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:43:58,722 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 19:43:58,722 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:43:58,722 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:43:58,722 INFO L82 PathProgramCache]: Analyzing trace with hash 1405112171, now seen corresponding path program 2 times [2018-11-28 19:43:58,722 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:43:58,722 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:43:58,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:58,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:43:58,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:58,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 19:43:58,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 19:43:58,806 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-11-28 19:43:58,987 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-11-28 19:43:58,990 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 07:43:58 BasicIcfg [2018-11-28 19:43:58,991 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 19:43:58,992 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 19:43:58,992 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 19:43:58,992 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 19:43:58,995 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 07:43:15" (3/4) ... [2018-11-28 19:43:58,999 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-28 19:43:59,206 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-28 19:43:59,210 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 19:43:59,211 INFO L168 Benchmark]: Toolchain (without parser) took 46353.79 ms. Allocated memory was 1.0 GB in the beginning and 3.0 GB in the end (delta: 1.9 GB). Free memory was 951.4 MB in the beginning and 2.1 GB in the end (delta: -1.2 GB). Peak memory consumption was 771.3 MB. Max. memory is 11.5 GB. [2018-11-28 19:43:59,212 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 19:43:59,212 INFO L168 Benchmark]: CACSL2BoogieTranslator took 898.36 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.3 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -137.7 MB). Peak memory consumption was 36.6 MB. Max. memory is 11.5 GB. [2018-11-28 19:43:59,212 INFO L168 Benchmark]: Boogie Procedure Inliner took 93.54 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-11-28 19:43:59,216 INFO L168 Benchmark]: Boogie Preprocessor took 85.46 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-11-28 19:43:59,216 INFO L168 Benchmark]: RCFGBuilder took 1192.00 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: 45.5 MB). Peak memory consumption was 45.5 MB. Max. memory is 11.5 GB. [2018-11-28 19:43:59,217 INFO L168 Benchmark]: TraceAbstraction took 43860.73 ms. Allocated memory was 1.1 GB in the beginning and 3.0 GB in the end (delta: 1.8 GB). Free memory was 1.0 GB in the beginning and 2.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 702.1 MB. Max. memory is 11.5 GB. [2018-11-28 19:43:59,217 INFO L168 Benchmark]: Witness Printer took 217.99 ms. Allocated memory is still 3.0 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 39.3 MB). Peak memory consumption was 39.3 MB. Max. memory is 11.5 GB. [2018-11-28 19:43:59,222 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 898.36 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.3 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -137.7 MB). Peak memory consumption was 36.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 93.54 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 85.46 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 1192.00 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: 45.5 MB). Peak memory consumption was 45.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 43860.73 ms. Allocated memory was 1.1 GB in the beginning and 3.0 GB in the end (delta: 1.8 GB). Free memory was 1.0 GB in the beginning and 2.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 702.1 MB. Max. memory is 11.5 GB. * Witness Printer took 217.99 ms. Allocated memory is still 3.0 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 39.3 MB). Peak memory consumption was 39.3 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_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L675] -1 int __unbuffered_p0_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0] [L677] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0] [L679] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L680] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L681] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L683] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L685] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L687] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L688] -1 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L689] -1 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L690] -1 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L691] -1 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L692] -1 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L693] -1 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0] [L694] -1 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L695] -1 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L696] -1 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0] [L697] -1 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L698] -1 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L699] -1 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L700] -1 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L701] -1 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L702] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L703] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L785] -1 pthread_t t255; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L786] FCALL, FORK -1 pthread_create(&t255, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L707] 0 z$w_buff1 = z$w_buff0 [L708] 0 z$w_buff0 = 1 [L709] 0 z$w_buff1_used = z$w_buff0_used [L710] 0 z$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L787] -1 pthread_t t256; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L712] 0 z$r_buff1_thd0 = z$r_buff0_thd0 [L713] 0 z$r_buff1_thd1 = z$r_buff0_thd1 [L714] 0 z$r_buff1_thd2 = z$r_buff0_thd2 [L715] 0 z$r_buff0_thd1 = (_Bool)1 [L718] 0 x = 1 [L721] 0 __unbuffered_p0_EAX = x [L724] 0 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L788] FCALL, FORK -1 pthread_create(&t256, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L741] 1 y = 1 [L744] 1 __unbuffered_p1_EAX = y [L747] 1 weak$$choice0 = __VERIFIER_nondet_pointer() [L748] 1 weak$$choice2 = __VERIFIER_nondet_pointer() [L749] 1 z$flush_delayed = weak$$choice2 [L750] 1 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L751] EXPR 1 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L751] 1 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L752] EXPR 1 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L752] 1 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L727] EXPR 0 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L753] EXPR 1 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L753] 1 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L754] EXPR 1 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L754] 1 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L755] EXPR 1 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L755] 1 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L756] EXPR 1 weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L756] 1 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L757] EXPR 1 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L757] 1 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L758] 1 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L727] 0 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L728] EXPR 0 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L728] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L729] EXPR 0 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L729] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L730] EXPR 0 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L759] EXPR 1 z$flush_delayed ? z$mem_tmp : z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=1, z$flush_delayed ? z$mem_tmp : z=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L759] 1 z = z$flush_delayed ? z$mem_tmp : z [L760] 1 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L763] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L763] EXPR 1 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=0] [L763] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z)=0, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=0] [L763] 1 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L764] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L764] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L730] 0 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L765] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L731] EXPR 0 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L765] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L766] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L766] 1 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L767] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L767] 1 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L770] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L731] 0 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L734] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L790] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L794] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L794] EXPR -1 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L794] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L794] -1 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L795] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L795] -1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L796] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L796] -1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L797] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L797] -1 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L798] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L798] -1 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L801] -1 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 225 locations, 3 error locations. UNSAFE Result, 43.6s OverallTime, 32 OverallIterations, 1 TraceHistogramMax, 22.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 8431 SDtfs, 9354 SDslu, 19428 SDs, 0 SdLazy, 8699 SolverSat, 455 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 319 GetRequests, 80 SyntacticMatches, 28 SemanticMatches, 211 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 397 ImplicationChecksByTransitivity, 7.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34809occurred in iteration=0, 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: 9.9s AutomataMinimizationTime, 31 MinimizatonAttempts, 83472 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 6.7s InterpolantComputationTime, 2440 NumberOfCodeBlocks, 2440 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 2311 ConstructedInterpolants, 0 QuantifiedInterpolants, 489332 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 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...