./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-wmm/mix052_rmo.opt_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa 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/mix052_rmo.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 5267a07e22f406547fd2976b8bb12867811c8308 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-2e94e6a [2018-12-31 22:12:22,970 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 22:12:22,972 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 22:12:22,986 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 22:12:22,987 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 22:12:22,988 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 22:12:22,989 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 22:12:22,991 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 22:12:22,993 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 22:12:22,994 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 22:12:22,994 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 22:12:22,995 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 22:12:22,996 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 22:12:22,997 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 22:12:22,998 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 22:12:22,999 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 22:12:23,000 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 22:12:23,002 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 22:12:23,004 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 22:12:23,006 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 22:12:23,007 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 22:12:23,008 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 22:12:23,011 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 22:12:23,012 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 22:12:23,012 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 22:12:23,013 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 22:12:23,014 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 22:12:23,015 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 22:12:23,016 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 22:12:23,017 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 22:12:23,017 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 22:12:23,018 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 22:12:23,019 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 22:12:23,019 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 22:12:23,024 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 22:12:23,025 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 22:12:23,026 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-31 22:12:23,059 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 22:12:23,060 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 22:12:23,061 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 22:12:23,061 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 22:12:23,061 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 22:12:23,062 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 22:12:23,062 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 22:12:23,062 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 22:12:23,062 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 22:12:23,062 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 22:12:23,062 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 22:12:23,066 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 22:12:23,067 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 22:12:23,067 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 22:12:23,067 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 22:12:23,067 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 22:12:23,067 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 22:12:23,068 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 22:12:23,068 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 22:12:23,068 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 22:12:23,068 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 22:12:23,068 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 22:12:23,068 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 22:12:23,071 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 22:12:23,072 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 22:12:23,072 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 22:12:23,072 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 22:12:23,072 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 22:12:23,072 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 -> 5267a07e22f406547fd2976b8bb12867811c8308 [2018-12-31 22:12:23,128 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 22:12:23,142 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 22:12:23,146 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 22:12:23,147 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 22:12:23,148 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 22:12:23,149 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-wmm/mix052_rmo.opt_false-unreach-call.i [2018-12-31 22:12:23,213 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d2cb43f4/d75fd01769d94c13a8cbf555f595dc41/FLAGc7bcc2958 [2018-12-31 22:12:23,782 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 22:12:23,782 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-wmm/mix052_rmo.opt_false-unreach-call.i [2018-12-31 22:12:23,802 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d2cb43f4/d75fd01769d94c13a8cbf555f595dc41/FLAGc7bcc2958 [2018-12-31 22:12:24,054 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d2cb43f4/d75fd01769d94c13a8cbf555f595dc41 [2018-12-31 22:12:24,058 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 22:12:24,059 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 22:12:24,060 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 22:12:24,060 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 22:12:24,064 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 22:12:24,065 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 10:12:24" (1/1) ... [2018-12-31 22:12:24,068 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d2d9836 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:12:24, skipping insertion in model container [2018-12-31 22:12:24,069 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 10:12:24" (1/1) ... [2018-12-31 22:12:24,077 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 22:12:24,140 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 22:12:24,700 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 22:12:24,715 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 22:12:24,892 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 22:12:24,981 INFO L195 MainTranslator]: Completed translation [2018-12-31 22:12:24,982 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:12:24 WrapperNode [2018-12-31 22:12:24,982 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 22:12:24,984 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 22:12:24,984 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 22:12:24,984 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 22:12:24,992 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:12:24" (1/1) ... [2018-12-31 22:12:25,013 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:12:24" (1/1) ... [2018-12-31 22:12:25,050 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 22:12:25,050 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 22:12:25,050 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 22:12:25,050 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 22:12:25,061 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:12:24" (1/1) ... [2018-12-31 22:12:25,061 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:12:24" (1/1) ... [2018-12-31 22:12:25,067 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:12:24" (1/1) ... [2018-12-31 22:12:25,067 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:12:24" (1/1) ... [2018-12-31 22:12:25,087 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:12:24" (1/1) ... [2018-12-31 22:12:25,093 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:12:24" (1/1) ... [2018-12-31 22:12:25,096 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:12:24" (1/1) ... [2018-12-31 22:12:25,102 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 22:12:25,103 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 22:12:25,103 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 22:12:25,103 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 22:12:25,104 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:12:24" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 22:12:25,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-31 22:12:25,181 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-31 22:12:25,181 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2018-12-31 22:12:25,181 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-31 22:12:25,181 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-31 22:12:25,182 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-31 22:12:25,182 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-31 22:12:25,183 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-31 22:12:25,183 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2018-12-31 22:12:25,183 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2018-12-31 22:12:25,183 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-31 22:12:25,183 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 22:12:25,183 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 22:12:25,186 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-31 22:12:26,310 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 22:12:26,310 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-31 22:12:26,311 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 10:12:26 BoogieIcfgContainer [2018-12-31 22:12:26,311 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 22:12:26,312 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 22:12:26,312 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 22:12:26,316 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 22:12:26,316 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 10:12:24" (1/3) ... [2018-12-31 22:12:26,317 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fe46f13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 10:12:26, skipping insertion in model container [2018-12-31 22:12:26,317 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:12:24" (2/3) ... [2018-12-31 22:12:26,317 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fe46f13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 10:12:26, skipping insertion in model container [2018-12-31 22:12:26,318 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 10:12:26" (3/3) ... [2018-12-31 22:12:26,319 INFO L112 eAbstractionObserver]: Analyzing ICFG mix052_rmo.opt_false-unreach-call.i [2018-12-31 22:12:26,365 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,366 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,366 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,366 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,367 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,367 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,367 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,367 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,368 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,368 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,369 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet5.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,369 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,369 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,369 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,370 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,370 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet5.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,370 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,370 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,370 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet5.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,370 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,371 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,371 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet5.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,371 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,371 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,372 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,372 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,372 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,372 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,373 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,373 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,373 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,373 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,373 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,374 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,374 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,374 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,374 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,375 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,375 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,375 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,375 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,376 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,376 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,376 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,376 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,376 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,377 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,377 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,377 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,377 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,378 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,378 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,378 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,378 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,378 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,379 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,379 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,379 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,379 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,379 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,380 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,380 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,380 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,380 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,381 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,381 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,381 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,381 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,381 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,382 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,382 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,382 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,382 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,383 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,383 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,383 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,383 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,383 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,384 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,384 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,384 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,384 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,384 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,385 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,385 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,385 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,385 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,386 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,386 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,386 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,386 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,386 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,386 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,387 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,387 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,387 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,387 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,388 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,388 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,388 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,388 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,388 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,389 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,389 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,389 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,389 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,389 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,390 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,390 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,390 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,390 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,390 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,391 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,391 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,391 WARN L317 ript$VariableManager]: TermVariabe Thread2_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,392 WARN L317 ript$VariableManager]: TermVariabe Thread2_P2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,392 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,392 WARN L317 ript$VariableManager]: TermVariabe Thread2_P2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,392 WARN L317 ript$VariableManager]: TermVariabe Thread2_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,393 WARN L317 ript$VariableManager]: TermVariabe Thread2_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,393 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,393 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,393 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,394 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,394 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,394 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,394 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,395 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,395 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,395 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,395 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,395 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,396 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,396 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,396 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,396 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,396 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,397 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,397 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,397 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,397 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,398 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,398 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,398 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,398 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~nondet34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,398 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~nondet34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,399 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,399 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,399 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~nondet34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,399 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~nondet34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:12:26,429 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-31 22:12:26,429 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 22:12:26,438 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-31 22:12:26,457 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-31 22:12:26,487 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 22:12:26,488 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 22:12:26,488 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 22:12:26,488 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 22:12:26,488 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 22:12:26,488 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 22:12:26,488 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 22:12:26,489 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 22:12:26,489 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 22:12:26,504 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 144places, 175 transitions [2018-12-31 22:12:57,567 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 149043 states. [2018-12-31 22:12:57,569 INFO L276 IsEmpty]: Start isEmpty. Operand 149043 states. [2018-12-31 22:12:57,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-31 22:12:57,587 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:12:57,588 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] [2018-12-31 22:12:57,591 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:12:57,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:12:57,599 INFO L82 PathProgramCache]: Analyzing trace with hash -1052590070, now seen corresponding path program 1 times [2018-12-31 22:12:57,602 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:12:57,602 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:12:57,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:12:57,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:12:57,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:12:57,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:12:58,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:12:58,026 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:12:58,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 22:12:58,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 22:12:58,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 22:12:58,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 22:12:58,053 INFO L87 Difference]: Start difference. First operand 149043 states. Second operand 4 states. [2018-12-31 22:13:00,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:13:00,576 INFO L93 Difference]: Finished difference Result 257063 states and 1188602 transitions. [2018-12-31 22:13:00,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 22:13:00,579 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2018-12-31 22:13:00,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:13:01,904 INFO L225 Difference]: With dead ends: 257063 [2018-12-31 22:13:01,905 INFO L226 Difference]: Without dead ends: 174813 [2018-12-31 22:13:01,907 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 22:13:10,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174813 states. [2018-12-31 22:13:14,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174813 to 110553. [2018-12-31 22:13:14,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110553 states. [2018-12-31 22:13:15,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110553 states to 110553 states and 511484 transitions. [2018-12-31 22:13:15,042 INFO L78 Accepts]: Start accepts. Automaton has 110553 states and 511484 transitions. Word has length 44 [2018-12-31 22:13:15,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:13:15,045 INFO L480 AbstractCegarLoop]: Abstraction has 110553 states and 511484 transitions. [2018-12-31 22:13:15,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 22:13:15,045 INFO L276 IsEmpty]: Start isEmpty. Operand 110553 states and 511484 transitions. [2018-12-31 22:13:15,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-31 22:13:15,072 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:13:15,072 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 22:13:15,073 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:13:15,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:13:15,073 INFO L82 PathProgramCache]: Analyzing trace with hash 835996618, now seen corresponding path program 1 times [2018-12-31 22:13:15,073 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:13:15,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:13:15,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:13:15,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:13:15,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:13:15,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:13:15,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:13:15,209 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:13:15,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 22:13:15,212 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 22:13:15,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 22:13:15,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 22:13:15,213 INFO L87 Difference]: Start difference. First operand 110553 states and 511484 transitions. Second operand 3 states. [2018-12-31 22:13:19,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:13:19,081 INFO L93 Difference]: Finished difference Result 110553 states and 511379 transitions. [2018-12-31 22:13:19,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 22:13:19,082 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2018-12-31 22:13:19,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:13:19,620 INFO L225 Difference]: With dead ends: 110553 [2018-12-31 22:13:19,620 INFO L226 Difference]: Without dead ends: 110553 [2018-12-31 22:13:19,621 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 22:13:20,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110553 states. [2018-12-31 22:13:22,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110553 to 110553. [2018-12-31 22:13:22,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110553 states. [2018-12-31 22:13:22,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110553 states to 110553 states and 511379 transitions. [2018-12-31 22:13:22,813 INFO L78 Accepts]: Start accepts. Automaton has 110553 states and 511379 transitions. Word has length 52 [2018-12-31 22:13:22,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:13:22,813 INFO L480 AbstractCegarLoop]: Abstraction has 110553 states and 511379 transitions. [2018-12-31 22:13:22,813 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 22:13:22,814 INFO L276 IsEmpty]: Start isEmpty. Operand 110553 states and 511379 transitions. [2018-12-31 22:13:22,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-31 22:13:22,825 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:13:22,825 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 22:13:22,825 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:13:22,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:13:22,825 INFO L82 PathProgramCache]: Analyzing trace with hash -1716160343, now seen corresponding path program 1 times [2018-12-31 22:13:22,826 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:13:22,826 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:13:22,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:13:22,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:13:22,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:13:22,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:13:22,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:13:22,997 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:13:22,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 22:13:22,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 22:13:22,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 22:13:22,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 22:13:22,998 INFO L87 Difference]: Start difference. First operand 110553 states and 511379 transitions. Second operand 4 states. [2018-12-31 22:13:25,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:13:25,659 INFO L93 Difference]: Finished difference Result 99451 states and 448604 transitions. [2018-12-31 22:13:25,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 22:13:25,659 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2018-12-31 22:13:25,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:13:26,203 INFO L225 Difference]: With dead ends: 99451 [2018-12-31 22:13:26,203 INFO L226 Difference]: Without dead ends: 95221 [2018-12-31 22:13:26,204 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 22:13:27,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95221 states. [2018-12-31 22:13:28,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95221 to 95221. [2018-12-31 22:13:28,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95221 states. [2018-12-31 22:13:28,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95221 states to 95221 states and 432988 transitions. [2018-12-31 22:13:28,996 INFO L78 Accepts]: Start accepts. Automaton has 95221 states and 432988 transitions. Word has length 52 [2018-12-31 22:13:28,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:13:28,997 INFO L480 AbstractCegarLoop]: Abstraction has 95221 states and 432988 transitions. [2018-12-31 22:13:28,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 22:13:28,997 INFO L276 IsEmpty]: Start isEmpty. Operand 95221 states and 432988 transitions. [2018-12-31 22:13:29,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-31 22:13:29,008 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:13:29,008 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 22:13:29,008 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:13:29,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:13:29,009 INFO L82 PathProgramCache]: Analyzing trace with hash -1708686521, now seen corresponding path program 1 times [2018-12-31 22:13:29,009 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:13:29,009 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:13:29,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:13:29,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:13:29,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:13:29,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:13:29,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:13:29,194 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:13:29,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 22:13:29,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 22:13:29,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 22:13:29,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-31 22:13:29,195 INFO L87 Difference]: Start difference. First operand 95221 states and 432988 transitions. Second operand 5 states. [2018-12-31 22:13:29,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:13:29,789 INFO L93 Difference]: Finished difference Result 30965 states and 124168 transitions. [2018-12-31 22:13:29,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 22:13:29,790 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2018-12-31 22:13:29,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:13:29,873 INFO L225 Difference]: With dead ends: 30965 [2018-12-31 22:13:29,873 INFO L226 Difference]: Without dead ends: 27337 [2018-12-31 22:13:29,873 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-31 22:13:30,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27337 states. [2018-12-31 22:13:30,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27337 to 26877. [2018-12-31 22:13:30,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26877 states. [2018-12-31 22:13:30,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26877 states to 26877 states and 107650 transitions. [2018-12-31 22:13:30,490 INFO L78 Accepts]: Start accepts. Automaton has 26877 states and 107650 transitions. Word has length 53 [2018-12-31 22:13:30,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:13:30,490 INFO L480 AbstractCegarLoop]: Abstraction has 26877 states and 107650 transitions. [2018-12-31 22:13:30,490 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 22:13:30,490 INFO L276 IsEmpty]: Start isEmpty. Operand 26877 states and 107650 transitions. [2018-12-31 22:13:30,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-31 22:13:30,494 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:13:30,495 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] [2018-12-31 22:13:30,495 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:13:30,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:13:30,495 INFO L82 PathProgramCache]: Analyzing trace with hash -1522037347, now seen corresponding path program 1 times [2018-12-31 22:13:30,495 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:13:30,495 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:13:30,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:13:30,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:13:30,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:13:30,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:13:30,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:13:30,619 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:13:30,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 22:13:30,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 22:13:30,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 22:13:30,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 22:13:30,620 INFO L87 Difference]: Start difference. First operand 26877 states and 107650 transitions. Second operand 5 states. [2018-12-31 22:13:31,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:13:31,414 INFO L93 Difference]: Finished difference Result 51021 states and 201904 transitions. [2018-12-31 22:13:31,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 22:13:31,415 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2018-12-31 22:13:31,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:13:31,575 INFO L225 Difference]: With dead ends: 51021 [2018-12-31 22:13:31,575 INFO L226 Difference]: Without dead ends: 50646 [2018-12-31 22:13:31,575 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-31 22:13:32,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50646 states. [2018-12-31 22:13:32,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50646 to 35270. [2018-12-31 22:13:32,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35270 states. [2018-12-31 22:13:33,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35270 states to 35270 states and 138745 transitions. [2018-12-31 22:13:33,007 INFO L78 Accepts]: Start accepts. Automaton has 35270 states and 138745 transitions. Word has length 53 [2018-12-31 22:13:33,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:13:33,007 INFO L480 AbstractCegarLoop]: Abstraction has 35270 states and 138745 transitions. [2018-12-31 22:13:33,007 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 22:13:33,007 INFO L276 IsEmpty]: Start isEmpty. Operand 35270 states and 138745 transitions. [2018-12-31 22:13:33,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-31 22:13:33,012 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:13:33,012 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 22:13:33,013 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:13:33,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:13:33,013 INFO L82 PathProgramCache]: Analyzing trace with hash -1506436157, now seen corresponding path program 1 times [2018-12-31 22:13:33,013 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:13:33,013 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:13:33,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:13:33,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:13:33,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:13:33,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:13:33,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:13:33,103 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:13:33,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 22:13:33,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 22:13:33,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 22:13:33,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 22:13:33,104 INFO L87 Difference]: Start difference. First operand 35270 states and 138745 transitions. Second operand 3 states. [2018-12-31 22:13:33,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:13:33,453 INFO L93 Difference]: Finished difference Result 46810 states and 182037 transitions. [2018-12-31 22:13:33,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 22:13:33,454 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2018-12-31 22:13:33,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:13:33,598 INFO L225 Difference]: With dead ends: 46810 [2018-12-31 22:13:33,599 INFO L226 Difference]: Without dead ends: 46790 [2018-12-31 22:13:33,599 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 22:13:33,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46790 states. [2018-12-31 22:13:34,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46790 to 36252. [2018-12-31 22:13:34,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36252 states. [2018-12-31 22:13:34,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36252 states to 36252 states and 141452 transitions. [2018-12-31 22:13:34,464 INFO L78 Accepts]: Start accepts. Automaton has 36252 states and 141452 transitions. Word has length 55 [2018-12-31 22:13:34,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:13:34,464 INFO L480 AbstractCegarLoop]: Abstraction has 36252 states and 141452 transitions. [2018-12-31 22:13:34,464 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 22:13:34,465 INFO L276 IsEmpty]: Start isEmpty. Operand 36252 states and 141452 transitions. [2018-12-31 22:13:34,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-31 22:13:34,473 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:13:34,473 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] [2018-12-31 22:13:34,473 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:13:34,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:13:34,474 INFO L82 PathProgramCache]: Analyzing trace with hash 420735980, now seen corresponding path program 1 times [2018-12-31 22:13:34,475 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:13:34,475 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:13:34,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:13:34,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:13:34,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:13:34,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:13:34,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:13:34,612 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:13:34,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 22:13:34,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 22:13:34,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 22:13:34,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-31 22:13:34,613 INFO L87 Difference]: Start difference. First operand 36252 states and 141452 transitions. Second operand 6 states. [2018-12-31 22:13:35,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:13:35,521 INFO L93 Difference]: Finished difference Result 50344 states and 193874 transitions. [2018-12-31 22:13:35,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-31 22:13:35,522 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2018-12-31 22:13:35,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:13:35,669 INFO L225 Difference]: With dead ends: 50344 [2018-12-31 22:13:35,670 INFO L226 Difference]: Without dead ends: 49859 [2018-12-31 22:13:35,670 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 [2018-12-31 22:13:35,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49859 states. [2018-12-31 22:13:36,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49859 to 39286. [2018-12-31 22:13:36,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39286 states. [2018-12-31 22:13:36,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39286 states to 39286 states and 153273 transitions. [2018-12-31 22:13:36,584 INFO L78 Accepts]: Start accepts. Automaton has 39286 states and 153273 transitions. Word has length 59 [2018-12-31 22:13:36,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:13:36,584 INFO L480 AbstractCegarLoop]: Abstraction has 39286 states and 153273 transitions. [2018-12-31 22:13:36,584 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 22:13:36,584 INFO L276 IsEmpty]: Start isEmpty. Operand 39286 states and 153273 transitions. [2018-12-31 22:13:36,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-31 22:13:36,610 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:13:36,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] [2018-12-31 22:13:36,611 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:13:36,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:13:36,611 INFO L82 PathProgramCache]: Analyzing trace with hash 767048363, now seen corresponding path program 1 times [2018-12-31 22:13:36,611 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:13:36,611 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:13:36,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:13:36,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:13:36,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:13:36,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:13:36,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:13:36,818 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:13:36,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 22:13:36,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 22:13:36,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 22:13:36,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 22:13:36,820 INFO L87 Difference]: Start difference. First operand 39286 states and 153273 transitions. Second operand 4 states. [2018-12-31 22:13:37,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:13:37,702 INFO L93 Difference]: Finished difference Result 46149 states and 179276 transitions. [2018-12-31 22:13:37,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 22:13:37,702 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 70 [2018-12-31 22:13:37,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:13:37,830 INFO L225 Difference]: With dead ends: 46149 [2018-12-31 22:13:37,830 INFO L226 Difference]: Without dead ends: 46149 [2018-12-31 22:13:37,831 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 22:13:37,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46149 states. [2018-12-31 22:13:38,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46149 to 42181. [2018-12-31 22:13:38,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42181 states. [2018-12-31 22:13:39,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42181 states to 42181 states and 164108 transitions. [2018-12-31 22:13:39,433 INFO L78 Accepts]: Start accepts. Automaton has 42181 states and 164108 transitions. Word has length 70 [2018-12-31 22:13:39,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:13:39,434 INFO L480 AbstractCegarLoop]: Abstraction has 42181 states and 164108 transitions. [2018-12-31 22:13:39,434 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 22:13:39,434 INFO L276 IsEmpty]: Start isEmpty. Operand 42181 states and 164108 transitions. [2018-12-31 22:13:39,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-31 22:13:39,465 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:13:39,466 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] [2018-12-31 22:13:39,466 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:13:39,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:13:39,466 INFO L82 PathProgramCache]: Analyzing trace with hash -1785108598, now seen corresponding path program 1 times [2018-12-31 22:13:39,466 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:13:39,466 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:13:39,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:13:39,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:13:39,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:13:39,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:13:39,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:13:39,738 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:13:39,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 22:13:39,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 22:13:39,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 22:13:39,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-31 22:13:39,739 INFO L87 Difference]: Start difference. First operand 42181 states and 164108 transitions. Second operand 6 states. [2018-12-31 22:13:40,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:13:40,024 INFO L93 Difference]: Finished difference Result 13861 states and 46332 transitions. [2018-12-31 22:13:40,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 22:13:40,025 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2018-12-31 22:13:40,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:13:40,051 INFO L225 Difference]: With dead ends: 13861 [2018-12-31 22:13:40,051 INFO L226 Difference]: Without dead ends: 11605 [2018-12-31 22:13:40,051 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-12-31 22:13:40,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11605 states. [2018-12-31 22:13:40,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11605 to 11015. [2018-12-31 22:13:40,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11015 states. [2018-12-31 22:13:40,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11015 states to 11015 states and 36284 transitions. [2018-12-31 22:13:40,237 INFO L78 Accepts]: Start accepts. Automaton has 11015 states and 36284 transitions. Word has length 70 [2018-12-31 22:13:40,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:13:40,237 INFO L480 AbstractCegarLoop]: Abstraction has 11015 states and 36284 transitions. [2018-12-31 22:13:40,237 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 22:13:40,237 INFO L276 IsEmpty]: Start isEmpty. Operand 11015 states and 36284 transitions. [2018-12-31 22:13:40,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-31 22:13:40,259 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:13:40,260 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] [2018-12-31 22:13:40,260 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:13:40,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:13:40,260 INFO L82 PathProgramCache]: Analyzing trace with hash -2118258903, now seen corresponding path program 1 times [2018-12-31 22:13:40,261 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:13:40,261 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:13:40,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:13:40,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:13:40,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:13:40,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:13:40,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:13:40,541 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:13:40,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 22:13:40,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 22:13:40,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 22:13:40,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 22:13:40,542 INFO L87 Difference]: Start difference. First operand 11015 states and 36284 transitions. Second operand 4 states. [2018-12-31 22:13:40,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:13:40,938 INFO L93 Difference]: Finished difference Result 15460 states and 49930 transitions. [2018-12-31 22:13:40,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 22:13:40,939 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2018-12-31 22:13:40,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:13:40,969 INFO L225 Difference]: With dead ends: 15460 [2018-12-31 22:13:40,970 INFO L226 Difference]: Without dead ends: 15460 [2018-12-31 22:13:40,970 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 [2018-12-31 22:13:41,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15460 states. [2018-12-31 22:13:41,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15460 to 13477. [2018-12-31 22:13:41,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13477 states. [2018-12-31 22:13:41,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13477 states to 13477 states and 43783 transitions. [2018-12-31 22:13:41,194 INFO L78 Accepts]: Start accepts. Automaton has 13477 states and 43783 transitions. Word has length 89 [2018-12-31 22:13:41,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:13:41,195 INFO L480 AbstractCegarLoop]: Abstraction has 13477 states and 43783 transitions. [2018-12-31 22:13:41,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 22:13:41,195 INFO L276 IsEmpty]: Start isEmpty. Operand 13477 states and 43783 transitions. [2018-12-31 22:13:41,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-31 22:13:41,218 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:13:41,218 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] [2018-12-31 22:13:41,219 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:13:41,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:13:41,219 INFO L82 PathProgramCache]: Analyzing trace with hash 99499050, now seen corresponding path program 1 times [2018-12-31 22:13:41,219 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:13:41,219 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:13:41,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:13:41,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:13:41,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:13:41,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:13:41,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:13:41,476 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:13:41,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 22:13:41,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 22:13:41,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 22:13:41,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 22:13:41,477 INFO L87 Difference]: Start difference. First operand 13477 states and 43783 transitions. Second operand 4 states. [2018-12-31 22:13:41,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:13:41,970 INFO L93 Difference]: Finished difference Result 14309 states and 46551 transitions. [2018-12-31 22:13:41,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 22:13:41,971 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2018-12-31 22:13:41,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:13:41,999 INFO L225 Difference]: With dead ends: 14309 [2018-12-31 22:13:41,999 INFO L226 Difference]: Without dead ends: 14309 [2018-12-31 22:13:41,999 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 [2018-12-31 22:13:42,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14309 states. [2018-12-31 22:13:42,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14309 to 13733. [2018-12-31 22:13:42,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13733 states. [2018-12-31 22:13:42,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13733 states to 13733 states and 44679 transitions. [2018-12-31 22:13:42,225 INFO L78 Accepts]: Start accepts. Automaton has 13733 states and 44679 transitions. Word has length 89 [2018-12-31 22:13:42,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:13:42,225 INFO L480 AbstractCegarLoop]: Abstraction has 13733 states and 44679 transitions. [2018-12-31 22:13:42,225 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 22:13:42,226 INFO L276 IsEmpty]: Start isEmpty. Operand 13733 states and 44679 transitions. [2018-12-31 22:13:42,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-31 22:13:42,246 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:13:42,246 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] [2018-12-31 22:13:42,246 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:13:42,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:13:42,248 INFO L82 PathProgramCache]: Analyzing trace with hash -1707955413, now seen corresponding path program 1 times [2018-12-31 22:13:42,248 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:13:42,248 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:13:42,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:13:42,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:13:42,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:13:42,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:13:42,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:13:42,455 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:13:42,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 22:13:42,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 22:13:42,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 22:13:42,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-31 22:13:42,458 INFO L87 Difference]: Start difference. First operand 13733 states and 44679 transitions. Second operand 6 states. [2018-12-31 22:13:43,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:13:43,234 INFO L93 Difference]: Finished difference Result 20566 states and 66384 transitions. [2018-12-31 22:13:43,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 22:13:43,235 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 89 [2018-12-31 22:13:43,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:13:43,274 INFO L225 Difference]: With dead ends: 20566 [2018-12-31 22:13:43,274 INFO L226 Difference]: Without dead ends: 20438 [2018-12-31 22:13:43,275 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-31 22:13:43,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20438 states. [2018-12-31 22:13:43,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20438 to 17431. [2018-12-31 22:13:43,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17431 states. [2018-12-31 22:13:43,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17431 states to 17431 states and 56542 transitions. [2018-12-31 22:13:43,559 INFO L78 Accepts]: Start accepts. Automaton has 17431 states and 56542 transitions. Word has length 89 [2018-12-31 22:13:43,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:13:43,560 INFO L480 AbstractCegarLoop]: Abstraction has 17431 states and 56542 transitions. [2018-12-31 22:13:43,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 22:13:43,560 INFO L276 IsEmpty]: Start isEmpty. Operand 17431 states and 56542 transitions. [2018-12-31 22:13:43,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-31 22:13:43,585 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:13:43,585 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] [2018-12-31 22:13:43,585 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:13:43,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:13:43,586 INFO L82 PathProgramCache]: Analyzing trace with hash 790060524, now seen corresponding path program 1 times [2018-12-31 22:13:43,586 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:13:43,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:13:43,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:13:43,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:13:43,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:13:43,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:13:43,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:13:43,787 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:13:43,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 22:13:43,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 22:13:43,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 22:13:43,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-31 22:13:43,788 INFO L87 Difference]: Start difference. First operand 17431 states and 56542 transitions. Second operand 7 states. [2018-12-31 22:13:44,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:13:44,611 INFO L93 Difference]: Finished difference Result 34885 states and 113549 transitions. [2018-12-31 22:13:44,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-31 22:13:44,612 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 89 [2018-12-31 22:13:44,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:13:44,682 INFO L225 Difference]: With dead ends: 34885 [2018-12-31 22:13:44,682 INFO L226 Difference]: Without dead ends: 34885 [2018-12-31 22:13:44,683 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 [2018-12-31 22:13:44,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34885 states. [2018-12-31 22:13:45,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34885 to 21349. [2018-12-31 22:13:45,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21349 states. [2018-12-31 22:13:45,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21349 states to 21349 states and 69675 transitions. [2018-12-31 22:13:45,151 INFO L78 Accepts]: Start accepts. Automaton has 21349 states and 69675 transitions. Word has length 89 [2018-12-31 22:13:45,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:13:45,152 INFO L480 AbstractCegarLoop]: Abstraction has 21349 states and 69675 transitions. [2018-12-31 22:13:45,152 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 22:13:45,152 INFO L276 IsEmpty]: Start isEmpty. Operand 21349 states and 69675 transitions. [2018-12-31 22:13:45,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-31 22:13:45,194 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:13:45,194 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 22:13:45,194 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:13:45,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:13:45,194 INFO L82 PathProgramCache]: Analyzing trace with hash 1677564205, now seen corresponding path program 1 times [2018-12-31 22:13:45,194 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:13:45,195 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:13:45,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:13:45,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:13:45,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:13:45,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:13:45,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:13:45,468 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:13:45,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 22:13:45,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 22:13:45,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 22:13:45,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-31 22:13:45,469 INFO L87 Difference]: Start difference. First operand 21349 states and 69675 transitions. Second operand 6 states. [2018-12-31 22:13:46,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:13:46,271 INFO L93 Difference]: Finished difference Result 23047 states and 74301 transitions. [2018-12-31 22:13:46,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 22:13:46,272 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 89 [2018-12-31 22:13:46,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:13:46,315 INFO L225 Difference]: With dead ends: 23047 [2018-12-31 22:13:46,315 INFO L226 Difference]: Without dead ends: 23047 [2018-12-31 22:13:46,316 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-31 22:13:46,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23047 states. [2018-12-31 22:13:46,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23047 to 18925. [2018-12-31 22:13:46,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18925 states. [2018-12-31 22:13:46,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18925 states to 18925 states and 60764 transitions. [2018-12-31 22:13:46,639 INFO L78 Accepts]: Start accepts. Automaton has 18925 states and 60764 transitions. Word has length 89 [2018-12-31 22:13:46,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:13:46,640 INFO L480 AbstractCegarLoop]: Abstraction has 18925 states and 60764 transitions. [2018-12-31 22:13:46,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 22:13:46,640 INFO L276 IsEmpty]: Start isEmpty. Operand 18925 states and 60764 transitions. [2018-12-31 22:13:46,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-31 22:13:46,678 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:13:46,678 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] [2018-12-31 22:13:46,679 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:13:46,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:13:46,679 INFO L82 PathProgramCache]: Analyzing trace with hash 1136150973, now seen corresponding path program 1 times [2018-12-31 22:13:46,679 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:13:46,679 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:13:46,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:13:46,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:13:46,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:13:46,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:13:46,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:13:46,856 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:13:46,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 22:13:46,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 22:13:46,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 22:13:46,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-31 22:13:46,858 INFO L87 Difference]: Start difference. First operand 18925 states and 60764 transitions. Second operand 6 states. [2018-12-31 22:13:48,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:13:48,142 INFO L93 Difference]: Finished difference Result 22410 states and 71037 transitions. [2018-12-31 22:13:48,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 22:13:48,143 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 89 [2018-12-31 22:13:48,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:13:48,185 INFO L225 Difference]: With dead ends: 22410 [2018-12-31 22:13:48,185 INFO L226 Difference]: Without dead ends: 21890 [2018-12-31 22:13:48,186 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-31 22:13:48,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21890 states. [2018-12-31 22:13:48,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21890 to 20605. [2018-12-31 22:13:48,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20605 states. [2018-12-31 22:13:48,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20605 states to 20605 states and 65908 transitions. [2018-12-31 22:13:48,530 INFO L78 Accepts]: Start accepts. Automaton has 20605 states and 65908 transitions. Word has length 89 [2018-12-31 22:13:48,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:13:48,531 INFO L480 AbstractCegarLoop]: Abstraction has 20605 states and 65908 transitions. [2018-12-31 22:13:48,531 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 22:13:48,531 INFO L276 IsEmpty]: Start isEmpty. Operand 20605 states and 65908 transitions. [2018-12-31 22:13:48,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-31 22:13:48,564 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:13:48,564 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 22:13:48,565 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:13:48,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:13:48,565 INFO L82 PathProgramCache]: Analyzing trace with hash -1471508820, now seen corresponding path program 1 times [2018-12-31 22:13:48,565 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:13:48,565 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:13:48,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:13:48,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:13:48,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:13:48,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:13:49,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:13:49,244 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:13:49,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 22:13:49,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 22:13:49,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 22:13:49,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-31 22:13:49,245 INFO L87 Difference]: Start difference. First operand 20605 states and 65908 transitions. Second operand 7 states. [2018-12-31 22:13:49,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:13:49,953 INFO L93 Difference]: Finished difference Result 23378 states and 74692 transitions. [2018-12-31 22:13:49,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 22:13:49,954 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 89 [2018-12-31 22:13:49,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:13:49,997 INFO L225 Difference]: With dead ends: 23378 [2018-12-31 22:13:49,997 INFO L226 Difference]: Without dead ends: 23378 [2018-12-31 22:13:49,997 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-31 22:13:50,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23378 states. [2018-12-31 22:13:50,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23378 to 20780. [2018-12-31 22:13:50,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20780 states. [2018-12-31 22:13:50,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20780 states to 20780 states and 66628 transitions. [2018-12-31 22:13:50,358 INFO L78 Accepts]: Start accepts. Automaton has 20780 states and 66628 transitions. Word has length 89 [2018-12-31 22:13:50,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:13:50,359 INFO L480 AbstractCegarLoop]: Abstraction has 20780 states and 66628 transitions. [2018-12-31 22:13:50,359 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 22:13:50,359 INFO L276 IsEmpty]: Start isEmpty. Operand 20780 states and 66628 transitions. [2018-12-31 22:13:50,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-31 22:13:50,392 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:13:50,393 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] [2018-12-31 22:13:50,393 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:13:50,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:13:50,393 INFO L82 PathProgramCache]: Analyzing trace with hash -873952868, now seen corresponding path program 1 times [2018-12-31 22:13:50,393 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:13:50,393 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:13:50,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:13:50,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:13:50,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:13:50,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:13:50,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:13:50,691 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:13:50,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 22:13:50,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 22:13:50,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 22:13:50,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-31 22:13:50,693 INFO L87 Difference]: Start difference. First operand 20780 states and 66628 transitions. Second operand 6 states. [2018-12-31 22:13:51,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:13:51,237 INFO L93 Difference]: Finished difference Result 22800 states and 71524 transitions. [2018-12-31 22:13:51,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 22:13:51,238 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 89 [2018-12-31 22:13:51,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:13:51,281 INFO L225 Difference]: With dead ends: 22800 [2018-12-31 22:13:51,282 INFO L226 Difference]: Without dead ends: 22800 [2018-12-31 22:13:51,282 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-31 22:13:51,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22800 states. [2018-12-31 22:13:51,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22800 to 21185. [2018-12-31 22:13:51,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21185 states. [2018-12-31 22:13:51,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21185 states to 21185 states and 66772 transitions. [2018-12-31 22:13:51,598 INFO L78 Accepts]: Start accepts. Automaton has 21185 states and 66772 transitions. Word has length 89 [2018-12-31 22:13:51,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:13:51,598 INFO L480 AbstractCegarLoop]: Abstraction has 21185 states and 66772 transitions. [2018-12-31 22:13:51,599 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 22:13:51,599 INFO L276 IsEmpty]: Start isEmpty. Operand 21185 states and 66772 transitions. [2018-12-31 22:13:51,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-31 22:13:51,628 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:13:51,629 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] [2018-12-31 22:13:51,629 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:13:51,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:13:51,629 INFO L82 PathProgramCache]: Analyzing trace with hash -1128689413, now seen corresponding path program 1 times [2018-12-31 22:13:51,629 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:13:51,630 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:13:51,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:13:51,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:13:51,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:13:51,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:13:52,060 WARN L181 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 10 [2018-12-31 22:13:52,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:13:52,136 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:13:52,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 22:13:52,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 22:13:52,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 22:13:52,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-31 22:13:52,138 INFO L87 Difference]: Start difference. First operand 21185 states and 66772 transitions. Second operand 6 states. [2018-12-31 22:13:52,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:13:52,422 INFO L93 Difference]: Finished difference Result 19713 states and 60964 transitions. [2018-12-31 22:13:52,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 22:13:52,423 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 89 [2018-12-31 22:13:52,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:13:52,456 INFO L225 Difference]: With dead ends: 19713 [2018-12-31 22:13:52,456 INFO L226 Difference]: Without dead ends: 19713 [2018-12-31 22:13:52,457 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-31 22:13:52,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19713 states. [2018-12-31 22:13:52,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19713 to 12349. [2018-12-31 22:13:52,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12349 states. [2018-12-31 22:13:52,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12349 states to 12349 states and 38204 transitions. [2018-12-31 22:13:52,688 INFO L78 Accepts]: Start accepts. Automaton has 12349 states and 38204 transitions. Word has length 89 [2018-12-31 22:13:52,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:13:52,689 INFO L480 AbstractCegarLoop]: Abstraction has 12349 states and 38204 transitions. [2018-12-31 22:13:52,689 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 22:13:52,689 INFO L276 IsEmpty]: Start isEmpty. Operand 12349 states and 38204 transitions. [2018-12-31 22:13:52,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-31 22:13:52,705 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:13:52,705 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 22:13:52,706 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:13:52,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:13:52,706 INFO L82 PathProgramCache]: Analyzing trace with hash 800833982, now seen corresponding path program 1 times [2018-12-31 22:13:52,706 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:13:52,706 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:13:52,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:13:52,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:13:52,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:13:52,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:13:53,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:13:53,049 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:13:53,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 22:13:53,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 22:13:53,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 22:13:53,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-31 22:13:53,050 INFO L87 Difference]: Start difference. First operand 12349 states and 38204 transitions. Second operand 6 states. [2018-12-31 22:13:53,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:13:53,301 INFO L93 Difference]: Finished difference Result 14279 states and 43813 transitions. [2018-12-31 22:13:53,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 22:13:53,302 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2018-12-31 22:13:53,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:13:53,335 INFO L225 Difference]: With dead ends: 14279 [2018-12-31 22:13:53,335 INFO L226 Difference]: Without dead ends: 13989 [2018-12-31 22:13:53,336 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 [2018-12-31 22:13:53,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13989 states. [2018-12-31 22:13:53,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13989 to 10869. [2018-12-31 22:13:53,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10869 states. [2018-12-31 22:13:53,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10869 states to 10869 states and 33340 transitions. [2018-12-31 22:13:53,533 INFO L78 Accepts]: Start accepts. Automaton has 10869 states and 33340 transitions. Word has length 91 [2018-12-31 22:13:53,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:13:53,534 INFO L480 AbstractCegarLoop]: Abstraction has 10869 states and 33340 transitions. [2018-12-31 22:13:53,534 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 22:13:53,534 INFO L276 IsEmpty]: Start isEmpty. Operand 10869 states and 33340 transitions. [2018-12-31 22:13:53,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-31 22:13:53,551 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:13:53,551 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 22:13:53,551 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:13:53,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:13:53,552 INFO L82 PathProgramCache]: Analyzing trace with hash -1276375361, now seen corresponding path program 1 times [2018-12-31 22:13:53,552 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:13:53,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:13:53,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:13:53,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:13:53,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:13:53,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:13:54,383 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 6 [2018-12-31 22:13:54,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:13:54,646 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:13:54,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 22:13:54,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 22:13:54,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 22:13:54,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-31 22:13:54,649 INFO L87 Difference]: Start difference. First operand 10869 states and 33340 transitions. Second operand 7 states. [2018-12-31 22:13:55,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:13:55,306 INFO L93 Difference]: Finished difference Result 12896 states and 39484 transitions. [2018-12-31 22:13:55,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 22:13:55,307 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 91 [2018-12-31 22:13:55,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:13:55,330 INFO L225 Difference]: With dead ends: 12896 [2018-12-31 22:13:55,330 INFO L226 Difference]: Without dead ends: 12896 [2018-12-31 22:13:55,330 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2018-12-31 22:13:55,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12896 states. [2018-12-31 22:13:55,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12896 to 12832. [2018-12-31 22:13:55,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12832 states. [2018-12-31 22:13:55,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12832 states to 12832 states and 39276 transitions. [2018-12-31 22:13:55,528 INFO L78 Accepts]: Start accepts. Automaton has 12832 states and 39276 transitions. Word has length 91 [2018-12-31 22:13:55,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:13:55,529 INFO L480 AbstractCegarLoop]: Abstraction has 12832 states and 39276 transitions. [2018-12-31 22:13:55,529 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 22:13:55,529 INFO L276 IsEmpty]: Start isEmpty. Operand 12832 states and 39276 transitions. [2018-12-31 22:13:55,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-31 22:13:55,548 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:13:55,548 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 22:13:55,548 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:13:55,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:13:55,549 INFO L82 PathProgramCache]: Analyzing trace with hash -388871680, now seen corresponding path program 1 times [2018-12-31 22:13:55,549 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:13:55,549 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:13:55,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:13:55,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:13:55,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:13:55,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:13:55,842 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-12-31 22:13:55,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:13:55,939 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:13:55,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-31 22:13:55,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-31 22:13:55,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-31 22:13:55,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-31 22:13:55,942 INFO L87 Difference]: Start difference. First operand 12832 states and 39276 transitions. Second operand 10 states. [2018-12-31 22:13:56,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:13:56,901 INFO L93 Difference]: Finished difference Result 23024 states and 70388 transitions. [2018-12-31 22:13:56,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-31 22:13:56,902 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 91 [2018-12-31 22:13:56,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:13:56,922 INFO L225 Difference]: With dead ends: 23024 [2018-12-31 22:13:56,922 INFO L226 Difference]: Without dead ends: 11060 [2018-12-31 22:13:56,923 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2018-12-31 22:13:56,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11060 states. [2018-12-31 22:13:57,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11060 to 11060. [2018-12-31 22:13:57,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11060 states. [2018-12-31 22:13:57,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11060 states to 11060 states and 33600 transitions. [2018-12-31 22:13:57,090 INFO L78 Accepts]: Start accepts. Automaton has 11060 states and 33600 transitions. Word has length 91 [2018-12-31 22:13:57,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:13:57,090 INFO L480 AbstractCegarLoop]: Abstraction has 11060 states and 33600 transitions. [2018-12-31 22:13:57,090 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-31 22:13:57,091 INFO L276 IsEmpty]: Start isEmpty. Operand 11060 states and 33600 transitions. [2018-12-31 22:13:57,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-31 22:13:57,105 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:13:57,105 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 22:13:57,105 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:13:57,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:13:57,105 INFO L82 PathProgramCache]: Analyzing trace with hash 1052755860, now seen corresponding path program 2 times [2018-12-31 22:13:57,106 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:13:57,106 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:13:57,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:13:57,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:13:57,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:13:57,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:13:57,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:13:57,252 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:13:57,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 22:13:57,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 22:13:57,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 22:13:57,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-31 22:13:57,253 INFO L87 Difference]: Start difference. First operand 11060 states and 33600 transitions. Second operand 7 states. [2018-12-31 22:13:57,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:13:57,863 INFO L93 Difference]: Finished difference Result 19166 states and 58450 transitions. [2018-12-31 22:13:57,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 22:13:57,864 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 91 [2018-12-31 22:13:57,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:13:57,877 INFO L225 Difference]: With dead ends: 19166 [2018-12-31 22:13:57,878 INFO L226 Difference]: Without dead ends: 7778 [2018-12-31 22:13:57,878 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-12-31 22:13:57,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7778 states. [2018-12-31 22:13:57,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7778 to 7778. [2018-12-31 22:13:57,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7778 states. [2018-12-31 22:13:57,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7778 states to 7778 states and 23721 transitions. [2018-12-31 22:13:57,985 INFO L78 Accepts]: Start accepts. Automaton has 7778 states and 23721 transitions. Word has length 91 [2018-12-31 22:13:57,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:13:57,985 INFO L480 AbstractCegarLoop]: Abstraction has 7778 states and 23721 transitions. [2018-12-31 22:13:57,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 22:13:57,985 INFO L276 IsEmpty]: Start isEmpty. Operand 7778 states and 23721 transitions. [2018-12-31 22:13:57,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-31 22:13:57,996 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:13:57,996 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 22:13:57,997 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:13:57,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:13:57,997 INFO L82 PathProgramCache]: Analyzing trace with hash -1451279012, now seen corresponding path program 3 times [2018-12-31 22:13:57,997 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:13:57,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:13:57,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:13:57,999 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 22:13:57,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:13:58,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 22:13:58,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 22:13:58,095 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-31 22:13:58,286 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-31 22:13:58,288 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 10:13:58 BasicIcfg [2018-12-31 22:13:58,288 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 22:13:58,289 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 22:13:58,289 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 22:13:58,289 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 22:13:58,290 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 10:12:26" (3/4) ... [2018-12-31 22:13:58,294 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-31 22:13:58,474 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 22:13:58,474 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 22:13:58,479 INFO L168 Benchmark]: Toolchain (without parser) took 94420.15 ms. Allocated memory was 1.0 GB in the beginning and 5.8 GB in the end (delta: 4.8 GB). Free memory was 951.4 MB in the beginning and 2.3 GB in the end (delta: -1.3 GB). Peak memory consumption was 3.4 GB. Max. memory is 11.5 GB. [2018-12-31 22:13:58,480 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 22:13:58,480 INFO L168 Benchmark]: CACSL2BoogieTranslator took 922.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -173.7 MB). Peak memory consumption was 25.7 MB. Max. memory is 11.5 GB. [2018-12-31 22:13:58,481 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.25 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2018-12-31 22:13:58,481 INFO L168 Benchmark]: Boogie Preprocessor took 52.14 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 22:13:58,481 INFO L168 Benchmark]: RCFGBuilder took 1208.18 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: 45.4 MB). Peak memory consumption was 45.4 MB. Max. memory is 11.5 GB. [2018-12-31 22:13:58,483 INFO L168 Benchmark]: TraceAbstraction took 91976.20 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.1 GB in the beginning and 2.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 3.3 GB. Max. memory is 11.5 GB. [2018-12-31 22:13:58,484 INFO L168 Benchmark]: Witness Printer took 185.56 ms. Allocated memory is still 5.8 GB. Free memory was 2.4 GB in the beginning and 2.3 GB in the end (delta: 54.9 MB). Peak memory consumption was 54.9 MB. Max. memory is 11.5 GB. [2018-12-31 22:13:58,487 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.20 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 922.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -173.7 MB). Peak memory consumption was 25.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 66.25 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 52.14 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 1208.18 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: 45.4 MB). Peak memory consumption was 45.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 91976.20 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.1 GB in the beginning and 2.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 3.3 GB. Max. memory is 11.5 GB. * Witness Printer took 185.56 ms. Allocated memory is still 5.8 GB. Free memory was 2.4 GB in the beginning and 2.3 GB in the end (delta: 54.9 MB). Peak memory consumption was 54.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L672] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L674] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L676] -1 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0] [L677] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0] [L678] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L680] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L682] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L683] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L684] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L685] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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] [L686] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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] [L687] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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] [L688] -1 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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] [L689] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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] [L690] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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] [L691] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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] [L692] -1 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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] [L693] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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] [L694] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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}] [L695] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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] [L696] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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] [L697] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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] [L698] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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] [L700] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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] [L701] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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] [L702] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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] [L786] -1 pthread_t t1402; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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] [L787] FCALL, FORK -1 pthread_create(&t1402, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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] [L788] -1 pthread_t t1403; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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] [L789] FCALL, FORK -1 pthread_create(&t1403, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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] [L790] -1 pthread_t t1404; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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] [L791] FCALL, FORK -1 pthread_create(&t1404, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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] [L749] 0 y$w_buff1 = y$w_buff0 [L750] 0 y$w_buff0 = 1 [L751] 0 y$w_buff1_used = y$w_buff0_used [L752] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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] [L754] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L755] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L756] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L757] 0 y$r_buff1_thd3 = y$r_buff0_thd3 [L758] 0 y$r_buff0_thd3 = (_Bool)1 [L761] 0 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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=0] [L706] 1 z = 1 [L709] 1 x = 1 [L714] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L721] 2 x = 2 [L724] 2 weak$$choice0 = __VERIFIER_nondet_pointer() [L725] 2 weak$$choice2 = __VERIFIER_nondet_pointer() [L726] 2 y$flush_delayed = weak$$choice2 [L727] 2 y$mem_tmp = y VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L728] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L728] 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) [L729] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L764] 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=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L729] 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)) [L730] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L730] 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)) [L731] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, 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))=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L731] 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)) [L732] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L732] 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)) [L733] 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=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L733] 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)) [L734] 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=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L734] 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)) [L735] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L736] EXPR 2 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L736] 2 y = y$flush_delayed ? y$mem_tmp : y [L737] 2 y$flush_delayed = (_Bool)0 [L742] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L764] 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) [L765] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, y$flush_delayed=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] [L765] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L766] 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=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, y$flush_delayed=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] [L766] 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 [L767] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, y$flush_delayed=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] [L767] 0 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L768] 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=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, y$flush_delayed=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] [L768] 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 [L771] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, y$flush_delayed=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] [L793] -1 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, 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] [L797] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, 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] [L797] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, 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] [L797] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, 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] [L797] -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) [L798] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, 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] [L798] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L799] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, 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] [L799] -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 [L800] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, 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] [L800] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L801] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, 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] [L801] -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 [L804] -1 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, 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, 217 locations, 3 error locations. UNSAFE Result, 91.8s OverallTime, 23 OverallIterations, 1 TraceHistogramMax, 25.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5546 SDtfs, 7536 SDslu, 11560 SDs, 0 SdLazy, 4198 SolverSat, 234 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 187 GetRequests, 52 SyntacticMatches, 11 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 6.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=149043occurred 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: 28.1s AutomataMinimizationTime, 22 MinimizatonAttempts, 145035 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.8s InterpolantComputationTime, 1764 NumberOfCodeBlocks, 1764 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 1651 ConstructedInterpolants, 0 QuantifiedInterpolants, 347057 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 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...