./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-wmm/mix035_tso.opt_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f 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/mix035_tso.opt_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 00d92b40773ef1575f2814e1b92f3f694886005e ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-0ed9222-m [2019-01-13 01:31:54,044 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-13 01:31:54,049 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-13 01:31:54,062 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-13 01:31:54,062 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-13 01:31:54,063 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-13 01:31:54,065 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-13 01:31:54,067 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-13 01:31:54,068 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-13 01:31:54,069 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-13 01:31:54,070 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-13 01:31:54,070 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-13 01:31:54,071 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-13 01:31:54,072 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-13 01:31:54,073 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-13 01:31:54,074 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-13 01:31:54,075 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-13 01:31:54,077 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-13 01:31:54,079 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-13 01:31:54,081 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-13 01:31:54,082 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-13 01:31:54,083 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-13 01:31:54,086 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-13 01:31:54,086 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-13 01:31:54,087 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-13 01:31:54,088 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-13 01:31:54,089 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-13 01:31:54,090 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-13 01:31:54,090 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-13 01:31:54,092 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-13 01:31:54,092 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-13 01:31:54,093 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-13 01:31:54,093 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-13 01:31:54,093 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-13 01:31:54,094 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-13 01:31:54,095 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-13 01:31:54,095 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-13 01:31:54,118 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-13 01:31:54,122 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-13 01:31:54,123 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-13 01:31:54,124 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-13 01:31:54,125 INFO L133 SettingsManager]: * Use SBE=true [2019-01-13 01:31:54,126 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-13 01:31:54,126 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-13 01:31:54,126 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-13 01:31:54,126 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-13 01:31:54,126 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-13 01:31:54,128 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-13 01:31:54,128 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-13 01:31:54,129 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-13 01:31:54,129 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-13 01:31:54,129 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-13 01:31:54,130 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-13 01:31:54,130 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-13 01:31:54,130 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-13 01:31:54,130 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-13 01:31:54,130 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-13 01:31:54,131 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-13 01:31:54,131 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-13 01:31:54,131 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-13 01:31:54,131 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-13 01:31:54,131 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-13 01:31:54,131 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-13 01:31:54,132 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-13 01:31:54,135 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-13 01:31:54,135 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 -> 00d92b40773ef1575f2814e1b92f3f694886005e [2019-01-13 01:31:54,187 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-13 01:31:54,203 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-13 01:31:54,208 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-13 01:31:54,210 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-13 01:31:54,210 INFO L276 PluginConnector]: CDTParser initialized [2019-01-13 01:31:54,211 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-wmm/mix035_tso.opt_false-unreach-call.i [2019-01-13 01:31:54,278 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89a58c356/bb7a1ab55fad45be88e92dfc30d98941/FLAG43d333ec8 [2019-01-13 01:31:54,854 INFO L307 CDTParser]: Found 1 translation units. [2019-01-13 01:31:54,855 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-wmm/mix035_tso.opt_false-unreach-call.i [2019-01-13 01:31:54,887 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89a58c356/bb7a1ab55fad45be88e92dfc30d98941/FLAG43d333ec8 [2019-01-13 01:31:55,094 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89a58c356/bb7a1ab55fad45be88e92dfc30d98941 [2019-01-13 01:31:55,098 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-13 01:31:55,100 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-13 01:31:55,101 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-13 01:31:55,101 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-13 01:31:55,105 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-13 01:31:55,106 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 01:31:55" (1/1) ... [2019-01-13 01:31:55,110 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2140a624 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 01:31:55, skipping insertion in model container [2019-01-13 01:31:55,110 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 01:31:55" (1/1) ... [2019-01-13 01:31:55,120 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-13 01:31:55,192 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-13 01:31:55,713 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 01:31:55,738 INFO L191 MainTranslator]: Completed pre-run [2019-01-13 01:31:55,892 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 01:31:55,968 INFO L195 MainTranslator]: Completed translation [2019-01-13 01:31:55,968 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 01:31:55 WrapperNode [2019-01-13 01:31:55,969 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-13 01:31:55,970 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-13 01:31:55,970 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-13 01:31:55,970 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-13 01:31:55,979 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 01:31:55" (1/1) ... [2019-01-13 01:31:56,000 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 01:31:55" (1/1) ... [2019-01-13 01:31:56,036 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-13 01:31:56,036 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-13 01:31:56,036 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-13 01:31:56,037 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-13 01:31:56,048 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 01:31:55" (1/1) ... [2019-01-13 01:31:56,048 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 01:31:55" (1/1) ... [2019-01-13 01:31:56,054 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 01:31:55" (1/1) ... [2019-01-13 01:31:56,054 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 01:31:55" (1/1) ... [2019-01-13 01:31:56,065 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 01:31:55" (1/1) ... [2019-01-13 01:31:56,069 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 01:31:55" (1/1) ... [2019-01-13 01:31:56,073 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 01:31:55" (1/1) ... [2019-01-13 01:31:56,078 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-13 01:31:56,079 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-13 01:31:56,079 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-13 01:31:56,079 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-13 01:31:56,080 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 01:31:55" (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 [2019-01-13 01:31:56,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-13 01:31:56,152 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-01-13 01:31:56,153 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-13 01:31:56,153 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-13 01:31:56,153 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-01-13 01:31:56,153 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-01-13 01:31:56,153 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-01-13 01:31:56,154 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-01-13 01:31:56,154 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-01-13 01:31:56,154 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-01-13 01:31:56,154 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-01-13 01:31:56,155 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-13 01:31:56,155 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-13 01:31:56,157 WARN L204 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-01-13 01:31:57,184 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-13 01:31:57,185 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-13 01:31:57,186 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 01:31:57 BoogieIcfgContainer [2019-01-13 01:31:57,187 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-13 01:31:57,188 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-13 01:31:57,188 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-13 01:31:57,191 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-13 01:31:57,192 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.01 01:31:55" (1/3) ... [2019-01-13 01:31:57,193 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@688d2b4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 01:31:57, skipping insertion in model container [2019-01-13 01:31:57,193 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 01:31:55" (2/3) ... [2019-01-13 01:31:57,193 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@688d2b4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 01:31:57, skipping insertion in model container [2019-01-13 01:31:57,193 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 01:31:57" (3/3) ... [2019-01-13 01:31:57,195 INFO L112 eAbstractionObserver]: Analyzing ICFG mix035_tso.opt_false-unreach-call.i [2019-01-13 01:31:57,241 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,242 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,242 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,242 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,243 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,243 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,243 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,243 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,243 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,244 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,245 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet5.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,245 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,245 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,245 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,245 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,245 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet5.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,246 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,246 WARN L317 ript$VariableManager]: TermVariabe Thread2_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,246 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet5.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,246 WARN L317 ript$VariableManager]: TermVariabe Thread2_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,246 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,246 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet5.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,247 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,247 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,247 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,247 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,248 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,248 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,248 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,249 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,249 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,249 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,249 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,249 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,249 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,250 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,250 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,250 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,251 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,251 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,251 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,251 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,251 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,252 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,252 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,252 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,252 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,252 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,253 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,253 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,253 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,253 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,254 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,254 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,254 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,254 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,255 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,255 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,255 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,255 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,256 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,256 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,256 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,256 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,256 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,257 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,257 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,257 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,257 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,257 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,258 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,258 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,258 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,258 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,258 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,259 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,259 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,259 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,259 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,259 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,260 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,260 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,260 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,260 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,261 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,261 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,261 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,261 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,262 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,262 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,262 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,262 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,262 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,262 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,263 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,263 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,263 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,263 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,264 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,264 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,264 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,264 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,264 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,265 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,265 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,265 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,265 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,265 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,266 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,266 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,266 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,266 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,267 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,267 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,267 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,267 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,268 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,268 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,268 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,268 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,269 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,269 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,269 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,269 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,269 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,270 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,270 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,270 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,270 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,270 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,271 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,271 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,271 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,271 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,272 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,272 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,272 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,272 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,272 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,273 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,273 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,273 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,273 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,274 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,274 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,274 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,274 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,274 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,274 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,275 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:31:57,316 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-01-13 01:31:57,317 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-13 01:31:57,325 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-01-13 01:31:57,342 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-01-13 01:31:57,370 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-13 01:31:57,371 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-13 01:31:57,371 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-13 01:31:57,371 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-13 01:31:57,371 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-13 01:31:57,371 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-13 01:31:57,371 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-13 01:31:57,372 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-13 01:31:57,372 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-13 01:31:57,386 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 147places, 178 transitions [2019-01-13 01:32:28,057 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 149046 states. [2019-01-13 01:32:28,059 INFO L276 IsEmpty]: Start isEmpty. Operand 149046 states. [2019-01-13 01:32:28,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-01-13 01:32:28,074 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:32:28,075 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] [2019-01-13 01:32:28,078 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:32:28,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:32:28,084 INFO L82 PathProgramCache]: Analyzing trace with hash 585073781, now seen corresponding path program 1 times [2019-01-13 01:32:28,086 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:32:28,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:32:28,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:32:28,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:32:28,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:32:28,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:32:28,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 01:32:28,407 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:32:28,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 01:32:28,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 01:32:28,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 01:32:28,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 01:32:28,430 INFO L87 Difference]: Start difference. First operand 149046 states. Second operand 4 states. [2019-01-13 01:32:31,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:32:31,183 INFO L93 Difference]: Finished difference Result 257066 states and 1188605 transitions. [2019-01-13 01:32:31,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 01:32:31,185 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-01-13 01:32:31,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:32:32,636 INFO L225 Difference]: With dead ends: 257066 [2019-01-13 01:32:32,637 INFO L226 Difference]: Without dead ends: 174816 [2019-01-13 01:32:32,639 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 [2019-01-13 01:32:41,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174816 states. [2019-01-13 01:32:44,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174816 to 110556. [2019-01-13 01:32:44,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110556 states. [2019-01-13 01:32:44,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110556 states to 110556 states and 511487 transitions. [2019-01-13 01:32:44,788 INFO L78 Accepts]: Start accepts. Automaton has 110556 states and 511487 transitions. Word has length 47 [2019-01-13 01:32:44,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:32:44,790 INFO L480 AbstractCegarLoop]: Abstraction has 110556 states and 511487 transitions. [2019-01-13 01:32:44,790 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 01:32:44,790 INFO L276 IsEmpty]: Start isEmpty. Operand 110556 states and 511487 transitions. [2019-01-13 01:32:44,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-01-13 01:32:44,820 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:32:44,820 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] [2019-01-13 01:32:44,821 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:32:44,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:32:44,821 INFO L82 PathProgramCache]: Analyzing trace with hash 188144804, now seen corresponding path program 1 times [2019-01-13 01:32:44,821 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:32:44,821 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:32:44,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:32:44,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:32:44,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:32:44,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:32:44,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 01:32:44,955 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:32:44,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 01:32:44,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 01:32:44,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 01:32:44,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 01:32:44,958 INFO L87 Difference]: Start difference. First operand 110556 states and 511487 transitions. Second operand 3 states. [2019-01-13 01:32:47,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:32:47,568 INFO L93 Difference]: Finished difference Result 110556 states and 510462 transitions. [2019-01-13 01:32:47,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 01:32:47,569 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-01-13 01:32:47,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:32:48,038 INFO L225 Difference]: With dead ends: 110556 [2019-01-13 01:32:48,038 INFO L226 Difference]: Without dead ends: 110556 [2019-01-13 01:32:48,039 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 [2019-01-13 01:32:49,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110556 states. [2019-01-13 01:32:50,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110556 to 110556. [2019-01-13 01:32:50,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110556 states. [2019-01-13 01:32:51,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110556 states to 110556 states and 510462 transitions. [2019-01-13 01:32:51,052 INFO L78 Accepts]: Start accepts. Automaton has 110556 states and 510462 transitions. Word has length 55 [2019-01-13 01:32:51,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:32:51,053 INFO L480 AbstractCegarLoop]: Abstraction has 110556 states and 510462 transitions. [2019-01-13 01:32:51,053 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 01:32:51,053 INFO L276 IsEmpty]: Start isEmpty. Operand 110556 states and 510462 transitions. [2019-01-13 01:32:51,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-01-13 01:32:51,068 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:32:51,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] [2019-01-13 01:32:51,068 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:32:51,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:32:51,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1930955139, now seen corresponding path program 1 times [2019-01-13 01:32:51,069 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:32:51,069 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:32:51,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:32:51,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:32:51,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:32:51,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:32:51,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 01:32:51,250 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:32:51,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 01:32:51,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 01:32:51,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 01:32:51,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 01:32:51,251 INFO L87 Difference]: Start difference. First operand 110556 states and 510462 transitions. Second operand 4 states. [2019-01-13 01:32:53,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:32:53,590 INFO L93 Difference]: Finished difference Result 99454 states and 447847 transitions. [2019-01-13 01:32:53,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 01:32:53,591 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2019-01-13 01:32:53,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:32:54,122 INFO L225 Difference]: With dead ends: 99454 [2019-01-13 01:32:54,123 INFO L226 Difference]: Without dead ends: 95224 [2019-01-13 01:32:54,123 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-13 01:32:55,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95224 states. [2019-01-13 01:32:56,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95224 to 95224. [2019-01-13 01:32:56,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95224 states. [2019-01-13 01:32:56,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95224 states to 95224 states and 432231 transitions. [2019-01-13 01:32:56,945 INFO L78 Accepts]: Start accepts. Automaton has 95224 states and 432231 transitions. Word has length 55 [2019-01-13 01:32:56,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:32:56,945 INFO L480 AbstractCegarLoop]: Abstraction has 95224 states and 432231 transitions. [2019-01-13 01:32:56,946 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 01:32:56,946 INFO L276 IsEmpty]: Start isEmpty. Operand 95224 states and 432231 transitions. [2019-01-13 01:32:56,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-01-13 01:32:56,956 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:32:56,956 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] [2019-01-13 01:32:56,957 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:32:56,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:32:56,957 INFO L82 PathProgramCache]: Analyzing trace with hash -843007537, now seen corresponding path program 1 times [2019-01-13 01:32:56,957 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:32:56,957 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:32:56,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:32:56,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:32:56,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:32:56,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:32:57,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 01:32:57,082 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:32:57,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 01:32:57,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 01:32:57,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 01:32:57,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-13 01:32:57,083 INFO L87 Difference]: Start difference. First operand 95224 states and 432231 transitions. Second operand 5 states. [2019-01-13 01:32:57,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:32:57,369 INFO L93 Difference]: Finished difference Result 30968 states and 124075 transitions. [2019-01-13 01:32:57,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 01:32:57,370 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2019-01-13 01:32:57,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:32:57,465 INFO L225 Difference]: With dead ends: 30968 [2019-01-13 01:32:57,465 INFO L226 Difference]: Without dead ends: 27340 [2019-01-13 01:32:57,466 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-13 01:32:57,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27340 states. [2019-01-13 01:32:57,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27340 to 26880. [2019-01-13 01:32:57,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26880 states. [2019-01-13 01:32:57,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26880 states to 26880 states and 107557 transitions. [2019-01-13 01:32:57,976 INFO L78 Accepts]: Start accepts. Automaton has 26880 states and 107557 transitions. Word has length 56 [2019-01-13 01:32:57,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:32:57,976 INFO L480 AbstractCegarLoop]: Abstraction has 26880 states and 107557 transitions. [2019-01-13 01:32:57,976 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 01:32:57,976 INFO L276 IsEmpty]: Start isEmpty. Operand 26880 states and 107557 transitions. [2019-01-13 01:32:57,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-01-13 01:32:57,981 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:32:57,981 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] [2019-01-13 01:32:57,981 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:32:57,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:32:57,982 INFO L82 PathProgramCache]: Analyzing trace with hash -484759346, now seen corresponding path program 1 times [2019-01-13 01:32:57,982 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:32:57,982 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:32:57,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:32:57,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:32:57,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:32:58,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:32:58,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 01:32:58,318 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:32:58,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 01:32:58,318 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 01:32:58,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 01:32:58,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-13 01:32:58,320 INFO L87 Difference]: Start difference. First operand 26880 states and 107557 transitions. Second operand 6 states. [2019-01-13 01:32:59,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:32:59,381 INFO L93 Difference]: Finished difference Result 37432 states and 146030 transitions. [2019-01-13 01:32:59,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 01:32:59,382 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-01-13 01:32:59,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:32:59,473 INFO L225 Difference]: With dead ends: 37432 [2019-01-13 01:32:59,474 INFO L226 Difference]: Without dead ends: 37057 [2019-01-13 01:32:59,474 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-01-13 01:32:59,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37057 states. [2019-01-13 01:33:00,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37057 to 35273. [2019-01-13 01:33:00,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35273 states. [2019-01-13 01:33:00,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35273 states to 35273 states and 138604 transitions. [2019-01-13 01:33:00,734 INFO L78 Accepts]: Start accepts. Automaton has 35273 states and 138604 transitions. Word has length 56 [2019-01-13 01:33:00,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:33:00,734 INFO L480 AbstractCegarLoop]: Abstraction has 35273 states and 138604 transitions. [2019-01-13 01:33:00,734 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 01:33:00,734 INFO L276 IsEmpty]: Start isEmpty. Operand 35273 states and 138604 transitions. [2019-01-13 01:33:00,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-01-13 01:33:00,742 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:33:00,742 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] [2019-01-13 01:33:00,742 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:33:00,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:33:00,743 INFO L82 PathProgramCache]: Analyzing trace with hash 1508119156, now seen corresponding path program 1 times [2019-01-13 01:33:00,743 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:33:00,743 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:33:00,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:33:00,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:33:00,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:33:00,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:33:00,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 01:33:00,852 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:33:00,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 01:33:00,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 01:33:00,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 01:33:00,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 01:33:00,853 INFO L87 Difference]: Start difference. First operand 35273 states and 138604 transitions. Second operand 3 states. [2019-01-13 01:33:01,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:33:01,194 INFO L93 Difference]: Finished difference Result 46813 states and 181800 transitions. [2019-01-13 01:33:01,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 01:33:01,194 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-01-13 01:33:01,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:33:01,317 INFO L225 Difference]: With dead ends: 46813 [2019-01-13 01:33:01,317 INFO L226 Difference]: Without dead ends: 46793 [2019-01-13 01:33:01,318 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 [2019-01-13 01:33:01,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46793 states. [2019-01-13 01:33:01,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46793 to 36255. [2019-01-13 01:33:01,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36255 states. [2019-01-13 01:33:02,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36255 states to 36255 states and 141311 transitions. [2019-01-13 01:33:02,082 INFO L78 Accepts]: Start accepts. Automaton has 36255 states and 141311 transitions. Word has length 58 [2019-01-13 01:33:02,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:33:02,082 INFO L480 AbstractCegarLoop]: Abstraction has 36255 states and 141311 transitions. [2019-01-13 01:33:02,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 01:33:02,083 INFO L276 IsEmpty]: Start isEmpty. Operand 36255 states and 141311 transitions. [2019-01-13 01:33:02,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-01-13 01:33:02,089 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:33:02,089 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 01:33:02,090 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:33:02,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:33:02,090 INFO L82 PathProgramCache]: Analyzing trace with hash 979024319, now seen corresponding path program 1 times [2019-01-13 01:33:02,090 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:33:02,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:33:02,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:33:02,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:33:02,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:33:02,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:33:02,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 01:33:02,229 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:33:02,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 01:33:02,229 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 01:33:02,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 01:33:02,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-13 01:33:02,230 INFO L87 Difference]: Start difference. First operand 36255 states and 141311 transitions. Second operand 6 states. [2019-01-13 01:33:03,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:33:03,249 INFO L93 Difference]: Finished difference Result 50347 states and 193733 transitions. [2019-01-13 01:33:03,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-13 01:33:03,250 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2019-01-13 01:33:03,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:33:03,379 INFO L225 Difference]: With dead ends: 50347 [2019-01-13 01:33:03,379 INFO L226 Difference]: Without dead ends: 49862 [2019-01-13 01:33:03,379 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-01-13 01:33:03,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49862 states. [2019-01-13 01:33:04,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49862 to 39289. [2019-01-13 01:33:04,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39289 states. [2019-01-13 01:33:04,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39289 states to 39289 states and 153196 transitions. [2019-01-13 01:33:04,242 INFO L78 Accepts]: Start accepts. Automaton has 39289 states and 153196 transitions. Word has length 62 [2019-01-13 01:33:04,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:33:04,243 INFO L480 AbstractCegarLoop]: Abstraction has 39289 states and 153196 transitions. [2019-01-13 01:33:04,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 01:33:04,243 INFO L276 IsEmpty]: Start isEmpty. Operand 39289 states and 153196 transitions. [2019-01-13 01:33:04,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-01-13 01:33:04,266 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:33:04,267 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] [2019-01-13 01:33:04,267 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:33:04,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:33:04,267 INFO L82 PathProgramCache]: Analyzing trace with hash -307792068, now seen corresponding path program 1 times [2019-01-13 01:33:04,268 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:33:04,268 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:33:04,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:33:04,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:33:04,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:33:04,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:33:04,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 01:33:04,405 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:33:04,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 01:33:04,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 01:33:04,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 01:33:04,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-13 01:33:04,406 INFO L87 Difference]: Start difference. First operand 39289 states and 153196 transitions. Second operand 6 states. [2019-01-13 01:33:04,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:33:04,531 INFO L93 Difference]: Finished difference Result 12025 states and 40428 transitions. [2019-01-13 01:33:04,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 01:33:04,532 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 73 [2019-01-13 01:33:04,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:33:04,550 INFO L225 Difference]: With dead ends: 12025 [2019-01-13 01:33:04,551 INFO L226 Difference]: Without dead ends: 10201 [2019-01-13 01:33:04,551 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-01-13 01:33:04,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10201 states. [2019-01-13 01:33:04,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10201 to 10136. [2019-01-13 01:33:04,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10136 states. [2019-01-13 01:33:04,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10136 states to 10136 states and 33478 transitions. [2019-01-13 01:33:04,700 INFO L78 Accepts]: Start accepts. Automaton has 10136 states and 33478 transitions. Word has length 73 [2019-01-13 01:33:04,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:33:04,701 INFO L480 AbstractCegarLoop]: Abstraction has 10136 states and 33478 transitions. [2019-01-13 01:33:04,701 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 01:33:04,701 INFO L276 IsEmpty]: Start isEmpty. Operand 10136 states and 33478 transitions. [2019-01-13 01:33:04,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-01-13 01:33:04,718 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:33:04,718 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] [2019-01-13 01:33:04,719 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:33:04,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:33:04,719 INFO L82 PathProgramCache]: Analyzing trace with hash -1451763945, now seen corresponding path program 1 times [2019-01-13 01:33:04,719 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:33:04,719 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:33:04,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:33:04,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:33:04,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:33:04,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:33:05,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 01:33:05,031 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:33:05,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 01:33:05,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 01:33:05,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 01:33:05,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-13 01:33:05,033 INFO L87 Difference]: Start difference. First operand 10136 states and 33478 transitions. Second operand 5 states. [2019-01-13 01:33:05,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:33:05,747 INFO L93 Difference]: Finished difference Result 16403 states and 52436 transitions. [2019-01-13 01:33:05,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 01:33:05,748 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2019-01-13 01:33:05,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:33:05,776 INFO L225 Difference]: With dead ends: 16403 [2019-01-13 01:33:05,777 INFO L226 Difference]: Without dead ends: 16403 [2019-01-13 01:33:05,777 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-01-13 01:33:05,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16403 states. [2019-01-13 01:33:05,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16403 to 11971. [2019-01-13 01:33:05,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11971 states. [2019-01-13 01:33:05,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11971 states to 11971 states and 38746 transitions. [2019-01-13 01:33:05,991 INFO L78 Accepts]: Start accepts. Automaton has 11971 states and 38746 transitions. Word has length 92 [2019-01-13 01:33:05,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:33:05,991 INFO L480 AbstractCegarLoop]: Abstraction has 11971 states and 38746 transitions. [2019-01-13 01:33:05,991 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 01:33:05,991 INFO L276 IsEmpty]: Start isEmpty. Operand 11971 states and 38746 transitions. [2019-01-13 01:33:06,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-01-13 01:33:06,013 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:33:06,013 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] [2019-01-13 01:33:06,013 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:33:06,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:33:06,013 INFO L82 PathProgramCache]: Analyzing trace with hash -1384757192, now seen corresponding path program 1 times [2019-01-13 01:33:06,014 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:33:06,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:33:06,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:33:06,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:33:06,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:33:06,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:33:06,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 01:33:06,329 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:33:06,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 01:33:06,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 01:33:06,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 01:33:06,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 01:33:06,330 INFO L87 Difference]: Start difference. First operand 11971 states and 38746 transitions. Second operand 4 states. [2019-01-13 01:33:06,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:33:06,855 INFO L93 Difference]: Finished difference Result 16269 states and 51830 transitions. [2019-01-13 01:33:06,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 01:33:06,856 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-01-13 01:33:06,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:33:06,884 INFO L225 Difference]: With dead ends: 16269 [2019-01-13 01:33:06,884 INFO L226 Difference]: Without dead ends: 16269 [2019-01-13 01:33:06,884 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 01:33:06,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16269 states. [2019-01-13 01:33:07,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16269 to 12406. [2019-01-13 01:33:07,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12406 states. [2019-01-13 01:33:07,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12406 states to 12406 states and 40224 transitions. [2019-01-13 01:33:07,096 INFO L78 Accepts]: Start accepts. Automaton has 12406 states and 40224 transitions. Word has length 92 [2019-01-13 01:33:07,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:33:07,096 INFO L480 AbstractCegarLoop]: Abstraction has 12406 states and 40224 transitions. [2019-01-13 01:33:07,096 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 01:33:07,096 INFO L276 IsEmpty]: Start isEmpty. Operand 12406 states and 40224 transitions. [2019-01-13 01:33:07,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-01-13 01:33:07,119 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:33:07,119 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] [2019-01-13 01:33:07,120 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:33:07,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:33:07,120 INFO L82 PathProgramCache]: Analyzing trace with hash -1639493737, now seen corresponding path program 1 times [2019-01-13 01:33:07,120 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:33:07,120 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:33:07,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:33:07,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:33:07,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:33:07,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:33:07,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 01:33:07,248 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:33:07,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 01:33:07,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 01:33:07,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 01:33:07,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 01:33:07,249 INFO L87 Difference]: Start difference. First operand 12406 states and 40224 transitions. Second operand 3 states. [2019-01-13 01:33:07,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:33:07,650 INFO L93 Difference]: Finished difference Result 13041 states and 42027 transitions. [2019-01-13 01:33:07,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 01:33:07,651 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2019-01-13 01:33:07,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:33:07,673 INFO L225 Difference]: With dead ends: 13041 [2019-01-13 01:33:07,674 INFO L226 Difference]: Without dead ends: 13041 [2019-01-13 01:33:07,674 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 [2019-01-13 01:33:07,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13041 states. [2019-01-13 01:33:07,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13041 to 12696. [2019-01-13 01:33:07,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12696 states. [2019-01-13 01:33:08,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12696 states to 12696 states and 40971 transitions. [2019-01-13 01:33:08,031 INFO L78 Accepts]: Start accepts. Automaton has 12696 states and 40971 transitions. Word has length 92 [2019-01-13 01:33:08,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:33:08,031 INFO L480 AbstractCegarLoop]: Abstraction has 12696 states and 40971 transitions. [2019-01-13 01:33:08,031 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 01:33:08,031 INFO L276 IsEmpty]: Start isEmpty. Operand 12696 states and 40971 transitions. [2019-01-13 01:33:08,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-01-13 01:33:08,050 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:33:08,050 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] [2019-01-13 01:33:08,050 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:33:08,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:33:08,051 INFO L82 PathProgramCache]: Analyzing trace with hash 1042856709, now seen corresponding path program 2 times [2019-01-13 01:33:08,051 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:33:08,051 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:33:08,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:33:08,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:33:08,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:33:08,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:33:08,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 01:33:08,304 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:33:08,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 01:33:08,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 01:33:08,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 01:33:08,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 01:33:08,306 INFO L87 Difference]: Start difference. First operand 12696 states and 40971 transitions. Second operand 4 states. [2019-01-13 01:33:08,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:33:08,588 INFO L93 Difference]: Finished difference Result 13528 states and 43739 transitions. [2019-01-13 01:33:08,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 01:33:08,589 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-01-13 01:33:08,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:33:08,613 INFO L225 Difference]: With dead ends: 13528 [2019-01-13 01:33:08,613 INFO L226 Difference]: Without dead ends: 13528 [2019-01-13 01:33:08,614 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 01:33:08,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13528 states. [2019-01-13 01:33:08,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13528 to 12952. [2019-01-13 01:33:08,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12952 states. [2019-01-13 01:33:08,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12952 states to 12952 states and 41867 transitions. [2019-01-13 01:33:08,810 INFO L78 Accepts]: Start accepts. Automaton has 12952 states and 41867 transitions. Word has length 92 [2019-01-13 01:33:08,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:33:08,810 INFO L480 AbstractCegarLoop]: Abstraction has 12952 states and 41867 transitions. [2019-01-13 01:33:08,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 01:33:08,810 INFO L276 IsEmpty]: Start isEmpty. Operand 12952 states and 41867 transitions. [2019-01-13 01:33:08,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-01-13 01:33:08,829 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:33:08,829 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] [2019-01-13 01:33:08,829 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:33:08,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:33:08,829 INFO L82 PathProgramCache]: Analyzing trace with hash -764597754, now seen corresponding path program 1 times [2019-01-13 01:33:08,830 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:33:08,830 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:33:08,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:33:08,832 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 01:33:08,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:33:08,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:33:09,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 01:33:09,147 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:33:09,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 01:33:09,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 01:33:09,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 01:33:09,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-13 01:33:09,148 INFO L87 Difference]: Start difference. First operand 12952 states and 41867 transitions. Second operand 6 states. [2019-01-13 01:33:09,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:33:09,636 INFO L93 Difference]: Finished difference Result 18685 states and 59837 transitions. [2019-01-13 01:33:09,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 01:33:09,637 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 92 [2019-01-13 01:33:09,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:33:09,669 INFO L225 Difference]: With dead ends: 18685 [2019-01-13 01:33:09,669 INFO L226 Difference]: Without dead ends: 18557 [2019-01-13 01:33:09,669 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-13 01:33:09,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18557 states. [2019-01-13 01:33:09,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18557 to 16485. [2019-01-13 01:33:09,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16485 states. [2019-01-13 01:33:09,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16485 states to 16485 states and 53213 transitions. [2019-01-13 01:33:09,925 INFO L78 Accepts]: Start accepts. Automaton has 16485 states and 53213 transitions. Word has length 92 [2019-01-13 01:33:09,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:33:09,925 INFO L480 AbstractCegarLoop]: Abstraction has 16485 states and 53213 transitions. [2019-01-13 01:33:09,925 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 01:33:09,925 INFO L276 IsEmpty]: Start isEmpty. Operand 16485 states and 53213 transitions. [2019-01-13 01:33:09,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-01-13 01:33:09,948 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:33:09,949 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 01:33:09,949 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:33:09,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:33:09,949 INFO L82 PathProgramCache]: Analyzing trace with hash 1733418183, now seen corresponding path program 1 times [2019-01-13 01:33:09,949 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:33:09,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:33:09,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:33:09,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:33:09,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:33:09,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:33:10,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 01:33:10,163 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:33:10,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 01:33:10,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 01:33:10,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 01:33:10,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-13 01:33:10,165 INFO L87 Difference]: Start difference. First operand 16485 states and 53213 transitions. Second operand 7 states. [2019-01-13 01:33:11,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:33:11,085 INFO L93 Difference]: Finished difference Result 30090 states and 97304 transitions. [2019-01-13 01:33:11,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-13 01:33:11,086 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2019-01-13 01:33:11,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:33:11,139 INFO L225 Difference]: With dead ends: 30090 [2019-01-13 01:33:11,139 INFO L226 Difference]: Without dead ends: 30090 [2019-01-13 01:33:11,139 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2019-01-13 01:33:11,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30090 states. [2019-01-13 01:33:11,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30090 to 19441. [2019-01-13 01:33:11,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19441 states. [2019-01-13 01:33:11,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19441 states to 19441 states and 63058 transitions. [2019-01-13 01:33:11,524 INFO L78 Accepts]: Start accepts. Automaton has 19441 states and 63058 transitions. Word has length 92 [2019-01-13 01:33:11,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:33:11,524 INFO L480 AbstractCegarLoop]: Abstraction has 19441 states and 63058 transitions. [2019-01-13 01:33:11,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 01:33:11,526 INFO L276 IsEmpty]: Start isEmpty. Operand 19441 states and 63058 transitions. [2019-01-13 01:33:11,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-01-13 01:33:11,562 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:33:11,563 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] [2019-01-13 01:33:11,563 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:33:11,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:33:11,563 INFO L82 PathProgramCache]: Analyzing trace with hash -1674045432, now seen corresponding path program 1 times [2019-01-13 01:33:11,563 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:33:11,564 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:33:11,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:33:11,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:33:11,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:33:11,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:33:11,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 01:33:11,844 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:33:11,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 01:33:11,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 01:33:11,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 01:33:11,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-13 01:33:11,845 INFO L87 Difference]: Start difference. First operand 19441 states and 63058 transitions. Second operand 6 states. [2019-01-13 01:33:12,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:33:12,351 INFO L93 Difference]: Finished difference Result 22178 states and 71372 transitions. [2019-01-13 01:33:12,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 01:33:12,352 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 92 [2019-01-13 01:33:12,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:33:12,403 INFO L225 Difference]: With dead ends: 22178 [2019-01-13 01:33:12,403 INFO L226 Difference]: Without dead ends: 22178 [2019-01-13 01:33:12,404 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-01-13 01:33:12,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22178 states. [2019-01-13 01:33:12,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22178 to 17776. [2019-01-13 01:33:12,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17776 states. [2019-01-13 01:33:12,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17776 states to 17776 states and 56961 transitions. [2019-01-13 01:33:12,831 INFO L78 Accepts]: Start accepts. Automaton has 17776 states and 56961 transitions. Word has length 92 [2019-01-13 01:33:12,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:33:12,832 INFO L480 AbstractCegarLoop]: Abstraction has 17776 states and 56961 transitions. [2019-01-13 01:33:12,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 01:33:12,832 INFO L276 IsEmpty]: Start isEmpty. Operand 17776 states and 56961 transitions. [2019-01-13 01:33:12,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-01-13 01:33:12,856 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:33:12,857 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] [2019-01-13 01:33:12,857 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:33:12,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:33:12,857 INFO L82 PathProgramCache]: Analyzing trace with hash -1196331413, now seen corresponding path program 1 times [2019-01-13 01:33:12,858 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:33:12,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:33:12,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:33:12,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:33:12,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:33:12,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:33:13,337 WARN L181 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 6 [2019-01-13 01:33:13,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 01:33:13,488 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:33:13,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 01:33:13,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 01:33:13,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 01:33:13,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-13 01:33:13,489 INFO L87 Difference]: Start difference. First operand 17776 states and 56961 transitions. Second operand 6 states. [2019-01-13 01:33:13,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:33:13,775 INFO L93 Difference]: Finished difference Result 18923 states and 60686 transitions. [2019-01-13 01:33:13,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 01:33:13,776 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 92 [2019-01-13 01:33:13,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:33:13,814 INFO L225 Difference]: With dead ends: 18923 [2019-01-13 01:33:13,814 INFO L226 Difference]: Without dead ends: 18923 [2019-01-13 01:33:13,814 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-13 01:33:13,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18923 states. [2019-01-13 01:33:14,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18923 to 15766. [2019-01-13 01:33:14,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15766 states. [2019-01-13 01:33:14,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15766 states to 15766 states and 50032 transitions. [2019-01-13 01:33:14,087 INFO L78 Accepts]: Start accepts. Automaton has 15766 states and 50032 transitions. Word has length 92 [2019-01-13 01:33:14,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:33:14,087 INFO L480 AbstractCegarLoop]: Abstraction has 15766 states and 50032 transitions. [2019-01-13 01:33:14,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 01:33:14,087 INFO L276 IsEmpty]: Start isEmpty. Operand 15766 states and 50032 transitions. [2019-01-13 01:33:14,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-01-13 01:33:14,106 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:33:14,106 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] [2019-01-13 01:33:14,107 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:33:14,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:33:14,107 INFO L82 PathProgramCache]: Analyzing trace with hash 173075913, now seen corresponding path program 1 times [2019-01-13 01:33:14,107 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:33:14,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:33:14,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:33:14,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:33:14,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:33:14,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:33:14,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 01:33:14,412 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:33:14,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 01:33:14,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 01:33:14,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 01:33:14,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-13 01:33:14,414 INFO L87 Difference]: Start difference. First operand 15766 states and 50032 transitions. Second operand 6 states. [2019-01-13 01:33:14,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:33:14,628 INFO L93 Difference]: Finished difference Result 14486 states and 45104 transitions. [2019-01-13 01:33:14,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 01:33:14,629 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 92 [2019-01-13 01:33:14,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:33:14,653 INFO L225 Difference]: With dead ends: 14486 [2019-01-13 01:33:14,653 INFO L226 Difference]: Without dead ends: 14486 [2019-01-13 01:33:14,653 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-01-13 01:33:14,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14486 states. [2019-01-13 01:33:14,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14486 to 10377. [2019-01-13 01:33:14,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10377 states. [2019-01-13 01:33:14,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10377 states to 10377 states and 32407 transitions. [2019-01-13 01:33:14,825 INFO L78 Accepts]: Start accepts. Automaton has 10377 states and 32407 transitions. Word has length 92 [2019-01-13 01:33:14,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:33:14,826 INFO L480 AbstractCegarLoop]: Abstraction has 10377 states and 32407 transitions. [2019-01-13 01:33:14,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 01:33:14,826 INFO L276 IsEmpty]: Start isEmpty. Operand 10377 states and 32407 transitions. [2019-01-13 01:33:14,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-13 01:33:14,839 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:33:14,839 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] [2019-01-13 01:33:14,839 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:33:14,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:33:14,840 INFO L82 PathProgramCache]: Analyzing trace with hash 1449993601, now seen corresponding path program 1 times [2019-01-13 01:33:14,840 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:33:14,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:33:14,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:33:14,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:33:14,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:33:14,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:33:15,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 01:33:15,100 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:33:15,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 01:33:15,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 01:33:15,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 01:33:15,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-13 01:33:15,102 INFO L87 Difference]: Start difference. First operand 10377 states and 32407 transitions. Second operand 6 states. [2019-01-13 01:33:15,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:33:15,435 INFO L93 Difference]: Finished difference Result 12872 states and 39513 transitions. [2019-01-13 01:33:15,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 01:33:15,436 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-01-13 01:33:15,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:33:15,456 INFO L225 Difference]: With dead ends: 12872 [2019-01-13 01:33:15,456 INFO L226 Difference]: Without dead ends: 12582 [2019-01-13 01:33:15,457 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-01-13 01:33:15,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12582 states. [2019-01-13 01:33:15,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12582 to 10822. [2019-01-13 01:33:15,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10822 states. [2019-01-13 01:33:15,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10822 states to 10822 states and 33383 transitions. [2019-01-13 01:33:15,621 INFO L78 Accepts]: Start accepts. Automaton has 10822 states and 33383 transitions. Word has length 94 [2019-01-13 01:33:15,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:33:15,621 INFO L480 AbstractCegarLoop]: Abstraction has 10822 states and 33383 transitions. [2019-01-13 01:33:15,621 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 01:33:15,621 INFO L276 IsEmpty]: Start isEmpty. Operand 10822 states and 33383 transitions. [2019-01-13 01:33:15,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-13 01:33:15,634 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:33:15,634 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] [2019-01-13 01:33:15,634 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:33:15,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:33:15,635 INFO L82 PathProgramCache]: Analyzing trace with hash 1195257056, now seen corresponding path program 1 times [2019-01-13 01:33:15,635 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:33:15,635 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:33:15,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:33:15,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:33:15,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:33:15,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:33:16,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 01:33:16,035 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:33:16,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 01:33:16,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 01:33:16,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 01:33:16,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-13 01:33:16,036 INFO L87 Difference]: Start difference. First operand 10822 states and 33383 transitions. Second operand 6 states. [2019-01-13 01:33:16,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:33:16,390 INFO L93 Difference]: Finished difference Result 11837 states and 36215 transitions. [2019-01-13 01:33:16,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-13 01:33:16,392 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-01-13 01:33:16,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:33:16,414 INFO L225 Difference]: With dead ends: 11837 [2019-01-13 01:33:16,415 INFO L226 Difference]: Without dead ends: 11837 [2019-01-13 01:33:16,415 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-01-13 01:33:16,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11837 states. [2019-01-13 01:33:16,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11837 to 10922. [2019-01-13 01:33:16,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10922 states. [2019-01-13 01:33:16,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10922 states to 10922 states and 33518 transitions. [2019-01-13 01:33:16,595 INFO L78 Accepts]: Start accepts. Automaton has 10922 states and 33518 transitions. Word has length 94 [2019-01-13 01:33:16,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:33:16,595 INFO L480 AbstractCegarLoop]: Abstraction has 10922 states and 33518 transitions. [2019-01-13 01:33:16,595 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 01:33:16,595 INFO L276 IsEmpty]: Start isEmpty. Operand 10922 states and 33518 transitions. [2019-01-13 01:33:16,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-13 01:33:16,610 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:33:16,610 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] [2019-01-13 01:33:16,610 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:33:16,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:33:16,611 INFO L82 PathProgramCache]: Analyzing trace with hash 1128250303, now seen corresponding path program 1 times [2019-01-13 01:33:16,611 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:33:16,611 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:33:16,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:33:16,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:33:16,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:33:16,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:33:16,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 01:33:16,798 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:33:16,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 01:33:16,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 01:33:16,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 01:33:16,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-13 01:33:16,799 INFO L87 Difference]: Start difference. First operand 10922 states and 33518 transitions. Second operand 7 states. [2019-01-13 01:33:17,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:33:17,162 INFO L93 Difference]: Finished difference Result 13174 states and 40267 transitions. [2019-01-13 01:33:17,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-13 01:33:17,163 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2019-01-13 01:33:17,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:33:17,184 INFO L225 Difference]: With dead ends: 13174 [2019-01-13 01:33:17,184 INFO L226 Difference]: Without dead ends: 13174 [2019-01-13 01:33:17,184 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-01-13 01:33:17,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13174 states. [2019-01-13 01:33:17,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13174 to 13110. [2019-01-13 01:33:17,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13110 states. [2019-01-13 01:33:17,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13110 states to 13110 states and 40059 transitions. [2019-01-13 01:33:17,372 INFO L78 Accepts]: Start accepts. Automaton has 13110 states and 40059 transitions. Word has length 94 [2019-01-13 01:33:17,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:33:17,372 INFO L480 AbstractCegarLoop]: Abstraction has 13110 states and 40059 transitions. [2019-01-13 01:33:17,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 01:33:17,372 INFO L276 IsEmpty]: Start isEmpty. Operand 13110 states and 40059 transitions. [2019-01-13 01:33:17,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-13 01:33:17,390 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:33:17,390 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] [2019-01-13 01:33:17,390 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:33:17,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:33:17,391 INFO L82 PathProgramCache]: Analyzing trace with hash 2015753984, now seen corresponding path program 1 times [2019-01-13 01:33:17,391 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:33:17,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:33:17,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:33:17,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:33:17,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:33:17,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:33:17,771 WARN L181 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 9 [2019-01-13 01:33:18,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 01:33:18,482 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:33:18,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-13 01:33:18,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-13 01:33:18,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-13 01:33:18,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-01-13 01:33:18,483 INFO L87 Difference]: Start difference. First operand 13110 states and 40059 transitions. Second operand 9 states. [2019-01-13 01:33:18,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:33:18,898 INFO L93 Difference]: Finished difference Result 31926 states and 97283 transitions. [2019-01-13 01:33:18,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-13 01:33:18,899 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 94 [2019-01-13 01:33:18,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:33:18,918 INFO L225 Difference]: With dead ends: 31926 [2019-01-13 01:33:18,919 INFO L226 Difference]: Without dead ends: 11346 [2019-01-13 01:33:18,919 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=103, Invalid=203, Unknown=0, NotChecked=0, Total=306 [2019-01-13 01:33:18,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11346 states. [2019-01-13 01:33:19,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11346 to 11346. [2019-01-13 01:33:19,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11346 states. [2019-01-13 01:33:19,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11346 states to 11346 states and 34407 transitions. [2019-01-13 01:33:19,077 INFO L78 Accepts]: Start accepts. Automaton has 11346 states and 34407 transitions. Word has length 94 [2019-01-13 01:33:19,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:33:19,077 INFO L480 AbstractCegarLoop]: Abstraction has 11346 states and 34407 transitions. [2019-01-13 01:33:19,077 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-13 01:33:19,077 INFO L276 IsEmpty]: Start isEmpty. Operand 11346 states and 34407 transitions. [2019-01-13 01:33:19,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-13 01:33:19,089 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:33:19,090 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] [2019-01-13 01:33:19,090 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:33:19,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:33:19,090 INFO L82 PathProgramCache]: Analyzing trace with hash 757820908, now seen corresponding path program 2 times [2019-01-13 01:33:19,090 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:33:19,091 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:33:19,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:33:19,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:33:19,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:33:19,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:33:19,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 01:33:19,437 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:33:19,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-13 01:33:19,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-13 01:33:19,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-13 01:33:19,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-01-13 01:33:19,438 INFO L87 Difference]: Start difference. First operand 11346 states and 34407 transitions. Second operand 9 states. [2019-01-13 01:33:19,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:33:19,781 INFO L93 Difference]: Finished difference Result 19394 states and 59003 transitions. [2019-01-13 01:33:19,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-13 01:33:19,783 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 94 [2019-01-13 01:33:19,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:33:19,803 INFO L225 Difference]: With dead ends: 19394 [2019-01-13 01:33:19,803 INFO L226 Difference]: Without dead ends: 8303 [2019-01-13 01:33:19,803 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2019-01-13 01:33:19,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8303 states. [2019-01-13 01:33:19,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8303 to 8303. [2019-01-13 01:33:19,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8303 states. [2019-01-13 01:33:19,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8303 states to 8303 states and 25262 transitions. [2019-01-13 01:33:19,938 INFO L78 Accepts]: Start accepts. Automaton has 8303 states and 25262 transitions. Word has length 94 [2019-01-13 01:33:19,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:33:19,939 INFO L480 AbstractCegarLoop]: Abstraction has 8303 states and 25262 transitions. [2019-01-13 01:33:19,939 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-13 01:33:19,939 INFO L276 IsEmpty]: Start isEmpty. Operand 8303 states and 25262 transitions. [2019-01-13 01:33:19,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-13 01:33:19,949 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:33:19,949 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 01:33:19,949 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:33:19,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:33:19,950 INFO L82 PathProgramCache]: Analyzing trace with hash 15963458, now seen corresponding path program 1 times [2019-01-13 01:33:19,950 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:33:19,950 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:33:19,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:33:19,952 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 01:33:19,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:33:19,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:33:20,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 01:33:20,142 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:33:20,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 01:33:20,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 01:33:20,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 01:33:20,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-01-13 01:33:20,143 INFO L87 Difference]: Start difference. First operand 8303 states and 25262 transitions. Second operand 7 states. [2019-01-13 01:33:20,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:33:20,533 INFO L93 Difference]: Finished difference Result 8921 states and 27123 transitions. [2019-01-13 01:33:20,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 01:33:20,534 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2019-01-13 01:33:20,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:33:20,548 INFO L225 Difference]: With dead ends: 8921 [2019-01-13 01:33:20,549 INFO L226 Difference]: Without dead ends: 8921 [2019-01-13 01:33:20,549 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 [2019-01-13 01:33:20,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8921 states. [2019-01-13 01:33:20,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8921 to 8069. [2019-01-13 01:33:20,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8069 states. [2019-01-13 01:33:20,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8069 states to 8069 states and 24596 transitions. [2019-01-13 01:33:20,661 INFO L78 Accepts]: Start accepts. Automaton has 8069 states and 24596 transitions. Word has length 94 [2019-01-13 01:33:20,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:33:20,662 INFO L480 AbstractCegarLoop]: Abstraction has 8069 states and 24596 transitions. [2019-01-13 01:33:20,662 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 01:33:20,662 INFO L276 IsEmpty]: Start isEmpty. Operand 8069 states and 24596 transitions. [2019-01-13 01:33:20,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-13 01:33:20,671 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:33:20,671 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 01:33:20,672 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:33:20,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:33:20,672 INFO L82 PathProgramCache]: Analyzing trace with hash 475121201, now seen corresponding path program 2 times [2019-01-13 01:33:20,672 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:33:20,672 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:33:20,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:33:20,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:33:20,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:33:20,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:33:21,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 01:33:21,055 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:33:21,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 01:33:21,055 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 01:33:21,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 01:33:21,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-13 01:33:21,056 INFO L87 Difference]: Start difference. First operand 8069 states and 24596 transitions. Second operand 5 states. [2019-01-13 01:33:21,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:33:21,146 INFO L93 Difference]: Finished difference Result 8069 states and 24532 transitions. [2019-01-13 01:33:21,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 01:33:21,147 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2019-01-13 01:33:21,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:33:21,159 INFO L225 Difference]: With dead ends: 8069 [2019-01-13 01:33:21,160 INFO L226 Difference]: Without dead ends: 8069 [2019-01-13 01:33:21,160 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-13 01:33:21,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8069 states. [2019-01-13 01:33:21,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8069 to 6445. [2019-01-13 01:33:21,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6445 states. [2019-01-13 01:33:21,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6445 states to 6445 states and 19606 transitions. [2019-01-13 01:33:21,259 INFO L78 Accepts]: Start accepts. Automaton has 6445 states and 19606 transitions. Word has length 94 [2019-01-13 01:33:21,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:33:21,260 INFO L480 AbstractCegarLoop]: Abstraction has 6445 states and 19606 transitions. [2019-01-13 01:33:21,260 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 01:33:21,260 INFO L276 IsEmpty]: Start isEmpty. Operand 6445 states and 19606 transitions. [2019-01-13 01:33:21,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-13 01:33:21,268 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:33:21,268 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] [2019-01-13 01:33:21,268 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:33:21,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:33:21,269 INFO L82 PathProgramCache]: Analyzing trace with hash 1362624882, now seen corresponding path program 3 times [2019-01-13 01:33:21,269 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:33:21,269 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:33:21,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:33:21,270 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 01:33:21,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:33:21,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:33:21,463 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-01-13 01:33:21,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 01:33:21,563 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:33:21,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-01-13 01:33:21,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-13 01:33:21,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-13 01:33:21,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-01-13 01:33:21,564 INFO L87 Difference]: Start difference. First operand 6445 states and 19606 transitions. Second operand 11 states. [2019-01-13 01:33:22,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:33:22,616 INFO L93 Difference]: Finished difference Result 12513 states and 38185 transitions. [2019-01-13 01:33:22,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-13 01:33:22,617 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 94 [2019-01-13 01:33:22,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:33:22,630 INFO L225 Difference]: With dead ends: 12513 [2019-01-13 01:33:22,630 INFO L226 Difference]: Without dead ends: 7343 [2019-01-13 01:33:22,630 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2019-01-13 01:33:22,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7343 states. [2019-01-13 01:33:22,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7343 to 6567. [2019-01-13 01:33:22,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6567 states. [2019-01-13 01:33:22,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6567 states to 6567 states and 19777 transitions. [2019-01-13 01:33:22,724 INFO L78 Accepts]: Start accepts. Automaton has 6567 states and 19777 transitions. Word has length 94 [2019-01-13 01:33:22,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:33:22,724 INFO L480 AbstractCegarLoop]: Abstraction has 6567 states and 19777 transitions. [2019-01-13 01:33:22,724 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-13 01:33:22,724 INFO L276 IsEmpty]: Start isEmpty. Operand 6567 states and 19777 transitions. [2019-01-13 01:33:22,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-13 01:33:22,733 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:33:22,733 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] [2019-01-13 01:33:22,733 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:33:22,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:33:22,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1113002672, now seen corresponding path program 4 times [2019-01-13 01:33:22,734 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:33:22,734 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:33:22,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:33:22,735 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 01:33:22,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:33:22,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-13 01:33:22,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-13 01:33:22,816 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-13 01:33:23,046 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-01-13 01:33:23,049 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.01 01:33:23 BasicIcfg [2019-01-13 01:33:23,050 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-13 01:33:23,051 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-13 01:33:23,053 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-13 01:33:23,053 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-13 01:33:23,054 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 01:31:57" (3/4) ... [2019-01-13 01:33:23,059 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-13 01:33:23,271 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-13 01:33:23,271 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-13 01:33:23,272 INFO L168 Benchmark]: Toolchain (without parser) took 88173.46 ms. Allocated memory was 1.0 GB in the beginning and 5.8 GB in the end (delta: 4.8 GB). Free memory was 936.6 MB in the beginning and 3.2 GB in the end (delta: -2.2 GB). Peak memory consumption was 2.5 GB. Max. memory is 11.5 GB. [2019-01-13 01:33:23,274 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 01:33:23,274 INFO L168 Benchmark]: CACSL2BoogieTranslator took 867.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -165.7 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. [2019-01-13 01:33:23,276 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.58 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-01-13 01:33:23,276 INFO L168 Benchmark]: Boogie Preprocessor took 42.08 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 01:33:23,276 INFO L168 Benchmark]: RCFGBuilder took 1108.08 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 46.0 MB). Peak memory consumption was 46.0 MB. Max. memory is 11.5 GB. [2019-01-13 01:33:23,277 INFO L168 Benchmark]: TraceAbstraction took 85861.94 ms. Allocated memory was 1.2 GB in the beginning and 5.8 GB in the end (delta: 4.6 GB). Free memory was 1.0 GB in the beginning and 3.2 GB in the end (delta: -2.2 GB). Peak memory consumption was 2.4 GB. Max. memory is 11.5 GB. [2019-01-13 01:33:23,277 INFO L168 Benchmark]: Witness Printer took 220.19 ms. Allocated memory is still 5.8 GB. Free memory was 3.2 GB in the beginning and 3.2 GB in the end (delta: 57.0 MB). Peak memory consumption was 57.0 MB. Max. memory is 11.5 GB. [2019-01-13 01:33:23,283 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 867.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -165.7 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 66.58 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 42.08 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1108.08 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 46.0 MB). Peak memory consumption was 46.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 85861.94 ms. Allocated memory was 1.2 GB in the beginning and 5.8 GB in the end (delta: 4.6 GB). Free memory was 1.0 GB in the beginning and 3.2 GB in the end (delta: -2.2 GB). Peak memory consumption was 2.4 GB. Max. memory is 11.5 GB. * Witness Printer took 220.19 ms. Allocated memory is still 5.8 GB. Free memory was 3.2 GB in the beginning and 3.2 GB in the end (delta: 57.0 MB). Peak memory consumption was 57.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L672] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L674] -1 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L676] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L678] -1 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0] [L680] -1 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L682] -1 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0] [L683] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0] [L684] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L686] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L688] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L689] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L690] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L691] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L692] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L693] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L694] -1 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L695] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0] [L696] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L697] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L698] -1 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L699] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L700] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L701] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L702] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L703] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L704] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L706] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L707] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L708] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L798] -1 pthread_t t936; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L799] FCALL, FORK -1 pthread_create(&t936, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L800] -1 pthread_t t937; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L801] FCALL, FORK -1 pthread_create(&t937, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L802] -1 pthread_t t938; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L803] FCALL, FORK -1 pthread_create(&t938, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L755] 0 y$w_buff1 = y$w_buff0 [L756] 0 y$w_buff0 = 1 [L757] 0 y$w_buff1_used = y$w_buff0_used [L758] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L760] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L761] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L762] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L763] 0 y$r_buff1_thd3 = y$r_buff0_thd3 [L764] 0 y$r_buff0_thd3 = (_Bool)1 [L767] 0 z = 1 [L770] 0 __unbuffered_p2_EAX = z [L773] 0 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L776] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L712] 1 a = 1 [L715] 1 __unbuffered_p0_EAX = x [L720] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L727] 2 x = 1 [L730] 2 weak$$choice0 = __VERIFIER_nondet_pointer() [L731] 2 weak$$choice2 = __VERIFIER_nondet_pointer() [L732] 2 y$flush_delayed = weak$$choice2 [L733] 2 y$mem_tmp = y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L734] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L776] 0 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L777] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L777] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L734] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L735] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L735] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L736] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L736] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L778] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L778] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L779] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L779] 0 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L780] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L780] 0 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L783] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L737] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L737] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L738] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L738] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L739] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L739] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L740] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L740] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L741] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L742] EXPR 2 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L742] 2 y = y$flush_delayed ? y$mem_tmp : y [L743] 2 y$flush_delayed = (_Bool)0 [L748] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L805] -1 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L809] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L809] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L809] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L809] -1 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L810] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L810] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L811] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L811] -1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L812] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L812] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L813] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L813] -1 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L816] -1 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 220 locations, 3 error locations. UNSAFE Result, 85.6s OverallTime, 26 OverallIterations, 1 TraceHistogramMax, 21.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6213 SDtfs, 8229 SDslu, 14873 SDs, 0 SdLazy, 3495 SolverSat, 242 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 227 GetRequests, 60 SyntacticMatches, 13 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 6.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=149046occurred 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: 25.1s AutomataMinimizationTime, 25 MinimizatonAttempts, 127276 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 6.6s InterpolantComputationTime, 2136 NumberOfCodeBlocks, 2136 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 2017 ConstructedInterpolants, 0 QuantifiedInterpolants, 427278 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 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...