/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix011_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 20:17:53,184 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 20:17:53,187 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 20:17:53,206 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 20:17:53,207 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 20:17:53,209 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 20:17:53,211 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 20:17:53,221 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 20:17:53,225 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 20:17:53,228 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 20:17:53,230 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 20:17:53,232 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 20:17:53,232 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 20:17:53,234 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 20:17:53,237 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 20:17:53,238 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 20:17:53,240 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 20:17:53,241 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 20:17:53,243 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 20:17:53,248 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 20:17:53,252 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 20:17:53,257 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 20:17:53,258 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 20:17:53,259 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 20:17:53,261 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 20:17:53,262 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 20:17:53,262 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 20:17:53,264 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 20:17:53,265 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 20:17:53,266 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 20:17:53,266 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 20:17:53,267 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 20:17:53,268 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 20:17:53,269 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 20:17:53,270 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 20:17:53,270 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 20:17:53,271 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 20:17:53,271 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 20:17:53,271 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 20:17:53,272 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 20:17:53,273 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 20:17:53,274 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-18 20:17:53,303 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 20:17:53,303 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 20:17:53,304 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 20:17:53,304 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 20:17:53,309 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 20:17:53,310 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 20:17:53,310 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 20:17:53,310 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 20:17:53,311 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 20:17:53,311 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 20:17:53,311 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 20:17:53,311 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 20:17:53,311 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 20:17:53,311 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 20:17:53,313 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 20:17:53,313 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 20:17:53,313 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 20:17:53,313 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 20:17:53,314 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 20:17:53,314 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 20:17:53,314 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 20:17:53,314 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 20:17:53,314 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 20:17:53,315 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 20:17:53,315 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 20:17:53,315 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 20:17:53,315 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 20:17:53,315 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 20:17:53,316 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 20:17:53,316 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 20:17:53,596 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 20:17:53,620 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 20:17:53,623 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 20:17:53,625 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 20:17:53,625 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 20:17:53,626 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix011_pso.opt.i [2019-12-18 20:17:53,702 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d300984a/15df9db59cbe4fca87e1dbe5ed7d96b6/FLAGe9f825096 [2019-12-18 20:17:54,273 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 20:17:54,280 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix011_pso.opt.i [2019-12-18 20:17:54,297 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d300984a/15df9db59cbe4fca87e1dbe5ed7d96b6/FLAGe9f825096 [2019-12-18 20:17:54,542 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d300984a/15df9db59cbe4fca87e1dbe5ed7d96b6 [2019-12-18 20:17:54,550 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 20:17:54,551 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 20:17:54,552 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 20:17:54,552 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 20:17:54,556 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 20:17:54,557 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 08:17:54" (1/1) ... [2019-12-18 20:17:54,560 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32100126 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:17:54, skipping insertion in model container [2019-12-18 20:17:54,560 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 08:17:54" (1/1) ... [2019-12-18 20:17:54,567 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 20:17:54,626 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 20:17:55,095 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 20:17:55,107 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 20:17:55,223 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 20:17:55,301 INFO L208 MainTranslator]: Completed translation [2019-12-18 20:17:55,301 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:17:55 WrapperNode [2019-12-18 20:17:55,301 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 20:17:55,302 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 20:17:55,302 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 20:17:55,303 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 20:17:55,312 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:17:55" (1/1) ... [2019-12-18 20:17:55,332 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:17:55" (1/1) ... [2019-12-18 20:17:55,368 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 20:17:55,369 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 20:17:55,369 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 20:17:55,369 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 20:17:55,379 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:17:55" (1/1) ... [2019-12-18 20:17:55,379 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:17:55" (1/1) ... [2019-12-18 20:17:55,384 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:17:55" (1/1) ... [2019-12-18 20:17:55,384 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:17:55" (1/1) ... [2019-12-18 20:17:55,396 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:17:55" (1/1) ... [2019-12-18 20:17:55,401 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:17:55" (1/1) ... [2019-12-18 20:17:55,405 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:17:55" (1/1) ... [2019-12-18 20:17:55,410 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 20:17:55,411 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 20:17:55,411 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 20:17:55,411 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 20:17:55,412 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:17:55" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 20:17:55,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 20:17:55,502 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 20:17:55,502 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 20:17:55,502 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 20:17:55,503 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 20:17:55,503 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 20:17:55,503 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 20:17:55,504 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 20:17:55,504 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 20:17:55,504 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 20:17:55,505 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 20:17:55,505 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 20:17:55,505 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 20:17:55,507 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 20:17:56,373 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 20:17:56,374 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 20:17:56,375 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 08:17:56 BoogieIcfgContainer [2019-12-18 20:17:56,376 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 20:17:56,377 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 20:17:56,377 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 20:17:56,380 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 20:17:56,380 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 08:17:54" (1/3) ... [2019-12-18 20:17:56,381 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@556166a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 08:17:56, skipping insertion in model container [2019-12-18 20:17:56,382 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:17:55" (2/3) ... [2019-12-18 20:17:56,382 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@556166a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 08:17:56, skipping insertion in model container [2019-12-18 20:17:56,382 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 08:17:56" (3/3) ... [2019-12-18 20:17:56,384 INFO L109 eAbstractionObserver]: Analyzing ICFG mix011_pso.opt.i [2019-12-18 20:17:56,394 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 20:17:56,395 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 20:17:56,403 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 20:17:56,404 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 20:17:56,460 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,461 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,461 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,461 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,462 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,462 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,463 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,463 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,464 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,464 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,464 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,464 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,464 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,464 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,465 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,465 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,465 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,465 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,466 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,466 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,466 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,466 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,467 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,467 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,467 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,467 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,468 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,468 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,468 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,468 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,469 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,469 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,469 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,469 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,469 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,470 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,470 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,470 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,470 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,471 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,471 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,471 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,471 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,471 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,472 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,472 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,472 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,472 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,472 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,473 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,473 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,473 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,473 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,473 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,474 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,474 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,474 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,474 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,474 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,475 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,475 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,475 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,475 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,476 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,476 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,476 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,476 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,476 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,477 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,477 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,477 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,477 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,477 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,477 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,478 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,478 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,478 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,478 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,478 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,479 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,479 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,479 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,479 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,480 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,480 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,480 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,480 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,480 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,481 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,481 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,481 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,481 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,481 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,482 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,482 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,482 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,482 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,482 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,483 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,483 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,484 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,484 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,484 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,485 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,485 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,485 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,485 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,486 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,486 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,486 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,486 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,486 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,487 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,487 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,487 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,487 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,487 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,488 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,488 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,488 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,488 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,488 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,489 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,489 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,489 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,489 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,489 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,490 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,490 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,490 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,490 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,490 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,490 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,491 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,491 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,491 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,491 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,491 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,492 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,492 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,492 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,493 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,493 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,493 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,493 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,493 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,493 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,494 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,494 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,494 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,494 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,495 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,495 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,495 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,495 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,495 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,495 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,496 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,496 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,496 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,496 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,496 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,497 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,497 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,497 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,497 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,497 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,498 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,498 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,498 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,498 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,498 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,499 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,499 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,499 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,499 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,499 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,500 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,500 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,500 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,500 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,500 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,500 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,501 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,501 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,501 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,501 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,501 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,502 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,502 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,502 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,502 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,502 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,503 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,503 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,503 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,503 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,503 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,504 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,504 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,504 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,504 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,505 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,505 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,505 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,505 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,505 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,505 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,506 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,506 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,506 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,506 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,506 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,507 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,507 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,507 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,507 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,507 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,508 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,508 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,508 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,508 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,512 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,512 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,512 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,513 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,513 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,513 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,513 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,513 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,514 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,514 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,514 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,514 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,514 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,515 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,515 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,515 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,515 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,515 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,515 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,516 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,516 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,516 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,516 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,516 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,517 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,517 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,517 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,517 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,517 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,518 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,518 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,518 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,518 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,518 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,518 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,521 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,522 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,522 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,522 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,524 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,524 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,525 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,525 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,525 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,525 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,525 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,525 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,526 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,526 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,526 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,526 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,526 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,527 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,527 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,527 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,527 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,527 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,528 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,528 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,528 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,528 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,528 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,528 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,529 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,529 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,529 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:56,544 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 20:17:56,564 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 20:17:56,565 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 20:17:56,565 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 20:17:56,565 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 20:17:56,565 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 20:17:56,565 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 20:17:56,565 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 20:17:56,565 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 20:17:56,582 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 196 places, 242 transitions [2019-12-18 20:17:56,584 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 196 places, 242 transitions [2019-12-18 20:17:56,680 INFO L126 PetriNetUnfolder]: 56/239 cut-off events. [2019-12-18 20:17:56,680 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 20:17:56,704 INFO L76 FinitePrefix]: Finished finitePrefix Result has 249 conditions, 239 events. 56/239 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 565 event pairs. 9/190 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-12-18 20:17:56,743 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 196 places, 242 transitions [2019-12-18 20:17:56,797 INFO L126 PetriNetUnfolder]: 56/239 cut-off events. [2019-12-18 20:17:56,797 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 20:17:56,808 INFO L76 FinitePrefix]: Finished finitePrefix Result has 249 conditions, 239 events. 56/239 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 565 event pairs. 9/190 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-12-18 20:17:56,836 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 24630 [2019-12-18 20:17:56,837 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 20:18:00,624 WARN L192 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-18 20:18:00,764 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-18 20:18:00,877 INFO L206 etLargeBlockEncoding]: Checked pairs total: 123784 [2019-12-18 20:18:00,877 INFO L214 etLargeBlockEncoding]: Total number of compositions: 125 [2019-12-18 20:18:00,881 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 106 places, 127 transitions [2019-12-18 20:18:04,749 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 42982 states. [2019-12-18 20:18:04,751 INFO L276 IsEmpty]: Start isEmpty. Operand 42982 states. [2019-12-18 20:18:04,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-18 20:18:04,758 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:18:04,758 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:18:04,759 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-18 20:18:04,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:18:04,765 INFO L82 PathProgramCache]: Analyzing trace with hash 48878050, now seen corresponding path program 1 times [2019-12-18 20:18:04,772 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:18:04,773 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240187786] [2019-12-18 20:18:04,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:18:04,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:18:05,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:18:05,099 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240187786] [2019-12-18 20:18:05,100 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:18:05,100 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 20:18:05,101 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518382962] [2019-12-18 20:18:05,105 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:18:05,106 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:18:05,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:18:05,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:18:05,123 INFO L87 Difference]: Start difference. First operand 42982 states. Second operand 3 states. [2019-12-18 20:18:05,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:18:05,872 INFO L93 Difference]: Finished difference Result 42470 states and 173504 transitions. [2019-12-18 20:18:05,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:18:05,875 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-18 20:18:05,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:18:06,528 INFO L225 Difference]: With dead ends: 42470 [2019-12-18 20:18:06,529 INFO L226 Difference]: Without dead ends: 39546 [2019-12-18 20:18:06,533 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:18:07,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39546 states. [2019-12-18 20:18:09,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39546 to 39546. [2019-12-18 20:18:09,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39546 states. [2019-12-18 20:18:10,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39546 states to 39546 states and 161440 transitions. [2019-12-18 20:18:10,293 INFO L78 Accepts]: Start accepts. Automaton has 39546 states and 161440 transitions. Word has length 7 [2019-12-18 20:18:10,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:18:10,295 INFO L462 AbstractCegarLoop]: Abstraction has 39546 states and 161440 transitions. [2019-12-18 20:18:10,295 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:18:10,295 INFO L276 IsEmpty]: Start isEmpty. Operand 39546 states and 161440 transitions. [2019-12-18 20:18:10,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 20:18:10,300 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:18:10,301 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:18:10,301 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-18 20:18:10,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:18:10,302 INFO L82 PathProgramCache]: Analyzing trace with hash 2064044969, now seen corresponding path program 1 times [2019-12-18 20:18:10,302 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:18:10,302 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721847349] [2019-12-18 20:18:10,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:18:10,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:18:10,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:18:10,401 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721847349] [2019-12-18 20:18:10,401 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:18:10,401 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:18:10,402 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315868327] [2019-12-18 20:18:10,404 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:18:10,404 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:18:10,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:18:10,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:18:10,405 INFO L87 Difference]: Start difference. First operand 39546 states and 161440 transitions. Second operand 4 states. [2019-12-18 20:18:12,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:18:12,929 INFO L93 Difference]: Finished difference Result 62606 states and 245680 transitions. [2019-12-18 20:18:12,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 20:18:12,930 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 20:18:12,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:18:13,288 INFO L225 Difference]: With dead ends: 62606 [2019-12-18 20:18:13,289 INFO L226 Difference]: Without dead ends: 62574 [2019-12-18 20:18:13,290 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:18:13,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62574 states. [2019-12-18 20:18:15,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62574 to 60086. [2019-12-18 20:18:15,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60086 states. [2019-12-18 20:18:15,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60086 states to 60086 states and 237688 transitions. [2019-12-18 20:18:15,885 INFO L78 Accepts]: Start accepts. Automaton has 60086 states and 237688 transitions. Word has length 13 [2019-12-18 20:18:15,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:18:15,885 INFO L462 AbstractCegarLoop]: Abstraction has 60086 states and 237688 transitions. [2019-12-18 20:18:15,886 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:18:15,886 INFO L276 IsEmpty]: Start isEmpty. Operand 60086 states and 237688 transitions. [2019-12-18 20:18:15,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 20:18:15,892 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:18:15,892 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:18:15,892 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-18 20:18:15,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:18:15,893 INFO L82 PathProgramCache]: Analyzing trace with hash 503175658, now seen corresponding path program 1 times [2019-12-18 20:18:15,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:18:15,893 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324271085] [2019-12-18 20:18:15,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:18:15,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:18:15,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:18:15,960 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324271085] [2019-12-18 20:18:15,960 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:18:15,960 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:18:15,961 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854025367] [2019-12-18 20:18:15,961 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:18:15,961 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:18:15,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:18:15,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:18:15,962 INFO L87 Difference]: Start difference. First operand 60086 states and 237688 transitions. Second operand 4 states. [2019-12-18 20:18:18,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:18:18,773 INFO L93 Difference]: Finished difference Result 77526 states and 302124 transitions. [2019-12-18 20:18:18,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 20:18:18,774 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 20:18:18,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:18:19,293 INFO L225 Difference]: With dead ends: 77526 [2019-12-18 20:18:19,293 INFO L226 Difference]: Without dead ends: 77496 [2019-12-18 20:18:19,294 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:18:20,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77496 states. [2019-12-18 20:18:21,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77496 to 68188. [2019-12-18 20:18:21,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68188 states. [2019-12-18 20:18:21,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68188 states to 68188 states and 268551 transitions. [2019-12-18 20:18:21,624 INFO L78 Accepts]: Start accepts. Automaton has 68188 states and 268551 transitions. Word has length 16 [2019-12-18 20:18:21,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:18:21,624 INFO L462 AbstractCegarLoop]: Abstraction has 68188 states and 268551 transitions. [2019-12-18 20:18:21,624 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:18:21,624 INFO L276 IsEmpty]: Start isEmpty. Operand 68188 states and 268551 transitions. [2019-12-18 20:18:21,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-18 20:18:21,633 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:18:21,633 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:18:21,633 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-18 20:18:21,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:18:21,634 INFO L82 PathProgramCache]: Analyzing trace with hash -787717565, now seen corresponding path program 1 times [2019-12-18 20:18:21,634 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:18:21,634 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105581010] [2019-12-18 20:18:21,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:18:21,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:18:21,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:18:21,703 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105581010] [2019-12-18 20:18:21,704 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:18:21,704 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 20:18:21,704 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971025210] [2019-12-18 20:18:21,705 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:18:21,705 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:18:21,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:18:21,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:18:21,708 INFO L87 Difference]: Start difference. First operand 68188 states and 268551 transitions. Second operand 3 states. [2019-12-18 20:18:22,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:18:22,586 INFO L93 Difference]: Finished difference Result 64048 states and 251839 transitions. [2019-12-18 20:18:22,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:18:22,587 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-18 20:18:22,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:18:22,747 INFO L225 Difference]: With dead ends: 64048 [2019-12-18 20:18:22,747 INFO L226 Difference]: Without dead ends: 63856 [2019-12-18 20:18:22,748 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:18:23,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63856 states. [2019-12-18 20:18:24,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63856 to 63856. [2019-12-18 20:18:24,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63856 states. [2019-12-18 20:18:28,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63856 states to 63856 states and 251151 transitions. [2019-12-18 20:18:28,663 INFO L78 Accepts]: Start accepts. Automaton has 63856 states and 251151 transitions. Word has length 18 [2019-12-18 20:18:28,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:18:28,663 INFO L462 AbstractCegarLoop]: Abstraction has 63856 states and 251151 transitions. [2019-12-18 20:18:28,663 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:18:28,663 INFO L276 IsEmpty]: Start isEmpty. Operand 63856 states and 251151 transitions. [2019-12-18 20:18:28,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 20:18:28,682 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:18:28,682 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] [2019-12-18 20:18:28,682 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-18 20:18:28,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:18:28,683 INFO L82 PathProgramCache]: Analyzing trace with hash -802769487, now seen corresponding path program 1 times [2019-12-18 20:18:28,683 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:18:28,683 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893679163] [2019-12-18 20:18:28,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:18:28,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:18:28,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:18:28,807 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893679163] [2019-12-18 20:18:28,807 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:18:28,807 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:18:28,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657805449] [2019-12-18 20:18:28,808 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:18:28,808 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:18:28,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:18:28,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:18:28,809 INFO L87 Difference]: Start difference. First operand 63856 states and 251151 transitions. Second operand 5 states. [2019-12-18 20:18:29,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:18:29,691 INFO L93 Difference]: Finished difference Result 77072 states and 298885 transitions. [2019-12-18 20:18:29,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 20:18:29,691 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 20:18:29,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:18:29,869 INFO L225 Difference]: With dead ends: 77072 [2019-12-18 20:18:29,869 INFO L226 Difference]: Without dead ends: 77018 [2019-12-18 20:18:29,870 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 20:18:30,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77018 states. [2019-12-18 20:18:34,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77018 to 63662. [2019-12-18 20:18:34,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63662 states. [2019-12-18 20:18:34,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63662 states to 63662 states and 250434 transitions. [2019-12-18 20:18:34,545 INFO L78 Accepts]: Start accepts. Automaton has 63662 states and 250434 transitions. Word has length 22 [2019-12-18 20:18:34,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:18:34,546 INFO L462 AbstractCegarLoop]: Abstraction has 63662 states and 250434 transitions. [2019-12-18 20:18:34,546 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:18:34,546 INFO L276 IsEmpty]: Start isEmpty. Operand 63662 states and 250434 transitions. [2019-12-18 20:18:34,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-18 20:18:34,615 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:18:34,615 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] [2019-12-18 20:18:34,615 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-18 20:18:34,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:18:34,615 INFO L82 PathProgramCache]: Analyzing trace with hash -655538281, now seen corresponding path program 1 times [2019-12-18 20:18:34,616 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:18:34,616 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630982519] [2019-12-18 20:18:34,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:18:34,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:18:34,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:18:34,680 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630982519] [2019-12-18 20:18:34,680 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:18:34,681 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 20:18:34,681 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976266116] [2019-12-18 20:18:34,681 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:18:34,681 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:18:34,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:18:34,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:18:34,682 INFO L87 Difference]: Start difference. First operand 63662 states and 250434 transitions. Second operand 3 states. [2019-12-18 20:18:34,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:18:34,951 INFO L93 Difference]: Finished difference Result 63610 states and 250254 transitions. [2019-12-18 20:18:34,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:18:34,951 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-12-18 20:18:34,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:18:35,646 INFO L225 Difference]: With dead ends: 63610 [2019-12-18 20:18:35,646 INFO L226 Difference]: Without dead ends: 63610 [2019-12-18 20:18:35,647 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:18:36,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63610 states. [2019-12-18 20:18:37,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63610 to 63610. [2019-12-18 20:18:37,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63610 states. [2019-12-18 20:18:37,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63610 states to 63610 states and 250254 transitions. [2019-12-18 20:18:37,601 INFO L78 Accepts]: Start accepts. Automaton has 63610 states and 250254 transitions. Word has length 32 [2019-12-18 20:18:37,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:18:37,601 INFO L462 AbstractCegarLoop]: Abstraction has 63610 states and 250254 transitions. [2019-12-18 20:18:37,602 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:18:37,602 INFO L276 IsEmpty]: Start isEmpty. Operand 63610 states and 250254 transitions. [2019-12-18 20:18:37,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 20:18:37,670 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:18:37,670 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] [2019-12-18 20:18:37,670 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-18 20:18:37,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:18:37,671 INFO L82 PathProgramCache]: Analyzing trace with hash -33493824, now seen corresponding path program 1 times [2019-12-18 20:18:37,671 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:18:37,671 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713707233] [2019-12-18 20:18:37,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:18:37,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:18:37,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:18:37,742 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713707233] [2019-12-18 20:18:37,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:18:37,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:18:37,742 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248888573] [2019-12-18 20:18:37,743 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:18:37,743 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:18:37,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:18:37,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:18:37,744 INFO L87 Difference]: Start difference. First operand 63610 states and 250254 transitions. Second operand 4 states. [2019-12-18 20:18:37,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:18:37,912 INFO L93 Difference]: Finished difference Result 39471 states and 135697 transitions. [2019-12-18 20:18:37,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 20:18:37,913 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2019-12-18 20:18:37,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:18:37,974 INFO L225 Difference]: With dead ends: 39471 [2019-12-18 20:18:37,974 INFO L226 Difference]: Without dead ends: 35301 [2019-12-18 20:18:37,974 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:18:38,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35301 states. [2019-12-18 20:18:40,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35301 to 35301. [2019-12-18 20:18:40,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35301 states. [2019-12-18 20:18:41,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35301 states to 35301 states and 121237 transitions. [2019-12-18 20:18:41,001 INFO L78 Accepts]: Start accepts. Automaton has 35301 states and 121237 transitions. Word has length 33 [2019-12-18 20:18:41,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:18:41,002 INFO L462 AbstractCegarLoop]: Abstraction has 35301 states and 121237 transitions. [2019-12-18 20:18:41,002 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:18:41,002 INFO L276 IsEmpty]: Start isEmpty. Operand 35301 states and 121237 transitions. [2019-12-18 20:18:41,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-18 20:18:41,042 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:18:41,042 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] [2019-12-18 20:18:41,042 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-18 20:18:41,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:18:41,042 INFO L82 PathProgramCache]: Analyzing trace with hash 85671784, now seen corresponding path program 1 times [2019-12-18 20:18:41,043 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:18:41,043 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656990323] [2019-12-18 20:18:41,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:18:41,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:18:41,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:18:41,123 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656990323] [2019-12-18 20:18:41,123 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:18:41,124 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 20:18:41,124 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95443987] [2019-12-18 20:18:41,124 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:18:41,124 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:18:41,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:18:41,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:18:41,125 INFO L87 Difference]: Start difference. First operand 35301 states and 121237 transitions. Second operand 5 states. [2019-12-18 20:18:41,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:18:41,215 INFO L93 Difference]: Finished difference Result 7868 states and 23608 transitions. [2019-12-18 20:18:41,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 20:18:41,215 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2019-12-18 20:18:41,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:18:41,226 INFO L225 Difference]: With dead ends: 7868 [2019-12-18 20:18:41,226 INFO L226 Difference]: Without dead ends: 5651 [2019-12-18 20:18:41,226 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 20:18:41,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5651 states. [2019-12-18 20:18:41,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5651 to 5651. [2019-12-18 20:18:41,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5651 states. [2019-12-18 20:18:41,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5651 states to 5651 states and 16018 transitions. [2019-12-18 20:18:41,292 INFO L78 Accepts]: Start accepts. Automaton has 5651 states and 16018 transitions. Word has length 34 [2019-12-18 20:18:41,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:18:41,292 INFO L462 AbstractCegarLoop]: Abstraction has 5651 states and 16018 transitions. [2019-12-18 20:18:41,292 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:18:41,293 INFO L276 IsEmpty]: Start isEmpty. Operand 5651 states and 16018 transitions. [2019-12-18 20:18:41,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-18 20:18:41,298 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:18:41,298 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-18 20:18:41,298 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-18 20:18:41,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:18:41,299 INFO L82 PathProgramCache]: Analyzing trace with hash -326961402, now seen corresponding path program 1 times [2019-12-18 20:18:41,299 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:18:41,299 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272921957] [2019-12-18 20:18:41,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:18:41,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:18:41,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:18:41,364 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272921957] [2019-12-18 20:18:41,364 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:18:41,364 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:18:41,364 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398473196] [2019-12-18 20:18:41,365 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:18:41,365 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:18:41,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:18:41,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:18:41,365 INFO L87 Difference]: Start difference. First operand 5651 states and 16018 transitions. Second operand 4 states. [2019-12-18 20:18:41,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:18:41,401 INFO L93 Difference]: Finished difference Result 6797 states and 18645 transitions. [2019-12-18 20:18:41,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 20:18:41,402 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2019-12-18 20:18:41,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:18:41,410 INFO L225 Difference]: With dead ends: 6797 [2019-12-18 20:18:41,410 INFO L226 Difference]: Without dead ends: 5662 [2019-12-18 20:18:41,411 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:18:41,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5662 states. [2019-12-18 20:18:41,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5662 to 5645. [2019-12-18 20:18:41,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5645 states. [2019-12-18 20:18:41,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5645 states to 5645 states and 15934 transitions. [2019-12-18 20:18:41,484 INFO L78 Accepts]: Start accepts. Automaton has 5645 states and 15934 transitions. Word has length 45 [2019-12-18 20:18:41,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:18:41,485 INFO L462 AbstractCegarLoop]: Abstraction has 5645 states and 15934 transitions. [2019-12-18 20:18:41,485 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:18:41,485 INFO L276 IsEmpty]: Start isEmpty. Operand 5645 states and 15934 transitions. [2019-12-18 20:18:41,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-18 20:18:41,494 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:18:41,494 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-18 20:18:41,494 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-18 20:18:41,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:18:41,494 INFO L82 PathProgramCache]: Analyzing trace with hash 1604810864, now seen corresponding path program 2 times [2019-12-18 20:18:41,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:18:41,495 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147483236] [2019-12-18 20:18:41,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:18:41,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:18:41,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:18:41,570 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147483236] [2019-12-18 20:18:41,570 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:18:41,570 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:18:41,571 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586394763] [2019-12-18 20:18:41,571 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:18:41,571 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:18:41,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:18:41,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:18:41,572 INFO L87 Difference]: Start difference. First operand 5645 states and 15934 transitions. Second operand 5 states. [2019-12-18 20:18:41,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:18:41,689 INFO L93 Difference]: Finished difference Result 9238 states and 26393 transitions. [2019-12-18 20:18:41,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 20:18:41,689 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-12-18 20:18:41,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:18:41,699 INFO L225 Difference]: With dead ends: 9238 [2019-12-18 20:18:41,699 INFO L226 Difference]: Without dead ends: 7491 [2019-12-18 20:18:41,700 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-18 20:18:41,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7491 states. [2019-12-18 20:18:41,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7491 to 7491. [2019-12-18 20:18:41,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7491 states. [2019-12-18 20:18:41,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7491 states to 7491 states and 21772 transitions. [2019-12-18 20:18:41,787 INFO L78 Accepts]: Start accepts. Automaton has 7491 states and 21772 transitions. Word has length 45 [2019-12-18 20:18:41,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:18:41,787 INFO L462 AbstractCegarLoop]: Abstraction has 7491 states and 21772 transitions. [2019-12-18 20:18:41,787 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:18:41,787 INFO L276 IsEmpty]: Start isEmpty. Operand 7491 states and 21772 transitions. [2019-12-18 20:18:41,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-18 20:18:41,797 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:18:41,797 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:18:41,798 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-18 20:18:41,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:18:41,798 INFO L82 PathProgramCache]: Analyzing trace with hash 334885599, now seen corresponding path program 1 times [2019-12-18 20:18:41,798 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:18:41,799 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972116982] [2019-12-18 20:18:41,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:18:41,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:18:41,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:18:41,857 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972116982] [2019-12-18 20:18:41,858 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:18:41,858 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:18:41,858 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182303902] [2019-12-18 20:18:41,858 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:18:41,859 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:18:41,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:18:41,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:18:41,859 INFO L87 Difference]: Start difference. First operand 7491 states and 21772 transitions. Second operand 3 states. [2019-12-18 20:18:41,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:18:41,904 INFO L93 Difference]: Finished difference Result 11521 states and 31868 transitions. [2019-12-18 20:18:41,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:18:41,905 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2019-12-18 20:18:41,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:18:41,917 INFO L225 Difference]: With dead ends: 11521 [2019-12-18 20:18:41,918 INFO L226 Difference]: Without dead ends: 7183 [2019-12-18 20:18:41,919 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:18:41,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7183 states. [2019-12-18 20:18:41,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7183 to 7126. [2019-12-18 20:18:41,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7126 states. [2019-12-18 20:18:42,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7126 states to 7126 states and 18041 transitions. [2019-12-18 20:18:42,000 INFO L78 Accepts]: Start accepts. Automaton has 7126 states and 18041 transitions. Word has length 46 [2019-12-18 20:18:42,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:18:42,000 INFO L462 AbstractCegarLoop]: Abstraction has 7126 states and 18041 transitions. [2019-12-18 20:18:42,001 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:18:42,001 INFO L276 IsEmpty]: Start isEmpty. Operand 7126 states and 18041 transitions. [2019-12-18 20:18:42,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-18 20:18:42,007 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:18:42,007 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:18:42,007 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:18:42,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:18:42,007 INFO L82 PathProgramCache]: Analyzing trace with hash -1224518567, now seen corresponding path program 2 times [2019-12-18 20:18:42,008 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:18:42,008 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162787397] [2019-12-18 20:18:42,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:18:42,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:18:42,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:18:42,087 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162787397] [2019-12-18 20:18:42,088 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:18:42,088 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 20:18:42,088 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671274691] [2019-12-18 20:18:42,088 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:18:42,088 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:18:42,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:18:42,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:18:42,089 INFO L87 Difference]: Start difference. First operand 7126 states and 18041 transitions. Second operand 5 states. [2019-12-18 20:18:42,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:18:42,529 INFO L93 Difference]: Finished difference Result 8075 states and 20066 transitions. [2019-12-18 20:18:42,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 20:18:42,530 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-12-18 20:18:42,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:18:42,540 INFO L225 Difference]: With dead ends: 8075 [2019-12-18 20:18:42,540 INFO L226 Difference]: Without dead ends: 8075 [2019-12-18 20:18:42,540 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 20:18:42,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8075 states. [2019-12-18 20:18:42,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8075 to 7785. [2019-12-18 20:18:42,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7785 states. [2019-12-18 20:18:42,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7785 states to 7785 states and 19502 transitions. [2019-12-18 20:18:42,849 INFO L78 Accepts]: Start accepts. Automaton has 7785 states and 19502 transitions. Word has length 46 [2019-12-18 20:18:42,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:18:42,851 INFO L462 AbstractCegarLoop]: Abstraction has 7785 states and 19502 transitions. [2019-12-18 20:18:42,851 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:18:42,851 INFO L276 IsEmpty]: Start isEmpty. Operand 7785 states and 19502 transitions. [2019-12-18 20:18:42,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-18 20:18:42,858 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:18:42,858 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:18:42,859 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:18:42,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:18:42,859 INFO L82 PathProgramCache]: Analyzing trace with hash -1179496772, now seen corresponding path program 1 times [2019-12-18 20:18:42,859 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:18:42,860 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826726488] [2019-12-18 20:18:42,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:18:42,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:18:42,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:18:42,999 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826726488] [2019-12-18 20:18:42,999 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:18:43,000 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 20:18:43,000 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236518230] [2019-12-18 20:18:43,001 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 20:18:43,001 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:18:43,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 20:18:43,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-18 20:18:43,002 INFO L87 Difference]: Start difference. First operand 7785 states and 19502 transitions. Second operand 6 states. [2019-12-18 20:18:43,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:18:43,112 INFO L93 Difference]: Finished difference Result 6520 states and 16452 transitions. [2019-12-18 20:18:43,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 20:18:43,113 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2019-12-18 20:18:43,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:18:43,114 INFO L225 Difference]: With dead ends: 6520 [2019-12-18 20:18:43,115 INFO L226 Difference]: Without dead ends: 751 [2019-12-18 20:18:43,115 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-18 20:18:43,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751 states. [2019-12-18 20:18:43,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751 to 739. [2019-12-18 20:18:43,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 739 states. [2019-12-18 20:18:43,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 1591 transitions. [2019-12-18 20:18:43,128 INFO L78 Accepts]: Start accepts. Automaton has 739 states and 1591 transitions. Word has length 47 [2019-12-18 20:18:43,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:18:43,129 INFO L462 AbstractCegarLoop]: Abstraction has 739 states and 1591 transitions. [2019-12-18 20:18:43,129 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 20:18:43,130 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 1591 transitions. [2019-12-18 20:18:43,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-18 20:18:43,131 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:18:43,131 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:18:43,131 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:18:43,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:18:43,132 INFO L82 PathProgramCache]: Analyzing trace with hash -1962585643, now seen corresponding path program 1 times [2019-12-18 20:18:43,132 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:18:43,132 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372535602] [2019-12-18 20:18:43,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:18:43,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:18:43,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:18:43,279 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372535602] [2019-12-18 20:18:43,280 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:18:43,280 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 20:18:43,280 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928403641] [2019-12-18 20:18:43,281 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 20:18:43,281 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:18:43,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 20:18:43,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-18 20:18:43,282 INFO L87 Difference]: Start difference. First operand 739 states and 1591 transitions. Second operand 8 states. [2019-12-18 20:18:43,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:18:43,535 INFO L93 Difference]: Finished difference Result 1887 states and 4017 transitions. [2019-12-18 20:18:43,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 20:18:43,536 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 62 [2019-12-18 20:18:43,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:18:43,538 INFO L225 Difference]: With dead ends: 1887 [2019-12-18 20:18:43,538 INFO L226 Difference]: Without dead ends: 1515 [2019-12-18 20:18:43,538 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2019-12-18 20:18:43,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1515 states. [2019-12-18 20:18:43,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1515 to 838. [2019-12-18 20:18:43,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 838 states. [2019-12-18 20:18:43,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1798 transitions. [2019-12-18 20:18:43,554 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1798 transitions. Word has length 62 [2019-12-18 20:18:43,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:18:43,554 INFO L462 AbstractCegarLoop]: Abstraction has 838 states and 1798 transitions. [2019-12-18 20:18:43,554 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 20:18:43,554 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1798 transitions. [2019-12-18 20:18:43,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-18 20:18:43,556 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:18:43,556 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:18:43,556 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:18:43,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:18:43,556 INFO L82 PathProgramCache]: Analyzing trace with hash 892930217, now seen corresponding path program 2 times [2019-12-18 20:18:43,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:18:43,557 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386694953] [2019-12-18 20:18:43,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:18:43,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:18:43,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:18:43,747 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386694953] [2019-12-18 20:18:43,748 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:18:43,748 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 20:18:43,748 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228519302] [2019-12-18 20:18:43,748 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 20:18:43,748 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:18:43,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 20:18:43,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 20:18:43,749 INFO L87 Difference]: Start difference. First operand 838 states and 1798 transitions. Second operand 9 states. [2019-12-18 20:18:44,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:18:44,446 INFO L93 Difference]: Finished difference Result 1904 states and 4075 transitions. [2019-12-18 20:18:44,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 20:18:44,447 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 62 [2019-12-18 20:18:44,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:18:44,449 INFO L225 Difference]: With dead ends: 1904 [2019-12-18 20:18:44,449 INFO L226 Difference]: Without dead ends: 1904 [2019-12-18 20:18:44,449 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-12-18 20:18:44,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1904 states. [2019-12-18 20:18:44,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1904 to 1037. [2019-12-18 20:18:44,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1037 states. [2019-12-18 20:18:44,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1037 states to 1037 states and 2243 transitions. [2019-12-18 20:18:44,463 INFO L78 Accepts]: Start accepts. Automaton has 1037 states and 2243 transitions. Word has length 62 [2019-12-18 20:18:44,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:18:44,463 INFO L462 AbstractCegarLoop]: Abstraction has 1037 states and 2243 transitions. [2019-12-18 20:18:44,463 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 20:18:44,463 INFO L276 IsEmpty]: Start isEmpty. Operand 1037 states and 2243 transitions. [2019-12-18 20:18:44,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-18 20:18:44,464 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:18:44,464 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:18:44,464 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:18:44,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:18:44,465 INFO L82 PathProgramCache]: Analyzing trace with hash -2079455055, now seen corresponding path program 3 times [2019-12-18 20:18:44,465 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:18:44,465 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966059557] [2019-12-18 20:18:44,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:18:44,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:18:44,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:18:44,533 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966059557] [2019-12-18 20:18:44,533 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:18:44,533 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:18:44,534 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371339371] [2019-12-18 20:18:44,534 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:18:44,534 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:18:44,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:18:44,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:18:44,535 INFO L87 Difference]: Start difference. First operand 1037 states and 2243 transitions. Second operand 3 states. [2019-12-18 20:18:44,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:18:44,547 INFO L93 Difference]: Finished difference Result 1037 states and 2242 transitions. [2019-12-18 20:18:44,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:18:44,547 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2019-12-18 20:18:44,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:18:44,549 INFO L225 Difference]: With dead ends: 1037 [2019-12-18 20:18:44,549 INFO L226 Difference]: Without dead ends: 1037 [2019-12-18 20:18:44,549 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:18:44,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1037 states. [2019-12-18 20:18:44,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1037 to 918. [2019-12-18 20:18:44,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 918 states. [2019-12-18 20:18:44,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 918 states and 2009 transitions. [2019-12-18 20:18:44,562 INFO L78 Accepts]: Start accepts. Automaton has 918 states and 2009 transitions. Word has length 62 [2019-12-18 20:18:44,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:18:44,562 INFO L462 AbstractCegarLoop]: Abstraction has 918 states and 2009 transitions. [2019-12-18 20:18:44,562 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:18:44,562 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 2009 transitions. [2019-12-18 20:18:44,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-18 20:18:44,563 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:18:44,564 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:18:44,564 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:18:44,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:18:44,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1974293500, now seen corresponding path program 1 times [2019-12-18 20:18:44,564 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:18:44,564 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074659634] [2019-12-18 20:18:44,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:18:44,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 20:18:44,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 20:18:44,686 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 20:18:44,686 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 20:18:44,690 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1024] [1024] ULTIMATE.startENTRY-->L838: Formula: (let ((.cse0 (store |v_#valid_65| 0 0))) (and (= v_~z$r_buff0_thd0~0_22 0) (= 0 v_~weak$$choice0~0_10) (= v_~main$tmp_guard0~0_10 0) (= 0 v_~__unbuffered_p1_EAX~0_13) (= 0 v_~z$r_buff1_thd3~0_41) (= v_~main$tmp_guard1~0_18 0) (= v_~z$r_buff0_thd3~0_78 0) (= |v_#valid_63| (store .cse0 |v_ULTIMATE.start_main_~#t290~0.base_27| 1)) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t290~0.base_27| 4)) (= 0 v_~z$r_buff1_thd2~0_28) (= |v_#NULL.offset_6| 0) (= v_~z$r_buff1_thd1~0_8 0) (= v_~z~0_26 0) (= 0 v_~z$w_buff1~0_35) (= v_~x~0_15 0) (= 0 v_~y~0_7) (= v_~__unbuffered_p2_EBX~0_12 0) (= v_~z$read_delayed~0_6 0) (= v_~z$read_delayed_var~0.offset_7 0) (= 0 v_~z$flush_delayed~0_17) (< 0 |v_#StackHeapBarrier_18|) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t290~0.base_27|)) (= v_~z$w_buff0_used~0_134 0) (= v_~a~0_10 0) (= 0 |v_#NULL.base_6|) (= v_~z$r_buff0_thd2~0_54 0) (= 0 v_~z$r_buff1_thd0~0_22) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$r_buff0_thd1~0_9 0) (= 0 v_~weak$$choice2~0_35) (= 0 v_~__unbuffered_p2_EAX~0_12) (= v_~z$mem_tmp~0_12 0) (= 0 v_~__unbuffered_cnt~0_22) (= 0 v_~z$w_buff1_used~0_71) (= 0 |v_ULTIMATE.start_main_~#t290~0.offset_21|) (= v_~__unbuffered_p1_EBX~0_13 0) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t290~0.base_27| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t290~0.base_27|) |v_ULTIMATE.start_main_~#t290~0.offset_21| 0)) |v_#memory_int_23|) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t290~0.base_27|) (= 0 v_~z$w_buff0~0_35))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_65|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_7|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_8|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_28, ULTIMATE.start_main_~#t291~0.base=|v_ULTIMATE.start_main_~#t291~0.base_22|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_~#t290~0.offset=|v_ULTIMATE.start_main_~#t290~0.offset_21|, ~a~0=v_~a~0_10, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_22, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_13, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_12, ~z$mem_tmp~0=v_~z$mem_tmp~0_12, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_12, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_12|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_71, ~z$flush_delayed~0=v_~z$flush_delayed~0_17, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_18|, ~weak$$choice0~0=v_~weak$$choice0~0_10, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_10|, ULTIMATE.start_main_~#t290~0.base=|v_ULTIMATE.start_main_~#t290~0.base_27|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_8, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_78, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, ~x~0=v_~x~0_15, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_8|, ~z$read_delayed~0=v_~z$read_delayed~0_6, ~z$w_buff1~0=v_~z$w_buff1~0_35, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_22, ~y~0=v_~y~0_7, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_54, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_13, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_134, ~z$w_buff0~0=v_~z$w_buff0~0_35, ULTIMATE.start_main_~#t292~0.base=|v_ULTIMATE.start_main_~#t292~0.base_22|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_41, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_13|, ULTIMATE.start_main_~#t292~0.offset=|v_ULTIMATE.start_main_~#t292~0.offset_18|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_10|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_10|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, #valid=|v_#valid_63|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_~#t291~0.offset=|v_ULTIMATE.start_main_~#t291~0.offset_18|, ~z~0=v_~z~0_26, ~weak$$choice2~0=v_~weak$$choice2~0_35, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, ~z$r_buff1_thd2~0, ULTIMATE.start_main_~#t291~0.base, #NULL.offset, ULTIMATE.start_main_~#t290~0.offset, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite58, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ULTIMATE.start_main_~#t290~0.base, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_#t~nondet56, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ~__unbuffered_p1_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_~#t292~0.base, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite59, ULTIMATE.start_main_~#t292~0.offset, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t291~0.offset, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 20:18:44,691 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [974] [974] L838-1-->L840: Formula: (and (not (= |v_ULTIMATE.start_main_~#t291~0.base_10| 0)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t291~0.base_10| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t291~0.base_10|) |v_ULTIMATE.start_main_~#t291~0.offset_9| 1)) |v_#memory_int_13|) (= 0 |v_ULTIMATE.start_main_~#t291~0.offset_9|) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t291~0.base_10| 4)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t291~0.base_10|) (= |v_#valid_29| (store |v_#valid_30| |v_ULTIMATE.start_main_~#t291~0.base_10| 1)) (= (select |v_#valid_30| |v_ULTIMATE.start_main_~#t291~0.base_10|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_14|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_4|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t291~0.base=|v_ULTIMATE.start_main_~#t291~0.base_10|, ULTIMATE.start_main_~#t291~0.offset=|v_ULTIMATE.start_main_~#t291~0.offset_9|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, ULTIMATE.start_main_~#t291~0.base, ULTIMATE.start_main_~#t291~0.offset, #length] because there is no mapped edge [2019-12-18 20:18:44,692 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [990] [990] L840-1-->L842: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t292~0.base_11|)) (= |v_ULTIMATE.start_main_~#t292~0.offset_10| 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t292~0.base_11| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t292~0.base_11|) |v_ULTIMATE.start_main_~#t292~0.offset_10| 2)) |v_#memory_int_17|) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t292~0.base_11| 4) |v_#length_17|) (= 0 (select |v_#valid_38| |v_ULTIMATE.start_main_~#t292~0.base_11|)) (= |v_#valid_37| (store |v_#valid_38| |v_ULTIMATE.start_main_~#t292~0.base_11| 1)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t292~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t292~0.base=|v_ULTIMATE.start_main_~#t292~0.base_11|, #valid=|v_#valid_37|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_5|, #memory_int=|v_#memory_int_17|, #length=|v_#length_17|, ULTIMATE.start_main_~#t292~0.offset=|v_ULTIMATE.start_main_~#t292~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t292~0.base, #valid, ULTIMATE.start_main_#t~nondet56, #memory_int, #length, ULTIMATE.start_main_~#t292~0.offset] because there is no mapped edge [2019-12-18 20:18:44,694 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [896] [896] P2ENTRY-->L4-3: Formula: (and (= 0 (mod v_~z$w_buff1_used~0_53 256)) (= 1 v_~z$w_buff0~0_24) (= v_P2Thread1of1ForFork0_~arg.base_5 |v_P2Thread1of1ForFork0_#in~arg.base_5|) (= v_~z$w_buff0_used~0_99 1) (= v_P2Thread1of1ForFork0_~arg.offset_5 |v_P2Thread1of1ForFork0_#in~arg.offset_5|) (= |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_5| v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_7) (= v_~z$w_buff0_used~0_100 v_~z$w_buff1_used~0_53) (= v_~z$w_buff0~0_25 v_~z$w_buff1~0_22) (= 1 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_5|)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_100, ~z$w_buff0~0=v_~z$w_buff0~0_25, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_5, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_5|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_99, ~z$w_buff0~0=v_~z$w_buff0~0_24, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_5, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_53, ~z$w_buff1~0=v_~z$w_buff1~0_22, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_7} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~z$w_buff0_used~0, ~z$w_buff0~0, P2Thread1of1ForFork0_~arg.offset, ~z$w_buff1_used~0, ~z$w_buff1~0, P2Thread1of1ForFork0___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-18 20:18:44,696 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [954] [954] L800-2-->L800-5: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1298632963 256))) (.cse0 (= |P2Thread1of1ForFork0_#t~ite29_Out-1298632963| |P2Thread1of1ForFork0_#t~ite28_Out-1298632963|)) (.cse2 (= 0 (mod ~z$r_buff0_thd3~0_In-1298632963 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite28_Out-1298632963| ~z$w_buff1~0_In-1298632963) .cse0 (or .cse1 .cse2)) (and (not .cse1) .cse0 (= |P2Thread1of1ForFork0_#t~ite28_Out-1298632963| ~z$w_buff0~0_In-1298632963) (not .cse2)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In-1298632963, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1298632963, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1298632963, ~z$w_buff1~0=~z$w_buff1~0_In-1298632963} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out-1298632963|, ~z$w_buff0~0=~z$w_buff0~0_In-1298632963, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1298632963, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1298632963, ~z$w_buff1~0=~z$w_buff1~0_In-1298632963, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out-1298632963|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-18 20:18:44,705 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [905] [905] L805-->L806: Formula: (and (= v_~z$r_buff0_thd3~0_57 v_~z$r_buff0_thd3~0_56) (not (= 0 (mod v_~weak$$choice2~0_30 256)))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_57, ~weak$$choice2~0=v_~weak$$choice2~0_30} OutVars{P2Thread1of1ForFork0_#t~ite44=|v_P2Thread1of1ForFork0_#t~ite44_9|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_9|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_56, P2Thread1of1ForFork0_#t~ite42=|v_P2Thread1of1ForFork0_#t~ite42_8|, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite44, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-18 20:18:44,707 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [970] [970] L808-->L808-2: Formula: (let ((.cse0 (= (mod ~z$flush_delayed~0_In-880252831 256) 0))) (or (and (not .cse0) (= ~z$mem_tmp~0_In-880252831 |P2Thread1of1ForFork0_#t~ite48_Out-880252831|)) (and (= ~z~0_In-880252831 |P2Thread1of1ForFork0_#t~ite48_Out-880252831|) .cse0))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-880252831, ~z$flush_delayed~0=~z$flush_delayed~0_In-880252831, ~z~0=~z~0_In-880252831} OutVars{P2Thread1of1ForFork0_#t~ite48=|P2Thread1of1ForFork0_#t~ite48_Out-880252831|, ~z$mem_tmp~0=~z$mem_tmp~0_In-880252831, ~z$flush_delayed~0=~z$flush_delayed~0_In-880252831, ~z~0=~z~0_In-880252831} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite48] because there is no mapped edge [2019-12-18 20:18:44,708 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [996] [996] P0ENTRY-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= 1 v_~a~0_7) (= v_P0Thread1of1ForFork1_~arg.base_5 |v_P0Thread1of1ForFork1_#in~arg.base_5|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_P0Thread1of1ForFork1_~arg.offset_5 |v_P0Thread1of1ForFork1_#in~arg.offset_5|) (= 1 v_~x~0_8) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|} OutVars{~a~0=v_~a~0_7, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_5, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|, ~x~0=v_~x~0_8, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_5} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~x~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-18 20:18:44,726 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [955] [955] L816-->L816-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1601229318 256))) (.cse0 (= (mod ~z$r_buff0_thd3~0_In1601229318 256) 0))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork0_#t~ite51_Out1601229318|) (not .cse1)) (and (or .cse1 .cse0) (= ~z$w_buff0_used~0_In1601229318 |P2Thread1of1ForFork0_#t~ite51_Out1601229318|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1601229318, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1601229318} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1601229318, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1601229318, P2Thread1of1ForFork0_#t~ite51=|P2Thread1of1ForFork0_#t~ite51_Out1601229318|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite51] because there is no mapped edge [2019-12-18 20:18:44,728 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [964] [964] L817-->L817-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff0_used~0_In-235435378 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd3~0_In-235435378 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-235435378 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-235435378 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite52_Out-235435378| 0)) (and (= |P2Thread1of1ForFork0_#t~ite52_Out-235435378| ~z$w_buff1_used~0_In-235435378) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-235435378, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-235435378, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-235435378, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-235435378} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-235435378, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-235435378, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-235435378, P2Thread1of1ForFork0_#t~ite52=|P2Thread1of1ForFork0_#t~ite52_Out-235435378|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-235435378} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite52] because there is no mapped edge [2019-12-18 20:18:44,729 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [948] [948] L818-->L819: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-1889635619 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1889635619 256)))) (or (and (= ~z$r_buff0_thd3~0_Out-1889635619 0) (not .cse0) (not .cse1)) (and (= ~z$r_buff0_thd3~0_In-1889635619 ~z$r_buff0_thd3~0_Out-1889635619) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1889635619, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1889635619} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1889635619, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_Out-1889635619, P2Thread1of1ForFork0_#t~ite53=|P2Thread1of1ForFork0_#t~ite53_Out-1889635619|} AuxVars[] AssignedVars[~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite53] because there is no mapped edge [2019-12-18 20:18:44,729 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [951] [951] L819-->L819-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In641012673 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In641012673 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In641012673 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd3~0_In641012673 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd3~0_In641012673 |P2Thread1of1ForFork0_#t~ite54_Out641012673|) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork0_#t~ite54_Out641012673| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In641012673, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In641012673, ~z$w_buff1_used~0=~z$w_buff1_used~0_In641012673, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In641012673} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In641012673, P2Thread1of1ForFork0_#t~ite54=|P2Thread1of1ForFork0_#t~ite54_Out641012673|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In641012673, ~z$w_buff1_used~0=~z$w_buff1_used~0_In641012673, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In641012673} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite54] because there is no mapped edge [2019-12-18 20:18:44,729 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [999] [999] L819-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~z$r_buff1_thd3~0_37 |v_P2Thread1of1ForFork0_#t~ite54_8|) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= (+ v_~__unbuffered_cnt~0_18 1) v_~__unbuffered_cnt~0_17)) InVars {P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_37, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite54, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-18 20:18:44,729 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [972] [972] L771-->L771-2: Formula: (let ((.cse0 (= (mod ~z$flush_delayed~0_In180479083 256) 0))) (or (and (not .cse0) (= ~z$mem_tmp~0_In180479083 |P1Thread1of1ForFork2_#t~ite25_Out180479083|)) (and .cse0 (= |P1Thread1of1ForFork2_#t~ite25_Out180479083| ~z~0_In180479083)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In180479083, ~z$flush_delayed~0=~z$flush_delayed~0_In180479083, ~z~0=~z~0_In180479083} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In180479083, ~z$flush_delayed~0=~z$flush_delayed~0_In180479083, ~z~0=~z~0_In180479083, P1Thread1of1ForFork2_#t~ite25=|P1Thread1of1ForFork2_#t~ite25_Out180479083|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-18 20:18:44,730 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [982] [982] L771-2-->P1EXIT: Formula: (and (= 0 v_~z$flush_delayed~0_13) (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= |v_P1Thread1of1ForFork2_#t~ite25_8| v_~z~0_23) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_8|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ~z$flush_delayed~0=v_~z$flush_delayed~0_13, ~z~0=v_~z~0_23, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P1Thread1of1ForFork2_#res.base, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-18 20:18:44,731 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [891] [891] L846-->L848-2: Formula: (and (not (= (mod v_~main$tmp_guard0~0_4 256) 0)) (or (= 0 (mod v_~z$w_buff0_used~0_94 256)) (= 0 (mod v_~z$r_buff0_thd0~0_14 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_14, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_94, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_14, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_94, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 20:18:44,731 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [958] [958] L848-2-->L848-5: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In-592098217 256))) (.cse2 (= (mod ~z$r_buff1_thd0~0_In-592098217 256) 0)) (.cse1 (= |ULTIMATE.start_main_#t~ite59_Out-592098217| |ULTIMATE.start_main_#t~ite58_Out-592098217|))) (or (and (not .cse0) (= ~z$w_buff1~0_In-592098217 |ULTIMATE.start_main_#t~ite58_Out-592098217|) .cse1 (not .cse2)) (and (or .cse0 .cse2) (= ~z~0_In-592098217 |ULTIMATE.start_main_#t~ite58_Out-592098217|) .cse1))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-592098217, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-592098217, ~z$w_buff1~0=~z$w_buff1~0_In-592098217, ~z~0=~z~0_In-592098217} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-592098217, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out-592098217|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-592098217, ~z$w_buff1~0=~z$w_buff1~0_In-592098217, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out-592098217|, ~z~0=~z~0_In-592098217} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-18 20:18:44,732 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [966] [966] L849-->L849-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In-364456983 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-364456983 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite60_Out-364456983| 0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite60_Out-364456983| ~z$w_buff0_used~0_In-364456983)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-364456983, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-364456983} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out-364456983|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-364456983, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-364456983} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-18 20:18:44,734 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [957] [957] L850-->L850-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In-1720009837 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In-1720009837 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-1720009837 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-1720009837 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In-1720009837 |ULTIMATE.start_main_#t~ite61_Out-1720009837|) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite61_Out-1720009837|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1720009837, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1720009837, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1720009837, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1720009837} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1720009837, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-1720009837|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1720009837, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1720009837, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1720009837} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-18 20:18:44,735 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [965] [965] L851-->L851-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In650548526 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In650548526 256) 0))) (or (and (= ~z$r_buff0_thd0~0_In650548526 |ULTIMATE.start_main_#t~ite62_Out650548526|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite62_Out650548526|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In650548526, ~z$w_buff0_used~0=~z$w_buff0_used~0_In650548526} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out650548526|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In650548526, ~z$w_buff0_used~0=~z$w_buff0_used~0_In650548526} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-18 20:18:44,736 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [952] [952] L852-->L852-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In1279008585 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In1279008585 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In1279008585 256))) (.cse2 (= (mod ~z$r_buff0_thd0~0_In1279008585 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd0~0_In1279008585 |ULTIMATE.start_main_#t~ite63_Out1279008585|) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |ULTIMATE.start_main_#t~ite63_Out1279008585|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1279008585, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1279008585, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1279008585, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1279008585} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out1279008585|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1279008585, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1279008585, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1279008585, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1279008585} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-18 20:18:44,737 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1017] [1017] L852-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~x~0_10 2) (= 0 v_~__unbuffered_p1_EBX~0_8) (= 1 v_~__unbuffered_p1_EAX~0_8) (= v_~main$tmp_guard1~0_13 0) (= |v_ULTIMATE.start_main_#t~ite63_10| v_~z$r_buff1_thd0~0_17) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= v_~__unbuffered_p2_EAX~0_7 1) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|) (= v_~__unbuffered_p2_EBX~0_7 0)) InVars {ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_10|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_7, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_7, ~x~0=v_~x~0_10} OutVars{ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_9|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_7, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_17, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_7, ~x~0=v_~x~0_10, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 20:18:44,834 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 08:18:44 BasicIcfg [2019-12-18 20:18:44,834 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 20:18:44,836 INFO L168 Benchmark]: Toolchain (without parser) took 50284.65 ms. Allocated memory was 146.3 MB in the beginning and 2.4 GB in the end (delta: 2.2 GB). Free memory was 102.7 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 916.3 MB. Max. memory is 7.1 GB. [2019-12-18 20:18:44,837 INFO L168 Benchmark]: CDTParser took 1.39 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-18 20:18:44,837 INFO L168 Benchmark]: CACSL2BoogieTranslator took 749.60 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 102.2 MB in the beginning and 156.2 MB in the end (delta: -54.0 MB). Peak memory consumption was 22.4 MB. Max. memory is 7.1 GB. [2019-12-18 20:18:44,838 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.21 ms. Allocated memory is still 203.9 MB. Free memory was 156.2 MB in the beginning and 153.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 20:18:44,839 INFO L168 Benchmark]: Boogie Preprocessor took 41.47 ms. Allocated memory is still 203.9 MB. Free memory was 153.6 MB in the beginning and 151.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 20:18:44,839 INFO L168 Benchmark]: RCFGBuilder took 965.14 ms. Allocated memory is still 203.9 MB. Free memory was 151.0 MB in the beginning and 95.4 MB in the end (delta: 55.6 MB). Peak memory consumption was 55.6 MB. Max. memory is 7.1 GB. [2019-12-18 20:18:44,840 INFO L168 Benchmark]: TraceAbstraction took 48457.66 ms. Allocated memory was 203.9 MB in the beginning and 2.4 GB in the end (delta: 2.2 GB). Free memory was 95.4 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 851.4 MB. Max. memory is 7.1 GB. [2019-12-18 20:18:44,849 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.39 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 749.60 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 102.2 MB in the beginning and 156.2 MB in the end (delta: -54.0 MB). Peak memory consumption was 22.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 66.21 ms. Allocated memory is still 203.9 MB. Free memory was 156.2 MB in the beginning and 153.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.47 ms. Allocated memory is still 203.9 MB. Free memory was 153.6 MB in the beginning and 151.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 965.14 ms. Allocated memory is still 203.9 MB. Free memory was 151.0 MB in the beginning and 95.4 MB in the end (delta: 55.6 MB). Peak memory consumption was 55.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 48457.66 ms. Allocated memory was 203.9 MB in the beginning and 2.4 GB in the end (delta: 2.2 GB). Free memory was 95.4 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 851.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.2s, 196 ProgramPointsBefore, 106 ProgramPointsAfterwards, 242 TransitionsBefore, 127 TransitionsAfterwards, 24630 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 51 ConcurrentYvCompositions, 29 ChoiceCompositions, 8644 VarBasedMoverChecksPositive, 243 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 123784 CheckedPairsTotal, 125 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L838] FCALL, FORK 0 pthread_create(&t290, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L840] FCALL, FORK 0 pthread_create(&t291, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L842] FCALL, FORK 0 pthread_create(&t292, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L789] 3 z$r_buff1_thd0 = z$r_buff0_thd0 [L790] 3 z$r_buff1_thd1 = z$r_buff0_thd1 [L791] 3 z$r_buff1_thd2 = z$r_buff0_thd2 [L792] 3 z$r_buff1_thd3 = z$r_buff0_thd3 [L793] 3 z$r_buff0_thd3 = (_Bool)1 [L796] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L797] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L798] 3 z$flush_delayed = weak$$choice2 [L799] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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=8, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L800] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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=8, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L800] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L801] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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=8, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L801] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L802] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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=8, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L802] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L803] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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=8, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L803] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L804] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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=8, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L804] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L806] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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=8, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L806] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L807] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L808] 3 z = z$flush_delayed ? z$mem_tmp : z [L809] 3 z$flush_delayed = (_Bool)0 [L812] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L750] 2 x = 2 [L753] 2 y = 1 [L756] 2 __unbuffered_p1_EAX = y [L759] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L760] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L761] 2 z$flush_delayed = weak$$choice2 [L762] 2 z$mem_tmp = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L763] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L763] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L764] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L765] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L765] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L766] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L767] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L767] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L815] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] EXPR 2 weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L769] EXPR 2 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L769] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L770] 2 __unbuffered_p1_EBX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L815] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L816] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L817] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L844] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L848] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L849] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L850] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L851] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 187 locations, 2 error locations. Result: UNSAFE, OverallTime: 48.1s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 12.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3001 SDtfs, 3699 SDslu, 5104 SDs, 0 SdLazy, 2124 SolverSat, 134 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 98 GetRequests, 20 SyntacticMatches, 5 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=68188occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 24.9s AutomataMinimizationTime, 16 MinimizatonAttempts, 27191 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 653 NumberOfCodeBlocks, 653 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 574 ConstructedInterpolants, 0 QuantifiedInterpolants, 70173 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...