/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/mix035_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 22:23:40,174 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 22:23:40,176 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 22:23:40,194 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 22:23:40,195 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 22:23:40,197 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 22:23:40,198 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 22:23:40,208 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 22:23:40,211 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 22:23:40,214 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 22:23:40,216 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 22:23:40,217 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 22:23:40,217 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 22:23:40,218 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 22:23:40,219 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 22:23:40,221 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 22:23:40,222 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 22:23:40,222 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 22:23:40,225 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 22:23:40,229 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 22:23:40,233 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 22:23:40,234 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 22:23:40,235 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 22:23:40,235 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 22:23:40,238 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 22:23:40,238 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 22:23:40,238 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 22:23:40,240 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 22:23:40,241 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 22:23:40,242 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 22:23:40,242 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 22:23:40,243 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 22:23:40,244 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 22:23:40,245 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 22:23:40,246 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 22:23:40,246 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 22:23:40,248 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 22:23:40,248 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 22:23:40,248 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 22:23:40,251 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 22:23:40,253 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 22:23:40,254 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-26 22:23:40,270 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 22:23:40,271 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 22:23:40,272 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 22:23:40,272 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 22:23:40,272 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 22:23:40,272 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 22:23:40,273 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 22:23:40,273 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 22:23:40,273 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 22:23:40,273 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 22:23:40,273 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 22:23:40,273 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 22:23:40,274 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 22:23:40,274 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 22:23:40,274 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 22:23:40,274 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 22:23:40,274 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 22:23:40,275 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 22:23:40,275 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 22:23:40,275 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 22:23:40,275 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 22:23:40,275 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 22:23:40,276 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 22:23:40,276 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 22:23:40,276 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 22:23:40,276 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 22:23:40,276 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 22:23:40,277 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 22:23:40,277 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 22:23:40,277 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 22:23:40,553 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 22:23:40,565 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 22:23:40,569 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 22:23:40,571 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 22:23:40,571 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 22:23:40,572 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix035_tso.opt.i [2019-12-26 22:23:40,636 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cbb098551/fcd7146c0d3d44a38a00a441b4c6ba01/FLAG9abbf2c06 [2019-12-26 22:23:41,204 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 22:23:41,205 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix035_tso.opt.i [2019-12-26 22:23:41,232 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cbb098551/fcd7146c0d3d44a38a00a441b4c6ba01/FLAG9abbf2c06 [2019-12-26 22:23:41,477 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cbb098551/fcd7146c0d3d44a38a00a441b4c6ba01 [2019-12-26 22:23:41,488 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 22:23:41,489 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 22:23:41,490 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 22:23:41,490 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 22:23:41,496 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 22:23:41,497 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 10:23:41" (1/1) ... [2019-12-26 22:23:41,500 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26ede25d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:23:41, skipping insertion in model container [2019-12-26 22:23:41,500 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 10:23:41" (1/1) ... [2019-12-26 22:23:41,508 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 22:23:41,553 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 22:23:42,166 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 22:23:42,184 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 22:23:42,253 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 22:23:42,331 INFO L208 MainTranslator]: Completed translation [2019-12-26 22:23:42,332 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:23:42 WrapperNode [2019-12-26 22:23:42,332 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 22:23:42,333 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 22:23:42,333 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 22:23:42,333 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 22:23:42,343 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:23:42" (1/1) ... [2019-12-26 22:23:42,367 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:23:42" (1/1) ... [2019-12-26 22:23:42,402 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 22:23:42,402 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 22:23:42,402 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 22:23:42,403 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 22:23:42,412 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:23:42" (1/1) ... [2019-12-26 22:23:42,412 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:23:42" (1/1) ... [2019-12-26 22:23:42,417 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:23:42" (1/1) ... [2019-12-26 22:23:42,417 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:23:42" (1/1) ... [2019-12-26 22:23:42,426 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:23:42" (1/1) ... [2019-12-26 22:23:42,430 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:23:42" (1/1) ... [2019-12-26 22:23:42,433 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:23:42" (1/1) ... [2019-12-26 22:23:42,438 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 22:23:42,438 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 22:23:42,438 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 22:23:42,439 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 22:23:42,440 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:23:42" (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-26 22:23:42,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 22:23:42,507 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 22:23:42,508 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 22:23:42,508 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 22:23:42,508 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 22:23:42,509 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 22:23:42,509 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 22:23:42,509 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 22:23:42,509 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-26 22:23:42,510 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-26 22:23:42,510 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 22:23:42,510 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 22:23:42,510 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 22:23:42,512 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-26 22:23:43,197 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 22:23:43,197 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 22:23:43,198 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 10:23:43 BoogieIcfgContainer [2019-12-26 22:23:43,199 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 22:23:43,200 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 22:23:43,200 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 22:23:43,203 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 22:23:43,204 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 10:23:41" (1/3) ... [2019-12-26 22:23:43,205 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c92adb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 10:23:43, skipping insertion in model container [2019-12-26 22:23:43,205 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:23:42" (2/3) ... [2019-12-26 22:23:43,206 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c92adb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 10:23:43, skipping insertion in model container [2019-12-26 22:23:43,206 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 10:23:43" (3/3) ... [2019-12-26 22:23:43,208 INFO L109 eAbstractionObserver]: Analyzing ICFG mix035_tso.opt.i [2019-12-26 22:23:43,219 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 22:23:43,219 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 22:23:43,227 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 22:23:43,228 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 22:23:43,267 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,268 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,268 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,268 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,269 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,269 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,272 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,273 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,277 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,278 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,283 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,283 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,283 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,284 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,284 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,285 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,286 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,286 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,286 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,286 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,287 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,287 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,287 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,287 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,288 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,288 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,288 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,290 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,290 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,290 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,290 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,291 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,291 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,291 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,291 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,294 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,294 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,294 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,295 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,295 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,295 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,295 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,296 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,296 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,296 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,296 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,297 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,297 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,297 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,298 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,298 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,299 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,299 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,299 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,300 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,300 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,301 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,301 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,301 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,301 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,301 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,302 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,302 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,302 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,303 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,303 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,303 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,303 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,303 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,304 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,306 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,306 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,307 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,307 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,307 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,307 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,308 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,308 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,308 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,309 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,309 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,309 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,309 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,310 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,310 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,310 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,311 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,311 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,311 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,311 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,311 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,312 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,312 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,312 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,313 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,313 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,313 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,313 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,313 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,314 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,314 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,314 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,314 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,315 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,336 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,336 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,336 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,336 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,339 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,339 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,339 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,340 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,340 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,340 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,340 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,340 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,341 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,341 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,341 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,341 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,341 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,341 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,342 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,342 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,342 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,342 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,342 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,343 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,344 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,344 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,347 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,347 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,347 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,347 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,347 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,348 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,349 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,350 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,350 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,350 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,350 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,350 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:43,373 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-26 22:23:43,391 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 22:23:43,391 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 22:23:43,391 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 22:23:43,392 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 22:23:43,392 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 22:23:43,392 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 22:23:43,392 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 22:23:43,392 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 22:23:43,408 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 154 places, 179 transitions [2019-12-26 22:23:43,410 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 154 places, 179 transitions [2019-12-26 22:23:43,498 INFO L132 PetriNetUnfolder]: 35/176 cut-off events. [2019-12-26 22:23:43,498 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 22:23:43,511 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 176 events. 35/176 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 358 event pairs. 0/139 useless extension candidates. Maximal degree in co-relation 143. Up to 2 conditions per place. [2019-12-26 22:23:43,530 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 154 places, 179 transitions [2019-12-26 22:23:43,593 INFO L132 PetriNetUnfolder]: 35/176 cut-off events. [2019-12-26 22:23:43,593 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 22:23:43,602 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 176 events. 35/176 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 358 event pairs. 0/139 useless extension candidates. Maximal degree in co-relation 143. Up to 2 conditions per place. [2019-12-26 22:23:43,620 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11400 [2019-12-26 22:23:43,621 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 22:23:48,613 WARN L192 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-26 22:23:48,760 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-26 22:23:48,790 INFO L206 etLargeBlockEncoding]: Checked pairs total: 44280 [2019-12-26 22:23:48,790 INFO L214 etLargeBlockEncoding]: Total number of compositions: 113 [2019-12-26 22:23:48,794 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 71 places, 79 transitions [2019-12-26 22:23:49,479 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 12302 states. [2019-12-26 22:23:49,481 INFO L276 IsEmpty]: Start isEmpty. Operand 12302 states. [2019-12-26 22:23:49,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-26 22:23:49,486 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:23:49,487 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:23:49,487 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:23:49,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:23:49,492 INFO L82 PathProgramCache]: Analyzing trace with hash -941376449, now seen corresponding path program 1 times [2019-12-26 22:23:49,500 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:23:49,500 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803645247] [2019-12-26 22:23:49,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:23:49,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:23:49,757 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-26 22:23:49,758 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803645247] [2019-12-26 22:23:49,759 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:23:49,759 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 22:23:49,760 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547289099] [2019-12-26 22:23:49,765 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:23:49,766 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:23:49,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:23:49,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:23:49,786 INFO L87 Difference]: Start difference. First operand 12302 states. Second operand 3 states. [2019-12-26 22:23:50,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:23:50,033 INFO L93 Difference]: Finished difference Result 11966 states and 45788 transitions. [2019-12-26 22:23:50,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:23:50,035 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-26 22:23:50,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:23:50,167 INFO L225 Difference]: With dead ends: 11966 [2019-12-26 22:23:50,168 INFO L226 Difference]: Without dead ends: 11270 [2019-12-26 22:23:50,169 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-26 22:23:50,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11270 states. [2019-12-26 22:23:50,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11270 to 11270. [2019-12-26 22:23:50,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11270 states. [2019-12-26 22:23:50,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11270 states to 11270 states and 43054 transitions. [2019-12-26 22:23:50,801 INFO L78 Accepts]: Start accepts. Automaton has 11270 states and 43054 transitions. Word has length 7 [2019-12-26 22:23:50,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:23:50,802 INFO L462 AbstractCegarLoop]: Abstraction has 11270 states and 43054 transitions. [2019-12-26 22:23:50,802 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:23:50,802 INFO L276 IsEmpty]: Start isEmpty. Operand 11270 states and 43054 transitions. [2019-12-26 22:23:50,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-26 22:23:50,808 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:23:50,808 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:23:50,808 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:23:50,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:23:50,809 INFO L82 PathProgramCache]: Analyzing trace with hash -941453907, now seen corresponding path program 1 times [2019-12-26 22:23:50,809 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:23:50,809 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795436383] [2019-12-26 22:23:50,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:23:50,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:23:50,905 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-26 22:23:50,905 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795436383] [2019-12-26 22:23:50,906 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:23:50,906 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:23:50,906 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919179876] [2019-12-26 22:23:50,907 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:23:50,908 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:23:50,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:23:50,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:23:50,909 INFO L87 Difference]: Start difference. First operand 11270 states and 43054 transitions. Second operand 3 states. [2019-12-26 22:23:51,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:23:51,048 INFO L93 Difference]: Finished difference Result 6790 states and 22693 transitions. [2019-12-26 22:23:51,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:23:51,049 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-26 22:23:51,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:23:51,108 INFO L225 Difference]: With dead ends: 6790 [2019-12-26 22:23:51,108 INFO L226 Difference]: Without dead ends: 6790 [2019-12-26 22:23:51,111 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-26 22:23:51,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6790 states. [2019-12-26 22:23:51,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6790 to 6790. [2019-12-26 22:23:51,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6790 states. [2019-12-26 22:23:52,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6790 states to 6790 states and 22693 transitions. [2019-12-26 22:23:52,154 INFO L78 Accepts]: Start accepts. Automaton has 6790 states and 22693 transitions. Word has length 13 [2019-12-26 22:23:52,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:23:52,154 INFO L462 AbstractCegarLoop]: Abstraction has 6790 states and 22693 transitions. [2019-12-26 22:23:52,154 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:23:52,154 INFO L276 IsEmpty]: Start isEmpty. Operand 6790 states and 22693 transitions. [2019-12-26 22:23:52,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-26 22:23:52,159 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:23:52,159 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:23:52,160 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:23:52,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:23:52,160 INFO L82 PathProgramCache]: Analyzing trace with hash 369435328, now seen corresponding path program 1 times [2019-12-26 22:23:52,160 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:23:52,161 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205698759] [2019-12-26 22:23:52,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:23:52,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:23:52,273 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-26 22:23:52,274 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205698759] [2019-12-26 22:23:52,276 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:23:52,277 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:23:52,277 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042129026] [2019-12-26 22:23:52,277 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:23:52,277 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:23:52,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:23:52,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:23:52,278 INFO L87 Difference]: Start difference. First operand 6790 states and 22693 transitions. Second operand 4 states. [2019-12-26 22:23:52,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:23:52,325 INFO L93 Difference]: Finished difference Result 1617 states and 4342 transitions. [2019-12-26 22:23:52,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 22:23:52,326 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-26 22:23:52,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:23:52,331 INFO L225 Difference]: With dead ends: 1617 [2019-12-26 22:23:52,332 INFO L226 Difference]: Without dead ends: 1617 [2019-12-26 22:23:52,332 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:23:52,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1617 states. [2019-12-26 22:23:52,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1617 to 1617. [2019-12-26 22:23:52,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1617 states. [2019-12-26 22:23:52,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1617 states to 1617 states and 4342 transitions. [2019-12-26 22:23:52,371 INFO L78 Accepts]: Start accepts. Automaton has 1617 states and 4342 transitions. Word has length 14 [2019-12-26 22:23:52,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:23:52,372 INFO L462 AbstractCegarLoop]: Abstraction has 1617 states and 4342 transitions. [2019-12-26 22:23:52,372 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:23:52,372 INFO L276 IsEmpty]: Start isEmpty. Operand 1617 states and 4342 transitions. [2019-12-26 22:23:52,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-26 22:23:52,373 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:23:52,373 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:23:52,374 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:23:52,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:23:52,374 INFO L82 PathProgramCache]: Analyzing trace with hash 166730424, now seen corresponding path program 1 times [2019-12-26 22:23:52,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:23:52,375 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944843803] [2019-12-26 22:23:52,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:23:52,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:23:52,415 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-26 22:23:52,416 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944843803] [2019-12-26 22:23:52,416 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:23:52,416 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:23:52,416 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668261716] [2019-12-26 22:23:52,417 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:23:52,417 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:23:52,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:23:52,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:23:52,418 INFO L87 Difference]: Start difference. First operand 1617 states and 4342 transitions. Second operand 3 states. [2019-12-26 22:23:52,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:23:52,480 INFO L93 Difference]: Finished difference Result 2388 states and 6272 transitions. [2019-12-26 22:23:52,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:23:52,480 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-26 22:23:52,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:23:52,487 INFO L225 Difference]: With dead ends: 2388 [2019-12-26 22:23:52,487 INFO L226 Difference]: Without dead ends: 2388 [2019-12-26 22:23:52,488 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-26 22:23:52,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2388 states. [2019-12-26 22:23:52,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2388 to 1795. [2019-12-26 22:23:52,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1795 states. [2019-12-26 22:23:52,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1795 states to 1795 states and 4765 transitions. [2019-12-26 22:23:52,544 INFO L78 Accepts]: Start accepts. Automaton has 1795 states and 4765 transitions. Word has length 16 [2019-12-26 22:23:52,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:23:52,544 INFO L462 AbstractCegarLoop]: Abstraction has 1795 states and 4765 transitions. [2019-12-26 22:23:52,544 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:23:52,545 INFO L276 IsEmpty]: Start isEmpty. Operand 1795 states and 4765 transitions. [2019-12-26 22:23:52,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-26 22:23:52,546 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:23:52,546 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:23:52,546 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:23:52,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:23:52,547 INFO L82 PathProgramCache]: Analyzing trace with hash 166596039, now seen corresponding path program 1 times [2019-12-26 22:23:52,547 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:23:52,548 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527299266] [2019-12-26 22:23:52,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:23:52,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:23:52,640 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-26 22:23:52,641 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527299266] [2019-12-26 22:23:52,641 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:23:52,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:23:52,641 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86041725] [2019-12-26 22:23:52,642 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:23:52,642 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:23:52,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:23:52,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:23:52,642 INFO L87 Difference]: Start difference. First operand 1795 states and 4765 transitions. Second operand 4 states. [2019-12-26 22:23:52,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:23:52,808 INFO L93 Difference]: Finished difference Result 2341 states and 6074 transitions. [2019-12-26 22:23:52,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:23:52,809 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-26 22:23:52,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:23:52,816 INFO L225 Difference]: With dead ends: 2341 [2019-12-26 22:23:52,816 INFO L226 Difference]: Without dead ends: 2341 [2019-12-26 22:23:52,816 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-26 22:23:52,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2341 states. [2019-12-26 22:23:52,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2341 to 2141. [2019-12-26 22:23:52,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2141 states. [2019-12-26 22:23:52,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2141 states to 2141 states and 5644 transitions. [2019-12-26 22:23:52,873 INFO L78 Accepts]: Start accepts. Automaton has 2141 states and 5644 transitions. Word has length 16 [2019-12-26 22:23:52,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:23:52,873 INFO L462 AbstractCegarLoop]: Abstraction has 2141 states and 5644 transitions. [2019-12-26 22:23:52,873 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:23:52,873 INFO L276 IsEmpty]: Start isEmpty. Operand 2141 states and 5644 transitions. [2019-12-26 22:23:52,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-26 22:23:52,874 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:23:52,874 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:23:52,875 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:23:52,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:23:52,875 INFO L82 PathProgramCache]: Analyzing trace with hash 289916209, now seen corresponding path program 1 times [2019-12-26 22:23:52,875 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:23:52,876 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456956183] [2019-12-26 22:23:52,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:23:52,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:23:52,952 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-26 22:23:52,952 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456956183] [2019-12-26 22:23:52,953 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:23:52,953 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:23:52,954 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358170595] [2019-12-26 22:23:52,954 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:23:52,954 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:23:52,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:23:52,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:23:52,955 INFO L87 Difference]: Start difference. First operand 2141 states and 5644 transitions. Second operand 4 states. [2019-12-26 22:23:53,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:23:53,124 INFO L93 Difference]: Finished difference Result 2723 states and 7055 transitions. [2019-12-26 22:23:53,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:23:53,124 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-26 22:23:53,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:23:53,132 INFO L225 Difference]: With dead ends: 2723 [2019-12-26 22:23:53,132 INFO L226 Difference]: Without dead ends: 2723 [2019-12-26 22:23:53,132 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-26 22:23:53,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2723 states. [2019-12-26 22:23:53,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2723 to 2242. [2019-12-26 22:23:53,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2242 states. [2019-12-26 22:23:53,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2242 states to 2242 states and 5899 transitions. [2019-12-26 22:23:53,186 INFO L78 Accepts]: Start accepts. Automaton has 2242 states and 5899 transitions. Word has length 16 [2019-12-26 22:23:53,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:23:53,186 INFO L462 AbstractCegarLoop]: Abstraction has 2242 states and 5899 transitions. [2019-12-26 22:23:53,186 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:23:53,186 INFO L276 IsEmpty]: Start isEmpty. Operand 2242 states and 5899 transitions. [2019-12-26 22:23:53,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-26 22:23:53,190 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:23:53,191 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-26 22:23:53,191 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:23:53,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:23:53,191 INFO L82 PathProgramCache]: Analyzing trace with hash -45017831, now seen corresponding path program 1 times [2019-12-26 22:23:53,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:23:53,192 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705821961] [2019-12-26 22:23:53,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:23:53,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:23:53,253 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-26 22:23:53,253 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705821961] [2019-12-26 22:23:53,254 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:23:53,254 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 22:23:53,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394306322] [2019-12-26 22:23:53,255 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:23:53,255 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:23:53,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:23:53,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:23:53,255 INFO L87 Difference]: Start difference. First operand 2242 states and 5899 transitions. Second operand 5 states. [2019-12-26 22:23:53,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:23:53,289 INFO L93 Difference]: Finished difference Result 1366 states and 3668 transitions. [2019-12-26 22:23:53,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:23:53,289 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-12-26 22:23:53,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:23:53,294 INFO L225 Difference]: With dead ends: 1366 [2019-12-26 22:23:53,294 INFO L226 Difference]: Without dead ends: 1366 [2019-12-26 22:23:53,294 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:23:53,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1366 states. [2019-12-26 22:23:53,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1366 to 1282. [2019-12-26 22:23:53,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1282 states. [2019-12-26 22:23:53,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1282 states to 1282 states and 3460 transitions. [2019-12-26 22:23:53,321 INFO L78 Accepts]: Start accepts. Automaton has 1282 states and 3460 transitions. Word has length 29 [2019-12-26 22:23:53,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:23:53,322 INFO L462 AbstractCegarLoop]: Abstraction has 1282 states and 3460 transitions. [2019-12-26 22:23:53,322 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:23:53,322 INFO L276 IsEmpty]: Start isEmpty. Operand 1282 states and 3460 transitions. [2019-12-26 22:23:53,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-26 22:23:53,326 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:23:53,326 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] [2019-12-26 22:23:53,326 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:23:53,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:23:53,326 INFO L82 PathProgramCache]: Analyzing trace with hash -651252201, now seen corresponding path program 1 times [2019-12-26 22:23:53,327 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:23:53,327 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504906280] [2019-12-26 22:23:53,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:23:53,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:23:53,458 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-26 22:23:53,459 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504906280] [2019-12-26 22:23:53,459 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:23:53,459 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:23:53,459 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035029268] [2019-12-26 22:23:53,460 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:23:53,460 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:23:53,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:23:53,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:23:53,460 INFO L87 Difference]: Start difference. First operand 1282 states and 3460 transitions. Second operand 4 states. [2019-12-26 22:23:53,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:23:53,488 INFO L93 Difference]: Finished difference Result 1917 states and 4864 transitions. [2019-12-26 22:23:53,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 22:23:53,489 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2019-12-26 22:23:53,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:23:53,492 INFO L225 Difference]: With dead ends: 1917 [2019-12-26 22:23:53,492 INFO L226 Difference]: Without dead ends: 673 [2019-12-26 22:23:53,493 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-26 22:23:53,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2019-12-26 22:23:53,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 673. [2019-12-26 22:23:53,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 673 states. [2019-12-26 22:23:53,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 1475 transitions. [2019-12-26 22:23:53,509 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 1475 transitions. Word has length 44 [2019-12-26 22:23:53,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:23:53,511 INFO L462 AbstractCegarLoop]: Abstraction has 673 states and 1475 transitions. [2019-12-26 22:23:53,511 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:23:53,511 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 1475 transitions. [2019-12-26 22:23:53,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-26 22:23:53,514 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:23:53,515 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] [2019-12-26 22:23:53,515 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:23:53,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:23:53,515 INFO L82 PathProgramCache]: Analyzing trace with hash 1022585143, now seen corresponding path program 2 times [2019-12-26 22:23:53,515 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:23:53,516 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504083986] [2019-12-26 22:23:53,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:23:53,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:23:53,609 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-26 22:23:53,609 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504083986] [2019-12-26 22:23:53,610 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:23:53,610 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:23:53,610 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595633659] [2019-12-26 22:23:53,610 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:23:53,610 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:23:53,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:23:53,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:23:53,612 INFO L87 Difference]: Start difference. First operand 673 states and 1475 transitions. Second operand 4 states. [2019-12-26 22:23:53,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:23:53,632 INFO L93 Difference]: Finished difference Result 1060 states and 2349 transitions. [2019-12-26 22:23:53,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 22:23:53,632 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2019-12-26 22:23:53,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:23:53,634 INFO L225 Difference]: With dead ends: 1060 [2019-12-26 22:23:53,635 INFO L226 Difference]: Without dead ends: 408 [2019-12-26 22:23:53,635 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-26 22:23:53,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2019-12-26 22:23:53,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 408. [2019-12-26 22:23:53,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2019-12-26 22:23:53,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 907 transitions. [2019-12-26 22:23:53,643 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 907 transitions. Word has length 44 [2019-12-26 22:23:53,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:23:53,643 INFO L462 AbstractCegarLoop]: Abstraction has 408 states and 907 transitions. [2019-12-26 22:23:53,643 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:23:53,644 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 907 transitions. [2019-12-26 22:23:53,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-26 22:23:53,645 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:23:53,645 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] [2019-12-26 22:23:53,645 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:23:53,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:23:53,646 INFO L82 PathProgramCache]: Analyzing trace with hash -891161673, now seen corresponding path program 3 times [2019-12-26 22:23:53,646 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:23:53,646 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174564982] [2019-12-26 22:23:53,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:23:53,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:23:53,810 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-26 22:23:53,810 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174564982] [2019-12-26 22:23:53,810 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:23:53,810 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:23:53,811 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641595782] [2019-12-26 22:23:53,811 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:23:53,811 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:23:53,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:23:53,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:23:53,812 INFO L87 Difference]: Start difference. First operand 408 states and 907 transitions. Second operand 3 states. [2019-12-26 22:23:53,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:23:53,832 INFO L93 Difference]: Finished difference Result 406 states and 902 transitions. [2019-12-26 22:23:53,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:23:53,833 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-12-26 22:23:53,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:23:53,835 INFO L225 Difference]: With dead ends: 406 [2019-12-26 22:23:53,835 INFO L226 Difference]: Without dead ends: 406 [2019-12-26 22:23:53,835 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-26 22:23:53,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2019-12-26 22:23:53,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 406. [2019-12-26 22:23:53,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 406 states. [2019-12-26 22:23:53,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 902 transitions. [2019-12-26 22:23:53,843 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 902 transitions. Word has length 44 [2019-12-26 22:23:53,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:23:53,844 INFO L462 AbstractCegarLoop]: Abstraction has 406 states and 902 transitions. [2019-12-26 22:23:53,844 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:23:53,844 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 902 transitions. [2019-12-26 22:23:53,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-26 22:23:53,846 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:23:53,846 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:23:53,846 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:23:53,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:23:53,847 INFO L82 PathProgramCache]: Analyzing trace with hash -252375621, now seen corresponding path program 1 times [2019-12-26 22:23:53,847 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:23:53,848 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944029025] [2019-12-26 22:23:53,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:23:53,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 22:23:53,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 22:23:54,019 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 22:23:54,019 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 22:23:54,023 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [732] [732] ULTIMATE.startENTRY-->L822: Formula: (let ((.cse0 (store |v_#valid_76| 0 0))) (and (= 0 v_~weak$$choice0~0_10) (= v_~y$w_buff1~0_255 0) (= 0 v_~y$w_buff0~0_383) (= v_~a~0_43 0) (= v_~y$r_buff0_thd1~0_30 0) (= 0 v_~y$read_delayed_var~0.offset_8) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t934~0.base_38|)) (= v_~y$w_buff0_used~0_658 0) (= 0 v_~__unbuffered_p0_EAX~0_49) (= v_~z~0_82 0) (= v_~y$read_delayed~0_8 0) (= v_~x~0_24 0) (= v_~weak$$choice2~0_156 0) (= |v_#length_27| (store |v_#length_28| |v_ULTIMATE.start_main_~#t934~0.base_38| 4)) (= v_~__unbuffered_cnt~0_101 0) (= 0 v_~y$r_buff1_thd2~0_256) (= v_~y$w_buff1_used~0_429 0) (= 0 v_~y$r_buff0_thd3~0_155) (< 0 |v_#StackHeapBarrier_18|) (= 0 v_~y$flush_delayed~0_35) (= 0 |v_#NULL.base_4|) (= v_~main$tmp_guard0~0_20 0) (= 0 v_~__unbuffered_p1_EAX~0_63) (= 0 v_~__unbuffered_p2_EAX~0_107) (= (store .cse0 |v_ULTIMATE.start_main_~#t934~0.base_38| 1) |v_#valid_74|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t934~0.base_38| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t934~0.base_38|) |v_ULTIMATE.start_main_~#t934~0.offset_26| 0)) |v_#memory_int_17|) (= v_~y$mem_tmp~0_12 0) (= v_~y~0_134 0) (= |v_#NULL.offset_4| 0) (= 0 v_~y$read_delayed_var~0.base_8) (= |v_ULTIMATE.start_main_~#t934~0.offset_26| 0) (= 0 v_~y$r_buff0_thd2~0_301) (= v_~y$r_buff1_thd0~0_160 0) (= v_~__unbuffered_p2_EBX~0_107 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t934~0.base_38|) (= 0 v_~y$r_buff1_thd1~0_80) (= 0 v_~y$r_buff1_thd3~0_129) (= v_~y$r_buff0_thd0~0_90 0) (= v_~main$tmp_guard1~0_40 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_76|, #memory_int=|v_#memory_int_18|, #length=|v_#length_28|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_10|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_20|, #NULL.offset=|v_#NULL.offset_4|, ~y$read_delayed~0=v_~y$read_delayed~0_8, ~a~0=v_~a~0_43, ULTIMATE.start_main_~#t935~0.base=|v_ULTIMATE.start_main_~#t935~0.base_40|, ~y$mem_tmp~0=v_~y$mem_tmp~0_12, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_49, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_129, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_63, ULTIMATE.start_main_~#t936~0.offset=|v_ULTIMATE.start_main_~#t936~0.offset_19|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_30, ~y$flush_delayed~0=v_~y$flush_delayed~0_35, #length=|v_#length_27|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_107, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_107, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_32|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_68|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_34|, ~weak$$choice0~0=v_~weak$$choice0~0_10, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_79|, ~y$w_buff1~0=v_~y$w_buff1~0_255, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_8, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_301, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_101, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_160, ~x~0=v_~x~0_24, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_8, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_658, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_11|, ULTIMATE.start_main_~#t935~0.offset=|v_ULTIMATE.start_main_~#t935~0.offset_27|, ULTIMATE.start_main_~#t936~0.base=|v_ULTIMATE.start_main_~#t936~0.base_32|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_40, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_80, ~y$w_buff0~0=v_~y$w_buff0~0_383, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_155, ~y~0=v_~y~0_134, ULTIMATE.start_main_~#t934~0.base=|v_ULTIMATE.start_main_~#t934~0.base_38|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_66|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_66|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_20, #NULL.base=|v_#NULL.base_4|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_256, ULTIMATE.start_main_~#t934~0.offset=|v_ULTIMATE.start_main_~#t934~0.offset_26|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_27|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_90, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_17|, ~z~0=v_~z~0_82, ~weak$$choice2~0=v_~weak$$choice2~0_156, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_429} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_#t~nondet34, #NULL.offset, ~y$read_delayed~0, ~a~0, ULTIMATE.start_main_~#t935~0.base, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t936~0.offset, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite37, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_~#t935~0.offset, ULTIMATE.start_main_~#t936~0.base, ~main$tmp_guard1~0, ~y$r_buff1_thd1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_~#t934~0.base, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ULTIMATE.start_main_~#t934~0.offset, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-26 22:23:54,025 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L822-1-->L824: Formula: (and (= 0 (select |v_#valid_39| |v_ULTIMATE.start_main_~#t935~0.base_13|)) (= |v_ULTIMATE.start_main_~#t935~0.offset_11| 0) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t935~0.base_13| 4) |v_#length_17|) (= (store |v_#valid_39| |v_ULTIMATE.start_main_~#t935~0.base_13| 1) |v_#valid_38|) (not (= 0 |v_ULTIMATE.start_main_~#t935~0.base_13|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t935~0.base_13|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t935~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t935~0.base_13|) |v_ULTIMATE.start_main_~#t935~0.offset_11| 1)) |v_#memory_int_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_12|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t935~0.base=|v_ULTIMATE.start_main_~#t935~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, ULTIMATE.start_main_~#t935~0.offset=|v_ULTIMATE.start_main_~#t935~0.offset_11|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_11|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t935~0.base, ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t935~0.offset, #valid, #memory_int, #length] because there is no mapped edge [2019-12-26 22:23:54,025 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L824-1-->L826: Formula: (and (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t936~0.base_12| 1)) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t936~0.base_12| 4)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t936~0.base_12|) (= |v_ULTIMATE.start_main_~#t936~0.offset_10| 0) (= (select |v_#valid_35| |v_ULTIMATE.start_main_~#t936~0.base_12|) 0) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t936~0.base_12| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t936~0.base_12|) |v_ULTIMATE.start_main_~#t936~0.offset_10| 2)) |v_#memory_int_9|) (not (= |v_ULTIMATE.start_main_~#t936~0.base_12| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_10|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_6|, ULTIMATE.start_main_~#t936~0.offset=|v_ULTIMATE.start_main_~#t936~0.offset_10|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t936~0.base=|v_ULTIMATE.start_main_~#t936~0.base_12|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_~#t936~0.offset, #valid, #memory_int, ULTIMATE.start_main_~#t936~0.base, #length] because there is no mapped edge [2019-12-26 22:23:54,028 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [606] [606] L4-->L799: Formula: (and (= v_~y$r_buff0_thd3~0_16 v_~y$r_buff1_thd3~0_10) (not (= 0 v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_6)) (= v_~__unbuffered_p2_EBX~0_4 v_~a~0_4) (= 1 v_~z~0_3) (= v_~y$r_buff0_thd0~0_18 v_~y$r_buff1_thd0~0_10) (= v_~y$r_buff1_thd1~0_3 v_~y$r_buff0_thd1~0_3) (= v_~__unbuffered_p2_EAX~0_4 v_~z~0_3) (= v_~y$r_buff0_thd3~0_15 1) (= v_~y$r_buff0_thd2~0_37 v_~y$r_buff1_thd2~0_23)) InVars {~a~0=v_~a~0_4, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_16, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_18, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_37, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_3, P2Thread1of1ForFork2___VERIFIER_assert_~expression=v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_6} OutVars{~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_4, P2Thread1of1ForFork2___VERIFIER_assert_~expression=v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_6, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_23, ~a~0=v_~a~0_4, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_3, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_10, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_15, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_18, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_37, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_3, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_4, ~z~0=v_~z~0_3, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_10} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p2_EBX~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0, ~z~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-26 22:23:54,028 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] P0ENTRY-->P0EXIT: Formula: (and (= v_~x~0_18 v_~__unbuffered_p0_EAX~0_19) (= v_~a~0_27 1) (= v_P0Thread1of1ForFork0_~arg.base_15 |v_P0Thread1of1ForFork0_#in~arg.base_15|) (= |v_P0Thread1of1ForFork0_#res.base_11| 0) (= v_~__unbuffered_cnt~0_76 (+ v_~__unbuffered_cnt~0_77 1)) (= v_P0Thread1of1ForFork0_~arg.offset_15 |v_P0Thread1of1ForFork0_#in~arg.offset_15|) (= 0 |v_P0Thread1of1ForFork0_#res.offset_11|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_15|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_77, ~x~0=v_~x~0_18} OutVars{~a~0=v_~a~0_27, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_15|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_19, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_11|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_15|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_76, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_15, ~x~0=v_~x~0_18, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_15} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-26 22:23:54,031 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L758-->L758-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-1563990958 256)))) (or (and (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In-1563990958 256) 0))) (or (= (mod ~y$w_buff0_used~0_In-1563990958 256) 0) (and (= (mod ~y$w_buff1_used~0_In-1563990958 256) 0) .cse0) (and (= (mod ~y$r_buff1_thd2~0_In-1563990958 256) 0) .cse0))) .cse1 (= |P1Thread1of1ForFork1_#t~ite9_Out-1563990958| |P1Thread1of1ForFork1_#t~ite8_Out-1563990958|) (= ~y$w_buff0~0_In-1563990958 |P1Thread1of1ForFork1_#t~ite8_Out-1563990958|)) (and (= ~y$w_buff0~0_In-1563990958 |P1Thread1of1ForFork1_#t~ite9_Out-1563990958|) (= |P1Thread1of1ForFork1_#t~ite8_In-1563990958| |P1Thread1of1ForFork1_#t~ite8_Out-1563990958|) (not .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1563990958, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1563990958, ~y$w_buff0~0=~y$w_buff0~0_In-1563990958, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1563990958, P1Thread1of1ForFork1_#t~ite8=|P1Thread1of1ForFork1_#t~ite8_In-1563990958|, ~weak$$choice2~0=~weak$$choice2~0_In-1563990958, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1563990958} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1563990958, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1563990958, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out-1563990958|, ~y$w_buff0~0=~y$w_buff0~0_In-1563990958, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1563990958, P1Thread1of1ForFork1_#t~ite8=|P1Thread1of1ForFork1_#t~ite8_Out-1563990958|, ~weak$$choice2~0=~weak$$choice2~0_In-1563990958, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1563990958} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-26 22:23:54,037 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [638] [638] L762-->L763: Formula: (and (not (= (mod v_~weak$$choice2~0_22 256) 0)) (= v_~y$r_buff0_thd2~0_85 v_~y$r_buff0_thd2~0_84)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_85, ~weak$$choice2~0=v_~weak$$choice2~0_22} OutVars{P1Thread1of1ForFork1_#t~ite19=|v_P1Thread1of1ForFork1_#t~ite19_16|, P1Thread1of1ForFork1_#t~ite20=|v_P1Thread1of1ForFork1_#t~ite20_12|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_84, P1Thread1of1ForFork1_#t~ite21=|v_P1Thread1of1ForFork1_#t~ite21_9|, ~weak$$choice2~0=v_~weak$$choice2~0_22} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite19, P1Thread1of1ForFork1_#t~ite20, ~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-26 22:23:54,038 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L763-->L763-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-724431735 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite24_Out-724431735| ~y$r_buff1_thd2~0_In-724431735) (= |P1Thread1of1ForFork1_#t~ite23_In-724431735| |P1Thread1of1ForFork1_#t~ite23_Out-724431735|) (not .cse0)) (and (= |P1Thread1of1ForFork1_#t~ite23_Out-724431735| ~y$r_buff1_thd2~0_In-724431735) (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-724431735 256) 0))) (or (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In-724431735 256))) (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-724431735 256))) (= (mod ~y$w_buff0_used~0_In-724431735 256) 0))) .cse0 (= |P1Thread1of1ForFork1_#t~ite23_Out-724431735| |P1Thread1of1ForFork1_#t~ite24_Out-724431735|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-724431735, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-724431735, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-724431735, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In-724431735|, ~weak$$choice2~0=~weak$$choice2~0_In-724431735, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-724431735} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-724431735, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-724431735, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-724431735, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out-724431735|, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out-724431735|, ~weak$$choice2~0=~weak$$choice2~0_In-724431735, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-724431735} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24] because there is no mapped edge [2019-12-26 22:23:54,039 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [615] [615] L765-->L773: Formula: (and (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= 0 v_~y$flush_delayed~0_8) (not (= 0 (mod v_~y$flush_delayed~0_9 256))) (= v_~y~0_14 v_~y$mem_tmp~0_4)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_9, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~y~0=v_~y~0_14, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_11|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-26 22:23:54,040 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L800-->L800-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In-2061795028 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-2061795028 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite28_Out-2061795028| 0) (not .cse0) (not .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite28_Out-2061795028| ~y$w_buff0_used~0_In-2061795028) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2061795028, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2061795028} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2061795028, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2061795028, P2Thread1of1ForFork2_#t~ite28=|P2Thread1of1ForFork2_#t~ite28_Out-2061795028|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-26 22:23:54,041 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L801-->L801-2: Formula: (let ((.cse3 (= (mod ~y$r_buff1_thd3~0_In1367842540 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In1367842540 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In1367842540 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1367842540 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In1367842540 |P2Thread1of1ForFork2_#t~ite29_Out1367842540|)) (and (= 0 |P2Thread1of1ForFork2_#t~ite29_Out1367842540|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1367842540, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1367842540, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1367842540, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1367842540} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1367842540, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1367842540, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1367842540, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out1367842540|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1367842540} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-26 22:23:54,042 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L802-->L803: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In-1013553198 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1013553198 256)))) (or (and (not .cse0) (= ~y$r_buff0_thd3~0_Out-1013553198 0) (not .cse1)) (and (= ~y$r_buff0_thd3~0_In-1013553198 ~y$r_buff0_thd3~0_Out-1013553198) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1013553198, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1013553198} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1013553198, P2Thread1of1ForFork2_#t~ite30=|P2Thread1of1ForFork2_#t~ite30_Out-1013553198|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-1013553198} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite30, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-26 22:23:54,042 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [675] [675] L803-->L803-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In742299063 256))) (.cse3 (= (mod ~y$r_buff1_thd3~0_In742299063 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In742299063 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd3~0_In742299063 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite31_Out742299063| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= |P2Thread1of1ForFork2_#t~ite31_Out742299063| ~y$r_buff1_thd3~0_In742299063) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In742299063, ~y$w_buff0_used~0=~y$w_buff0_used~0_In742299063, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In742299063, ~y$w_buff1_used~0=~y$w_buff1_used~0_In742299063} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In742299063, ~y$w_buff0_used~0=~y$w_buff0_used~0_In742299063, P2Thread1of1ForFork2_#t~ite31=|P2Thread1of1ForFork2_#t~ite31_Out742299063|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In742299063, ~y$w_buff1_used~0=~y$w_buff1_used~0_In742299063} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-26 22:23:54,042 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L803-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= |v_P2Thread1of1ForFork2_#t~ite31_28| v_~y$r_buff1_thd3~0_47) (= (+ v_~__unbuffered_cnt~0_59 1) v_~__unbuffered_cnt~0_58) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0)) InVars {P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_47, P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_27|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite31, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-26 22:23:54,042 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [610] [610] L826-1-->L832: Formula: (and (= 3 v_~__unbuffered_cnt~0_13) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet34, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-26 22:23:54,043 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L832-2-->L832-4: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1015540453 256))) (.cse0 (= (mod ~y$r_buff1_thd0~0_In-1015540453 256) 0))) (or (and (or .cse0 .cse1) (= ~y~0_In-1015540453 |ULTIMATE.start_main_#t~ite35_Out-1015540453|)) (and (not .cse1) (not .cse0) (= ~y$w_buff1~0_In-1015540453 |ULTIMATE.start_main_#t~ite35_Out-1015540453|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1015540453, ~y~0=~y~0_In-1015540453, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1015540453, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1015540453} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-1015540453, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out-1015540453|, ~y~0=~y~0_In-1015540453, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1015540453, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1015540453} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35] because there is no mapped edge [2019-12-26 22:23:54,043 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [652] [652] L832-4-->L833: Formula: (= v_~y~0_55 |v_ULTIMATE.start_main_#t~ite35_32|) InVars {ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_32|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_31|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_33|, ~y~0=v_~y~0_55} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~y~0] because there is no mapped edge [2019-12-26 22:23:54,043 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [667] [667] L833-->L833-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In-1663255287 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-1663255287 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite37_Out-1663255287|) (not .cse1)) (and (= ~y$w_buff0_used~0_In-1663255287 |ULTIMATE.start_main_#t~ite37_Out-1663255287|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1663255287, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1663255287} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1663255287, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1663255287, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-1663255287|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-26 22:23:54,044 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L834-->L834-2: Formula: (let ((.cse3 (= (mod ~y$r_buff1_thd0~0_In-1219339959 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In-1219339959 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In-1219339959 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1219339959 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite38_Out-1219339959| ~y$w_buff1_used~0_In-1219339959)) (and (= |ULTIMATE.start_main_#t~ite38_Out-1219339959| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1219339959, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1219339959, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1219339959, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1219339959} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1219339959, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1219339959, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-1219339959|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1219339959, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1219339959} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-26 22:23:54,045 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L835-->L835-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-1143748602 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1143748602 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite39_Out-1143748602|)) (and (= ~y$r_buff0_thd0~0_In-1143748602 |ULTIMATE.start_main_#t~ite39_Out-1143748602|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1143748602, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1143748602} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1143748602, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-1143748602|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1143748602} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-26 22:23:54,046 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [676] [676] L836-->L836-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In1490444397 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1490444397 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In1490444397 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In1490444397 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite40_Out1490444397| ~y$r_buff1_thd0~0_In1490444397)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |ULTIMATE.start_main_#t~ite40_Out1490444397| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1490444397, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1490444397, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1490444397, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1490444397} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1490444397|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1490444397, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1490444397, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1490444397, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1490444397} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-26 22:23:54,046 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L836-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_20 0) (= v_~__unbuffered_p2_EBX~0_84 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_14|) (= 1 v_~__unbuffered_p2_EAX~0_84) (= v_~y$r_buff1_thd0~0_131 |v_ULTIMATE.start_main_#t~ite40_46|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= 0 v_~__unbuffered_p1_EAX~0_39) (= 0 v_~__unbuffered_p0_EAX~0_34)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_34, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_84, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_46|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_84} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_34, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_84, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_45|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_84, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_131, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_14|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite40, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-26 22:23:54,155 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 10:23:54 BasicIcfg [2019-12-26 22:23:54,155 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 22:23:54,157 INFO L168 Benchmark]: Toolchain (without parser) took 12667.55 ms. Allocated memory was 145.8 MB in the beginning and 607.1 MB in the end (delta: 461.4 MB). Free memory was 100.3 MB in the beginning and 363.7 MB in the end (delta: -263.4 MB). Peak memory consumption was 197.9 MB. Max. memory is 7.1 GB. [2019-12-26 22:23:54,158 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 145.8 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-26 22:23:54,159 INFO L168 Benchmark]: CACSL2BoogieTranslator took 842.38 ms. Allocated memory was 145.8 MB in the beginning and 203.9 MB in the end (delta: 58.2 MB). Free memory was 99.9 MB in the beginning and 157.5 MB in the end (delta: -57.6 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. [2019-12-26 22:23:54,161 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.06 ms. Allocated memory is still 203.9 MB. Free memory was 157.5 MB in the beginning and 154.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-26 22:23:54,162 INFO L168 Benchmark]: Boogie Preprocessor took 35.65 ms. Allocated memory is still 203.9 MB. Free memory was 154.9 MB in the beginning and 152.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-26 22:23:54,166 INFO L168 Benchmark]: RCFGBuilder took 760.54 ms. Allocated memory is still 203.9 MB. Free memory was 152.3 MB in the beginning and 108.7 MB in the end (delta: 43.6 MB). Peak memory consumption was 43.6 MB. Max. memory is 7.1 GB. [2019-12-26 22:23:54,168 INFO L168 Benchmark]: TraceAbstraction took 10954.99 ms. Allocated memory was 203.9 MB in the beginning and 607.1 MB in the end (delta: 403.2 MB). Free memory was 108.7 MB in the beginning and 363.7 MB in the end (delta: -255.1 MB). Peak memory consumption was 148.1 MB. Max. memory is 7.1 GB. [2019-12-26 22:23:54,180 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 145.8 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 842.38 ms. Allocated memory was 145.8 MB in the beginning and 203.9 MB in the end (delta: 58.2 MB). Free memory was 99.9 MB in the beginning and 157.5 MB in the end (delta: -57.6 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 69.06 ms. Allocated memory is still 203.9 MB. Free memory was 157.5 MB in the beginning and 154.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 35.65 ms. Allocated memory is still 203.9 MB. Free memory was 154.9 MB in the beginning and 152.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 760.54 ms. Allocated memory is still 203.9 MB. Free memory was 152.3 MB in the beginning and 108.7 MB in the end (delta: 43.6 MB). Peak memory consumption was 43.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10954.99 ms. Allocated memory was 203.9 MB in the beginning and 607.1 MB in the end (delta: 403.2 MB). Free memory was 108.7 MB in the beginning and 363.7 MB in the end (delta: -255.1 MB). Peak memory consumption was 148.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.3s, 154 ProgramPointsBefore, 71 ProgramPointsAfterwards, 179 TransitionsBefore, 79 TransitionsAfterwards, 11400 CoEnabledTransitionPairs, 8 FixpointIterations, 35 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 21 ChoiceCompositions, 4868 VarBasedMoverChecksPositive, 199 VarBasedMoverChecksNegative, 61 SemBasedMoverChecksPositive, 174 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.3s, 0 MoverChecksTotal, 44280 CheckedPairsTotal, 113 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L822] FCALL, FORK 0 pthread_create(&t934, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L824] FCALL, FORK 0 pthread_create(&t935, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L826] FCALL, FORK 0 pthread_create(&t936, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L778] 3 y$w_buff1 = y$w_buff0 [L779] 3 y$w_buff0 = 1 [L780] 3 y$w_buff1_used = y$w_buff0_used [L781] 3 y$w_buff0_used = (_Bool)1 [L750] 2 x = 1 [L753] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L754] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L755] 2 y$flush_delayed = weak$$choice2 [L756] 2 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L757] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L757] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L799] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)=1, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L758] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L759] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L759] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L760] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L760] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L761] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L761] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L763] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L764] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L799] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L800] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L801] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L832] 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L833] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L834] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L835] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 145 locations, 2 error locations. Result: UNSAFE, OverallTime: 10.6s, OverallIterations: 11, TraceHistogramMax: 1, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 942 SDtfs, 820 SDslu, 891 SDs, 0 SdLazy, 310 SolverSat, 36 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12302occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.9s AutomataMinimizationTime, 10 MinimizatonAttempts, 1358 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 288 NumberOfCodeBlocks, 288 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 233 ConstructedInterpolants, 0 QuantifiedInterpolants, 37271 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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...