/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix020_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 12:44:42,945 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 12:44:42,947 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 12:44:42,965 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 12:44:42,966 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 12:44:42,968 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 12:44:42,970 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 12:44:42,979 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 12:44:42,983 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 12:44:42,986 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 12:44:42,988 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 12:44:42,990 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 12:44:42,990 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 12:44:42,992 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 12:44:42,994 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 12:44:42,997 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 12:44:42,999 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 12:44:42,999 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 12:44:43,001 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 12:44:43,006 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 12:44:43,010 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 12:44:43,014 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 12:44:43,016 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 12:44:43,016 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 12:44:43,018 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 12:44:43,019 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 12:44:43,019 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 12:44:43,021 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 12:44:43,022 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 12:44:43,023 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 12:44:43,023 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 12:44:43,024 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 12:44:43,025 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 12:44:43,026 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 12:44:43,027 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 12:44:43,027 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 12:44:43,028 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 12:44:43,028 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 12:44:43,028 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 12:44:43,029 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 12:44:43,030 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 12:44:43,031 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 12:44:43,060 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 12:44:43,060 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 12:44:43,061 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 12:44:43,061 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 12:44:43,062 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 12:44:43,064 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 12:44:43,064 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 12:44:43,064 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 12:44:43,064 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 12:44:43,064 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 12:44:43,067 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 12:44:43,067 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 12:44:43,067 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 12:44:43,067 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 12:44:43,068 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 12:44:43,068 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 12:44:43,068 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 12:44:43,068 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 12:44:43,069 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 12:44:43,069 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 12:44:43,069 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 12:44:43,069 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 12:44:43,069 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 12:44:43,070 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 12:44:43,070 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 12:44:43,070 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 12:44:43,070 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 12:44:43,070 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 12:44:43,070 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 12:44:43,074 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 12:44:43,338 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 12:44:43,359 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 12:44:43,363 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 12:44:43,364 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 12:44:43,365 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 12:44:43,366 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix020_rmo.opt.i [2019-12-18 12:44:43,440 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18060124f/d6cef283b99841d2a98554b1652e176a/FLAGf1d5a5cf3 [2019-12-18 12:44:44,043 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 12:44:44,044 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix020_rmo.opt.i [2019-12-18 12:44:44,061 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18060124f/d6cef283b99841d2a98554b1652e176a/FLAGf1d5a5cf3 [2019-12-18 12:44:44,289 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18060124f/d6cef283b99841d2a98554b1652e176a [2019-12-18 12:44:44,298 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 12:44:44,300 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 12:44:44,301 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 12:44:44,301 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 12:44:44,304 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 12:44:44,305 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 12:44:44" (1/1) ... [2019-12-18 12:44:44,308 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56d76d18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:44:44, skipping insertion in model container [2019-12-18 12:44:44,309 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 12:44:44" (1/1) ... [2019-12-18 12:44:44,314 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 12:44:44,367 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 12:44:44,873 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 12:44:44,894 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 12:44:44,969 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 12:44:45,069 INFO L208 MainTranslator]: Completed translation [2019-12-18 12:44:45,070 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:44:45 WrapperNode [2019-12-18 12:44:45,070 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 12:44:45,071 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 12:44:45,071 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 12:44:45,071 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 12:44:45,080 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:44:45" (1/1) ... [2019-12-18 12:44:45,107 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:44:45" (1/1) ... [2019-12-18 12:44:45,152 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 12:44:45,155 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 12:44:45,155 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 12:44:45,155 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 12:44:45,164 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:44:45" (1/1) ... [2019-12-18 12:44:45,164 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:44:45" (1/1) ... [2019-12-18 12:44:45,170 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:44:45" (1/1) ... [2019-12-18 12:44:45,170 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:44:45" (1/1) ... [2019-12-18 12:44:45,182 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:44:45" (1/1) ... [2019-12-18 12:44:45,187 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:44:45" (1/1) ... [2019-12-18 12:44:45,192 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:44:45" (1/1) ... [2019-12-18 12:44:45,198 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 12:44:45,199 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 12:44:45,199 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 12:44:45,199 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 12:44:45,200 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:44:45" (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-18 12:44:45,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 12:44:45,274 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 12:44:45,274 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 12:44:45,274 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 12:44:45,274 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 12:44:45,275 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 12:44:45,275 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 12:44:45,275 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 12:44:45,275 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 12:44:45,276 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 12:44:45,276 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-18 12:44:45,276 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-18 12:44:45,276 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 12:44:45,276 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 12:44:45,277 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 12:44:45,279 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 12:44:46,153 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 12:44:46,154 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 12:44:46,155 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 12:44:46 BoogieIcfgContainer [2019-12-18 12:44:46,156 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 12:44:46,157 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 12:44:46,157 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 12:44:46,161 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 12:44:46,161 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 12:44:44" (1/3) ... [2019-12-18 12:44:46,162 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d311fca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 12:44:46, skipping insertion in model container [2019-12-18 12:44:46,162 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:44:45" (2/3) ... [2019-12-18 12:44:46,163 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d311fca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 12:44:46, skipping insertion in model container [2019-12-18 12:44:46,163 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 12:44:46" (3/3) ... [2019-12-18 12:44:46,165 INFO L109 eAbstractionObserver]: Analyzing ICFG mix020_rmo.opt.i [2019-12-18 12:44:46,176 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 12:44:46,176 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 12:44:46,184 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 12:44:46,185 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 12:44:46,265 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,265 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,266 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,266 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,266 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,266 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,267 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,267 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,269 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,269 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,269 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,269 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,270 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,270 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,270 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,270 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,270 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,271 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,271 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,271 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,271 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,271 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,272 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,272 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,272 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,272 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,272 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,273 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,273 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,273 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,273 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,274 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,274 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,274 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,274 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,275 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,275 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,275 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,275 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,275 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,276 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,276 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,276 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,276 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,276 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,277 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,277 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,277 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,277 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,277 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,278 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,278 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,278 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,278 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,279 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,279 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,279 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,279 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,280 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,280 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,280 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,280 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,280 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,280 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,281 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,281 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,281 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,281 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,282 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,282 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,282 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,282 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,282 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,283 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,283 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,283 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,283 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,283 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,284 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,284 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,284 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,285 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,285 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,285 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,285 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,285 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,286 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,286 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,286 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,286 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,287 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,287 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,287 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,287 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,287 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,288 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,288 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,288 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,288 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,288 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,289 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,289 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,290 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,291 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,291 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,291 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,291 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,291 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,292 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,292 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,292 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,292 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,292 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,293 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,293 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,293 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,293 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,293 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,294 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,294 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,294 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,294 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,294 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,295 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,295 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,295 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,295 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,295 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,296 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,296 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,296 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,296 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,297 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,297 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,297 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,297 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,297 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,297 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,298 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,298 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,298 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,298 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,298 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,299 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,299 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,299 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,299 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,299 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,300 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,300 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,300 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,300 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,300 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,301 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,301 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,301 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,301 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,301 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,302 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,302 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,302 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,302 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,302 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,303 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,303 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,303 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,303 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,303 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,304 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,304 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,304 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,304 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,304 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,304 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,305 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,305 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,305 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,305 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,305 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,306 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,306 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,306 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,306 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,307 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,307 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,307 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,307 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,307 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,308 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,308 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,308 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,308 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,308 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,309 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,309 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,309 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,309 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,309 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,309 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,310 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,310 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,310 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,310 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,310 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,311 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,311 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,311 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,311 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,311 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,312 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,312 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,312 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,312 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,312 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,313 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,313 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,313 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,313 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,313 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,314 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,314 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,314 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,314 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,315 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,318 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,318 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,318 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,319 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,329 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,329 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,329 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,329 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,330 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,331 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,331 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,331 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,331 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,331 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,332 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,332 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,332 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,332 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,332 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,333 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,333 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,333 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,333 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,333 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,333 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,334 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,334 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,334 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,335 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,335 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,335 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,348 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,349 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,349 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,349 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,349 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,349 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,350 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,350 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,350 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,350 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,350 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,350 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,351 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,351 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,351 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,351 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,351 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,352 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,352 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,352 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,352 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,352 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,352 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,353 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,353 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,353 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,353 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,353 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,354 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,354 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,354 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,354 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,354 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,354 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,355 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,357 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,357 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,357 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,357 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:44:46,371 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-18 12:44:46,392 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 12:44:46,392 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 12:44:46,393 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 12:44:46,393 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 12:44:46,393 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 12:44:46,393 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 12:44:46,393 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 12:44:46,393 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 12:44:46,420 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 211 places, 254 transitions [2019-12-18 12:44:46,422 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 211 places, 254 transitions [2019-12-18 12:44:46,550 INFO L126 PetriNetUnfolder]: 56/250 cut-off events. [2019-12-18 12:44:46,550 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 12:44:46,579 INFO L76 FinitePrefix]: Finished finitePrefix Result has 263 conditions, 250 events. 56/250 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 574 event pairs. 12/204 useless extension candidates. Maximal degree in co-relation 217. Up to 2 conditions per place. [2019-12-18 12:44:46,612 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 211 places, 254 transitions [2019-12-18 12:44:46,680 INFO L126 PetriNetUnfolder]: 56/250 cut-off events. [2019-12-18 12:44:46,680 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 12:44:46,690 INFO L76 FinitePrefix]: Finished finitePrefix Result has 263 conditions, 250 events. 56/250 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 574 event pairs. 12/204 useless extension candidates. Maximal degree in co-relation 217. Up to 2 conditions per place. [2019-12-18 12:44:46,724 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 26510 [2019-12-18 12:44:46,725 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 12:44:53,674 WARN L192 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-12-18 12:44:53,817 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-12-18 12:44:53,849 INFO L206 etLargeBlockEncoding]: Checked pairs total: 142340 [2019-12-18 12:44:53,849 INFO L214 etLargeBlockEncoding]: Total number of compositions: 134 [2019-12-18 12:44:53,852 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 112 places, 131 transitions [2019-12-18 12:45:03,936 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 90046 states. [2019-12-18 12:45:03,938 INFO L276 IsEmpty]: Start isEmpty. Operand 90046 states. [2019-12-18 12:45:03,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-18 12:45:03,945 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:45:03,946 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:45:03,946 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:45:03,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:45:03,951 INFO L82 PathProgramCache]: Analyzing trace with hash 259811849, now seen corresponding path program 1 times [2019-12-18 12:45:03,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:45:03,960 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897248876] [2019-12-18 12:45:03,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:45:04,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:45:04,244 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-18 12:45:04,245 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897248876] [2019-12-18 12:45:04,246 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:45:04,246 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 12:45:04,247 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557724143] [2019-12-18 12:45:04,252 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:45:04,252 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:45:04,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:45:04,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:45:04,276 INFO L87 Difference]: Start difference. First operand 90046 states. Second operand 3 states. [2019-12-18 12:45:07,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:45:07,101 INFO L93 Difference]: Finished difference Result 89182 states and 411616 transitions. [2019-12-18 12:45:07,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:45:07,103 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-18 12:45:07,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:45:07,719 INFO L225 Difference]: With dead ends: 89182 [2019-12-18 12:45:07,719 INFO L226 Difference]: Without dead ends: 83470 [2019-12-18 12:45:07,721 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:45:11,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83470 states. [2019-12-18 12:45:13,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83470 to 83470. [2019-12-18 12:45:13,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83470 states. [2019-12-18 12:45:14,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83470 states to 83470 states and 385016 transitions. [2019-12-18 12:45:14,137 INFO L78 Accepts]: Start accepts. Automaton has 83470 states and 385016 transitions. Word has length 9 [2019-12-18 12:45:14,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:45:14,138 INFO L462 AbstractCegarLoop]: Abstraction has 83470 states and 385016 transitions. [2019-12-18 12:45:14,138 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:45:14,138 INFO L276 IsEmpty]: Start isEmpty. Operand 83470 states and 385016 transitions. [2019-12-18 12:45:14,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 12:45:14,152 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:45:14,152 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:45:14,152 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:45:14,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:45:14,153 INFO L82 PathProgramCache]: Analyzing trace with hash 1558204525, now seen corresponding path program 1 times [2019-12-18 12:45:14,153 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:45:14,153 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702912861] [2019-12-18 12:45:14,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:45:14,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:45:14,277 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-18 12:45:14,277 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702912861] [2019-12-18 12:45:14,278 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:45:14,278 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:45:14,278 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693482198] [2019-12-18 12:45:14,279 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:45:14,280 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:45:14,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:45:14,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:45:14,280 INFO L87 Difference]: Start difference. First operand 83470 states and 385016 transitions. Second operand 4 states. [2019-12-18 12:45:18,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:45:18,413 INFO L93 Difference]: Finished difference Result 129310 states and 576248 transitions. [2019-12-18 12:45:18,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:45:18,414 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-18 12:45:18,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:45:19,609 INFO L225 Difference]: With dead ends: 129310 [2019-12-18 12:45:19,610 INFO L226 Difference]: Without dead ends: 129254 [2019-12-18 12:45:19,611 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:45:21,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129254 states. [2019-12-18 12:45:24,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129254 to 124642. [2019-12-18 12:45:24,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124642 states. [2019-12-18 12:45:31,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124642 states to 124642 states and 558856 transitions. [2019-12-18 12:45:31,471 INFO L78 Accepts]: Start accepts. Automaton has 124642 states and 558856 transitions. Word has length 15 [2019-12-18 12:45:31,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:45:31,472 INFO L462 AbstractCegarLoop]: Abstraction has 124642 states and 558856 transitions. [2019-12-18 12:45:31,472 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:45:31,472 INFO L276 IsEmpty]: Start isEmpty. Operand 124642 states and 558856 transitions. [2019-12-18 12:45:31,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-18 12:45:31,481 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:45:31,481 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:45:31,481 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:45:31,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:45:31,482 INFO L82 PathProgramCache]: Analyzing trace with hash -545556496, now seen corresponding path program 1 times [2019-12-18 12:45:31,482 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:45:31,482 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969461802] [2019-12-18 12:45:31,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:45:31,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:45:31,618 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-18 12:45:31,618 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969461802] [2019-12-18 12:45:31,619 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:45:31,619 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:45:31,619 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004127648] [2019-12-18 12:45:31,620 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:45:31,620 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:45:31,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:45:31,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:45:31,620 INFO L87 Difference]: Start difference. First operand 124642 states and 558856 transitions. Second operand 4 states. [2019-12-18 12:45:37,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:45:37,502 INFO L93 Difference]: Finished difference Result 158782 states and 702836 transitions. [2019-12-18 12:45:37,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:45:37,503 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-18 12:45:37,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:45:38,018 INFO L225 Difference]: With dead ends: 158782 [2019-12-18 12:45:38,018 INFO L226 Difference]: Without dead ends: 158730 [2019-12-18 12:45:38,018 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-18 12:45:40,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158730 states. [2019-12-18 12:45:42,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158730 to 142378. [2019-12-18 12:45:42,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142378 states. [2019-12-18 12:45:44,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142378 states to 142378 states and 635380 transitions. [2019-12-18 12:45:44,415 INFO L78 Accepts]: Start accepts. Automaton has 142378 states and 635380 transitions. Word has length 18 [2019-12-18 12:45:44,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:45:44,415 INFO L462 AbstractCegarLoop]: Abstraction has 142378 states and 635380 transitions. [2019-12-18 12:45:44,415 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:45:44,415 INFO L276 IsEmpty]: Start isEmpty. Operand 142378 states and 635380 transitions. [2019-12-18 12:45:44,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 12:45:44,430 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:45:44,430 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:45:44,430 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:45:44,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:45:44,431 INFO L82 PathProgramCache]: Analyzing trace with hash 267646308, now seen corresponding path program 1 times [2019-12-18 12:45:44,431 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:45:44,431 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010667244] [2019-12-18 12:45:44,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:45:44,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:45:44,525 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-18 12:45:44,527 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010667244] [2019-12-18 12:45:44,528 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:45:44,528 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:45:44,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934960895] [2019-12-18 12:45:44,528 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:45:44,529 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:45:44,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:45:44,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:45:44,529 INFO L87 Difference]: Start difference. First operand 142378 states and 635380 transitions. Second operand 3 states. [2019-12-18 12:45:51,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:45:51,404 INFO L93 Difference]: Finished difference Result 243978 states and 1046540 transitions. [2019-12-18 12:45:51,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:45:51,405 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-18 12:45:51,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:45:52,896 INFO L225 Difference]: With dead ends: 243978 [2019-12-18 12:45:52,896 INFO L226 Difference]: Without dead ends: 243978 [2019-12-18 12:45:52,896 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:45:55,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243978 states. [2019-12-18 12:46:05,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243978 to 220082. [2019-12-18 12:46:05,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220082 states. [2019-12-18 12:46:06,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220082 states to 220082 states and 955428 transitions. [2019-12-18 12:46:06,884 INFO L78 Accepts]: Start accepts. Automaton has 220082 states and 955428 transitions. Word has length 19 [2019-12-18 12:46:06,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:46:06,884 INFO L462 AbstractCegarLoop]: Abstraction has 220082 states and 955428 transitions. [2019-12-18 12:46:06,884 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:46:06,884 INFO L276 IsEmpty]: Start isEmpty. Operand 220082 states and 955428 transitions. [2019-12-18 12:46:06,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-18 12:46:06,904 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:46:06,904 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] [2019-12-18 12:46:06,904 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:46:06,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:46:06,905 INFO L82 PathProgramCache]: Analyzing trace with hash -993922956, now seen corresponding path program 1 times [2019-12-18 12:46:06,905 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:46:06,905 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712113574] [2019-12-18 12:46:06,905 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:46:06,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:46:06,964 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-18 12:46:06,964 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712113574] [2019-12-18 12:46:06,964 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:46:06,965 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 12:46:06,965 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853989448] [2019-12-18 12:46:06,965 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:46:06,965 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:46:06,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:46:06,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:46:06,966 INFO L87 Difference]: Start difference. First operand 220082 states and 955428 transitions. Second operand 3 states. [2019-12-18 12:46:09,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:46:09,544 INFO L93 Difference]: Finished difference Result 208030 states and 902200 transitions. [2019-12-18 12:46:09,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:46:09,545 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-18 12:46:09,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:46:10,265 INFO L225 Difference]: With dead ends: 208030 [2019-12-18 12:46:10,266 INFO L226 Difference]: Without dead ends: 208030 [2019-12-18 12:46:10,266 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:46:21,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208030 states. [2019-12-18 12:46:24,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208030 to 208030. [2019-12-18 12:46:24,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208030 states. [2019-12-18 12:46:26,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208030 states to 208030 states and 902200 transitions. [2019-12-18 12:46:26,241 INFO L78 Accepts]: Start accepts. Automaton has 208030 states and 902200 transitions. Word has length 20 [2019-12-18 12:46:26,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:46:26,241 INFO L462 AbstractCegarLoop]: Abstraction has 208030 states and 902200 transitions. [2019-12-18 12:46:26,241 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:46:26,241 INFO L276 IsEmpty]: Start isEmpty. Operand 208030 states and 902200 transitions. [2019-12-18 12:46:26,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 12:46:26,260 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:46:26,260 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] [2019-12-18 12:46:26,260 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:46:26,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:46:26,260 INFO L82 PathProgramCache]: Analyzing trace with hash -1950965462, now seen corresponding path program 1 times [2019-12-18 12:46:26,260 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:46:26,260 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164965173] [2019-12-18 12:46:26,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:46:26,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:46:26,341 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-18 12:46:26,341 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164965173] [2019-12-18 12:46:26,341 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:46:26,342 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:46:26,342 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200909102] [2019-12-18 12:46:26,342 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:46:26,342 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:46:26,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:46:26,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:46:26,343 INFO L87 Difference]: Start difference. First operand 208030 states and 902200 transitions. Second operand 4 states. [2019-12-18 12:46:34,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:46:34,967 INFO L93 Difference]: Finished difference Result 258726 states and 1108448 transitions. [2019-12-18 12:46:34,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:46:34,967 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-12-18 12:46:34,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:46:35,844 INFO L225 Difference]: With dead ends: 258726 [2019-12-18 12:46:35,845 INFO L226 Difference]: Without dead ends: 258658 [2019-12-18 12:46:35,845 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-18 12:46:38,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258658 states. [2019-12-18 12:46:43,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258658 to 211214. [2019-12-18 12:46:43,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211214 states. [2019-12-18 12:46:44,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211214 states to 211214 states and 915696 transitions. [2019-12-18 12:46:44,214 INFO L78 Accepts]: Start accepts. Automaton has 211214 states and 915696 transitions. Word has length 21 [2019-12-18 12:46:44,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:46:44,215 INFO L462 AbstractCegarLoop]: Abstraction has 211214 states and 915696 transitions. [2019-12-18 12:46:44,215 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:46:44,215 INFO L276 IsEmpty]: Start isEmpty. Operand 211214 states and 915696 transitions. [2019-12-18 12:46:44,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-18 12:46:44,257 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:46:44,257 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] [2019-12-18 12:46:44,257 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:46:44,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:46:44,258 INFO L82 PathProgramCache]: Analyzing trace with hash 1910405908, now seen corresponding path program 1 times [2019-12-18 12:46:44,258 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:46:44,258 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804764257] [2019-12-18 12:46:44,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:46:44,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:46:44,334 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-18 12:46:44,335 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804764257] [2019-12-18 12:46:44,335 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:46:44,335 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:46:44,335 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262828901] [2019-12-18 12:46:44,336 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:46:44,336 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:46:44,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:46:44,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:46:44,337 INFO L87 Difference]: Start difference. First operand 211214 states and 915696 transitions. Second operand 4 states. [2019-12-18 12:46:50,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:46:50,897 INFO L93 Difference]: Finished difference Result 177260 states and 706065 transitions. [2019-12-18 12:46:50,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 12:46:50,897 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-12-18 12:46:50,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:46:51,397 INFO L225 Difference]: With dead ends: 177260 [2019-12-18 12:46:51,398 INFO L226 Difference]: Without dead ends: 163808 [2019-12-18 12:46:51,398 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-18 12:46:53,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163808 states. [2019-12-18 12:46:56,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163808 to 163808. [2019-12-18 12:46:56,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163808 states. [2019-12-18 12:46:57,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163808 states to 163808 states and 657545 transitions. [2019-12-18 12:46:57,233 INFO L78 Accepts]: Start accepts. Automaton has 163808 states and 657545 transitions. Word has length 24 [2019-12-18 12:46:57,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:46:57,234 INFO L462 AbstractCegarLoop]: Abstraction has 163808 states and 657545 transitions. [2019-12-18 12:46:57,234 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:46:57,234 INFO L276 IsEmpty]: Start isEmpty. Operand 163808 states and 657545 transitions. [2019-12-18 12:46:57,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 12:46:57,268 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:46:57,268 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] [2019-12-18 12:46:57,269 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:46:57,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:46:57,269 INFO L82 PathProgramCache]: Analyzing trace with hash 1761806270, now seen corresponding path program 1 times [2019-12-18 12:46:57,269 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:46:57,269 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077736090] [2019-12-18 12:46:57,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:46:57,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:46:57,371 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-18 12:46:57,373 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077736090] [2019-12-18 12:46:57,373 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:46:57,373 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:46:57,374 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939753696] [2019-12-18 12:46:57,374 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:46:57,374 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:46:57,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:46:57,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:46:57,375 INFO L87 Difference]: Start difference. First operand 163808 states and 657545 transitions. Second operand 5 states. [2019-12-18 12:47:04,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:47:04,562 INFO L93 Difference]: Finished difference Result 229696 states and 902416 transitions. [2019-12-18 12:47:04,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 12:47:04,562 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-18 12:47:04,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:47:05,278 INFO L225 Difference]: With dead ends: 229696 [2019-12-18 12:47:05,279 INFO L226 Difference]: Without dead ends: 229653 [2019-12-18 12:47:05,279 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:47:07,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229653 states. [2019-12-18 12:47:11,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229653 to 179710. [2019-12-18 12:47:11,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179710 states. [2019-12-18 12:47:12,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179710 states to 179710 states and 718320 transitions. [2019-12-18 12:47:12,139 INFO L78 Accepts]: Start accepts. Automaton has 179710 states and 718320 transitions. Word has length 25 [2019-12-18 12:47:12,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:47:12,140 INFO L462 AbstractCegarLoop]: Abstraction has 179710 states and 718320 transitions. [2019-12-18 12:47:12,140 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:47:12,140 INFO L276 IsEmpty]: Start isEmpty. Operand 179710 states and 718320 transitions. [2019-12-18 12:47:12,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 12:47:12,205 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:47:12,205 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] [2019-12-18 12:47:12,205 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:47:12,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:47:12,205 INFO L82 PathProgramCache]: Analyzing trace with hash -1396027996, now seen corresponding path program 1 times [2019-12-18 12:47:12,206 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:47:12,206 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131897094] [2019-12-18 12:47:12,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:47:12,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:47:12,275 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-18 12:47:12,276 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131897094] [2019-12-18 12:47:12,276 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:47:12,276 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:47:12,276 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632016545] [2019-12-18 12:47:12,277 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:47:12,277 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:47:12,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:47:12,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:47:12,277 INFO L87 Difference]: Start difference. First operand 179710 states and 718320 transitions. Second operand 5 states. [2019-12-18 12:47:14,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:47:14,118 INFO L93 Difference]: Finished difference Result 87745 states and 299472 transitions. [2019-12-18 12:47:14,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:47:14,118 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-18 12:47:14,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:47:14,270 INFO L225 Difference]: With dead ends: 87745 [2019-12-18 12:47:14,270 INFO L226 Difference]: Without dead ends: 75270 [2019-12-18 12:47:14,271 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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-18 12:47:14,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75270 states. [2019-12-18 12:47:17,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75270 to 75270. [2019-12-18 12:47:17,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75270 states. [2019-12-18 12:47:17,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75270 states to 75270 states and 254085 transitions. [2019-12-18 12:47:17,409 INFO L78 Accepts]: Start accepts. Automaton has 75270 states and 254085 transitions. Word has length 28 [2019-12-18 12:47:17,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:47:17,409 INFO L462 AbstractCegarLoop]: Abstraction has 75270 states and 254085 transitions. [2019-12-18 12:47:17,409 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:47:17,409 INFO L276 IsEmpty]: Start isEmpty. Operand 75270 states and 254085 transitions. [2019-12-18 12:47:17,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-18 12:47:17,431 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:47:17,432 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] [2019-12-18 12:47:17,432 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:47:17,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:47:17,432 INFO L82 PathProgramCache]: Analyzing trace with hash 1458765979, now seen corresponding path program 1 times [2019-12-18 12:47:17,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:47:17,433 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878829598] [2019-12-18 12:47:17,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:47:17,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:47:17,520 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-18 12:47:17,520 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878829598] [2019-12-18 12:47:17,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:47:17,521 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 12:47:17,521 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946870274] [2019-12-18 12:47:17,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 12:47:17,521 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:47:17,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 12:47:17,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:47:17,522 INFO L87 Difference]: Start difference. First operand 75270 states and 254085 transitions. Second operand 6 states. [2019-12-18 12:47:17,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:47:17,694 INFO L93 Difference]: Finished difference Result 23830 states and 76448 transitions. [2019-12-18 12:47:17,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 12:47:17,694 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2019-12-18 12:47:17,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:47:17,725 INFO L225 Difference]: With dead ends: 23830 [2019-12-18 12:47:17,726 INFO L226 Difference]: Without dead ends: 19208 [2019-12-18 12:47:17,726 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:47:17,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19208 states. [2019-12-18 12:47:17,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19208 to 19096. [2019-12-18 12:47:17,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19096 states. [2019-12-18 12:47:18,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19096 states to 19096 states and 61015 transitions. [2019-12-18 12:47:18,003 INFO L78 Accepts]: Start accepts. Automaton has 19096 states and 61015 transitions. Word has length 29 [2019-12-18 12:47:18,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:47:18,003 INFO L462 AbstractCegarLoop]: Abstraction has 19096 states and 61015 transitions. [2019-12-18 12:47:18,003 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 12:47:18,003 INFO L276 IsEmpty]: Start isEmpty. Operand 19096 states and 61015 transitions. [2019-12-18 12:47:18,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-18 12:47:18,021 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:47:18,021 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] [2019-12-18 12:47:18,021 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:47:18,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:47:18,022 INFO L82 PathProgramCache]: Analyzing trace with hash 1466756281, now seen corresponding path program 1 times [2019-12-18 12:47:18,022 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:47:18,022 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921074125] [2019-12-18 12:47:18,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:47:18,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:47:18,063 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-18 12:47:18,063 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921074125] [2019-12-18 12:47:18,063 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:47:18,064 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:47:18,064 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218691327] [2019-12-18 12:47:18,064 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:47:18,064 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:47:18,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:47:18,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:47:18,065 INFO L87 Difference]: Start difference. First operand 19096 states and 61015 transitions. Second operand 3 states. [2019-12-18 12:47:18,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:47:18,191 INFO L93 Difference]: Finished difference Result 20443 states and 62078 transitions. [2019-12-18 12:47:18,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:47:18,191 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-12-18 12:47:18,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:47:18,220 INFO L225 Difference]: With dead ends: 20443 [2019-12-18 12:47:18,220 INFO L226 Difference]: Without dead ends: 20443 [2019-12-18 12:47:18,221 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:47:18,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20443 states. [2019-12-18 12:47:18,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20443 to 19377. [2019-12-18 12:47:18,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19377 states. [2019-12-18 12:47:18,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19377 states to 19377 states and 59359 transitions. [2019-12-18 12:47:18,500 INFO L78 Accepts]: Start accepts. Automaton has 19377 states and 59359 transitions. Word has length 37 [2019-12-18 12:47:18,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:47:18,500 INFO L462 AbstractCegarLoop]: Abstraction has 19377 states and 59359 transitions. [2019-12-18 12:47:18,500 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:47:18,500 INFO L276 IsEmpty]: Start isEmpty. Operand 19377 states and 59359 transitions. [2019-12-18 12:47:18,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 12:47:18,525 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:47:18,525 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] [2019-12-18 12:47:18,526 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:47:18,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:47:18,526 INFO L82 PathProgramCache]: Analyzing trace with hash 102427512, now seen corresponding path program 1 times [2019-12-18 12:47:18,526 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:47:18,527 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209116729] [2019-12-18 12:47:18,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:47:18,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:47:18,630 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-18 12:47:18,631 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209116729] [2019-12-18 12:47:18,631 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:47:18,631 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:47:18,632 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395811572] [2019-12-18 12:47:18,632 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:47:18,632 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:47:18,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:47:18,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:47:18,633 INFO L87 Difference]: Start difference. First operand 19377 states and 59359 transitions. Second operand 5 states. [2019-12-18 12:47:19,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:47:19,360 INFO L93 Difference]: Finished difference Result 20703 states and 62425 transitions. [2019-12-18 12:47:19,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 12:47:19,361 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 12:47:19,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:47:19,392 INFO L225 Difference]: With dead ends: 20703 [2019-12-18 12:47:19,393 INFO L226 Difference]: Without dead ends: 20702 [2019-12-18 12:47:19,393 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 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-18 12:47:19,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20702 states. [2019-12-18 12:47:19,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20702 to 16886. [2019-12-18 12:47:19,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16886 states. [2019-12-18 12:47:19,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16886 states to 16886 states and 52214 transitions. [2019-12-18 12:47:19,643 INFO L78 Accepts]: Start accepts. Automaton has 16886 states and 52214 transitions. Word has length 40 [2019-12-18 12:47:19,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:47:19,643 INFO L462 AbstractCegarLoop]: Abstraction has 16886 states and 52214 transitions. [2019-12-18 12:47:19,643 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:47:19,643 INFO L276 IsEmpty]: Start isEmpty. Operand 16886 states and 52214 transitions. [2019-12-18 12:47:19,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-18 12:47:19,662 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:47:19,662 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] [2019-12-18 12:47:19,662 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:47:19,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:47:19,662 INFO L82 PathProgramCache]: Analyzing trace with hash -882664853, now seen corresponding path program 1 times [2019-12-18 12:47:19,662 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:47:19,663 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017945041] [2019-12-18 12:47:19,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:47:19,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:47:19,733 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-18 12:47:19,733 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017945041] [2019-12-18 12:47:19,734 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:47:19,734 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:47:19,734 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238089938] [2019-12-18 12:47:19,735 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:47:19,735 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:47:19,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:47:19,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:47:19,735 INFO L87 Difference]: Start difference. First operand 16886 states and 52214 transitions. Second operand 4 states. [2019-12-18 12:47:19,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:47:19,842 INFO L93 Difference]: Finished difference Result 19894 states and 59689 transitions. [2019-12-18 12:47:19,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 12:47:19,843 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-12-18 12:47:19,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:47:19,882 INFO L225 Difference]: With dead ends: 19894 [2019-12-18 12:47:19,882 INFO L226 Difference]: Without dead ends: 16897 [2019-12-18 12:47:19,882 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-18 12:47:19,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16897 states. [2019-12-18 12:47:20,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16897 to 16877. [2019-12-18 12:47:20,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16877 states. [2019-12-18 12:47:20,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16877 states to 16877 states and 51996 transitions. [2019-12-18 12:47:20,232 INFO L78 Accepts]: Start accepts. Automaton has 16877 states and 51996 transitions. Word has length 47 [2019-12-18 12:47:20,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:47:20,233 INFO L462 AbstractCegarLoop]: Abstraction has 16877 states and 51996 transitions. [2019-12-18 12:47:20,233 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:47:20,233 INFO L276 IsEmpty]: Start isEmpty. Operand 16877 states and 51996 transitions. [2019-12-18 12:47:20,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-18 12:47:20,252 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:47:20,252 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] [2019-12-18 12:47:20,253 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:47:20,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:47:20,253 INFO L82 PathProgramCache]: Analyzing trace with hash 1961418095, now seen corresponding path program 2 times [2019-12-18 12:47:20,253 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:47:20,253 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795435179] [2019-12-18 12:47:20,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:47:20,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:47:20,305 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-18 12:47:20,306 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795435179] [2019-12-18 12:47:20,306 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:47:20,306 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:47:20,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227009463] [2019-12-18 12:47:20,307 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:47:20,307 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:47:20,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:47:20,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:47:20,307 INFO L87 Difference]: Start difference. First operand 16877 states and 51996 transitions. Second operand 3 states. [2019-12-18 12:47:20,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:47:20,406 INFO L93 Difference]: Finished difference Result 26272 states and 76466 transitions. [2019-12-18 12:47:20,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:47:20,406 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-12-18 12:47:20,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:47:20,426 INFO L225 Difference]: With dead ends: 26272 [2019-12-18 12:47:20,426 INFO L226 Difference]: Without dead ends: 14264 [2019-12-18 12:47:20,427 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:47:20,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14264 states. [2019-12-18 12:47:20,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14264 to 14079. [2019-12-18 12:47:20,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14079 states. [2019-12-18 12:47:20,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14079 states to 14079 states and 35923 transitions. [2019-12-18 12:47:20,597 INFO L78 Accepts]: Start accepts. Automaton has 14079 states and 35923 transitions. Word has length 47 [2019-12-18 12:47:20,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:47:20,597 INFO L462 AbstractCegarLoop]: Abstraction has 14079 states and 35923 transitions. [2019-12-18 12:47:20,597 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:47:20,597 INFO L276 IsEmpty]: Start isEmpty. Operand 14079 states and 35923 transitions. [2019-12-18 12:47:20,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-18 12:47:20,609 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:47:20,609 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] [2019-12-18 12:47:20,609 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:47:20,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:47:20,609 INFO L82 PathProgramCache]: Analyzing trace with hash -1855662657, now seen corresponding path program 1 times [2019-12-18 12:47:20,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:47:20,610 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129483608] [2019-12-18 12:47:20,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:47:20,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:47:20,673 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-18 12:47:20,674 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129483608] [2019-12-18 12:47:20,674 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:47:20,674 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:47:20,674 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520399329] [2019-12-18 12:47:20,675 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:47:20,675 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:47:20,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:47:20,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:47:20,675 INFO L87 Difference]: Start difference. First operand 14079 states and 35923 transitions. Second operand 4 states. [2019-12-18 12:47:20,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:47:20,748 INFO L93 Difference]: Finished difference Result 19022 states and 46891 transitions. [2019-12-18 12:47:20,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 12:47:20,748 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2019-12-18 12:47:20,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:47:20,768 INFO L225 Difference]: With dead ends: 19022 [2019-12-18 12:47:20,768 INFO L226 Difference]: Without dead ends: 13143 [2019-12-18 12:47:20,769 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:47:20,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13143 states. [2019-12-18 12:47:21,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13143 to 13006. [2019-12-18 12:47:21,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13006 states. [2019-12-18 12:47:21,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13006 states to 13006 states and 29962 transitions. [2019-12-18 12:47:21,119 INFO L78 Accepts]: Start accepts. Automaton has 13006 states and 29962 transitions. Word has length 48 [2019-12-18 12:47:21,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:47:21,120 INFO L462 AbstractCegarLoop]: Abstraction has 13006 states and 29962 transitions. [2019-12-18 12:47:21,120 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:47:21,120 INFO L276 IsEmpty]: Start isEmpty. Operand 13006 states and 29962 transitions. [2019-12-18 12:47:21,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-18 12:47:21,135 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:47:21,136 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] [2019-12-18 12:47:21,136 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:47:21,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:47:21,136 INFO L82 PathProgramCache]: Analyzing trace with hash -1699851845, now seen corresponding path program 2 times [2019-12-18 12:47:21,136 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:47:21,137 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411203257] [2019-12-18 12:47:21,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:47:21,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:47:21,200 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-18 12:47:21,201 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411203257] [2019-12-18 12:47:21,201 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:47:21,201 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:47:21,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564414880] [2019-12-18 12:47:21,202 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:47:21,202 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:47:21,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:47:21,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:47:21,203 INFO L87 Difference]: Start difference. First operand 13006 states and 29962 transitions. Second operand 5 states. [2019-12-18 12:47:21,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:47:21,371 INFO L93 Difference]: Finished difference Result 20388 states and 47116 transitions. [2019-12-18 12:47:21,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 12:47:21,371 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-12-18 12:47:21,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:47:21,395 INFO L225 Difference]: With dead ends: 20388 [2019-12-18 12:47:21,395 INFO L226 Difference]: Without dead ends: 16544 [2019-12-18 12:47:21,395 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-18 12:47:21,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16544 states. [2019-12-18 12:47:21,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16544 to 16544. [2019-12-18 12:47:21,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16544 states. [2019-12-18 12:47:21,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16544 states to 16544 states and 38182 transitions. [2019-12-18 12:47:21,599 INFO L78 Accepts]: Start accepts. Automaton has 16544 states and 38182 transitions. Word has length 48 [2019-12-18 12:47:21,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:47:21,599 INFO L462 AbstractCegarLoop]: Abstraction has 16544 states and 38182 transitions. [2019-12-18 12:47:21,599 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:47:21,599 INFO L276 IsEmpty]: Start isEmpty. Operand 16544 states and 38182 transitions. [2019-12-18 12:47:21,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-18 12:47:21,614 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:47:21,614 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] [2019-12-18 12:47:21,615 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:47:21,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:47:21,615 INFO L82 PathProgramCache]: Analyzing trace with hash 1433918518, now seen corresponding path program 1 times [2019-12-18 12:47:21,615 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:47:21,615 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832706724] [2019-12-18 12:47:21,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:47:21,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:47:21,694 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-18 12:47:21,694 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832706724] [2019-12-18 12:47:21,695 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:47:21,695 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 12:47:21,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742740304] [2019-12-18 12:47:21,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:47:21,695 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:47:21,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:47:21,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:47:21,697 INFO L87 Difference]: Start difference. First operand 16544 states and 38182 transitions. Second operand 5 states. [2019-12-18 12:47:22,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:47:22,173 INFO L93 Difference]: Finished difference Result 19289 states and 44266 transitions. [2019-12-18 12:47:22,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 12:47:22,174 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2019-12-18 12:47:22,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:47:22,203 INFO L225 Difference]: With dead ends: 19289 [2019-12-18 12:47:22,203 INFO L226 Difference]: Without dead ends: 19289 [2019-12-18 12:47:22,204 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:47:22,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19289 states. [2019-12-18 12:47:22,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19289 to 18304. [2019-12-18 12:47:22,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18304 states. [2019-12-18 12:47:22,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18304 states to 18304 states and 42202 transitions. [2019-12-18 12:47:22,526 INFO L78 Accepts]: Start accepts. Automaton has 18304 states and 42202 transitions. Word has length 49 [2019-12-18 12:47:22,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:47:22,527 INFO L462 AbstractCegarLoop]: Abstraction has 18304 states and 42202 transitions. [2019-12-18 12:47:22,527 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:47:22,527 INFO L276 IsEmpty]: Start isEmpty. Operand 18304 states and 42202 transitions. [2019-12-18 12:47:22,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-18 12:47:22,550 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:47:22,550 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] [2019-12-18 12:47:22,550 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:47:22,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:47:22,550 INFO L82 PathProgramCache]: Analyzing trace with hash -133447137, now seen corresponding path program 1 times [2019-12-18 12:47:22,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:47:22,551 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672172909] [2019-12-18 12:47:22,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:47:22,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:47:22,646 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-18 12:47:22,646 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672172909] [2019-12-18 12:47:22,646 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:47:22,646 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:47:22,647 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528860865] [2019-12-18 12:47:22,651 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:47:22,651 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:47:22,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:47:22,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:47:22,652 INFO L87 Difference]: Start difference. First operand 18304 states and 42202 transitions. Second operand 7 states. [2019-12-18 12:47:22,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:47:22,787 INFO L93 Difference]: Finished difference Result 16354 states and 37801 transitions. [2019-12-18 12:47:22,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 12:47:22,788 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2019-12-18 12:47:22,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:47:22,790 INFO L225 Difference]: With dead ends: 16354 [2019-12-18 12:47:22,790 INFO L226 Difference]: Without dead ends: 962 [2019-12-18 12:47:22,790 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-12-18 12:47:22,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2019-12-18 12:47:22,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 920. [2019-12-18 12:47:22,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 920 states. [2019-12-18 12:47:22,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 920 states and 1833 transitions. [2019-12-18 12:47:22,799 INFO L78 Accepts]: Start accepts. Automaton has 920 states and 1833 transitions. Word has length 50 [2019-12-18 12:47:22,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:47:22,799 INFO L462 AbstractCegarLoop]: Abstraction has 920 states and 1833 transitions. [2019-12-18 12:47:22,799 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:47:22,799 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 1833 transitions. [2019-12-18 12:47:22,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:47:22,800 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:47:22,800 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] [2019-12-18 12:47:22,801 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:47:22,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:47:22,801 INFO L82 PathProgramCache]: Analyzing trace with hash -680135429, now seen corresponding path program 1 times [2019-12-18 12:47:22,801 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:47:22,801 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362371048] [2019-12-18 12:47:22,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:47:22,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:47:22,882 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-18 12:47:22,883 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362371048] [2019-12-18 12:47:22,883 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:47:22,883 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:47:22,883 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029676746] [2019-12-18 12:47:22,884 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:47:22,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:47:22,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:47:22,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:47:22,884 INFO L87 Difference]: Start difference. First operand 920 states and 1833 transitions. Second operand 7 states. [2019-12-18 12:47:23,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:47:23,061 INFO L93 Difference]: Finished difference Result 1705 states and 3362 transitions. [2019-12-18 12:47:23,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 12:47:23,061 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-18 12:47:23,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:47:23,063 INFO L225 Difference]: With dead ends: 1705 [2019-12-18 12:47:23,063 INFO L226 Difference]: Without dead ends: 1255 [2019-12-18 12:47:23,063 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-12-18 12:47:23,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1255 states. [2019-12-18 12:47:23,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1255 to 996. [2019-12-18 12:47:23,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 996 states. [2019-12-18 12:47:23,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 996 states to 996 states and 1957 transitions. [2019-12-18 12:47:23,078 INFO L78 Accepts]: Start accepts. Automaton has 996 states and 1957 transitions. Word has length 65 [2019-12-18 12:47:23,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:47:23,078 INFO L462 AbstractCegarLoop]: Abstraction has 996 states and 1957 transitions. [2019-12-18 12:47:23,078 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:47:23,078 INFO L276 IsEmpty]: Start isEmpty. Operand 996 states and 1957 transitions. [2019-12-18 12:47:23,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:47:23,079 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:47:23,080 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] [2019-12-18 12:47:23,080 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:47:23,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:47:23,080 INFO L82 PathProgramCache]: Analyzing trace with hash 5346039, now seen corresponding path program 2 times [2019-12-18 12:47:23,080 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:47:23,081 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707979516] [2019-12-18 12:47:23,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:47:23,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:47:23,144 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-18 12:47:23,144 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707979516] [2019-12-18 12:47:23,144 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:47:23,144 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:47:23,144 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054863224] [2019-12-18 12:47:23,145 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:47:23,145 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:47:23,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:47:23,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:47:23,146 INFO L87 Difference]: Start difference. First operand 996 states and 1957 transitions. Second operand 3 states. [2019-12-18 12:47:23,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:47:23,158 INFO L93 Difference]: Finished difference Result 995 states and 1955 transitions. [2019-12-18 12:47:23,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:47:23,158 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 12:47:23,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:47:23,160 INFO L225 Difference]: With dead ends: 995 [2019-12-18 12:47:23,160 INFO L226 Difference]: Without dead ends: 995 [2019-12-18 12:47:23,160 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-18 12:47:23,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 995 states. [2019-12-18 12:47:23,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 995 to 862. [2019-12-18 12:47:23,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 862 states. [2019-12-18 12:47:23,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 862 states to 862 states and 1711 transitions. [2019-12-18 12:47:23,172 INFO L78 Accepts]: Start accepts. Automaton has 862 states and 1711 transitions. Word has length 65 [2019-12-18 12:47:23,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:47:23,172 INFO L462 AbstractCegarLoop]: Abstraction has 862 states and 1711 transitions. [2019-12-18 12:47:23,172 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:47:23,172 INFO L276 IsEmpty]: Start isEmpty. Operand 862 states and 1711 transitions. [2019-12-18 12:47:23,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:47:23,173 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:47:23,174 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] [2019-12-18 12:47:23,174 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:47:23,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:47:23,174 INFO L82 PathProgramCache]: Analyzing trace with hash -1469521026, now seen corresponding path program 1 times [2019-12-18 12:47:23,174 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:47:23,175 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18848809] [2019-12-18 12:47:23,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:47:23,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 12:47:23,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 12:47:23,362 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 12:47:23,363 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 12:47:23,367 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1061] [1061] ULTIMATE.startENTRY-->L851: Formula: (let ((.cse0 (store |v_#valid_85| 0 0))) (and (= v_~__unbuffered_cnt~0_140 0) (= |v_#length_27| (store |v_#length_28| |v_ULTIMATE.start_main_~#t541~0.base_34| 4)) (= v_~z$r_buff0_thd2~0_131 0) (= 0 v_~z$flush_delayed~0_223) (= 0 v_~__unbuffered_p3_EAX~0_84) (= |v_#NULL.offset_6| 0) (= v_~z$w_buff1~0_366 0) (= v_~z$r_buff0_thd0~0_214 0) (= v_~z$r_buff1_thd2~0_149 0) (= v_~z$read_delayed~0_8 0) (= v_~z$r_buff1_thd1~0_149 0) (= v_~z$read_delayed_var~0.base_8 0) (= (store |v_#memory_int_26| |v_ULTIMATE.start_main_~#t541~0.base_34| (store (select |v_#memory_int_26| |v_ULTIMATE.start_main_~#t541~0.base_34|) |v_ULTIMATE.start_main_~#t541~0.offset_23| 0)) |v_#memory_int_25|) (= v_~main$tmp_guard1~0_56 0) (= v_~z$r_buff0_thd1~0_132 0) (= 0 v_~z$r_buff1_thd4~0_351) (= |v_ULTIMATE.start_main_~#t541~0.offset_23| 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t541~0.base_34|) 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t541~0.base_34| 1) |v_#valid_83|) (= v_~a~0_48 0) (= 0 v_~z$mem_tmp~0_195) (= 0 |v_#NULL.base_6|) (= v_~z$w_buff1_used~0_712 0) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t541~0.base_34|) (= v_~z$r_buff1_thd0~0_223 0) (= 0 v_~__unbuffered_p2_EAX~0_71) (< 0 |v_#StackHeapBarrier_20|) (= v_~z$w_buff0~0_640 0) (= v_~main$tmp_guard0~0_47 0) (= 0 v_~__unbuffered_p3_EBX~0_61) (= v_~y~0_94 0) (= 0 v_~z$r_buff0_thd3~0_453) (= v_~z$w_buff0_used~0_1093 0) (= v_~weak$$choice2~0_273 0) (= 0 v_~weak$$choice0~0_182) (= 0 v_~z$r_buff0_thd4~0_575) (= v_~z~0_310 0) (= 0 v_~__unbuffered_p0_EAX~0_80) (= 0 v_~z$r_buff1_thd3~0_381) (= v_~z$read_delayed_var~0.offset_8 0) (= v_~x~0_47 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_20|, #valid=|v_#valid_85|, #memory_int=|v_#memory_int_26|, #length=|v_#length_28|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_7|, ULTIMATE.start_main_~#t541~0.offset=|v_ULTIMATE.start_main_~#t541~0.offset_23|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_7|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_149, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_111|, ~a~0=v_~a~0_48, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_214, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_80, ULTIMATE.start_main_~#t544~0.offset=|v_ULTIMATE.start_main_~#t544~0.offset_16|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_575, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_84, #length=|v_#length_27|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_71, ~z$mem_tmp~0=v_~z$mem_tmp~0_195, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_712, ~z$flush_delayed~0=v_~z$flush_delayed~0_223, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_43|, ~weak$$choice0~0=v_~weak$$choice0~0_182, #StackHeapBarrier=|v_#StackHeapBarrier_20|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_183|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_149, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_8, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_453, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_140, ~x~0=v_~x~0_47, ULTIMATE.start_main_~#t541~0.base=|v_ULTIMATE.start_main_~#t541~0.base_34|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_351, ULTIMATE.start_main_#t~nondet58=|v_ULTIMATE.start_main_#t~nondet58_24|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_7|, ~z$read_delayed~0=v_~z$read_delayed~0_8, ~z$w_buff1~0=v_~z$w_buff1~0_366, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_56, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_8, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_223, ~y~0=v_~y~0_94, ULTIMATE.start_main_~#t544~0.base=|v_ULTIMATE.start_main_~#t544~0.base_22|, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_131, ULTIMATE.start_main_~#t543~0.offset=|v_ULTIMATE.start_main_~#t543~0.offset_17|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_1093, ~z$w_buff0~0=v_~z$w_buff0~0_640, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_381, ULTIMATE.start_main_~#t542~0.base=|v_ULTIMATE.start_main_~#t542~0.base_36|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_51|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_47, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_61, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_37|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_58|, ULTIMATE.start_main_~#t543~0.base=|v_ULTIMATE.start_main_~#t543~0.base_28|, ULTIMATE.start_main_~#t542~0.offset=|v_ULTIMATE.start_main_~#t542~0.offset_24|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_29|, #valid=|v_#valid_83|, #memory_int=|v_#memory_int_25|, ~z~0=v_~z~0_310, ~weak$$choice2~0=v_~weak$$choice2~0_273, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_132} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_~#t541~0.offset, ULTIMATE.start_main_#t~nondet55, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_#t~ite64, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t544~0.offset, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t541~0.base, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet58, ULTIMATE.start_main_#t~nondet56, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ~z$r_buff1_thd0~0, ~y~0, ULTIMATE.start_main_~#t544~0.base, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t543~0.offset, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_~#t542~0.base, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_~#t543~0.base, ULTIMATE.start_main_~#t542~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 12:47:23,368 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1031] [1031] L851-1-->L853: Formula: (and (= (select |v_#valid_46| |v_ULTIMATE.start_main_~#t542~0.base_11|) 0) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t542~0.base_11| 4) |v_#length_23|) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t542~0.base_11|) (= |v_ULTIMATE.start_main_~#t542~0.offset_10| 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t542~0.base_11| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t542~0.base_11|) |v_ULTIMATE.start_main_~#t542~0.offset_10| 1)) |v_#memory_int_21|) (not (= |v_ULTIMATE.start_main_~#t542~0.base_11| 0)) (= |v_#valid_45| (store |v_#valid_46| |v_ULTIMATE.start_main_~#t542~0.base_11| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_~#t542~0.offset=|v_ULTIMATE.start_main_~#t542~0.offset_10|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_5|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_~#t542~0.base=|v_ULTIMATE.start_main_~#t542~0.base_11|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t542~0.offset, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, ULTIMATE.start_main_~#t542~0.base, #length] because there is no mapped edge [2019-12-18 12:47:23,369 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1030] [1030] L853-1-->L855: Formula: (and (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t543~0.base_11| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t543~0.base_11|) |v_ULTIMATE.start_main_~#t543~0.offset_11| 2)) |v_#memory_int_19|) (= (select |v_#valid_44| |v_ULTIMATE.start_main_~#t543~0.base_11|) 0) (= 0 |v_ULTIMATE.start_main_~#t543~0.offset_11|) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t543~0.base_11|) (= (store |v_#valid_44| |v_ULTIMATE.start_main_~#t543~0.base_11| 1) |v_#valid_43|) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t543~0.base_11| 4) |v_#length_21|) (not (= 0 |v_ULTIMATE.start_main_~#t543~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t543~0.offset=|v_ULTIMATE.start_main_~#t543~0.offset_11|, ULTIMATE.start_main_~#t543~0.base=|v_ULTIMATE.start_main_~#t543~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_43|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_5|, #memory_int=|v_#memory_int_19|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t543~0.offset, ULTIMATE.start_main_~#t543~0.base, #valid, ULTIMATE.start_main_#t~nondet56, #memory_int, #length] because there is no mapped edge [2019-12-18 12:47:23,371 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1002] [1002] L855-1-->L857: Formula: (and (= 0 (select |v_#valid_36| |v_ULTIMATE.start_main_~#t544~0.base_9|)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t544~0.base_9| 4)) (= (store |v_#valid_36| |v_ULTIMATE.start_main_~#t544~0.base_9| 1) |v_#valid_35|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t544~0.base_9| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t544~0.base_9|) |v_ULTIMATE.start_main_~#t544~0.offset_8| 3)) |v_#memory_int_15|) (not (= |v_ULTIMATE.start_main_~#t544~0.base_9| 0)) (= 0 |v_ULTIMATE.start_main_~#t544~0.offset_8|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t544~0.base_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_4|, ULTIMATE.start_main_~#t544~0.offset=|v_ULTIMATE.start_main_~#t544~0.offset_8|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|, ULTIMATE.start_main_~#t544~0.base=|v_ULTIMATE.start_main_~#t544~0.base_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_~#t544~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_~#t544~0.base] because there is no mapped edge [2019-12-18 12:47:23,373 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1036] [1036] L4-->L813: Formula: (and (= ~weak$$choice0~0_Out-185393252 |P3Thread1of1ForFork2_#t~nondet26_In-185393252|) (= ~z$r_buff0_thd1~0_In-185393252 ~z$r_buff1_thd1~0_Out-185393252) (= |P3Thread1of1ForFork2_#t~nondet27_In-185393252| ~weak$$choice2~0_Out-185393252) (= ~z$r_buff0_thd2~0_In-185393252 ~z$r_buff1_thd2~0_Out-185393252) (= ~z$r_buff1_thd4~0_Out-185393252 ~z$r_buff0_thd4~0_In-185393252) (= ~z~0_In-185393252 ~z$mem_tmp~0_Out-185393252) (= ~z$r_buff1_thd3~0_Out-185393252 ~z$r_buff0_thd3~0_In-185393252) (= 1 ~z$r_buff0_thd4~0_Out-185393252) (not (= P3Thread1of1ForFork2___VERIFIER_assert_~expression_In-185393252 0)) (= ~weak$$choice2~0_Out-185393252 ~z$flush_delayed~0_Out-185393252) (= ~z$r_buff0_thd0~0_In-185393252 ~z$r_buff1_thd0~0_Out-185393252)) InVars {P3Thread1of1ForFork2_#t~nondet26=|P3Thread1of1ForFork2_#t~nondet26_In-185393252|, P3Thread1of1ForFork2_#t~nondet27=|P3Thread1of1ForFork2_#t~nondet27_In-185393252|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-185393252, P3Thread1of1ForFork2___VERIFIER_assert_~expression=P3Thread1of1ForFork2___VERIFIER_assert_~expression_In-185393252, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-185393252, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-185393252, ~z~0=~z~0_In-185393252, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-185393252, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-185393252} OutVars{P3Thread1of1ForFork2_#t~nondet26=|P3Thread1of1ForFork2_#t~nondet26_Out-185393252|, ~z$mem_tmp~0=~z$mem_tmp~0_Out-185393252, P3Thread1of1ForFork2_#t~nondet27=|P3Thread1of1ForFork2_#t~nondet27_Out-185393252|, P3Thread1of1ForFork2___VERIFIER_assert_~expression=P3Thread1of1ForFork2___VERIFIER_assert_~expression_In-185393252, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_Out-185393252, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_Out-185393252, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out-185393252, ~z$flush_delayed~0=~z$flush_delayed~0_Out-185393252, ~weak$$choice0~0=~weak$$choice0~0_Out-185393252, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-185393252, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out-185393252, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out-185393252, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-185393252, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-185393252, ~z~0=~z~0_In-185393252, ~weak$$choice2~0=~weak$$choice2~0_Out-185393252, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-185393252, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-185393252} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~nondet26, ~z$mem_tmp~0, P3Thread1of1ForFork2_#t~nondet27, ~weak$$choice0~0, ~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd4~0, ~z$flush_delayed~0, ~weak$$choice2~0] because there is no mapped edge [2019-12-18 12:47:23,375 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [992] [992] L813-2-->L813-5: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In545396600 256))) (.cse1 (= (mod ~z$r_buff0_thd4~0_In545396600 256) 0)) (.cse2 (= |P3Thread1of1ForFork2_#t~ite28_Out545396600| |P3Thread1of1ForFork2_#t~ite29_Out545396600|))) (or (and (= |P3Thread1of1ForFork2_#t~ite28_Out545396600| ~z$w_buff1~0_In545396600) (or .cse0 .cse1) .cse2) (and (not .cse0) (= |P3Thread1of1ForFork2_#t~ite28_Out545396600| ~z$w_buff0~0_In545396600) (not .cse1) .cse2))) InVars {~z$w_buff0~0=~z$w_buff0~0_In545396600, ~z$w_buff0_used~0=~z$w_buff0_used~0_In545396600, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In545396600, ~z$w_buff1~0=~z$w_buff1~0_In545396600} OutVars{P3Thread1of1ForFork2_#t~ite29=|P3Thread1of1ForFork2_#t~ite29_Out545396600|, P3Thread1of1ForFork2_#t~ite28=|P3Thread1of1ForFork2_#t~ite28_Out545396600|, ~z$w_buff0~0=~z$w_buff0~0_In545396600, ~z$w_buff0_used~0=~z$w_buff0_used~0_In545396600, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In545396600, ~z$w_buff1~0=~z$w_buff1~0_In545396600} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite29, P3Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-18 12:47:23,383 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [943] [943] L818-->L819: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_61 256))) (= v_~z$r_buff0_thd4~0_131 v_~z$r_buff0_thd4~0_130)) InVars {~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_131, ~weak$$choice2~0=v_~weak$$choice2~0_61} OutVars{P3Thread1of1ForFork2_#t~ite42=|v_P3Thread1of1ForFork2_#t~ite42_12|, P3Thread1of1ForFork2_#t~ite43=|v_P3Thread1of1ForFork2_#t~ite43_11|, P3Thread1of1ForFork2_#t~ite44=|v_P3Thread1of1ForFork2_#t~ite44_11|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_130, ~weak$$choice2~0=v_~weak$$choice2~0_61} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite42, P3Thread1of1ForFork2_#t~ite43, P3Thread1of1ForFork2_#t~ite44, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-18 12:47:23,386 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [993] [993] L821-->L821-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In626162954 256)))) (or (and (= ~z~0_In626162954 |P3Thread1of1ForFork2_#t~ite48_Out626162954|) .cse0) (and (= ~z$mem_tmp~0_In626162954 |P3Thread1of1ForFork2_#t~ite48_Out626162954|) (not .cse0)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In626162954, ~z$flush_delayed~0=~z$flush_delayed~0_In626162954, ~z~0=~z~0_In626162954} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In626162954, P3Thread1of1ForFork2_#t~ite48=|P3Thread1of1ForFork2_#t~ite48_Out626162954|, ~z$flush_delayed~0=~z$flush_delayed~0_In626162954, ~z~0=~z~0_In626162954} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite48] because there is no mapped edge [2019-12-18 12:47:23,388 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1032] [1032] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork3_#res.base_5|) (= v_~__unbuffered_cnt~0_71 (+ v_~__unbuffered_cnt~0_72 1)) (= v_~a~0_15 1) (= |v_P0Thread1of1ForFork3_#in~arg.offset_12| v_P0Thread1of1ForFork3_~arg.offset_12) (= |v_P0Thread1of1ForFork3_#res.offset_5| 0) (= v_~x~0_17 v_~__unbuffered_p0_EAX~0_19) (= v_P0Thread1of1ForFork3_~arg.base_12 |v_P0Thread1of1ForFork3_#in~arg.base_12|)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_12|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_72, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_12|, ~x~0=v_~x~0_17} OutVars{~a~0=v_~a~0_15, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_19, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_12|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_12, P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_71, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_5|, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_12, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_12|, ~x~0=v_~x~0_17} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset, P0Thread1of1ForFork3_~arg.offset] because there is no mapped edge [2019-12-18 12:47:23,388 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1001] [1001] P1ENTRY-->P1EXIT: Formula: (and (= v_P1Thread1of1ForFork0_~arg.offset_6 |v_P1Thread1of1ForFork0_#in~arg.offset_6|) (= v_P1Thread1of1ForFork0_~arg.base_6 |v_P1Thread1of1ForFork0_#in~arg.base_6|) (= v_~y~0_35 1) (= (+ v_~__unbuffered_cnt~0_41 1) v_~__unbuffered_cnt~0_40) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= 1 v_~x~0_8)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_6|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_41} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_6, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_6, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_6|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, ~y~0=v_~y~0_35, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|, ~x~0=v_~x~0_8} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, ~y~0, P1Thread1of1ForFork0_#res.base, ~x~0] because there is no mapped edge [2019-12-18 12:47:23,404 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [985] [985] L829-->L829-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-989231379 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In-989231379 256)))) (or (and (not .cse0) (= 0 |P3Thread1of1ForFork2_#t~ite51_Out-989231379|) (not .cse1)) (and (= ~z$w_buff0_used~0_In-989231379 |P3Thread1of1ForFork2_#t~ite51_Out-989231379|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-989231379, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-989231379} OutVars{P3Thread1of1ForFork2_#t~ite51=|P3Thread1of1ForFork2_#t~ite51_Out-989231379|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-989231379, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-989231379} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite51] because there is no mapped edge [2019-12-18 12:47:23,405 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [972] [972] L783-->L783-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In-2132450777 256)))) (or (and (not .cse0) (= ~z$mem_tmp~0_In-2132450777 |P2Thread1of1ForFork1_#t~ite25_Out-2132450777|)) (and (= ~z~0_In-2132450777 |P2Thread1of1ForFork1_#t~ite25_Out-2132450777|) .cse0))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-2132450777, ~z$flush_delayed~0=~z$flush_delayed~0_In-2132450777, ~z~0=~z~0_In-2132450777} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In-2132450777, P2Thread1of1ForFork1_#t~ite25=|P2Thread1of1ForFork1_#t~ite25_Out-2132450777|, ~z$flush_delayed~0=~z$flush_delayed~0_In-2132450777, ~z~0=~z~0_In-2132450777} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-18 12:47:23,406 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [988] [988] L830-->L830-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd4~0_In-39587550 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-39587550 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd4~0_In-39587550 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-39587550 256)))) (or (and (= 0 |P3Thread1of1ForFork2_#t~ite52_Out-39587550|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In-39587550 |P3Thread1of1ForFork2_#t~ite52_Out-39587550|)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-39587550, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-39587550, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-39587550, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-39587550} OutVars{P3Thread1of1ForFork2_#t~ite52=|P3Thread1of1ForFork2_#t~ite52_Out-39587550|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-39587550, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-39587550, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-39587550, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-39587550} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite52] because there is no mapped edge [2019-12-18 12:47:23,406 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [996] [996] L831-->L832: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In-432165568 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-432165568 256)))) (or (and (not .cse0) (not .cse1) (= 0 ~z$r_buff0_thd4~0_Out-432165568)) (and (= ~z$r_buff0_thd4~0_Out-432165568 ~z$r_buff0_thd4~0_In-432165568) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-432165568, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-432165568} OutVars{P3Thread1of1ForFork2_#t~ite53=|P3Thread1of1ForFork2_#t~ite53_Out-432165568|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-432165568, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-432165568} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite53, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-18 12:47:23,407 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [995] [995] L832-->L832-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In-1920080427 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-1920080427 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd4~0_In-1920080427 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1920080427 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P3Thread1of1ForFork2_#t~ite54_Out-1920080427| 0)) (and (or .cse0 .cse1) (= ~z$r_buff1_thd4~0_In-1920080427 |P3Thread1of1ForFork2_#t~ite54_Out-1920080427|) (or .cse3 .cse2)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1920080427, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1920080427, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1920080427, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1920080427} OutVars{P3Thread1of1ForFork2_#t~ite54=|P3Thread1of1ForFork2_#t~ite54_Out-1920080427|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1920080427, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1920080427, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1920080427, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1920080427} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite54] because there is no mapped edge [2019-12-18 12:47:23,407 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1021] [1021] L832-2-->P3EXIT: Formula: (and (= 0 |v_P3Thread1of1ForFork2_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_52 1) v_~__unbuffered_cnt~0_51) (= |v_P3Thread1of1ForFork2_#t~ite54_24| v_~z$r_buff1_thd4~0_191) (= 0 |v_P3Thread1of1ForFork2_#res.base_5|)) InVars {P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_24|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_52} OutVars{P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_23|, P3Thread1of1ForFork2_#res.base=|v_P3Thread1of1ForFork2_#res.base_5|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_191, P3Thread1of1ForFork2_#res.offset=|v_P3Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_51} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite54, P3Thread1of1ForFork2_#res.base, ~z$r_buff1_thd4~0, P3Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 12:47:23,407 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1023] [1023] L783-2-->P2EXIT: Formula: (and (= v_~__unbuffered_cnt~0_61 (+ v_~__unbuffered_cnt~0_62 1)) (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= 0 v_~z$flush_delayed~0_137) (= v_~z~0_175 |v_P2Thread1of1ForFork1_#t~ite25_38|)) InVars {P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62} OutVars{P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_37|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61, ~z$flush_delayed~0=v_~z$flush_delayed~0_137, ~z~0=v_~z~0_175, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25, P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-18 12:47:23,408 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [922] [922] L861-->L863-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (or (= 0 (mod v_~z$w_buff0_used~0_139 256)) (= 0 (mod v_~z$r_buff0_thd0~0_18 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_18, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_139, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_18, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_139, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 12:47:23,408 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [975] [975] L863-2-->L863-4: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd0~0_In-1938488153 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1938488153 256)))) (or (and (= ~z~0_In-1938488153 |ULTIMATE.start_main_#t~ite59_Out-1938488153|) (or .cse0 .cse1)) (and (not .cse1) (= ~z$w_buff1~0_In-1938488153 |ULTIMATE.start_main_#t~ite59_Out-1938488153|) (not .cse0)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1938488153, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1938488153, ~z$w_buff1~0=~z$w_buff1~0_In-1938488153, ~z~0=~z~0_In-1938488153} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1938488153, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1938488153, ~z$w_buff1~0=~z$w_buff1~0_In-1938488153, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out-1938488153|, ~z~0=~z~0_In-1938488153} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-18 12:47:23,408 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [946] [946] L863-4-->L864: Formula: (= v_~z~0_54 |v_ULTIMATE.start_main_#t~ite59_8|) InVars {ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_8|} OutVars{ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_10|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_7|, ~z~0=v_~z~0_54} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite59, ~z~0] because there is no mapped edge [2019-12-18 12:47:23,408 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [978] [978] L864-->L864-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In2088888782 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In2088888782 256)))) (or (and (= |ULTIMATE.start_main_#t~ite61_Out2088888782| 0) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite61_Out2088888782| ~z$w_buff0_used~0_In2088888782) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2088888782, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2088888782} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2088888782, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out2088888782|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2088888782} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-18 12:47:23,409 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [973] [973] L865-->L865-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In1602867184 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In1602867184 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In1602867184 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In1602867184 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite62_Out1602867184|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite62_Out1602867184| ~z$w_buff1_used~0_In1602867184)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1602867184, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1602867184, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1602867184, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1602867184} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out1602867184|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1602867184, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1602867184, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1602867184, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1602867184} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-18 12:47:23,410 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [991] [991] L866-->L866-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In531184776 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In531184776 256)))) (or (and (= ~z$r_buff0_thd0~0_In531184776 |ULTIMATE.start_main_#t~ite63_Out531184776|) (or .cse0 .cse1)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite63_Out531184776| 0) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In531184776, ~z$w_buff0_used~0=~z$w_buff0_used~0_In531184776} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out531184776|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In531184776, ~z$w_buff0_used~0=~z$w_buff0_used~0_In531184776} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-18 12:47:23,411 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [980] [980] L867-->L867-2: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd0~0_In-1036486651 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In-1036486651 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-1036486651 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-1036486651 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd0~0_In-1036486651 |ULTIMATE.start_main_#t~ite64_Out-1036486651|)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |ULTIMATE.start_main_#t~ite64_Out-1036486651|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1036486651, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1036486651, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1036486651, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1036486651} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1036486651, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1036486651, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1036486651, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1036486651, ULTIMATE.start_main_#t~ite64=|ULTIMATE.start_main_#t~ite64_Out-1036486651|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-18 12:47:23,411 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1043] [1043] L867-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 0 v_~__unbuffered_p0_EAX~0_31) (= 0 v_~__unbuffered_p2_EAX~0_33) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_~y~0_56 2) (= v_~z$r_buff1_thd0~0_171 |v_ULTIMATE.start_main_#t~ite64_41|) (= (mod v_~main$tmp_guard1~0_19 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= 1 v_~__unbuffered_p3_EAX~0_35) (= v_~main$tmp_guard1~0_19 0) (= 0 v_~__unbuffered_p3_EBX~0_22)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_31, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_35, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_33, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_22, ~y~0=v_~y~0_56, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_41|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_31, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_171, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_35, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_19, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_33, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_22, ~y~0=v_~y~0_56, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_40|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite64, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 12:47:23,551 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 12:47:23 BasicIcfg [2019-12-18 12:47:23,551 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 12:47:23,553 INFO L168 Benchmark]: Toolchain (without parser) took 159253.58 ms. Allocated memory was 144.2 MB in the beginning and 4.0 GB in the end (delta: 3.8 GB). Free memory was 100.1 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. [2019-12-18 12:47:23,554 INFO L168 Benchmark]: CDTParser took 1.49 ms. Allocated memory is still 144.2 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-18 12:47:23,554 INFO L168 Benchmark]: CACSL2BoogieTranslator took 769.65 ms. Allocated memory was 144.2 MB in the beginning and 201.3 MB in the end (delta: 57.1 MB). Free memory was 99.8 MB in the beginning and 153.6 MB in the end (delta: -53.8 MB). Peak memory consumption was 22.0 MB. Max. memory is 7.1 GB. [2019-12-18 12:47:23,555 INFO L168 Benchmark]: Boogie Procedure Inliner took 81.82 ms. Allocated memory is still 201.3 MB. Free memory was 153.6 MB in the beginning and 150.3 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2019-12-18 12:47:23,556 INFO L168 Benchmark]: Boogie Preprocessor took 43.34 ms. Allocated memory is still 201.3 MB. Free memory was 150.3 MB in the beginning and 147.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 12:47:23,556 INFO L168 Benchmark]: RCFGBuilder took 957.54 ms. Allocated memory is still 201.3 MB. Free memory was 147.6 MB in the beginning and 90.3 MB in the end (delta: 57.3 MB). Peak memory consumption was 57.3 MB. Max. memory is 7.1 GB. [2019-12-18 12:47:23,557 INFO L168 Benchmark]: TraceAbstraction took 157394.13 ms. Allocated memory was 201.3 MB in the beginning and 4.0 GB in the end (delta: 3.8 GB). Free memory was 89.6 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. [2019-12-18 12:47:23,560 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.49 ms. Allocated memory is still 144.2 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 769.65 ms. Allocated memory was 144.2 MB in the beginning and 201.3 MB in the end (delta: 57.1 MB). Free memory was 99.8 MB in the beginning and 153.6 MB in the end (delta: -53.8 MB). Peak memory consumption was 22.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 81.82 ms. Allocated memory is still 201.3 MB. Free memory was 153.6 MB in the beginning and 150.3 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.34 ms. Allocated memory is still 201.3 MB. Free memory was 150.3 MB in the beginning and 147.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 957.54 ms. Allocated memory is still 201.3 MB. Free memory was 147.6 MB in the beginning and 90.3 MB in the end (delta: 57.3 MB). Peak memory consumption was 57.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 157394.13 ms. Allocated memory was 201.3 MB in the beginning and 4.0 GB in the end (delta: 3.8 GB). Free memory was 89.6 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 7.4s, 211 ProgramPointsBefore, 112 ProgramPointsAfterwards, 254 TransitionsBefore, 131 TransitionsAfterwards, 26510 CoEnabledTransitionPairs, 8 FixpointIterations, 37 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 51 ConcurrentYvCompositions, 29 ChoiceCompositions, 11182 VarBasedMoverChecksPositive, 338 VarBasedMoverChecksNegative, 64 SemBasedMoverChecksPositive, 381 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.7s, 0 MoverChecksTotal, 142340 CheckedPairsTotal, 134 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L851] FCALL, FORK 0 pthread_create(&t541, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L853] FCALL, FORK 0 pthread_create(&t542, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L855] FCALL, FORK 0 pthread_create(&t543, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L857] FCALL, FORK 0 pthread_create(&t544, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L796] 4 z$w_buff1 = z$w_buff0 [L797] 4 z$w_buff0 = 1 [L798] 4 z$w_buff1_used = z$w_buff0_used [L799] 4 z$w_buff0_used = (_Bool)1 [L813] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L813] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L814] EXPR 4 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L814] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L815] EXPR 4 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L815] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L816] EXPR 4 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L816] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L817] EXPR 4 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L817] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L819] EXPR 4 weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L819] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L820] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L821] 4 z = z$flush_delayed ? z$mem_tmp : z [L822] 4 z$flush_delayed = (_Bool)0 [L825] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L828] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 3 y = 2 [L771] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L772] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L773] 3 z$flush_delayed = weak$$choice2 [L774] 3 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L776] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L776] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L777] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))=0, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L778] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L778] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L779] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L779] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L780] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3))=0, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L781] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L781] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L782] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L828] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L829] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L830] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L859] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L864] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L865] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L866] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 199 locations, 2 error locations. Result: UNSAFE, OverallTime: 156.9s, OverallIterations: 21, TraceHistogramMax: 1, AutomataDifference: 55.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4245 SDtfs, 5279 SDslu, 6318 SDs, 0 SdLazy, 2001 SolverSat, 214 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 106 GetRequests, 23 SyntacticMatches, 7 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=220082occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 81.0s AutomataMinimizationTime, 20 MinimizatonAttempts, 149002 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 770 NumberOfCodeBlocks, 770 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 684 ConstructedInterpolants, 0 QuantifiedInterpolants, 92954 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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...