/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe034_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-28 05:28:17,959 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-28 05:28:17,962 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-28 05:28:17,981 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-28 05:28:17,982 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-28 05:28:17,984 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-28 05:28:17,986 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-28 05:28:17,995 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-28 05:28:17,996 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-28 05:28:17,998 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-28 05:28:17,999 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-28 05:28:18,001 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-28 05:28:18,001 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-28 05:28:18,002 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-28 05:28:18,003 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-28 05:28:18,004 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-28 05:28:18,005 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-28 05:28:18,006 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-28 05:28:18,007 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-28 05:28:18,009 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-28 05:28:18,011 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-28 05:28:18,012 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-28 05:28:18,013 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-28 05:28:18,014 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-28 05:28:18,016 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-28 05:28:18,016 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-28 05:28:18,017 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-28 05:28:18,017 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-28 05:28:18,018 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-28 05:28:18,019 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-28 05:28:18,019 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-28 05:28:18,020 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-28 05:28:18,021 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-28 05:28:18,021 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-28 05:28:18,022 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-28 05:28:18,023 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-28 05:28:18,023 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-28 05:28:18,024 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-28 05:28:18,024 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-28 05:28:18,025 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-28 05:28:18,025 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-28 05:28:18,026 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe-MCR.epf [2019-12-28 05:28:18,045 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-28 05:28:18,045 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-28 05:28:18,046 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-28 05:28:18,046 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-28 05:28:18,047 INFO L138 SettingsManager]: * Use SBE=true [2019-12-28 05:28:18,047 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-28 05:28:18,047 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-28 05:28:18,047 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-28 05:28:18,047 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-28 05:28:18,048 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-28 05:28:18,048 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-28 05:28:18,048 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-28 05:28:18,048 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-28 05:28:18,048 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-28 05:28:18,049 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-28 05:28:18,049 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-28 05:28:18,049 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-28 05:28:18,049 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-28 05:28:18,049 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-28 05:28:18,050 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-28 05:28:18,050 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-28 05:28:18,050 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-28 05:28:18,050 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-28 05:28:18,050 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-28 05:28:18,051 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-28 05:28:18,051 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-28 05:28:18,051 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-28 05:28:18,051 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-28 05:28:18,051 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-28 05:28:18,051 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-28 05:28:18,052 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-28 05:28:18,052 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-28 05:28:18,318 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-28 05:28:18,336 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-28 05:28:18,342 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-28 05:28:18,343 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-28 05:28:18,343 INFO L275 PluginConnector]: CDTParser initialized [2019-12-28 05:28:18,344 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe034_pso.oepc.i [2019-12-28 05:28:18,406 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4cc078ca8/d8354b1fd7054b3997242623dfa6ab49/FLAG400689f6e [2019-12-28 05:28:19,010 INFO L306 CDTParser]: Found 1 translation units. [2019-12-28 05:28:19,011 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe034_pso.oepc.i [2019-12-28 05:28:19,029 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4cc078ca8/d8354b1fd7054b3997242623dfa6ab49/FLAG400689f6e [2019-12-28 05:28:19,289 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4cc078ca8/d8354b1fd7054b3997242623dfa6ab49 [2019-12-28 05:28:19,298 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-28 05:28:19,300 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-28 05:28:19,301 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-28 05:28:19,302 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-28 05:28:19,306 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-28 05:28:19,307 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 05:28:19" (1/1) ... [2019-12-28 05:28:19,310 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ef2d690 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:28:19, skipping insertion in model container [2019-12-28 05:28:19,310 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 05:28:19" (1/1) ... [2019-12-28 05:28:19,319 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-28 05:28:19,385 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-28 05:28:19,936 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-28 05:28:19,948 INFO L203 MainTranslator]: Completed pre-run [2019-12-28 05:28:20,031 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-28 05:28:20,113 INFO L208 MainTranslator]: Completed translation [2019-12-28 05:28:20,114 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:28:20 WrapperNode [2019-12-28 05:28:20,114 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-28 05:28:20,115 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-28 05:28:20,115 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-28 05:28:20,117 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-28 05:28:20,126 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:28:20" (1/1) ... [2019-12-28 05:28:20,149 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:28:20" (1/1) ... [2019-12-28 05:28:20,182 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-28 05:28:20,183 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-28 05:28:20,183 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-28 05:28:20,183 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-28 05:28:20,194 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:28:20" (1/1) ... [2019-12-28 05:28:20,194 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:28:20" (1/1) ... [2019-12-28 05:28:20,199 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:28:20" (1/1) ... [2019-12-28 05:28:20,199 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:28:20" (1/1) ... [2019-12-28 05:28:20,208 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:28:20" (1/1) ... [2019-12-28 05:28:20,212 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:28:20" (1/1) ... [2019-12-28 05:28:20,216 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:28:20" (1/1) ... [2019-12-28 05:28:20,220 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-28 05:28:20,224 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-28 05:28:20,224 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-28 05:28:20,224 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-28 05:28:20,225 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:28:20" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-28 05:28:20,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-28 05:28:20,290 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-28 05:28:20,290 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-28 05:28:20,291 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-28 05:28:20,291 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-28 05:28:20,291 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-28 05:28:20,291 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-28 05:28:20,292 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-28 05:28:20,292 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-28 05:28:20,292 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-28 05:28:20,292 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-28 05:28:20,292 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-28 05:28:20,292 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-28 05:28:20,294 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-28 05:28:21,043 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-28 05:28:21,043 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-28 05:28:21,047 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 05:28:21 BoogieIcfgContainer [2019-12-28 05:28:21,047 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-28 05:28:21,049 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-28 05:28:21,049 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-28 05:28:21,053 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-28 05:28:21,054 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.12 05:28:19" (1/3) ... [2019-12-28 05:28:21,055 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@80908ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 05:28:21, skipping insertion in model container [2019-12-28 05:28:21,056 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:28:20" (2/3) ... [2019-12-28 05:28:21,056 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@80908ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 05:28:21, skipping insertion in model container [2019-12-28 05:28:21,057 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 05:28:21" (3/3) ... [2019-12-28 05:28:21,060 INFO L109 eAbstractionObserver]: Analyzing ICFG safe034_pso.oepc.i [2019-12-28 05:28:21,072 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-28 05:28:21,072 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-28 05:28:21,086 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-28 05:28:21,087 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-28 05:28:21,127 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,128 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,128 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,128 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,129 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,129 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,131 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,131 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,131 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,132 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,132 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,132 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,132 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,132 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,133 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,133 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,133 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,133 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,134 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,134 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,134 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,137 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,137 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,137 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,138 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,138 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,138 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,138 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,139 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,140 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,140 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,142 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,143 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,143 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,144 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,144 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,144 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,144 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,160 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,160 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,160 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,160 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,164 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,164 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,164 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,164 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,165 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,165 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,165 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,166 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,166 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,166 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,166 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,168 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,168 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,168 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,168 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,169 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,169 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,169 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,169 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,170 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,170 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,170 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,170 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,171 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,171 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,171 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,171 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,172 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,172 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,176 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,176 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,177 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,177 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,181 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,181 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,181 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,181 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,181 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,182 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,182 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,182 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,182 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,183 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,183 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,183 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,183 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,183 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,184 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,184 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,184 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,184 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,185 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,190 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,209 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,210 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,211 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,212 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,212 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,212 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,212 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,212 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,213 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,213 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,213 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:28:21,232 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-28 05:28:21,254 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-28 05:28:21,254 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-28 05:28:21,254 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-28 05:28:21,255 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-28 05:28:21,255 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-28 05:28:21,255 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-28 05:28:21,255 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-28 05:28:21,255 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-28 05:28:21,270 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 151 places, 176 transitions [2019-12-28 05:28:40,157 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 111186 states. [2019-12-28 05:28:40,159 INFO L276 IsEmpty]: Start isEmpty. Operand 111186 states. [2019-12-28 05:28:40,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-28 05:28:40,174 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:28:40,175 INFO L411 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] [2019-12-28 05:28:40,175 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:28:40,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:28:40,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1109224519, now seen corresponding path program 1 times [2019-12-28 05:28:40,189 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:28:40,189 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949759498] [2019-12-28 05:28:40,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:28:40,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:28:40,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 05:28:40,572 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949759498] [2019-12-28 05:28:40,573 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:28:40,574 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 05:28:40,574 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [239580501] [2019-12-28 05:28:40,575 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:28:40,584 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:28:40,608 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 46 states and 45 transitions. [2019-12-28 05:28:40,609 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:28:40,613 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 05:28:40,614 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 05:28:40,614 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:28:40,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 05:28:40,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 05:28:40,631 INFO L87 Difference]: Start difference. First operand 111186 states. Second operand 4 states. [2019-12-28 05:28:44,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:28:44,339 INFO L93 Difference]: Finished difference Result 114114 states and 522350 transitions. [2019-12-28 05:28:44,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-28 05:28:44,341 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2019-12-28 05:28:44,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:28:44,971 INFO L225 Difference]: With dead ends: 114114 [2019-12-28 05:28:44,971 INFO L226 Difference]: Without dead ends: 82834 [2019-12-28 05:28:44,976 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 05:28:45,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82834 states. [2019-12-28 05:28:51,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82834 to 82834. [2019-12-28 05:28:51,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82834 states. [2019-12-28 05:28:51,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82834 states to 82834 states and 380410 transitions. [2019-12-28 05:28:51,853 INFO L78 Accepts]: Start accepts. Automaton has 82834 states and 380410 transitions. Word has length 45 [2019-12-28 05:28:51,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:28:51,855 INFO L462 AbstractCegarLoop]: Abstraction has 82834 states and 380410 transitions. [2019-12-28 05:28:51,855 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 05:28:51,855 INFO L276 IsEmpty]: Start isEmpty. Operand 82834 states and 380410 transitions. [2019-12-28 05:28:51,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-28 05:28:51,876 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:28:51,876 INFO L411 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] [2019-12-28 05:28:51,877 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:28:51,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:28:51,877 INFO L82 PathProgramCache]: Analyzing trace with hash 1958045590, now seen corresponding path program 1 times [2019-12-28 05:28:51,878 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:28:51,878 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163441359] [2019-12-28 05:28:51,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:28:51,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:28:52,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 05:28:52,028 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163441359] [2019-12-28 05:28:52,028 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:28:52,028 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 05:28:52,028 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [740318287] [2019-12-28 05:28:52,029 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:28:52,036 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:28:52,046 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 54 states and 53 transitions. [2019-12-28 05:28:52,046 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:28:52,048 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 05:28:52,049 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 05:28:52,050 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:28:52,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 05:28:52,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 05:28:52,051 INFO L87 Difference]: Start difference. First operand 82834 states and 380410 transitions. Second operand 5 states. [2019-12-28 05:28:57,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:28:57,249 INFO L93 Difference]: Finished difference Result 129234 states and 566702 transitions. [2019-12-28 05:28:57,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 05:28:57,250 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2019-12-28 05:28:57,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:28:57,731 INFO L225 Difference]: With dead ends: 129234 [2019-12-28 05:28:57,732 INFO L226 Difference]: Without dead ends: 126474 [2019-12-28 05:28:57,733 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 [2019-12-28 05:28:58,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126474 states. [2019-12-28 05:29:01,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126474 to 119958. [2019-12-28 05:29:01,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119958 states. [2019-12-28 05:29:02,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119958 states to 119958 states and 531549 transitions. [2019-12-28 05:29:02,313 INFO L78 Accepts]: Start accepts. Automaton has 119958 states and 531549 transitions. Word has length 53 [2019-12-28 05:29:02,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:29:02,313 INFO L462 AbstractCegarLoop]: Abstraction has 119958 states and 531549 transitions. [2019-12-28 05:29:02,314 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 05:29:02,314 INFO L276 IsEmpty]: Start isEmpty. Operand 119958 states and 531549 transitions. [2019-12-28 05:29:02,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-28 05:29:02,331 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:29:02,331 INFO L411 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] [2019-12-28 05:29:02,331 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:29:02,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:29:02,332 INFO L82 PathProgramCache]: Analyzing trace with hash 690713249, now seen corresponding path program 1 times [2019-12-28 05:29:02,332 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:29:02,332 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443190670] [2019-12-28 05:29:02,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:29:02,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:29:02,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 05:29:02,441 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443190670] [2019-12-28 05:29:02,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:29:02,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 05:29:02,441 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1970904643] [2019-12-28 05:29:02,442 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:29:02,450 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:29:02,462 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 91 states and 126 transitions. [2019-12-28 05:29:02,463 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:29:02,522 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 05:29:02,522 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 05:29:02,523 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:29:02,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 05:29:02,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-28 05:29:02,523 INFO L87 Difference]: Start difference. First operand 119958 states and 531549 transitions. Second operand 6 states. [2019-12-28 05:29:08,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:29:08,575 INFO L93 Difference]: Finished difference Result 156370 states and 680698 transitions. [2019-12-28 05:29:08,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 05:29:08,576 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-12-28 05:29:08,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:29:09,308 INFO L225 Difference]: With dead ends: 156370 [2019-12-28 05:29:09,308 INFO L226 Difference]: Without dead ends: 154130 [2019-12-28 05:29:09,309 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-28 05:29:10,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154130 states. [2019-12-28 05:29:13,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154130 to 132942. [2019-12-28 05:29:13,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132942 states. [2019-12-28 05:29:14,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132942 states to 132942 states and 585323 transitions. [2019-12-28 05:29:14,817 INFO L78 Accepts]: Start accepts. Automaton has 132942 states and 585323 transitions. Word has length 54 [2019-12-28 05:29:14,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:29:14,817 INFO L462 AbstractCegarLoop]: Abstraction has 132942 states and 585323 transitions. [2019-12-28 05:29:14,817 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 05:29:14,817 INFO L276 IsEmpty]: Start isEmpty. Operand 132942 states and 585323 transitions. [2019-12-28 05:29:14,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-28 05:29:14,860 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:29:14,861 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 05:29:14,861 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:29:14,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:29:14,861 INFO L82 PathProgramCache]: Analyzing trace with hash -1060971801, now seen corresponding path program 1 times [2019-12-28 05:29:14,862 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:29:14,862 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311897915] [2019-12-28 05:29:14,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:29:14,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:29:14,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 05:29:14,929 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311897915] [2019-12-28 05:29:14,930 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:29:14,930 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 05:29:14,930 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1610790658] [2019-12-28 05:29:14,930 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:29:14,938 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:29:14,952 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 101 states and 144 transitions. [2019-12-28 05:29:14,953 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:29:14,998 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-28 05:29:14,998 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 05:29:14,998 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:29:14,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 05:29:14,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-28 05:29:14,999 INFO L87 Difference]: Start difference. First operand 132942 states and 585323 transitions. Second operand 5 states. [2019-12-28 05:29:22,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:29:22,211 INFO L93 Difference]: Finished difference Result 171274 states and 741340 transitions. [2019-12-28 05:29:22,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 05:29:22,217 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2019-12-28 05:29:22,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:29:22,752 INFO L225 Difference]: With dead ends: 171274 [2019-12-28 05:29:22,752 INFO L226 Difference]: Without dead ends: 171274 [2019-12-28 05:29:22,752 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-28 05:29:23,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171274 states. [2019-12-28 05:29:26,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171274 to 151998. [2019-12-28 05:29:26,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151998 states. [2019-12-28 05:29:28,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151998 states to 151998 states and 663351 transitions. [2019-12-28 05:29:28,258 INFO L78 Accepts]: Start accepts. Automaton has 151998 states and 663351 transitions. Word has length 56 [2019-12-28 05:29:28,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:29:28,259 INFO L462 AbstractCegarLoop]: Abstraction has 151998 states and 663351 transitions. [2019-12-28 05:29:28,259 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 05:29:28,259 INFO L276 IsEmpty]: Start isEmpty. Operand 151998 states and 663351 transitions. [2019-12-28 05:29:28,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-28 05:29:28,307 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:29:28,307 INFO L411 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] [2019-12-28 05:29:28,308 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:29:28,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:29:28,308 INFO L82 PathProgramCache]: Analyzing trace with hash -1957923899, now seen corresponding path program 1 times [2019-12-28 05:29:28,309 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:29:28,309 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009022541] [2019-12-28 05:29:28,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:29:28,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:29:28,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 05:29:28,466 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009022541] [2019-12-28 05:29:28,466 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:29:28,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 05:29:28,467 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [435552882] [2019-12-28 05:29:28,467 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:29:28,474 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:29:28,484 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 63 states and 64 transitions. [2019-12-28 05:29:28,484 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:29:28,486 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 05:29:28,486 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 05:29:28,486 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:29:28,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 05:29:28,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-28 05:29:28,488 INFO L87 Difference]: Start difference. First operand 151998 states and 663351 transitions. Second operand 6 states. [2019-12-28 05:29:36,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:29:36,573 INFO L93 Difference]: Finished difference Result 208582 states and 902701 transitions. [2019-12-28 05:29:36,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 05:29:36,573 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2019-12-28 05:29:36,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:29:37,296 INFO L225 Difference]: With dead ends: 208582 [2019-12-28 05:29:37,296 INFO L226 Difference]: Without dead ends: 205382 [2019-12-28 05:29:37,297 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-28 05:29:38,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205382 states. [2019-12-28 05:29:42,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205382 to 193070. [2019-12-28 05:29:42,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193070 states. [2019-12-28 05:29:43,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193070 states to 193070 states and 837871 transitions. [2019-12-28 05:29:43,313 INFO L78 Accepts]: Start accepts. Automaton has 193070 states and 837871 transitions. Word has length 60 [2019-12-28 05:29:43,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:29:43,313 INFO L462 AbstractCegarLoop]: Abstraction has 193070 states and 837871 transitions. [2019-12-28 05:29:43,313 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 05:29:43,314 INFO L276 IsEmpty]: Start isEmpty. Operand 193070 states and 837871 transitions. [2019-12-28 05:29:43,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-28 05:29:43,369 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:29:43,369 INFO L411 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] [2019-12-28 05:29:43,369 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:29:43,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:29:43,370 INFO L82 PathProgramCache]: Analyzing trace with hash 540092038, now seen corresponding path program 1 times [2019-12-28 05:29:43,370 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:29:43,370 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269568230] [2019-12-28 05:29:43,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:29:43,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:29:43,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 05:29:43,507 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269568230] [2019-12-28 05:29:43,508 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:29:43,508 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 05:29:43,508 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1978066477] [2019-12-28 05:29:43,508 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:29:43,515 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:29:43,524 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 63 states and 64 transitions. [2019-12-28 05:29:43,525 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:29:43,525 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 05:29:43,525 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 05:29:43,525 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:29:43,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 05:29:43,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-28 05:29:43,526 INFO L87 Difference]: Start difference. First operand 193070 states and 837871 transitions. Second operand 7 states. [2019-12-28 05:29:51,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:29:51,858 INFO L93 Difference]: Finished difference Result 275526 states and 1157813 transitions. [2019-12-28 05:29:51,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-28 05:29:51,859 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 60 [2019-12-28 05:29:51,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:29:52,802 INFO L225 Difference]: With dead ends: 275526 [2019-12-28 05:29:52,803 INFO L226 Difference]: Without dead ends: 275526 [2019-12-28 05:29:52,803 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-28 05:30:00,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275526 states. [2019-12-28 05:30:04,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275526 to 228422. [2019-12-28 05:30:04,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228422 states. [2019-12-28 05:30:06,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228422 states to 228422 states and 972797 transitions. [2019-12-28 05:30:06,061 INFO L78 Accepts]: Start accepts. Automaton has 228422 states and 972797 transitions. Word has length 60 [2019-12-28 05:30:06,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:30:06,061 INFO L462 AbstractCegarLoop]: Abstraction has 228422 states and 972797 transitions. [2019-12-28 05:30:06,062 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 05:30:06,062 INFO L276 IsEmpty]: Start isEmpty. Operand 228422 states and 972797 transitions. [2019-12-28 05:30:06,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-28 05:30:06,120 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:30:06,120 INFO L411 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] [2019-12-28 05:30:06,120 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:30:06,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:30:06,121 INFO L82 PathProgramCache]: Analyzing trace with hash 1427595719, now seen corresponding path program 1 times [2019-12-28 05:30:06,121 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:30:06,121 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840151256] [2019-12-28 05:30:06,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:30:06,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:30:06,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 05:30:06,222 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840151256] [2019-12-28 05:30:06,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:30:06,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 05:30:06,223 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1862981872] [2019-12-28 05:30:06,223 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:30:06,229 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:30:06,238 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 63 states and 64 transitions. [2019-12-28 05:30:06,239 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:30:06,243 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-28 05:30:06,244 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 05:30:06,244 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:30:06,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 05:30:06,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 05:30:06,245 INFO L87 Difference]: Start difference. First operand 228422 states and 972797 transitions. Second operand 4 states. [2019-12-28 05:30:14,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:30:14,829 INFO L93 Difference]: Finished difference Result 185894 states and 771106 transitions. [2019-12-28 05:30:14,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 05:30:14,830 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2019-12-28 05:30:14,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:30:15,427 INFO L225 Difference]: With dead ends: 185894 [2019-12-28 05:30:15,427 INFO L226 Difference]: Without dead ends: 180910 [2019-12-28 05:30:15,427 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-28 05:30:16,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180910 states. [2019-12-28 05:30:19,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180910 to 180910. [2019-12-28 05:30:19,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180910 states. [2019-12-28 05:30:20,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180910 states to 180910 states and 753597 transitions. [2019-12-28 05:30:20,891 INFO L78 Accepts]: Start accepts. Automaton has 180910 states and 753597 transitions. Word has length 60 [2019-12-28 05:30:20,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:30:20,891 INFO L462 AbstractCegarLoop]: Abstraction has 180910 states and 753597 transitions. [2019-12-28 05:30:20,891 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 05:30:20,891 INFO L276 IsEmpty]: Start isEmpty. Operand 180910 states and 753597 transitions. [2019-12-28 05:30:20,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-28 05:30:20,920 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:30:20,920 INFO L411 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] [2019-12-28 05:30:20,920 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:30:20,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:30:20,920 INFO L82 PathProgramCache]: Analyzing trace with hash 1792364402, now seen corresponding path program 1 times [2019-12-28 05:30:20,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:30:20,921 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191011615] [2019-12-28 05:30:20,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:30:20,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:30:21,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 05:30:21,006 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191011615] [2019-12-28 05:30:21,006 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:30:21,006 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 05:30:21,006 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2037524466] [2019-12-28 05:30:21,006 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:30:21,016 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:30:21,037 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 121 states and 180 transitions. [2019-12-28 05:30:21,037 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:30:21,086 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-28 05:30:21,086 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-28 05:30:21,086 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:30:21,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-28 05:30:21,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-28 05:30:21,088 INFO L87 Difference]: Start difference. First operand 180910 states and 753597 transitions. Second operand 8 states. [2019-12-28 05:30:28,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:30:28,687 INFO L93 Difference]: Finished difference Result 234266 states and 959370 transitions. [2019-12-28 05:30:28,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-28 05:30:28,688 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 60 [2019-12-28 05:30:28,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:30:29,418 INFO L225 Difference]: With dead ends: 234266 [2019-12-28 05:30:29,418 INFO L226 Difference]: Without dead ends: 229388 [2019-12-28 05:30:29,419 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2019-12-28 05:30:31,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229388 states. [2019-12-28 05:30:34,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229388 to 183769. [2019-12-28 05:30:34,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183769 states. [2019-12-28 05:30:35,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183769 states to 183769 states and 765836 transitions. [2019-12-28 05:30:35,411 INFO L78 Accepts]: Start accepts. Automaton has 183769 states and 765836 transitions. Word has length 60 [2019-12-28 05:30:35,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:30:35,411 INFO L462 AbstractCegarLoop]: Abstraction has 183769 states and 765836 transitions. [2019-12-28 05:30:35,411 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-28 05:30:35,412 INFO L276 IsEmpty]: Start isEmpty. Operand 183769 states and 765836 transitions. [2019-12-28 05:30:35,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-28 05:30:35,447 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:30:35,447 INFO L411 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] [2019-12-28 05:30:35,447 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:30:35,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:30:35,447 INFO L82 PathProgramCache]: Analyzing trace with hash -2025804751, now seen corresponding path program 1 times [2019-12-28 05:30:35,448 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:30:35,448 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047759455] [2019-12-28 05:30:35,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:30:35,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:30:35,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 05:30:35,504 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047759455] [2019-12-28 05:30:35,504 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:30:35,505 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 05:30:35,505 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1318954579] [2019-12-28 05:30:35,505 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:30:35,513 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:30:35,523 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 73 states and 83 transitions. [2019-12-28 05:30:35,524 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:30:35,524 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 05:30:35,524 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-28 05:30:35,525 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:30:35,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-28 05:30:35,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 05:30:35,526 INFO L87 Difference]: Start difference. First operand 183769 states and 765836 transitions. Second operand 3 states. [2019-12-28 05:30:41,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:30:41,079 INFO L93 Difference]: Finished difference Result 139576 states and 577896 transitions. [2019-12-28 05:30:41,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 05:30:41,079 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-12-28 05:30:41,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:30:41,484 INFO L225 Difference]: With dead ends: 139576 [2019-12-28 05:30:41,484 INFO L226 Difference]: Without dead ends: 138064 [2019-12-28 05:30:41,484 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 05:30:42,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138064 states. [2019-12-28 05:30:45,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138064 to 133150. [2019-12-28 05:30:45,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133150 states. [2019-12-28 05:30:45,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133150 states to 133150 states and 553578 transitions. [2019-12-28 05:30:45,489 INFO L78 Accepts]: Start accepts. Automaton has 133150 states and 553578 transitions. Word has length 61 [2019-12-28 05:30:45,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:30:45,490 INFO L462 AbstractCegarLoop]: Abstraction has 133150 states and 553578 transitions. [2019-12-28 05:30:45,490 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-28 05:30:45,490 INFO L276 IsEmpty]: Start isEmpty. Operand 133150 states and 553578 transitions. [2019-12-28 05:30:46,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-28 05:30:46,411 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:30:46,412 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 05:30:46,412 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:30:46,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:30:46,412 INFO L82 PathProgramCache]: Analyzing trace with hash -223534845, now seen corresponding path program 1 times [2019-12-28 05:30:46,413 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:30:46,413 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110423825] [2019-12-28 05:30:46,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:30:46,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:30:46,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 05:30:46,513 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110423825] [2019-12-28 05:30:46,513 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:30:46,513 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 05:30:46,513 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [549842096] [2019-12-28 05:30:46,514 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:30:46,520 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:30:46,530 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 71 states and 78 transitions. [2019-12-28 05:30:46,530 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:30:46,546 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-28 05:30:46,546 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 05:30:46,546 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:30:46,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 05:30:46,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-28 05:30:46,547 INFO L87 Difference]: Start difference. First operand 133150 states and 553578 transitions. Second operand 6 states. [2019-12-28 05:30:46,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:30:46,716 INFO L93 Difference]: Finished difference Result 26542 states and 98275 transitions. [2019-12-28 05:30:46,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-28 05:30:46,716 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2019-12-28 05:30:46,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:30:46,759 INFO L225 Difference]: With dead ends: 26542 [2019-12-28 05:30:46,759 INFO L226 Difference]: Without dead ends: 22036 [2019-12-28 05:30:46,760 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-12-28 05:30:46,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22036 states. [2019-12-28 05:30:47,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22036 to 21844. [2019-12-28 05:30:47,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21844 states. [2019-12-28 05:30:47,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21844 states to 21844 states and 79583 transitions. [2019-12-28 05:30:47,123 INFO L78 Accepts]: Start accepts. Automaton has 21844 states and 79583 transitions. Word has length 62 [2019-12-28 05:30:47,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:30:47,124 INFO L462 AbstractCegarLoop]: Abstraction has 21844 states and 79583 transitions. [2019-12-28 05:30:47,124 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 05:30:47,124 INFO L276 IsEmpty]: Start isEmpty. Operand 21844 states and 79583 transitions. [2019-12-28 05:30:47,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-28 05:30:47,135 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:30:47,135 INFO L411 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] [2019-12-28 05:30:47,136 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:30:47,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:30:47,136 INFO L82 PathProgramCache]: Analyzing trace with hash -565208698, now seen corresponding path program 1 times [2019-12-28 05:30:47,136 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:30:47,137 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748728690] [2019-12-28 05:30:47,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:30:47,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:30:47,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 05:30:47,207 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748728690] [2019-12-28 05:30:47,207 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:30:47,207 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 05:30:47,207 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1976214841] [2019-12-28 05:30:47,207 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:30:47,219 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:30:47,258 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 148 states and 223 transitions. [2019-12-28 05:30:47,258 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:30:47,279 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 05:30:47,281 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 05:30:47,281 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:30:47,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 05:30:47,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-28 05:30:47,282 INFO L87 Difference]: Start difference. First operand 21844 states and 79583 transitions. Second operand 5 states. [2019-12-28 05:30:47,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:30:47,599 INFO L93 Difference]: Finished difference Result 25690 states and 92959 transitions. [2019-12-28 05:30:47,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 05:30:47,599 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-12-28 05:30:47,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:30:47,670 INFO L225 Difference]: With dead ends: 25690 [2019-12-28 05:30:47,670 INFO L226 Difference]: Without dead ends: 25690 [2019-12-28 05:30:47,671 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-28 05:30:47,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25690 states. [2019-12-28 05:30:48,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25690 to 23602. [2019-12-28 05:30:48,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23602 states. [2019-12-28 05:30:50,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23602 states to 23602 states and 85585 transitions. [2019-12-28 05:30:50,319 INFO L78 Accepts]: Start accepts. Automaton has 23602 states and 85585 transitions. Word has length 71 [2019-12-28 05:30:50,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:30:50,320 INFO L462 AbstractCegarLoop]: Abstraction has 23602 states and 85585 transitions. [2019-12-28 05:30:50,320 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 05:30:50,320 INFO L276 IsEmpty]: Start isEmpty. Operand 23602 states and 85585 transitions. [2019-12-28 05:30:50,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-28 05:30:50,333 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:30:50,333 INFO L411 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] [2019-12-28 05:30:50,333 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:30:50,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:30:50,333 INFO L82 PathProgramCache]: Analyzing trace with hash 1177601637, now seen corresponding path program 1 times [2019-12-28 05:30:50,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:30:50,334 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862538541] [2019-12-28 05:30:50,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:30:50,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:30:50,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 05:30:50,400 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862538541] [2019-12-28 05:30:50,400 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:30:50,400 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 05:30:50,401 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1263105214] [2019-12-28 05:30:50,401 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:30:50,413 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:30:50,452 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 148 states and 223 transitions. [2019-12-28 05:30:50,453 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:30:50,474 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 05:30:50,474 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 05:30:50,474 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:30:50,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 05:30:50,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-28 05:30:50,475 INFO L87 Difference]: Start difference. First operand 23602 states and 85585 transitions. Second operand 7 states. [2019-12-28 05:30:50,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:30:50,952 INFO L93 Difference]: Finished difference Result 30238 states and 108458 transitions. [2019-12-28 05:30:50,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-28 05:30:50,953 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 71 [2019-12-28 05:30:50,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:30:51,008 INFO L225 Difference]: With dead ends: 30238 [2019-12-28 05:30:51,008 INFO L226 Difference]: Without dead ends: 30058 [2019-12-28 05:30:51,009 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-12-28 05:30:51,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30058 states. [2019-12-28 05:30:51,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30058 to 26280. [2019-12-28 05:30:51,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26280 states. [2019-12-28 05:30:51,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26280 states to 26280 states and 94905 transitions. [2019-12-28 05:30:51,479 INFO L78 Accepts]: Start accepts. Automaton has 26280 states and 94905 transitions. Word has length 71 [2019-12-28 05:30:51,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:30:51,480 INFO L462 AbstractCegarLoop]: Abstraction has 26280 states and 94905 transitions. [2019-12-28 05:30:51,480 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 05:30:51,480 INFO L276 IsEmpty]: Start isEmpty. Operand 26280 states and 94905 transitions. [2019-12-28 05:30:51,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-28 05:30:51,500 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:30:51,500 INFO L411 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] [2019-12-28 05:30:51,500 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:30:51,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:30:51,501 INFO L82 PathProgramCache]: Analyzing trace with hash 1482467152, now seen corresponding path program 1 times [2019-12-28 05:30:51,501 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:30:51,501 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647564543] [2019-12-28 05:30:51,502 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:30:51,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:30:51,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 05:30:51,580 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647564543] [2019-12-28 05:30:51,581 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:30:51,581 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 05:30:51,581 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [816677065] [2019-12-28 05:30:51,581 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:30:51,614 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:30:51,650 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 96 states and 105 transitions. [2019-12-28 05:30:51,650 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:30:51,650 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 05:30:51,651 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 05:30:51,651 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:30:51,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 05:30:51,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 05:30:51,652 INFO L87 Difference]: Start difference. First operand 26280 states and 94905 transitions. Second operand 4 states. [2019-12-28 05:30:52,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:30:52,008 INFO L93 Difference]: Finished difference Result 34914 states and 124766 transitions. [2019-12-28 05:30:52,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-28 05:30:52,008 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-12-28 05:30:52,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:30:52,074 INFO L225 Difference]: With dead ends: 34914 [2019-12-28 05:30:52,074 INFO L226 Difference]: Without dead ends: 34914 [2019-12-28 05:30:52,075 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 05:30:52,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34914 states. [2019-12-28 05:30:52,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34914 to 29733. [2019-12-28 05:30:52,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29733 states. [2019-12-28 05:30:52,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29733 states to 29733 states and 106658 transitions. [2019-12-28 05:30:52,858 INFO L78 Accepts]: Start accepts. Automaton has 29733 states and 106658 transitions. Word has length 75 [2019-12-28 05:30:52,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:30:52,858 INFO L462 AbstractCegarLoop]: Abstraction has 29733 states and 106658 transitions. [2019-12-28 05:30:52,858 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 05:30:52,858 INFO L276 IsEmpty]: Start isEmpty. Operand 29733 states and 106658 transitions. [2019-12-28 05:30:52,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-28 05:30:52,882 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:30:52,882 INFO L411 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] [2019-12-28 05:30:52,882 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:30:52,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:30:52,883 INFO L82 PathProgramCache]: Analyzing trace with hash -1567735663, now seen corresponding path program 1 times [2019-12-28 05:30:52,883 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:30:52,884 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136069240] [2019-12-28 05:30:52,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:30:52,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:30:52,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 05:30:52,997 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136069240] [2019-12-28 05:30:52,998 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:30:52,998 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 05:30:52,998 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1054344517] [2019-12-28 05:30:52,998 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:30:53,011 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:30:53,036 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 96 states and 105 transitions. [2019-12-28 05:30:53,036 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:30:53,038 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-28 05:30:53,038 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 05:30:53,038 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:30:53,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 05:30:53,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-28 05:30:53,039 INFO L87 Difference]: Start difference. First operand 29733 states and 106658 transitions. Second operand 6 states. [2019-12-28 05:30:53,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:30:53,763 INFO L93 Difference]: Finished difference Result 34478 states and 121687 transitions. [2019-12-28 05:30:53,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 05:30:53,763 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 75 [2019-12-28 05:30:53,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:30:53,833 INFO L225 Difference]: With dead ends: 34478 [2019-12-28 05:30:53,833 INFO L226 Difference]: Without dead ends: 34478 [2019-12-28 05:30:53,833 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-28 05:30:53,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34478 states. [2019-12-28 05:30:54,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34478 to 33413. [2019-12-28 05:30:54,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33413 states. [2019-12-28 05:30:54,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33413 states to 33413 states and 118236 transitions. [2019-12-28 05:30:54,756 INFO L78 Accepts]: Start accepts. Automaton has 33413 states and 118236 transitions. Word has length 75 [2019-12-28 05:30:54,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:30:54,756 INFO L462 AbstractCegarLoop]: Abstraction has 33413 states and 118236 transitions. [2019-12-28 05:30:54,756 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 05:30:54,756 INFO L276 IsEmpty]: Start isEmpty. Operand 33413 states and 118236 transitions. [2019-12-28 05:30:54,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-28 05:30:54,780 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:30:54,781 INFO L411 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] [2019-12-28 05:30:54,781 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:30:54,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:30:54,781 INFO L82 PathProgramCache]: Analyzing trace with hash 650022290, now seen corresponding path program 1 times [2019-12-28 05:30:54,782 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:30:54,782 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206117864] [2019-12-28 05:30:54,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:30:54,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:30:54,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 05:30:54,892 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206117864] [2019-12-28 05:30:54,892 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:30:54,892 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 05:30:54,893 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [9004017] [2019-12-28 05:30:54,893 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:30:54,907 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:30:54,925 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 96 states and 105 transitions. [2019-12-28 05:30:54,925 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:30:54,925 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 05:30:54,925 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 05:30:54,926 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:30:54,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 05:30:54,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-28 05:30:54,926 INFO L87 Difference]: Start difference. First operand 33413 states and 118236 transitions. Second operand 6 states. [2019-12-28 05:30:55,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:30:55,416 INFO L93 Difference]: Finished difference Result 39881 states and 137564 transitions. [2019-12-28 05:30:55,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-28 05:30:55,417 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 75 [2019-12-28 05:30:55,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:30:55,485 INFO L225 Difference]: With dead ends: 39881 [2019-12-28 05:30:55,486 INFO L226 Difference]: Without dead ends: 39881 [2019-12-28 05:30:55,486 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-12-28 05:30:55,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39881 states. [2019-12-28 05:30:55,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39881 to 34241. [2019-12-28 05:30:55,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34241 states. [2019-12-28 05:30:56,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34241 states to 34241 states and 119102 transitions. [2019-12-28 05:30:56,044 INFO L78 Accepts]: Start accepts. Automaton has 34241 states and 119102 transitions. Word has length 75 [2019-12-28 05:30:56,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:30:56,045 INFO L462 AbstractCegarLoop]: Abstraction has 34241 states and 119102 transitions. [2019-12-28 05:30:56,045 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 05:30:56,045 INFO L276 IsEmpty]: Start isEmpty. Operand 34241 states and 119102 transitions. [2019-12-28 05:30:56,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-28 05:30:56,070 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:30:56,071 INFO L411 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] [2019-12-28 05:30:56,071 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:30:56,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:30:56,071 INFO L82 PathProgramCache]: Analyzing trace with hash 861373203, now seen corresponding path program 1 times [2019-12-28 05:30:56,072 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:30:56,072 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890862364] [2019-12-28 05:30:56,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:30:56,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:30:56,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 05:30:56,129 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890862364] [2019-12-28 05:30:56,131 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:30:56,131 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 05:30:56,131 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1591138530] [2019-12-28 05:30:56,131 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:30:56,318 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:30:56,340 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 96 states and 105 transitions. [2019-12-28 05:30:56,341 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:30:56,342 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-28 05:30:56,342 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 05:30:56,342 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:30:56,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 05:30:56,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 05:30:56,343 INFO L87 Difference]: Start difference. First operand 34241 states and 119102 transitions. Second operand 5 states. [2019-12-28 05:30:56,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:30:56,741 INFO L93 Difference]: Finished difference Result 41646 states and 144386 transitions. [2019-12-28 05:30:56,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-28 05:30:56,741 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2019-12-28 05:30:56,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:30:56,815 INFO L225 Difference]: With dead ends: 41646 [2019-12-28 05:30:56,815 INFO L226 Difference]: Without dead ends: 41646 [2019-12-28 05:30:56,815 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-28 05:30:56,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41646 states. [2019-12-28 05:30:57,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41646 to 36963. [2019-12-28 05:30:57,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36963 states. [2019-12-28 05:30:57,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36963 states to 36963 states and 127705 transitions. [2019-12-28 05:30:57,400 INFO L78 Accepts]: Start accepts. Automaton has 36963 states and 127705 transitions. Word has length 75 [2019-12-28 05:30:57,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:30:57,400 INFO L462 AbstractCegarLoop]: Abstraction has 36963 states and 127705 transitions. [2019-12-28 05:30:57,400 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 05:30:57,400 INFO L276 IsEmpty]: Start isEmpty. Operand 36963 states and 127705 transitions. [2019-12-28 05:30:57,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-28 05:30:57,426 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:30:57,426 INFO L411 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] [2019-12-28 05:30:57,426 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:30:57,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:30:57,427 INFO L82 PathProgramCache]: Analyzing trace with hash 350839026, now seen corresponding path program 1 times [2019-12-28 05:30:57,427 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:30:57,427 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103134582] [2019-12-28 05:30:57,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:30:57,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:30:57,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 05:30:57,527 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103134582] [2019-12-28 05:30:57,527 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:30:57,527 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 05:30:57,527 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [595345531] [2019-12-28 05:30:57,527 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:30:57,540 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:30:57,565 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 96 states and 105 transitions. [2019-12-28 05:30:57,565 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:30:57,566 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 05:30:57,566 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 05:30:57,566 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:30:57,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 05:30:57,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-28 05:30:57,567 INFO L87 Difference]: Start difference. First operand 36963 states and 127705 transitions. Second operand 6 states. [2019-12-28 05:30:57,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:30:57,853 INFO L93 Difference]: Finished difference Result 38259 states and 129280 transitions. [2019-12-28 05:30:57,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 05:30:57,854 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 75 [2019-12-28 05:30:57,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:30:58,177 INFO L225 Difference]: With dead ends: 38259 [2019-12-28 05:30:58,177 INFO L226 Difference]: Without dead ends: 38259 [2019-12-28 05:30:58,177 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-28 05:30:58,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38259 states. [2019-12-28 05:30:58,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38259 to 32163. [2019-12-28 05:30:58,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32163 states. [2019-12-28 05:30:58,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32163 states to 32163 states and 109074 transitions. [2019-12-28 05:30:58,663 INFO L78 Accepts]: Start accepts. Automaton has 32163 states and 109074 transitions. Word has length 75 [2019-12-28 05:30:58,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:30:58,663 INFO L462 AbstractCegarLoop]: Abstraction has 32163 states and 109074 transitions. [2019-12-28 05:30:58,663 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 05:30:58,663 INFO L276 IsEmpty]: Start isEmpty. Operand 32163 states and 109074 transitions. [2019-12-28 05:30:58,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-28 05:30:58,684 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:30:58,684 INFO L411 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] [2019-12-28 05:30:58,684 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:30:58,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:30:58,685 INFO L82 PathProgramCache]: Analyzing trace with hash -558608652, now seen corresponding path program 1 times [2019-12-28 05:30:58,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:30:58,685 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409094863] [2019-12-28 05:30:58,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:30:58,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:30:58,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 05:30:58,773 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409094863] [2019-12-28 05:30:58,773 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:30:58,773 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 05:30:58,773 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1197482796] [2019-12-28 05:30:58,773 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:30:58,785 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:30:58,808 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 96 states and 105 transitions. [2019-12-28 05:30:58,809 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:30:58,826 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-28 05:30:58,827 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 05:30:58,827 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:30:58,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 05:30:58,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-28 05:30:58,827 INFO L87 Difference]: Start difference. First operand 32163 states and 109074 transitions. Second operand 7 states. [2019-12-28 05:30:58,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:30:58,975 INFO L93 Difference]: Finished difference Result 13182 states and 40467 transitions. [2019-12-28 05:30:58,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-28 05:30:58,976 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 75 [2019-12-28 05:30:58,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:30:59,001 INFO L225 Difference]: With dead ends: 13182 [2019-12-28 05:30:59,002 INFO L226 Difference]: Without dead ends: 11579 [2019-12-28 05:30:59,002 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-12-28 05:30:59,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11579 states. [2019-12-28 05:30:59,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11579 to 10863. [2019-12-28 05:30:59,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10863 states. [2019-12-28 05:30:59,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10863 states to 10863 states and 33106 transitions. [2019-12-28 05:30:59,201 INFO L78 Accepts]: Start accepts. Automaton has 10863 states and 33106 transitions. Word has length 75 [2019-12-28 05:30:59,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:30:59,201 INFO L462 AbstractCegarLoop]: Abstraction has 10863 states and 33106 transitions. [2019-12-28 05:30:59,201 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 05:30:59,202 INFO L276 IsEmpty]: Start isEmpty. Operand 10863 states and 33106 transitions. [2019-12-28 05:30:59,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-28 05:30:59,218 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:30:59,218 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 05:30:59,219 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:30:59,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:30:59,219 INFO L82 PathProgramCache]: Analyzing trace with hash -11366195, now seen corresponding path program 1 times [2019-12-28 05:30:59,221 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:30:59,221 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273482600] [2019-12-28 05:30:59,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:30:59,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:30:59,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 05:30:59,333 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273482600] [2019-12-28 05:30:59,333 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:30:59,333 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 05:30:59,333 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1630959382] [2019-12-28 05:30:59,333 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:30:59,354 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:30:59,427 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 154 states and 209 transitions. [2019-12-28 05:30:59,427 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:30:59,496 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 13 times. [2019-12-28 05:30:59,497 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-28 05:30:59,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:30:59,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-28 05:30:59,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-12-28 05:30:59,498 INFO L87 Difference]: Start difference. First operand 10863 states and 33106 transitions. Second operand 11 states. [2019-12-28 05:31:01,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:31:01,074 INFO L93 Difference]: Finished difference Result 16541 states and 49584 transitions. [2019-12-28 05:31:01,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-28 05:31:01,074 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 92 [2019-12-28 05:31:01,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:31:01,097 INFO L225 Difference]: With dead ends: 16541 [2019-12-28 05:31:01,097 INFO L226 Difference]: Without dead ends: 16421 [2019-12-28 05:31:01,098 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=221, Invalid=709, Unknown=0, NotChecked=0, Total=930 [2019-12-28 05:31:01,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16421 states. [2019-12-28 05:31:01,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16421 to 13503. [2019-12-28 05:31:01,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13503 states. [2019-12-28 05:31:01,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13503 states to 13503 states and 40722 transitions. [2019-12-28 05:31:01,288 INFO L78 Accepts]: Start accepts. Automaton has 13503 states and 40722 transitions. Word has length 92 [2019-12-28 05:31:01,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:31:01,289 INFO L462 AbstractCegarLoop]: Abstraction has 13503 states and 40722 transitions. [2019-12-28 05:31:01,289 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-28 05:31:01,289 INFO L276 IsEmpty]: Start isEmpty. Operand 13503 states and 40722 transitions. [2019-12-28 05:31:01,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-28 05:31:01,304 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:31:01,304 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 05:31:01,304 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:31:01,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:31:01,304 INFO L82 PathProgramCache]: Analyzing trace with hash -2088575538, now seen corresponding path program 1 times [2019-12-28 05:31:01,305 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:31:01,305 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915826328] [2019-12-28 05:31:01,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:31:01,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:31:01,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 05:31:01,421 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915826328] [2019-12-28 05:31:01,421 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:31:01,421 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 05:31:01,421 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1359136892] [2019-12-28 05:31:01,421 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:31:01,442 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:31:01,526 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 154 states and 209 transitions. [2019-12-28 05:31:01,526 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:31:01,527 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 05:31:01,527 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 05:31:01,527 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:31:01,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 05:31:01,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-28 05:31:01,528 INFO L87 Difference]: Start difference. First operand 13503 states and 40722 transitions. Second operand 7 states. [2019-12-28 05:31:01,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:31:01,771 INFO L93 Difference]: Finished difference Result 22233 states and 66561 transitions. [2019-12-28 05:31:01,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-28 05:31:01,772 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2019-12-28 05:31:01,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:31:01,804 INFO L225 Difference]: With dead ends: 22233 [2019-12-28 05:31:01,804 INFO L226 Difference]: Without dead ends: 12057 [2019-12-28 05:31:01,804 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-12-28 05:31:01,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12057 states. [2019-12-28 05:31:02,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12057 to 12057. [2019-12-28 05:31:02,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12057 states. [2019-12-28 05:31:02,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12057 states to 12057 states and 36150 transitions. [2019-12-28 05:31:02,116 INFO L78 Accepts]: Start accepts. Automaton has 12057 states and 36150 transitions. Word has length 92 [2019-12-28 05:31:02,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:31:02,116 INFO L462 AbstractCegarLoop]: Abstraction has 12057 states and 36150 transitions. [2019-12-28 05:31:02,117 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 05:31:02,117 INFO L276 IsEmpty]: Start isEmpty. Operand 12057 states and 36150 transitions. [2019-12-28 05:31:02,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-28 05:31:02,144 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:31:02,144 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 05:31:02,145 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:31:02,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:31:02,145 INFO L82 PathProgramCache]: Analyzing trace with hash 1620378800, now seen corresponding path program 2 times [2019-12-28 05:31:02,146 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:31:02,147 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220564759] [2019-12-28 05:31:02,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:31:02,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:31:02,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 05:31:02,318 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220564759] [2019-12-28 05:31:02,318 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:31:02,318 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-28 05:31:02,318 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1505814002] [2019-12-28 05:31:02,319 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:31:02,340 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:31:02,423 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 154 states and 212 transitions. [2019-12-28 05:31:02,424 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:31:02,446 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-28 05:31:02,446 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-28 05:31:02,446 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:31:02,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-28 05:31:02,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-12-28 05:31:02,447 INFO L87 Difference]: Start difference. First operand 12057 states and 36150 transitions. Second operand 11 states. [2019-12-28 05:31:04,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:31:04,896 INFO L93 Difference]: Finished difference Result 44672 states and 133556 transitions. [2019-12-28 05:31:04,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-28 05:31:04,896 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 92 [2019-12-28 05:31:04,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:31:04,956 INFO L225 Difference]: With dead ends: 44672 [2019-12-28 05:31:04,957 INFO L226 Difference]: Without dead ends: 28300 [2019-12-28 05:31:04,957 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=154, Invalid=716, Unknown=0, NotChecked=0, Total=870 [2019-12-28 05:31:05,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28300 states. [2019-12-28 05:31:05,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28300 to 13497. [2019-12-28 05:31:05,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13497 states. [2019-12-28 05:31:05,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13497 states to 13497 states and 39992 transitions. [2019-12-28 05:31:05,470 INFO L78 Accepts]: Start accepts. Automaton has 13497 states and 39992 transitions. Word has length 92 [2019-12-28 05:31:05,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:31:05,471 INFO L462 AbstractCegarLoop]: Abstraction has 13497 states and 39992 transitions. [2019-12-28 05:31:05,471 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-28 05:31:05,471 INFO L276 IsEmpty]: Start isEmpty. Operand 13497 states and 39992 transitions. [2019-12-28 05:31:05,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-28 05:31:05,502 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:31:05,502 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 05:31:05,502 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:31:05,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:31:05,503 INFO L82 PathProgramCache]: Analyzing trace with hash -1218439478, now seen corresponding path program 3 times [2019-12-28 05:31:05,504 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:31:05,504 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776633616] [2019-12-28 05:31:05,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:31:05,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-28 05:31:05,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-28 05:31:05,612 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-28 05:31:05,613 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-28 05:31:05,933 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.12 05:31:05 BasicIcfg [2019-12-28 05:31:05,933 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-28 05:31:05,944 INFO L168 Benchmark]: Toolchain (without parser) took 166635.83 ms. Allocated memory was 138.4 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 100.1 MB in the beginning and 2.5 GB in the end (delta: -2.4 GB). Peak memory consumption was 924.5 MB. Max. memory is 7.1 GB. [2019-12-28 05:31:05,945 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 138.4 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-28 05:31:05,946 INFO L168 Benchmark]: CACSL2BoogieTranslator took 813.07 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 99.7 MB in the beginning and 156.9 MB in the end (delta: -57.2 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. [2019-12-28 05:31:05,947 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.80 ms. Allocated memory is still 202.9 MB. Free memory was 156.9 MB in the beginning and 154.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-28 05:31:05,947 INFO L168 Benchmark]: Boogie Preprocessor took 40.32 ms. Allocated memory is still 202.9 MB. Free memory was 154.2 MB in the beginning and 152.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-28 05:31:05,948 INFO L168 Benchmark]: RCFGBuilder took 823.54 ms. Allocated memory is still 202.9 MB. Free memory was 152.2 MB in the beginning and 109.1 MB in the end (delta: 43.2 MB). Peak memory consumption was 43.2 MB. Max. memory is 7.1 GB. [2019-12-28 05:31:05,951 INFO L168 Benchmark]: TraceAbstraction took 164884.98 ms. Allocated memory was 202.9 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 108.4 MB in the beginning and 2.5 GB in the end (delta: -2.4 GB). Peak memory consumption was 868.3 MB. Max. memory is 7.1 GB. [2019-12-28 05:31:05,960 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 138.4 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 813.07 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 99.7 MB in the beginning and 156.9 MB in the end (delta: -57.2 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 67.80 ms. Allocated memory is still 202.9 MB. Free memory was 156.9 MB in the beginning and 154.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.32 ms. Allocated memory is still 202.9 MB. Free memory was 154.2 MB in the beginning and 152.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 823.54 ms. Allocated memory is still 202.9 MB. Free memory was 152.2 MB in the beginning and 109.1 MB in the end (delta: 43.2 MB). Peak memory consumption was 43.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 164884.98 ms. Allocated memory was 202.9 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 108.4 MB in the beginning and 2.5 GB in the end (delta: -2.4 GB). Peak memory consumption was 868.3 MB. Max. memory is 7.1 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: [L695] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L697] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L699] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L700] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0] [L701] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L703] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L705] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L706] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L707] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L708] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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] [L709] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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] [L710] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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] [L711] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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] [L712] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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] [L713] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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] [L714] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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] [L715] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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] [L716] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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] [L717] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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}] [L718] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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] [L719] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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] [L720] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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] [L721] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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] [L723] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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] [L724] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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] [L725] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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] [L813] 0 pthread_t t2583; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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] [L814] FCALL, FORK 0 pthread_create(&t2583, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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] [L815] 0 pthread_t t2584; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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] [L816] FCALL, FORK 0 pthread_create(&t2584, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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] [L817] 0 pthread_t t2585; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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] [L818] FCALL, FORK 0 pthread_create(&t2585, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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] [L776] 3 y$w_buff1 = y$w_buff0 [L777] 3 y$w_buff0 = 1 [L778] 3 y$w_buff1_used = y$w_buff0_used [L779] 3 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 3 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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] [L781] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L782] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L783] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L784] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L785] 3 y$r_buff0_thd3 = (_Bool)1 [L788] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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=1] [L791] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L729] 1 z = 2 [L734] 1 __unbuffered_p0_EAX = x [L739] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_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=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=2] [L746] 2 x = 1 [L751] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L752] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L753] 2 y$flush_delayed = weak$$choice2 [L754] 2 y$mem_tmp = y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L755] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L755] 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) [L756] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L756] 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)) [L757] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L757] 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)) [L758] 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_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, 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=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L758] 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)) [L759] 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_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L759] 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)) [L760] 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_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L760] 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)) [L761] 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_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L761] 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)) [L762] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L763] EXPR 2 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L791] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L792] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, 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=2] [L763] 2 y = y$flush_delayed ? y$mem_tmp : y [L764] 2 y$flush_delayed = (_Bool)0 [L769] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L792] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L793] EXPR 3 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_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L793] 3 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 [L794] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L794] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L795] EXPR 3 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_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L795] 3 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 [L798] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L820] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L824] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L824] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L824] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L824] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L825] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L825] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L826] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L826] 0 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 [L827] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L827] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L828] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L828] 0 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 [L831] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L4] COND TRUE 0 !expression VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L4] 0 __VERIFIER_error() VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 142 locations, 2 error locations. Result: UNSAFE, OverallTime: 164.3s, OverallIterations: 22, TraceHistogramMax: 1, AutomataDifference: 74.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5996 SDtfs, 8550 SDslu, 16746 SDs, 0 SdLazy, 5842 SolverSat, 397 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 264 GetRequests, 89 SyntacticMatches, 6 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=228422occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 65.2s AutomataMinimizationTime, 21 MinimizatonAttempts, 204089 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 1531 NumberOfCodeBlocks, 1531 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1418 ConstructedInterpolants, 0 QuantifiedInterpolants, 275439 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...