/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-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix014_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 15:56:13,051 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 15:56:13,053 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 15:56:13,071 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 15:56:13,071 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 15:56:13,073 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 15:56:13,076 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 15:56:13,086 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 15:56:13,089 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 15:56:13,092 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 15:56:13,094 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 15:56:13,096 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 15:56:13,097 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 15:56:13,098 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 15:56:13,101 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 15:56:13,102 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 15:56:13,104 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 15:56:13,105 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 15:56:13,106 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 15:56:13,111 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 15:56:13,115 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 15:56:13,119 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 15:56:13,120 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 15:56:13,121 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 15:56:13,123 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 15:56:13,123 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 15:56:13,123 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 15:56:13,124 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 15:56:13,124 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 15:56:13,125 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 15:56:13,125 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 15:56:13,126 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 15:56:13,127 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 15:56:13,128 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 15:56:13,129 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 15:56:13,129 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 15:56:13,129 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 15:56:13,130 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 15:56:13,130 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 15:56:13,131 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 15:56:13,131 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 15:56:13,132 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-SemanticLbe-MCR.epf [2019-12-27 15:56:13,146 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 15:56:13,146 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 15:56:13,147 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 15:56:13,147 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 15:56:13,147 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 15:56:13,148 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 15:56:13,148 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 15:56:13,148 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 15:56:13,148 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 15:56:13,148 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 15:56:13,149 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 15:56:13,149 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 15:56:13,149 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 15:56:13,149 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 15:56:13,149 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 15:56:13,149 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 15:56:13,150 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 15:56:13,150 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 15:56:13,150 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 15:56:13,150 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 15:56:13,150 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 15:56:13,151 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 15:56:13,151 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 15:56:13,151 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 15:56:13,151 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 15:56:13,151 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 15:56:13,152 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 15:56:13,152 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 15:56:13,152 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 15:56:13,152 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 15:56:13,152 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 15:56:13,468 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 15:56:13,490 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 15:56:13,494 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 15:56:13,495 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 15:56:13,496 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 15:56:13,498 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix014_power.opt.i [2019-12-27 15:56:13,555 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/511c399bd/6f2f2134e2f646c9b67c23987bf746cc/FLAG9d0d34946 [2019-12-27 15:56:14,143 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 15:56:14,144 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix014_power.opt.i [2019-12-27 15:56:14,159 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/511c399bd/6f2f2134e2f646c9b67c23987bf746cc/FLAG9d0d34946 [2019-12-27 15:56:14,383 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/511c399bd/6f2f2134e2f646c9b67c23987bf746cc [2019-12-27 15:56:14,394 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 15:56:14,396 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 15:56:14,399 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 15:56:14,400 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 15:56:14,404 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 15:56:14,405 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:56:14" (1/1) ... [2019-12-27 15:56:14,408 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@166c5411 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:56:14, skipping insertion in model container [2019-12-27 15:56:14,408 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:56:14" (1/1) ... [2019-12-27 15:56:14,417 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 15:56:14,487 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 15:56:15,048 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 15:56:15,061 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 15:56:15,161 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 15:56:15,247 INFO L208 MainTranslator]: Completed translation [2019-12-27 15:56:15,248 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:56:15 WrapperNode [2019-12-27 15:56:15,248 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 15:56:15,249 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 15:56:15,249 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 15:56:15,249 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 15:56:15,258 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:56:15" (1/1) ... [2019-12-27 15:56:15,279 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:56:15" (1/1) ... [2019-12-27 15:56:15,317 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 15:56:15,317 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 15:56:15,318 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 15:56:15,318 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 15:56:15,328 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:56:15" (1/1) ... [2019-12-27 15:56:15,328 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:56:15" (1/1) ... [2019-12-27 15:56:15,334 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:56:15" (1/1) ... [2019-12-27 15:56:15,334 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:56:15" (1/1) ... [2019-12-27 15:56:15,346 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:56:15" (1/1) ... [2019-12-27 15:56:15,351 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:56:15" (1/1) ... [2019-12-27 15:56:15,355 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:56:15" (1/1) ... [2019-12-27 15:56:15,361 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 15:56:15,362 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 15:56:15,362 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 15:56:15,362 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 15:56:15,363 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:56:15" (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-27 15:56:15,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 15:56:15,425 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 15:56:15,425 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 15:56:15,425 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 15:56:15,426 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 15:56:15,426 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 15:56:15,426 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 15:56:15,426 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 15:56:15,427 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 15:56:15,427 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 15:56:15,427 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-27 15:56:15,427 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-27 15:56:15,427 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 15:56:15,427 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 15:56:15,428 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 15:56:15,430 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 15:56:16,327 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 15:56:16,327 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 15:56:16,329 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:56:16 BoogieIcfgContainer [2019-12-27 15:56:16,329 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 15:56:16,332 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 15:56:16,333 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 15:56:16,335 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 15:56:16,336 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 03:56:14" (1/3) ... [2019-12-27 15:56:16,337 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@783f9042 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:56:16, skipping insertion in model container [2019-12-27 15:56:16,337 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:56:15" (2/3) ... [2019-12-27 15:56:16,337 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@783f9042 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:56:16, skipping insertion in model container [2019-12-27 15:56:16,337 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:56:16" (3/3) ... [2019-12-27 15:56:16,340 INFO L109 eAbstractionObserver]: Analyzing ICFG mix014_power.opt.i [2019-12-27 15:56:16,350 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 15:56:16,351 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 15:56:16,358 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 15:56:16,359 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 15:56:16,398 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,399 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,399 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,399 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,400 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,400 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,401 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,401 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,401 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,401 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,403 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,403 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,403 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,403 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,403 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,404 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,404 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,404 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,404 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,405 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,405 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,405 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,405 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,405 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,406 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,406 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,406 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,406 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,407 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,407 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,407 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,407 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,407 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,408 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,408 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,408 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,408 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,408 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,409 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,409 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,409 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,409 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,410 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,410 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,410 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,410 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,410 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,411 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,411 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,411 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,411 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,411 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,411 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,412 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,412 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,412 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,412 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,413 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,413 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,413 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,413 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,413 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,414 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,414 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,414 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,414 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,414 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,415 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,415 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,415 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,415 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,415 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,416 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,416 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,416 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,416 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,417 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,417 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,417 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,417 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,417 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,418 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,418 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,418 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,418 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,418 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,419 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,419 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,419 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,419 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,420 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,420 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,420 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,420 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,420 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,421 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,421 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,421 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,421 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,422 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,422 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,422 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,422 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,422 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,424 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,424 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,424 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,424 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,425 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,425 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,425 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,425 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,426 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,426 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,426 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,426 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,426 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,427 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,427 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,427 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,427 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,427 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,428 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,428 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,428 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,428 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,428 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,429 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,429 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,429 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,429 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,429 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,430 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,430 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,430 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,430 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,430 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,430 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,431 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,431 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,431 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,431 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,431 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,432 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,432 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,432 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,432 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,432 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,433 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,433 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,433 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,433 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,433 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,434 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,434 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,434 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,434 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,434 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,435 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,435 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,435 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,435 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,435 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,436 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,436 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,436 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,436 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,436 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,437 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,437 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,437 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,437 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,437 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,438 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,438 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,438 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,438 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,438 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,439 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,439 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,439 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,439 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,439 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,440 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,440 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,440 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,440 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,440 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,441 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,441 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,441 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,441 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,441 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,441 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,442 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,442 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,442 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,442 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,442 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,443 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,443 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,443 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,443 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,443 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,444 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,444 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,444 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,444 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,444 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,445 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,445 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,445 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,445 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,445 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,446 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,446 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,446 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,446 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,446 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,446 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,447 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,447 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,447 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,447 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,447 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,448 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,451 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,452 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,452 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,452 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,455 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,455 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,455 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,455 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,455 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,456 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,456 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,456 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,456 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,456 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,457 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,457 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,457 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,457 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,457 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,458 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,458 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,458 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,458 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,458 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,459 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,459 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,459 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,459 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,459 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,460 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,460 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,466 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,466 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,467 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,467 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,467 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,467 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,467 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,468 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,468 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,468 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,468 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,468 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,469 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,469 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,469 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,469 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,469 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,470 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,470 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,470 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,470 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,470 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,470 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,471 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,471 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,471 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,471 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,471 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,471 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,472 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,472 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,472 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,472 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,472 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,472 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,475 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,475 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,475 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,476 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:56:16,491 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-27 15:56:16,512 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 15:56:16,512 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 15:56:16,512 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 15:56:16,513 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 15:56:16,513 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 15:56:16,513 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 15:56:16,513 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 15:56:16,513 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 15:56:16,532 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 212 places, 255 transitions [2019-12-27 15:56:16,534 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 212 places, 255 transitions [2019-12-27 15:56:16,661 INFO L132 PetriNetUnfolder]: 56/251 cut-off events. [2019-12-27 15:56:16,662 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 15:56:16,682 INFO L76 FinitePrefix]: Finished finitePrefix Result has 264 conditions, 251 events. 56/251 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 564 event pairs. 0/193 useless extension candidates. Maximal degree in co-relation 217. Up to 2 conditions per place. [2019-12-27 15:56:16,714 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 212 places, 255 transitions [2019-12-27 15:56:16,787 INFO L132 PetriNetUnfolder]: 56/251 cut-off events. [2019-12-27 15:56:16,787 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 15:56:16,800 INFO L76 FinitePrefix]: Finished finitePrefix Result has 264 conditions, 251 events. 56/251 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 564 event pairs. 0/193 useless extension candidates. Maximal degree in co-relation 217. Up to 2 conditions per place. [2019-12-27 15:56:16,836 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 26510 [2019-12-27 15:56:16,837 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 15:56:23,419 WARN L192 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 99 [2019-12-27 15:56:23,569 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2019-12-27 15:56:23,602 INFO L206 etLargeBlockEncoding]: Checked pairs total: 147467 [2019-12-27 15:56:23,603 INFO L214 etLargeBlockEncoding]: Total number of compositions: 131 [2019-12-27 15:56:23,606 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 114 places, 134 transitions [2019-12-27 15:56:34,337 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 94794 states. [2019-12-27 15:56:34,339 INFO L276 IsEmpty]: Start isEmpty. Operand 94794 states. [2019-12-27 15:56:34,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 15:56:34,345 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:56:34,346 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:56:34,346 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:56:34,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:56:34,352 INFO L82 PathProgramCache]: Analyzing trace with hash -284739831, now seen corresponding path program 1 times [2019-12-27 15:56:34,363 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:56:34,364 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763271979] [2019-12-27 15:56:34,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:56:34,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:56:34,624 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-27 15:56:34,625 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763271979] [2019-12-27 15:56:34,626 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:56:34,626 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 15:56:34,627 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2093422416] [2019-12-27 15:56:34,628 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:56:34,633 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:56:34,648 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 10 states and 9 transitions. [2019-12-27 15:56:34,649 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:56:34,653 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:56:34,654 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:56:34,654 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:56:34,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:56:34,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:56:34,875 INFO L87 Difference]: Start difference. First operand 94794 states. Second operand 3 states. [2019-12-27 15:56:35,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:56:35,999 INFO L93 Difference]: Finished difference Result 94058 states and 432536 transitions. [2019-12-27 15:56:36,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:56:36,001 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-27 15:56:36,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:56:39,339 INFO L225 Difference]: With dead ends: 94058 [2019-12-27 15:56:39,340 INFO L226 Difference]: Without dead ends: 88038 [2019-12-27 15:56:39,341 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-27 15:56:41,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88038 states. [2019-12-27 15:56:43,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88038 to 88038. [2019-12-27 15:56:43,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88038 states. [2019-12-27 15:56:48,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88038 states to 88038 states and 404604 transitions. [2019-12-27 15:56:48,166 INFO L78 Accepts]: Start accepts. Automaton has 88038 states and 404604 transitions. Word has length 9 [2019-12-27 15:56:48,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:56:48,167 INFO L462 AbstractCegarLoop]: Abstraction has 88038 states and 404604 transitions. [2019-12-27 15:56:48,167 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:56:48,167 INFO L276 IsEmpty]: Start isEmpty. Operand 88038 states and 404604 transitions. [2019-12-27 15:56:48,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 15:56:48,177 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:56:48,177 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:56:48,178 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:56:48,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:56:48,178 INFO L82 PathProgramCache]: Analyzing trace with hash -1938763797, now seen corresponding path program 1 times [2019-12-27 15:56:48,179 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:56:48,179 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566551199] [2019-12-27 15:56:48,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:56:48,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:56:48,278 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-27 15:56:48,278 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566551199] [2019-12-27 15:56:48,279 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:56:48,279 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:56:48,279 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1536409675] [2019-12-27 15:56:48,280 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:56:48,281 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:56:48,287 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 16 states and 15 transitions. [2019-12-27 15:56:48,287 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:56:48,288 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:56:48,289 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:56:48,289 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:56:48,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:56:48,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:56:48,290 INFO L87 Difference]: Start difference. First operand 88038 states and 404604 transitions. Second operand 3 states. [2019-12-27 15:56:48,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:56:48,890 INFO L93 Difference]: Finished difference Result 68675 states and 293381 transitions. [2019-12-27 15:56:48,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:56:48,890 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-27 15:56:48,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:56:49,305 INFO L225 Difference]: With dead ends: 68675 [2019-12-27 15:56:49,305 INFO L226 Difference]: Without dead ends: 68675 [2019-12-27 15:56:49,306 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-27 15:56:53,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68675 states. [2019-12-27 15:56:54,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68675 to 68675. [2019-12-27 15:56:54,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68675 states. [2019-12-27 15:56:55,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68675 states to 68675 states and 293381 transitions. [2019-12-27 15:56:55,162 INFO L78 Accepts]: Start accepts. Automaton has 68675 states and 293381 transitions. Word has length 15 [2019-12-27 15:56:55,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:56:55,163 INFO L462 AbstractCegarLoop]: Abstraction has 68675 states and 293381 transitions. [2019-12-27 15:56:55,163 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:56:55,163 INFO L276 IsEmpty]: Start isEmpty. Operand 68675 states and 293381 transitions. [2019-12-27 15:56:55,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 15:56:55,167 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:56:55,167 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:56:55,167 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:56:55,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:56:55,168 INFO L82 PathProgramCache]: Analyzing trace with hash -1812589106, now seen corresponding path program 1 times [2019-12-27 15:56:55,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:56:55,168 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148572557] [2019-12-27 15:56:55,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:56:55,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:56:55,242 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-27 15:56:55,243 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148572557] [2019-12-27 15:56:55,243 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:56:55,243 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 15:56:55,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1840441454] [2019-12-27 15:56:55,244 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:56:55,246 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:56:55,248 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 23 states and 28 transitions. [2019-12-27 15:56:55,249 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:56:55,250 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:56:55,250 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 15:56:55,250 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:56:55,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 15:56:55,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 15:56:55,251 INFO L87 Difference]: Start difference. First operand 68675 states and 293381 transitions. Second operand 4 states. [2019-12-27 15:56:55,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:56:55,408 INFO L93 Difference]: Finished difference Result 28933 states and 105182 transitions. [2019-12-27 15:56:55,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 15:56:55,408 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 15:56:55,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:56:55,477 INFO L225 Difference]: With dead ends: 28933 [2019-12-27 15:56:55,477 INFO L226 Difference]: Without dead ends: 28933 [2019-12-27 15:56:55,477 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 15:56:55,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28933 states. [2019-12-27 15:56:56,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28933 to 28933. [2019-12-27 15:56:56,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28933 states. [2019-12-27 15:56:56,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28933 states to 28933 states and 105182 transitions. [2019-12-27 15:56:56,959 INFO L78 Accepts]: Start accepts. Automaton has 28933 states and 105182 transitions. Word has length 16 [2019-12-27 15:56:56,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:56:56,960 INFO L462 AbstractCegarLoop]: Abstraction has 28933 states and 105182 transitions. [2019-12-27 15:56:56,960 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 15:56:56,960 INFO L276 IsEmpty]: Start isEmpty. Operand 28933 states and 105182 transitions. [2019-12-27 15:56:56,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 15:56:56,962 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:56:56,962 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:56:56,963 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:56:56,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:56:56,963 INFO L82 PathProgramCache]: Analyzing trace with hash 382957685, now seen corresponding path program 1 times [2019-12-27 15:56:56,963 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:56:56,963 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869814930] [2019-12-27 15:56:56,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:56:57,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:56:57,059 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-27 15:56:57,059 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869814930] [2019-12-27 15:56:57,060 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:56:57,060 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 15:56:57,060 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [267419082] [2019-12-27 15:56:57,060 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:56:57,062 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:56:57,067 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 37 transitions. [2019-12-27 15:56:57,068 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:56:57,068 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:56:57,069 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 15:56:57,069 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:56:57,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 15:56:57,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 15:56:57,070 INFO L87 Difference]: Start difference. First operand 28933 states and 105182 transitions. Second operand 5 states. [2019-12-27 15:56:57,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:56:57,145 INFO L93 Difference]: Finished difference Result 7525 states and 25719 transitions. [2019-12-27 15:56:57,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 15:56:57,146 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-27 15:56:57,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:56:57,163 INFO L225 Difference]: With dead ends: 7525 [2019-12-27 15:56:57,163 INFO L226 Difference]: Without dead ends: 7525 [2019-12-27 15:56:57,164 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 15:56:57,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7525 states. [2019-12-27 15:56:57,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7525 to 7525. [2019-12-27 15:56:57,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7525 states. [2019-12-27 15:56:57,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7525 states to 7525 states and 25719 transitions. [2019-12-27 15:56:57,327 INFO L78 Accepts]: Start accepts. Automaton has 7525 states and 25719 transitions. Word has length 17 [2019-12-27 15:56:57,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:56:57,328 INFO L462 AbstractCegarLoop]: Abstraction has 7525 states and 25719 transitions. [2019-12-27 15:56:57,328 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 15:56:57,328 INFO L276 IsEmpty]: Start isEmpty. Operand 7525 states and 25719 transitions. [2019-12-27 15:56:57,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 15:56:57,331 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:56:57,331 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-27 15:56:57,331 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:56:57,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:56:57,331 INFO L82 PathProgramCache]: Analyzing trace with hash 1496935772, now seen corresponding path program 1 times [2019-12-27 15:56:57,332 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:56:57,332 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276301584] [2019-12-27 15:56:57,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:56:57,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:56:57,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:56:57,422 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276301584] [2019-12-27 15:56:57,422 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:56:57,422 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:56:57,423 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [673159] [2019-12-27 15:56:57,423 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:56:57,425 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:56:57,429 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 37 states and 54 transitions. [2019-12-27 15:56:57,429 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:56:57,465 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 15:56:57,465 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 15:56:57,466 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:56:57,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 15:56:57,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 15:56:57,466 INFO L87 Difference]: Start difference. First operand 7525 states and 25719 transitions. Second operand 5 states. [2019-12-27 15:56:57,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:56:57,838 INFO L93 Difference]: Finished difference Result 10693 states and 35605 transitions. [2019-12-27 15:56:57,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 15:56:57,838 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-12-27 15:56:57,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:56:57,860 INFO L225 Difference]: With dead ends: 10693 [2019-12-27 15:56:57,861 INFO L226 Difference]: Without dead ends: 10693 [2019-12-27 15:56:57,861 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 15:56:57,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10693 states. [2019-12-27 15:56:58,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10693 to 10585. [2019-12-27 15:56:58,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10585 states. [2019-12-27 15:56:58,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10585 states to 10585 states and 35405 transitions. [2019-12-27 15:56:58,093 INFO L78 Accepts]: Start accepts. Automaton has 10585 states and 35405 transitions. Word has length 18 [2019-12-27 15:56:58,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:56:58,093 INFO L462 AbstractCegarLoop]: Abstraction has 10585 states and 35405 transitions. [2019-12-27 15:56:58,093 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 15:56:58,093 INFO L276 IsEmpty]: Start isEmpty. Operand 10585 states and 35405 transitions. [2019-12-27 15:56:58,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 15:56:58,097 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:56:58,097 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:56:58,097 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:56:58,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:56:58,098 INFO L82 PathProgramCache]: Analyzing trace with hash -839601205, now seen corresponding path program 1 times [2019-12-27 15:56:58,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:56:58,098 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469683681] [2019-12-27 15:56:58,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:56:58,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:56:58,133 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-27 15:56:58,133 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469683681] [2019-12-27 15:56:58,134 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:56:58,134 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 15:56:58,134 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [901461580] [2019-12-27 15:56:58,134 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:56:58,136 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:56:58,142 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 40 states and 59 transitions. [2019-12-27 15:56:58,142 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:56:58,153 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 15:56:58,154 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 15:56:58,154 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:56:58,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 15:56:58,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 15:56:58,155 INFO L87 Difference]: Start difference. First operand 10585 states and 35405 transitions. Second operand 4 states. [2019-12-27 15:56:58,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:56:58,366 INFO L93 Difference]: Finished difference Result 17745 states and 56415 transitions. [2019-12-27 15:56:58,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:56:58,367 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-27 15:56:58,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:56:58,403 INFO L225 Difference]: With dead ends: 17745 [2019-12-27 15:56:58,403 INFO L226 Difference]: Without dead ends: 17745 [2019-12-27 15:56:58,403 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 15:56:58,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17745 states. [2019-12-27 15:57:00,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17745 to 16385. [2019-12-27 15:57:00,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16385 states. [2019-12-27 15:57:00,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16385 states to 16385 states and 52887 transitions. [2019-12-27 15:57:00,139 INFO L78 Accepts]: Start accepts. Automaton has 16385 states and 52887 transitions. Word has length 19 [2019-12-27 15:57:00,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:57:00,139 INFO L462 AbstractCegarLoop]: Abstraction has 16385 states and 52887 transitions. [2019-12-27 15:57:00,139 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 15:57:00,140 INFO L276 IsEmpty]: Start isEmpty. Operand 16385 states and 52887 transitions. [2019-12-27 15:57:00,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 15:57:00,145 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:57:00,146 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:57:00,146 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:57:00,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:57:00,146 INFO L82 PathProgramCache]: Analyzing trace with hash 49865209, now seen corresponding path program 1 times [2019-12-27 15:57:00,147 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:57:00,147 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892063402] [2019-12-27 15:57:00,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:57:00,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:57:00,195 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-27 15:57:00,196 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892063402] [2019-12-27 15:57:00,196 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:57:00,196 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:57:00,196 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1268451031] [2019-12-27 15:57:00,196 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:57:00,199 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:57:00,207 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 46 states and 69 transitions. [2019-12-27 15:57:00,207 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:57:00,229 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 15:57:00,229 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 15:57:00,229 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:57:00,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 15:57:00,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 15:57:00,232 INFO L87 Difference]: Start difference. First operand 16385 states and 52887 transitions. Second operand 5 states. [2019-12-27 15:57:00,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:57:00,639 INFO L93 Difference]: Finished difference Result 20652 states and 65719 transitions. [2019-12-27 15:57:00,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 15:57:00,639 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-12-27 15:57:00,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:57:00,674 INFO L225 Difference]: With dead ends: 20652 [2019-12-27 15:57:00,675 INFO L226 Difference]: Without dead ends: 20652 [2019-12-27 15:57:00,675 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 15:57:00,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20652 states. [2019-12-27 15:57:00,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20652 to 16487. [2019-12-27 15:57:00,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16487 states. [2019-12-27 15:57:00,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16487 states to 16487 states and 53226 transitions. [2019-12-27 15:57:00,940 INFO L78 Accepts]: Start accepts. Automaton has 16487 states and 53226 transitions. Word has length 21 [2019-12-27 15:57:00,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:57:00,940 INFO L462 AbstractCegarLoop]: Abstraction has 16487 states and 53226 transitions. [2019-12-27 15:57:00,940 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 15:57:00,940 INFO L276 IsEmpty]: Start isEmpty. Operand 16487 states and 53226 transitions. [2019-12-27 15:57:00,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 15:57:00,961 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:57:00,961 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-27 15:57:00,961 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:57:00,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:57:00,962 INFO L82 PathProgramCache]: Analyzing trace with hash 2139224125, now seen corresponding path program 1 times [2019-12-27 15:57:00,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:57:00,962 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622094369] [2019-12-27 15:57:00,963 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:57:00,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:57:01,036 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-27 15:57:01,036 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622094369] [2019-12-27 15:57:01,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:57:01,037 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 15:57:01,037 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [393547415] [2019-12-27 15:57:01,037 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:57:01,043 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:57:01,063 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 79 states and 122 transitions. [2019-12-27 15:57:01,063 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:57:01,079 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 15:57:01,079 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 15:57:01,080 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:57:01,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 15:57:01,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-12-27 15:57:01,080 INFO L87 Difference]: Start difference. First operand 16487 states and 53226 transitions. Second operand 7 states. [2019-12-27 15:57:01,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:57:01,189 INFO L93 Difference]: Finished difference Result 14396 states and 48284 transitions. [2019-12-27 15:57:01,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 15:57:01,190 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2019-12-27 15:57:01,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:57:01,214 INFO L225 Difference]: With dead ends: 14396 [2019-12-27 15:57:01,214 INFO L226 Difference]: Without dead ends: 14396 [2019-12-27 15:57:01,215 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-12-27 15:57:01,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14396 states. [2019-12-27 15:57:01,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14396 to 13640. [2019-12-27 15:57:01,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13640 states. [2019-12-27 15:57:01,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13640 states to 13640 states and 46096 transitions. [2019-12-27 15:57:01,433 INFO L78 Accepts]: Start accepts. Automaton has 13640 states and 46096 transitions. Word has length 34 [2019-12-27 15:57:01,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:57:01,433 INFO L462 AbstractCegarLoop]: Abstraction has 13640 states and 46096 transitions. [2019-12-27 15:57:01,433 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 15:57:01,434 INFO L276 IsEmpty]: Start isEmpty. Operand 13640 states and 46096 transitions. [2019-12-27 15:57:01,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 15:57:01,460 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:57:01,460 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:57:01,461 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:57:01,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:57:01,461 INFO L82 PathProgramCache]: Analyzing trace with hash 414624015, now seen corresponding path program 1 times [2019-12-27 15:57:01,462 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:57:01,462 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211323684] [2019-12-27 15:57:01,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:57:01,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:57:01,552 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-27 15:57:01,556 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211323684] [2019-12-27 15:57:01,556 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:57:01,556 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 15:57:01,556 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2077496469] [2019-12-27 15:57:01,557 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:57:01,580 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:57:01,752 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 181 states and 296 transitions. [2019-12-27 15:57:01,752 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:57:01,754 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:57:01,754 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 15:57:01,754 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:57:01,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 15:57:01,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 15:57:01,755 INFO L87 Difference]: Start difference. First operand 13640 states and 46096 transitions. Second operand 4 states. [2019-12-27 15:57:02,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:57:02,011 INFO L93 Difference]: Finished difference Result 15595 states and 51374 transitions. [2019-12-27 15:57:02,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 15:57:02,012 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-12-27 15:57:02,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:57:02,027 INFO L225 Difference]: With dead ends: 15595 [2019-12-27 15:57:02,028 INFO L226 Difference]: Without dead ends: 8770 [2019-12-27 15:57:02,028 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-27 15:57:02,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8770 states. [2019-12-27 15:57:02,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8770 to 8770. [2019-12-27 15:57:02,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8770 states. [2019-12-27 15:57:02,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8770 states to 8770 states and 26856 transitions. [2019-12-27 15:57:02,148 INFO L78 Accepts]: Start accepts. Automaton has 8770 states and 26856 transitions. Word has length 64 [2019-12-27 15:57:02,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:57:02,148 INFO L462 AbstractCegarLoop]: Abstraction has 8770 states and 26856 transitions. [2019-12-27 15:57:02,148 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 15:57:02,148 INFO L276 IsEmpty]: Start isEmpty. Operand 8770 states and 26856 transitions. [2019-12-27 15:57:02,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 15:57:02,161 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:57:02,161 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:57:02,162 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:57:02,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:57:02,162 INFO L82 PathProgramCache]: Analyzing trace with hash 1912452979, now seen corresponding path program 2 times [2019-12-27 15:57:02,163 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:57:02,163 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514593987] [2019-12-27 15:57:02,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:57:02,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:57:02,228 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-27 15:57:02,229 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514593987] [2019-12-27 15:57:02,229 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:57:02,229 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:57:02,230 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [443079515] [2019-12-27 15:57:02,230 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:57:02,250 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:57:02,385 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 183 states and 300 transitions. [2019-12-27 15:57:02,385 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:57:02,386 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:57:02,386 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:57:02,387 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:57:02,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:57:02,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:57:02,387 INFO L87 Difference]: Start difference. First operand 8770 states and 26856 transitions. Second operand 3 states. [2019-12-27 15:57:02,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:57:02,420 INFO L93 Difference]: Finished difference Result 9754 states and 29017 transitions. [2019-12-27 15:57:02,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:57:02,425 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 15:57:02,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:57:02,435 INFO L225 Difference]: With dead ends: 9754 [2019-12-27 15:57:02,435 INFO L226 Difference]: Without dead ends: 5365 [2019-12-27 15:57:02,435 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-27 15:57:02,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5365 states. [2019-12-27 15:57:02,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5365 to 5365. [2019-12-27 15:57:02,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5365 states. [2019-12-27 15:57:02,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5365 states to 5365 states and 14367 transitions. [2019-12-27 15:57:02,500 INFO L78 Accepts]: Start accepts. Automaton has 5365 states and 14367 transitions. Word has length 64 [2019-12-27 15:57:02,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:57:02,500 INFO L462 AbstractCegarLoop]: Abstraction has 5365 states and 14367 transitions. [2019-12-27 15:57:02,500 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:57:02,500 INFO L276 IsEmpty]: Start isEmpty. Operand 5365 states and 14367 transitions. [2019-12-27 15:57:02,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 15:57:02,508 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:57:02,508 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:57:02,508 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:57:02,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:57:02,508 INFO L82 PathProgramCache]: Analyzing trace with hash -1133933701, now seen corresponding path program 3 times [2019-12-27 15:57:02,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:57:02,509 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509940706] [2019-12-27 15:57:02,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:57:02,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:57:02,589 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-27 15:57:02,590 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509940706] [2019-12-27 15:57:02,590 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:57:02,590 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 15:57:02,590 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1932595660] [2019-12-27 15:57:02,591 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:57:02,610 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:57:02,805 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 187 states and 308 transitions. [2019-12-27 15:57:02,805 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:57:02,806 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:57:02,806 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 15:57:02,806 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:57:02,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 15:57:02,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 15:57:02,807 INFO L87 Difference]: Start difference. First operand 5365 states and 14367 transitions. Second operand 4 states. [2019-12-27 15:57:02,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:57:02,846 INFO L93 Difference]: Finished difference Result 5845 states and 15448 transitions. [2019-12-27 15:57:02,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 15:57:02,847 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-12-27 15:57:02,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:57:02,848 INFO L225 Difference]: With dead ends: 5845 [2019-12-27 15:57:02,848 INFO L226 Difference]: Without dead ends: 564 [2019-12-27 15:57:02,848 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-27 15:57:02,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2019-12-27 15:57:02,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 564. [2019-12-27 15:57:02,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 564 states. [2019-12-27 15:57:02,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 1214 transitions. [2019-12-27 15:57:02,856 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 1214 transitions. Word has length 64 [2019-12-27 15:57:02,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:57:02,856 INFO L462 AbstractCegarLoop]: Abstraction has 564 states and 1214 transitions. [2019-12-27 15:57:02,856 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 15:57:02,856 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 1214 transitions. [2019-12-27 15:57:02,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 15:57:02,858 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:57:02,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:57:02,858 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:57:02,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:57:02,858 INFO L82 PathProgramCache]: Analyzing trace with hash 897701435, now seen corresponding path program 4 times [2019-12-27 15:57:02,859 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:57:02,859 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660440681] [2019-12-27 15:57:02,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:57:02,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:57:02,960 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-27 15:57:02,960 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660440681] [2019-12-27 15:57:02,960 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:57:02,961 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 15:57:02,961 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [552188486] [2019-12-27 15:57:02,961 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:57:02,979 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:57:03,116 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 124 states and 174 transitions. [2019-12-27 15:57:03,116 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:57:03,116 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:57:03,117 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 15:57:03,117 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:57:03,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 15:57:03,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 15:57:03,117 INFO L87 Difference]: Start difference. First operand 564 states and 1214 transitions. Second operand 5 states. [2019-12-27 15:57:03,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:57:03,179 INFO L93 Difference]: Finished difference Result 1115 states and 2414 transitions. [2019-12-27 15:57:03,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 15:57:03,180 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 64 [2019-12-27 15:57:03,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:57:03,181 INFO L225 Difference]: With dead ends: 1115 [2019-12-27 15:57:03,181 INFO L226 Difference]: Without dead ends: 564 [2019-12-27 15:57:03,181 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-27 15:57:03,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2019-12-27 15:57:03,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 564. [2019-12-27 15:57:03,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 564 states. [2019-12-27 15:57:03,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 1213 transitions. [2019-12-27 15:57:03,189 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 1213 transitions. Word has length 64 [2019-12-27 15:57:03,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:57:03,189 INFO L462 AbstractCegarLoop]: Abstraction has 564 states and 1213 transitions. [2019-12-27 15:57:03,189 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 15:57:03,189 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 1213 transitions. [2019-12-27 15:57:03,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 15:57:03,190 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:57:03,191 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 15:57:03,191 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:57:03,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:57:03,191 INFO L82 PathProgramCache]: Analyzing trace with hash 626369668, now seen corresponding path program 1 times [2019-12-27 15:57:03,192 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:57:03,192 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950056687] [2019-12-27 15:57:03,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:57:03,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:57:03,283 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-27 15:57:03,284 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950056687] [2019-12-27 15:57:03,284 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:57:03,284 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 15:57:03,284 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1224873820] [2019-12-27 15:57:03,284 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:57:03,304 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:57:03,407 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 125 states and 175 transitions. [2019-12-27 15:57:03,408 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:57:03,537 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 15:57:03,537 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 15:57:03,537 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:57:03,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 15:57:03,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-12-27 15:57:03,538 INFO L87 Difference]: Start difference. First operand 564 states and 1213 transitions. Second operand 11 states. [2019-12-27 15:57:05,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:57:05,592 INFO L93 Difference]: Finished difference Result 2871 states and 6167 transitions. [2019-12-27 15:57:05,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-27 15:57:05,592 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2019-12-27 15:57:05,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:57:05,595 INFO L225 Difference]: With dead ends: 2871 [2019-12-27 15:57:05,595 INFO L226 Difference]: Without dead ends: 1993 [2019-12-27 15:57:05,596 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=272, Invalid=988, Unknown=0, NotChecked=0, Total=1260 [2019-12-27 15:57:05,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1993 states. [2019-12-27 15:57:05,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1993 to 831. [2019-12-27 15:57:05,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 831 states. [2019-12-27 15:57:05,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1747 transitions. [2019-12-27 15:57:05,611 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1747 transitions. Word has length 65 [2019-12-27 15:57:05,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:57:05,611 INFO L462 AbstractCegarLoop]: Abstraction has 831 states and 1747 transitions. [2019-12-27 15:57:05,611 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 15:57:05,611 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1747 transitions. [2019-12-27 15:57:05,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 15:57:05,613 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:57:05,613 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:57:05,613 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:57:05,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:57:05,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1820368900, now seen corresponding path program 2 times [2019-12-27 15:57:05,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:57:05,615 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848953328] [2019-12-27 15:57:05,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:57:05,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:57:05,782 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-27 15:57:05,783 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848953328] [2019-12-27 15:57:05,783 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:57:05,783 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 15:57:05,783 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [232695521] [2019-12-27 15:57:05,784 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:57:05,807 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:57:05,891 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 125 states and 170 transitions. [2019-12-27 15:57:05,891 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:57:06,047 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 20 times. [2019-12-27 15:57:06,049 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 15:57:06,049 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:57:06,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 15:57:06,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-12-27 15:57:06,050 INFO L87 Difference]: Start difference. First operand 831 states and 1747 transitions. Second operand 13 states. [2019-12-27 15:57:06,997 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 37 [2019-12-27 15:57:07,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:57:07,691 INFO L93 Difference]: Finished difference Result 1750 states and 3435 transitions. [2019-12-27 15:57:07,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 15:57:07,692 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 65 [2019-12-27 15:57:07,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:57:07,694 INFO L225 Difference]: With dead ends: 1750 [2019-12-27 15:57:07,695 INFO L226 Difference]: Without dead ends: 1750 [2019-12-27 15:57:07,695 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=163, Invalid=539, Unknown=0, NotChecked=0, Total=702 [2019-12-27 15:57:07,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1750 states. [2019-12-27 15:57:07,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1750 to 945. [2019-12-27 15:57:07,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 945 states. [2019-12-27 15:57:07,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 945 states and 1857 transitions. [2019-12-27 15:57:07,708 INFO L78 Accepts]: Start accepts. Automaton has 945 states and 1857 transitions. Word has length 65 [2019-12-27 15:57:07,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:57:07,708 INFO L462 AbstractCegarLoop]: Abstraction has 945 states and 1857 transitions. [2019-12-27 15:57:07,708 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 15:57:07,708 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 1857 transitions. [2019-12-27 15:57:07,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 15:57:07,709 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:57:07,710 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:57:07,710 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:57:07,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:57:07,710 INFO L82 PathProgramCache]: Analyzing trace with hash -276182642, now seen corresponding path program 3 times [2019-12-27 15:57:07,711 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:57:07,711 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686941711] [2019-12-27 15:57:07,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:57:07,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:57:07,819 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-27 15:57:07,819 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686941711] [2019-12-27 15:57:07,819 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:57:07,819 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 15:57:07,819 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [473958739] [2019-12-27 15:57:07,820 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:57:07,832 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:57:07,921 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 97 states and 127 transitions. [2019-12-27 15:57:07,921 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:57:07,922 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 15:57:07,922 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 15:57:07,923 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:57:07,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 15:57:07,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-27 15:57:07,923 INFO L87 Difference]: Start difference. First operand 945 states and 1857 transitions. Second operand 8 states. [2019-12-27 15:57:08,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:57:08,166 INFO L93 Difference]: Finished difference Result 1300 states and 2450 transitions. [2019-12-27 15:57:08,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 15:57:08,166 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-27 15:57:08,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:57:08,168 INFO L225 Difference]: With dead ends: 1300 [2019-12-27 15:57:08,168 INFO L226 Difference]: Without dead ends: 1129 [2019-12-27 15:57:08,169 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2019-12-27 15:57:08,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1129 states. [2019-12-27 15:57:08,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1129 to 935. [2019-12-27 15:57:08,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 935 states. [2019-12-27 15:57:08,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 935 states to 935 states and 1837 transitions. [2019-12-27 15:57:08,181 INFO L78 Accepts]: Start accepts. Automaton has 935 states and 1837 transitions. Word has length 65 [2019-12-27 15:57:08,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:57:08,181 INFO L462 AbstractCegarLoop]: Abstraction has 935 states and 1837 transitions. [2019-12-27 15:57:08,182 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 15:57:08,182 INFO L276 IsEmpty]: Start isEmpty. Operand 935 states and 1837 transitions. [2019-12-27 15:57:08,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 15:57:08,183 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:57:08,184 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:57:08,184 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:57:08,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:57:08,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1390225604, now seen corresponding path program 4 times [2019-12-27 15:57:08,185 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:57:08,185 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108027052] [2019-12-27 15:57:08,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:57:08,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:57:08,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:57:08,273 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108027052] [2019-12-27 15:57:08,275 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:57:08,275 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:57:08,276 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2120287506] [2019-12-27 15:57:08,276 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:57:08,297 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:57:08,395 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 125 states and 178 transitions. [2019-12-27 15:57:08,395 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:57:08,396 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:57:08,396 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:57:08,396 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:57:08,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:57:08,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:57:08,397 INFO L87 Difference]: Start difference. First operand 935 states and 1837 transitions. Second operand 3 states. [2019-12-27 15:57:08,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:57:08,407 INFO L93 Difference]: Finished difference Result 934 states and 1835 transitions. [2019-12-27 15:57:08,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:57:08,407 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 15:57:08,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:57:08,411 INFO L225 Difference]: With dead ends: 934 [2019-12-27 15:57:08,412 INFO L226 Difference]: Without dead ends: 934 [2019-12-27 15:57:08,412 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-27 15:57:08,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 934 states. [2019-12-27 15:57:08,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 934 to 840. [2019-12-27 15:57:08,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 840 states. [2019-12-27 15:57:08,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 840 states and 1667 transitions. [2019-12-27 15:57:08,423 INFO L78 Accepts]: Start accepts. Automaton has 840 states and 1667 transitions. Word has length 65 [2019-12-27 15:57:08,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:57:08,423 INFO L462 AbstractCegarLoop]: Abstraction has 840 states and 1667 transitions. [2019-12-27 15:57:08,423 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:57:08,423 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 1667 transitions. [2019-12-27 15:57:08,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 15:57:08,424 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:57:08,424 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:57:08,424 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:57:08,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:57:08,425 INFO L82 PathProgramCache]: Analyzing trace with hash 1474232984, now seen corresponding path program 1 times [2019-12-27 15:57:08,425 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:57:08,425 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433705393] [2019-12-27 15:57:08,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:57:08,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 15:57:08,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 15:57:08,562 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 15:57:08,563 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 15:57:08,567 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1059] [1059] ULTIMATE.startENTRY-->L856: Formula: (let ((.cse0 (store |v_#valid_92| 0 0))) (and (= v_~weak$$choice2~0_289 0) (= v_~z$r_buff0_thd0~0_178 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t357~0.base_44|) 0) (= |v_#valid_90| (store .cse0 |v_ULTIMATE.start_main_~#t357~0.base_44| 1)) (= 0 v_~z$r_buff1_thd3~0_386) (= v_~z~0_311 0) (= |v_#NULL.offset_6| 0) (= 0 v_~__unbuffered_p1_EAX~0_71) (= v_~__unbuffered_cnt~0_176 0) (= v_~main$tmp_guard0~0_25 0) (< 0 |v_#StackHeapBarrier_19|) (= v_~z$read_delayed~0_6 0) (= v_~z$r_buff0_thd2~0_95 0) (= v_~z$read_delayed_var~0.base_5 0) (< |v_#StackHeapBarrier_19| |v_ULTIMATE.start_main_~#t357~0.base_44|) (= v_~__unbuffered_p1_EBX~0_70 0) (= 0 v_~z$mem_tmp~0_209) (= v_~z$read_delayed_var~0.offset_5 0) (= v_~z$r_buff1_thd1~0_163 0) (= v_~z$w_buff0~0_362 0) (= 0 v_~z$r_buff0_thd4~0_531) (= v_~z$r_buff0_thd1~0_95 0) (= 0 |v_#NULL.base_6|) (= 0 v_~weak$$choice0~0_196) (= 0 v_~z$flush_delayed~0_243) (= 0 v_~__unbuffered_p3_EBX~0_64) (= v_~z$w_buff0_used~0_937 0) (= 0 v_~__unbuffered_p2_EAX~0_86) (= v_~z$r_buff1_thd2~0_163 0) (= 0 |v_ULTIMATE.start_main_~#t357~0.offset_28|) (= v_~z$w_buff1~0_247 0) (= 0 v_~z$r_buff0_thd3~0_403) (= v_~a~0_42 0) (= |v_#length_29| (store |v_#length_30| |v_ULTIMATE.start_main_~#t357~0.base_44| 4)) (= v_~z$w_buff1_used~0_682 0) (= v_~y~0_58 0) (= (store |v_#memory_int_30| |v_ULTIMATE.start_main_~#t357~0.base_44| (store (select |v_#memory_int_30| |v_ULTIMATE.start_main_~#t357~0.base_44|) |v_ULTIMATE.start_main_~#t357~0.offset_28| 0)) |v_#memory_int_29|) (= v_~z$r_buff1_thd0~0_268 0) (= v_~main$tmp_guard1~0_55 0) (= 0 v_~z$r_buff1_thd4~0_339) (= v_~x~0_88 0) (= 0 v_~__unbuffered_p3_EAX~0_71))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_19|, #valid=|v_#valid_92|, #memory_int=|v_#memory_int_30|, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_8|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_8|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_163, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_114|, ~a~0=v_~a~0_42, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_178, ULTIMATE.start_main_~#t357~0.offset=|v_ULTIMATE.start_main_~#t357~0.offset_28|, ULTIMATE.start_main_~#t359~0.base=|v_ULTIMATE.start_main_~#t359~0.base_23|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_71, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_531, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_71, #length=|v_#length_29|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_86, ~z$mem_tmp~0=v_~z$mem_tmp~0_209, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_682, ~z$flush_delayed~0=v_~z$flush_delayed~0_243, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_28|, ~weak$$choice0~0=v_~weak$$choice0~0_196, #StackHeapBarrier=|v_#StackHeapBarrier_19|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_202|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_163, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_5, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_403, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_176, ~x~0=v_~x~0_88, ULTIMATE.start_main_~#t358~0.offset=|v_ULTIMATE.start_main_~#t358~0.offset_24|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_339, ULTIMATE.start_main_#t~nondet58=|v_ULTIMATE.start_main_#t~nondet58_24|, 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_247, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_55, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_5, ULTIMATE.start_main_~#t360~0.offset=|v_ULTIMATE.start_main_~#t360~0.offset_18|, ULTIMATE.start_main_~#t360~0.base=|v_ULTIMATE.start_main_~#t360~0.base_24|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_268, ULTIMATE.start_main_~#t357~0.base=|v_ULTIMATE.start_main_~#t357~0.base_44|, ~y~0=v_~y~0_58, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_95, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_70, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_937, ~z$w_buff0~0=v_~z$w_buff0~0_362, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_386, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_84|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_25, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_64, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_84|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_106|, ULTIMATE.start_main_~#t359~0.offset=|v_ULTIMATE.start_main_~#t359~0.offset_18|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_27|, #valid=|v_#valid_90|, #memory_int=|v_#memory_int_29|, ULTIMATE.start_main_~#t358~0.base=|v_ULTIMATE.start_main_~#t358~0.base_36|, ~z~0=v_~z~0_311, ~weak$$choice2~0=v_~weak$$choice2~0_289, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_95} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_#t~ite64, ~a~0, ~z$r_buff0_thd0~0, ULTIMATE.start_main_~#t357~0.offset, ULTIMATE.start_main_~#t359~0.base, ~__unbuffered_p1_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t358~0.offset, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet58, ULTIMATE.start_main_#t~nondet56, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t360~0.offset, ULTIMATE.start_main_~#t360~0.base, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t357~0.base, ~y~0, ~z$r_buff0_thd2~0, ~__unbuffered_p1_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_~#t359~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t358~0.base, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 15:57:08,570 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1032] [1032] L856-1-->L858: Formula: (and (= (store |v_#valid_49| |v_ULTIMATE.start_main_~#t358~0.base_11| 1) |v_#valid_48|) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t358~0.base_11|) (not (= 0 |v_ULTIMATE.start_main_~#t358~0.base_11|)) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t358~0.base_11| 4)) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t358~0.base_11| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t358~0.base_11|) |v_ULTIMATE.start_main_~#t358~0.offset_10| 1)) |v_#memory_int_21|) (= 0 (select |v_#valid_49| |v_ULTIMATE.start_main_~#t358~0.base_11|)) (= 0 |v_ULTIMATE.start_main_~#t358~0.offset_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_22|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t358~0.offset=|v_ULTIMATE.start_main_~#t358~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_5|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_21|, #length=|v_#length_21|, ULTIMATE.start_main_~#t358~0.base=|v_ULTIMATE.start_main_~#t358~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t358~0.offset, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length, ULTIMATE.start_main_~#t358~0.base] because there is no mapped edge [2019-12-27 15:57:08,571 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1030] [1030] L858-1-->L860: Formula: (and (= (store |v_#valid_47| |v_ULTIMATE.start_main_~#t359~0.base_12| 1) |v_#valid_46|) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t359~0.base_12| 4)) (not (= |v_ULTIMATE.start_main_~#t359~0.base_12| 0)) (= 0 |v_ULTIMATE.start_main_~#t359~0.offset_11|) (= (select |v_#valid_47| |v_ULTIMATE.start_main_~#t359~0.base_12|) 0) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t359~0.base_12|) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t359~0.base_12| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t359~0.base_12|) |v_ULTIMATE.start_main_~#t359~0.offset_11| 2)) |v_#memory_int_19|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_20|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t359~0.base=|v_ULTIMATE.start_main_~#t359~0.base_12|, ULTIMATE.start_main_~#t359~0.offset=|v_ULTIMATE.start_main_~#t359~0.offset_11|, #valid=|v_#valid_46|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_5|, #memory_int=|v_#memory_int_19|, #length=|v_#length_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t359~0.base, ULTIMATE.start_main_~#t359~0.offset, #valid, ULTIMATE.start_main_#t~nondet56, #memory_int, #length] because there is no mapped edge [2019-12-27 15:57:08,573 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1035] [1035] L860-1-->L862: Formula: (and (= |v_ULTIMATE.start_main_~#t360~0.offset_11| 0) (= |v_#valid_50| (store |v_#valid_51| |v_ULTIMATE.start_main_~#t360~0.base_13| 1)) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t360~0.base_13| 4)) (not (= |v_ULTIMATE.start_main_~#t360~0.base_13| 0)) (= (select |v_#valid_51| |v_ULTIMATE.start_main_~#t360~0.base_13|) 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t360~0.base_13|) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t360~0.base_13| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t360~0.base_13|) |v_ULTIMATE.start_main_~#t360~0.offset_11| 3)) |v_#memory_int_23|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_51|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_~#t360~0.offset=|v_ULTIMATE.start_main_~#t360~0.offset_11|, ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_5|, ULTIMATE.start_main_~#t360~0.base=|v_ULTIMATE.start_main_~#t360~0.base_13|, #valid=|v_#valid_50|, #memory_int=|v_#memory_int_23|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t360~0.offset, ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_~#t360~0.base, #valid, #memory_int, #length] because there is no mapped edge [2019-12-27 15:57:08,575 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [901] [901] P3ENTRY-->L4-3: Formula: (and (= 0 (mod v_~z$w_buff1_used~0_52 256)) (= 1 |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_6|) (= 1 v_~z$w_buff0~0_22) (= v_P3Thread1of1ForFork2_~arg.base_6 |v_P3Thread1of1ForFork2_#in~arg.base_6|) (= |v_P3Thread1of1ForFork2_#in~arg.offset_6| v_P3Thread1of1ForFork2_~arg.offset_6) (= v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_8 |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_6|) (= v_~z$w_buff0_used~0_90 1) (= v_~z$w_buff0~0_23 v_~z$w_buff1~0_19) (= v_~z$w_buff0_used~0_91 v_~z$w_buff1_used~0_52)) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_91, ~z$w_buff0~0=v_~z$w_buff0~0_23, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_6|, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_6|} OutVars{P3Thread1of1ForFork2___VERIFIER_assert_~expression=v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_8, P3Thread1of1ForFork2_~arg.offset=v_P3Thread1of1ForFork2_~arg.offset_6, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_90, ~z$w_buff0~0=v_~z$w_buff0~0_22, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_52, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_6|, ~z$w_buff1~0=v_~z$w_buff1~0_19, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression=|v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_6|, P3Thread1of1ForFork2_~arg.base=v_P3Thread1of1ForFork2_~arg.base_6, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_6|} AuxVars[] AssignedVars[P3Thread1of1ForFork2___VERIFIER_assert_~expression, P3Thread1of1ForFork2_~arg.offset, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression, P3Thread1of1ForFork2_~arg.base] because there is no mapped edge [2019-12-27 15:57:08,579 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [978] [978] L818-2-->L818-5: Formula: (let ((.cse0 (= |P3Thread1of1ForFork2_#t~ite28_Out1275512004| |P3Thread1of1ForFork2_#t~ite29_Out1275512004|)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In1275512004 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In1275512004 256)))) (or (and (= |P3Thread1of1ForFork2_#t~ite28_Out1275512004| ~z$w_buff0~0_In1275512004) .cse0 (not .cse1) (not .cse2)) (and .cse0 (= |P3Thread1of1ForFork2_#t~ite28_Out1275512004| ~z$w_buff1~0_In1275512004) (or .cse2 .cse1)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In1275512004, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1275512004, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1275512004, ~z$w_buff1~0=~z$w_buff1~0_In1275512004} OutVars{P3Thread1of1ForFork2_#t~ite29=|P3Thread1of1ForFork2_#t~ite29_Out1275512004|, P3Thread1of1ForFork2_#t~ite28=|P3Thread1of1ForFork2_#t~ite28_Out1275512004|, ~z$w_buff0~0=~z$w_buff0~0_In1275512004, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1275512004, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1275512004, ~z$w_buff1~0=~z$w_buff1~0_In1275512004} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite29, P3Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-27 15:57:08,592 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [931] [931] L823-->L824: Formula: (and (= v_~z$r_buff0_thd4~0_102 v_~z$r_buff0_thd4~0_101) (not (= 0 (mod v_~weak$$choice2~0_68 256)))) InVars {~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_102, ~weak$$choice2~0=v_~weak$$choice2~0_68} OutVars{P3Thread1of1ForFork2_#t~ite42=|v_P3Thread1of1ForFork2_#t~ite42_8|, P3Thread1of1ForFork2_#t~ite43=|v_P3Thread1of1ForFork2_#t~ite43_11|, P3Thread1of1ForFork2_#t~ite44=|v_P3Thread1of1ForFork2_#t~ite44_11|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_101, ~weak$$choice2~0=v_~weak$$choice2~0_68} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite42, P3Thread1of1ForFork2_#t~ite43, P3Thread1of1ForFork2_#t~ite44, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-27 15:57:08,595 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [976] [976] L826-->L826-2: Formula: (let ((.cse0 (= (mod ~z$flush_delayed~0_In1193229408 256) 0))) (or (and (not .cse0) (= |P3Thread1of1ForFork2_#t~ite48_Out1193229408| ~z$mem_tmp~0_In1193229408)) (and (= ~z~0_In1193229408 |P3Thread1of1ForFork2_#t~ite48_Out1193229408|) .cse0))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In1193229408, ~z$flush_delayed~0=~z$flush_delayed~0_In1193229408, ~z~0=~z~0_In1193229408} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In1193229408, P3Thread1of1ForFork2_#t~ite48=|P3Thread1of1ForFork2_#t~ite48_Out1193229408|, ~z$flush_delayed~0=~z$flush_delayed~0_In1193229408, ~z~0=~z~0_In1193229408} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite48] because there is no mapped edge [2019-12-27 15:57:08,597 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1025] [1025] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork3_#res.base_5|) (= v_~a~0_15 1) (= v_~x~0_24 1) (= v_P0Thread1of1ForFork3_~arg.base_10 |v_P0Thread1of1ForFork3_#in~arg.base_10|) (= |v_P0Thread1of1ForFork3_#res.offset_5| 0) (= |v_P0Thread1of1ForFork3_#in~arg.offset_10| v_P0Thread1of1ForFork3_~arg.offset_10) (= (+ v_~__unbuffered_cnt~0_87 1) v_~__unbuffered_cnt~0_86)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_87, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_10|} OutVars{~a~0=v_~a~0_15, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_10|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_10, P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_86, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_5|, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_10, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_10|, ~x~0=v_~x~0_24} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset, P0Thread1of1ForFork3_~arg.offset, ~x~0] because there is no mapped edge [2019-12-27 15:57:08,597 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1027] [1027] P1ENTRY-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_9|) (= v_P1Thread1of1ForFork0_~arg.base_11 |v_P1Thread1of1ForFork0_#in~arg.base_11|) (= v_~__unbuffered_p1_EBX~0_22 v_~y~0_39) (= 0 |v_P1Thread1of1ForFork0_#res.base_9|) (= |v_P1Thread1of1ForFork0_#in~arg.offset_11| v_P1Thread1of1ForFork0_~arg.offset_11) (= v_~x~0_28 2) (= v_~x~0_28 v_~__unbuffered_p1_EAX~0_23) (= (+ v_~__unbuffered_cnt~0_93 1) v_~__unbuffered_cnt~0_92)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_11|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_93, ~y~0=v_~y~0_39} OutVars{~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_22, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_11, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_23, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_11, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_11|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_92, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_9|, ~y~0=v_~y~0_39, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_9|, ~x~0=v_~x~0_28} AuxVars[] AssignedVars[~__unbuffered_p1_EBX~0, P1Thread1of1ForFork0_~arg.offset, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork0_~arg.base, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base, ~x~0] because there is no mapped edge [2019-12-27 15:57:08,623 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [980] [980] L788-->L788-2: Formula: (let ((.cse0 (= (mod ~z$flush_delayed~0_In264702260 256) 0))) (or (and (= ~z$mem_tmp~0_In264702260 |P2Thread1of1ForFork1_#t~ite25_Out264702260|) (not .cse0)) (and (= |P2Thread1of1ForFork1_#t~ite25_Out264702260| ~z~0_In264702260) .cse0))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In264702260, ~z$flush_delayed~0=~z$flush_delayed~0_In264702260, ~z~0=~z~0_In264702260} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In264702260, P2Thread1of1ForFork1_#t~ite25=|P2Thread1of1ForFork1_#t~ite25_Out264702260|, ~z$flush_delayed~0=~z$flush_delayed~0_In264702260, ~z~0=~z~0_In264702260} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-27 15:57:08,625 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [993] [993] L834-->L834-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-287509174 256))) (.cse0 (= (mod ~z$r_buff0_thd4~0_In-287509174 256) 0))) (or (and (not .cse0) (= |P3Thread1of1ForFork2_#t~ite51_Out-287509174| 0) (not .cse1)) (and (= |P3Thread1of1ForFork2_#t~ite51_Out-287509174| ~z$w_buff0_used~0_In-287509174) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-287509174, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-287509174} OutVars{P3Thread1of1ForFork2_#t~ite51=|P3Thread1of1ForFork2_#t~ite51_Out-287509174|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-287509174, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-287509174} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite51] because there is no mapped edge [2019-12-27 15:57:08,627 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [983] [983] L835-->L835-2: Formula: (let ((.cse2 (= (mod ~z$r_buff0_thd4~0_In1702525159 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In1702525159 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd4~0_In1702525159 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In1702525159 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P3Thread1of1ForFork2_#t~ite52_Out1702525159| ~z$w_buff1_used~0_In1702525159)) (and (= |P3Thread1of1ForFork2_#t~ite52_Out1702525159| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1702525159, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1702525159, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1702525159, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1702525159} OutVars{P3Thread1of1ForFork2_#t~ite52=|P3Thread1of1ForFork2_#t~ite52_Out1702525159|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1702525159, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1702525159, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1702525159, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1702525159} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite52] because there is no mapped edge [2019-12-27 15:57:08,629 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [979] [979] L836-->L837: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In-774331020 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-774331020 256) 0))) (or (and (= 0 ~z$r_buff0_thd4~0_Out-774331020) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~z$r_buff0_thd4~0_Out-774331020 ~z$r_buff0_thd4~0_In-774331020)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-774331020, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-774331020} OutVars{P3Thread1of1ForFork2_#t~ite53=|P3Thread1of1ForFork2_#t~ite53_Out-774331020|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-774331020, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-774331020} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite53, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-27 15:57:08,629 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [981] [981] L837-->L837-2: Formula: (let ((.cse2 (= (mod ~z$w_buff0_used~0_In-632901137 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd4~0_In-632901137 256))) (.cse0 (= (mod ~z$r_buff1_thd4~0_In-632901137 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In-632901137 256) 0))) (or (and (= ~z$r_buff1_thd4~0_In-632901137 |P3Thread1of1ForFork2_#t~ite54_Out-632901137|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P3Thread1of1ForFork2_#t~ite54_Out-632901137|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-632901137, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-632901137, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-632901137, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-632901137} OutVars{P3Thread1of1ForFork2_#t~ite54=|P3Thread1of1ForFork2_#t~ite54_Out-632901137|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-632901137, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-632901137, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-632901137, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-632901137} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite54] because there is no mapped edge [2019-12-27 15:57:08,629 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1031] [1031] L837-2-->P3EXIT: Formula: (and (= 0 |v_P3Thread1of1ForFork2_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_111 1) v_~__unbuffered_cnt~0_110) (= 0 |v_P3Thread1of1ForFork2_#res.base_5|) (= |v_P3Thread1of1ForFork2_#t~ite54_44| v_~z$r_buff1_thd4~0_264)) InVars {P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_44|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_111} OutVars{P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_43|, P3Thread1of1ForFork2_#res.base=|v_P3Thread1of1ForFork2_#res.base_5|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_264, P3Thread1of1ForFork2_#res.offset=|v_P3Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_110} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite54, P3Thread1of1ForFork2_#res.base, ~z$r_buff1_thd4~0, P3Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 15:57:08,630 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1020] [1020] L788-2-->P2EXIT: Formula: (and (= 0 v_~z$flush_delayed~0_182) (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= v_~z~0_183 |v_P2Thread1of1ForFork1_#t~ite25_46|) (= (+ v_~__unbuffered_cnt~0_67 1) v_~__unbuffered_cnt~0_66)) InVars {P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_46|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_67} OutVars{P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_45|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_66, ~z$flush_delayed~0=v_~z$flush_delayed~0_182, ~z~0=v_~z~0_183, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25, P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-27 15:57:08,630 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [919] [919] L862-1-->L868: Formula: (and (= 4 v_~__unbuffered_cnt~0_26) (= v_~main$tmp_guard0~0_8 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_26} OutVars{ULTIMATE.start_main_#t~nondet58=|v_ULTIMATE.start_main_#t~nondet58_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_26, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet58, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 15:57:08,632 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [987] [987] L868-2-->L868-4: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In-2038656377 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-2038656377 256)))) (or (and (or .cse0 .cse1) (= ~z~0_In-2038656377 |ULTIMATE.start_main_#t~ite59_Out-2038656377|)) (and (= |ULTIMATE.start_main_#t~ite59_Out-2038656377| ~z$w_buff1~0_In-2038656377) (not .cse1) (not .cse0)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2038656377, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2038656377, ~z$w_buff1~0=~z$w_buff1~0_In-2038656377, ~z~0=~z~0_In-2038656377} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2038656377, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2038656377, ~z$w_buff1~0=~z$w_buff1~0_In-2038656377, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out-2038656377|, ~z~0=~z~0_In-2038656377} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-27 15:57:08,632 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [962] [962] L868-4-->L869: Formula: (= v_~z~0_104 |v_ULTIMATE.start_main_#t~ite59_32|) InVars {ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_32|} OutVars{ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_25|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_31|, ~z~0=v_~z~0_104} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite59, ~z~0] because there is no mapped edge [2019-12-27 15:57:08,632 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [990] [990] L869-->L869-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1313301552 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-1313301552 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite61_Out-1313301552| ~z$w_buff0_used~0_In-1313301552)) (and (= 0 |ULTIMATE.start_main_#t~ite61_Out-1313301552|) (not .cse0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1313301552, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1313301552} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1313301552, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-1313301552|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1313301552} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-27 15:57:08,634 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [996] [996] L870-->L870-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In1105013148 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In1105013148 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In1105013148 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In1105013148 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite62_Out1105013148| ~z$w_buff1_used~0_In1105013148) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |ULTIMATE.start_main_#t~ite62_Out1105013148| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1105013148, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1105013148, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1105013148, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1105013148} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out1105013148|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1105013148, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1105013148, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1105013148, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1105013148} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-27 15:57:08,636 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [977] [977] L871-->L871-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-125786547 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-125786547 256)))) (or (and (= |ULTIMATE.start_main_#t~ite63_Out-125786547| ~z$r_buff0_thd0~0_In-125786547) (or .cse0 .cse1)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite63_Out-125786547|) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-125786547, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-125786547} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-125786547|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-125786547, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-125786547} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-27 15:57:08,638 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [984] [984] L872-->L872-2: Formula: (let ((.cse3 (= (mod ~z$r_buff0_thd0~0_In1749905076 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In1749905076 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In1749905076 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In1749905076 256)))) (or (and (= |ULTIMATE.start_main_#t~ite64_Out1749905076| ~z$r_buff1_thd0~0_In1749905076) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite64_Out1749905076|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1749905076, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1749905076, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1749905076, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1749905076} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1749905076, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1749905076, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1749905076, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1749905076, ULTIMATE.start_main_#t~ite64=|ULTIMATE.start_main_#t~ite64_Out1749905076|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-27 15:57:08,638 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1046] [1046] L872-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_21 0) (= 2 v_~__unbuffered_p1_EAX~0_33) (= v_~x~0_44 2) (= v_~__unbuffered_p1_EBX~0_32 0) (= 0 v_~__unbuffered_p2_EAX~0_48) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12| (mod v_~main$tmp_guard1~0_21 256)) (= 1 v_~__unbuffered_p3_EAX~0_33) (= 0 v_~__unbuffered_p3_EBX~0_28) (= v_~z$r_buff1_thd0~0_227 |v_ULTIMATE.start_main_#t~ite64_49|)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_32, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_33, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_33, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_48, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_28, ~x~0=v_~x~0_44, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_49|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_32, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_33, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_227, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_33, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_48, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_28, ~x~0=v_~x~0_44, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_48|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite64, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 15:57:08,762 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 03:57:08 BasicIcfg [2019-12-27 15:57:08,762 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 15:57:08,764 INFO L168 Benchmark]: Toolchain (without parser) took 54368.29 ms. Allocated memory was 138.9 MB in the beginning and 2.1 GB in the end (delta: 2.0 GB). Free memory was 102.5 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 902.4 MB. Max. memory is 7.1 GB. [2019-12-27 15:57:08,765 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 15:57:08,766 INFO L168 Benchmark]: CACSL2BoogieTranslator took 848.86 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 102.1 MB in the beginning and 153.6 MB in the end (delta: -51.5 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. [2019-12-27 15:57:08,766 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.47 ms. Allocated memory is still 203.4 MB. Free memory was 153.6 MB in the beginning and 150.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 15:57:08,767 INFO L168 Benchmark]: Boogie Preprocessor took 44.10 ms. Allocated memory is still 203.4 MB. Free memory was 150.9 MB in the beginning and 148.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 15:57:08,767 INFO L168 Benchmark]: RCFGBuilder took 968.03 ms. Allocated memory was 203.4 MB in the beginning and 237.0 MB in the end (delta: 33.6 MB). Free memory was 148.2 MB in the beginning and 207.6 MB in the end (delta: -59.5 MB). Peak memory consumption was 64.7 MB. Max. memory is 7.1 GB. [2019-12-27 15:57:08,768 INFO L168 Benchmark]: TraceAbstraction took 52430.09 ms. Allocated memory was 237.0 MB in the beginning and 2.1 GB in the end (delta: 1.9 GB). Free memory was 206.2 MB in the beginning and 1.2 GB in the end (delta: -1.0 GB). Peak memory consumption was 908.1 MB. Max. memory is 7.1 GB. [2019-12-27 15:57:08,771 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 848.86 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 102.1 MB in the beginning and 153.6 MB in the end (delta: -51.5 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 68.47 ms. Allocated memory is still 203.4 MB. Free memory was 153.6 MB in the beginning and 150.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 44.10 ms. Allocated memory is still 203.4 MB. Free memory was 150.9 MB in the beginning and 148.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 968.03 ms. Allocated memory was 203.4 MB in the beginning and 237.0 MB in the end (delta: 33.6 MB). Free memory was 148.2 MB in the beginning and 207.6 MB in the end (delta: -59.5 MB). Peak memory consumption was 64.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 52430.09 ms. Allocated memory was 237.0 MB in the beginning and 2.1 GB in the end (delta: 1.9 GB). Free memory was 206.2 MB in the beginning and 1.2 GB in the end (delta: -1.0 GB). Peak memory consumption was 908.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 7.0s, 212 ProgramPointsBefore, 114 ProgramPointsAfterwards, 255 TransitionsBefore, 134 TransitionsAfterwards, 26510 CoEnabledTransitionPairs, 8 FixpointIterations, 38 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 48 ConcurrentYvCompositions, 28 ChoiceCompositions, 11004 VarBasedMoverChecksPositive, 332 VarBasedMoverChecksNegative, 88 SemBasedMoverChecksPositive, 353 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.5s, 0 MoverChecksTotal, 147467 CheckedPairsTotal, 131 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L856] FCALL, FORK 0 pthread_create(&t357, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L858] FCALL, FORK 0 pthread_create(&t358, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L860] FCALL, FORK 0 pthread_create(&t359, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L862] FCALL, FORK 0 pthread_create(&t360, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L806] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L807] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L808] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L809] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L810] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L811] 4 z$r_buff0_thd4 = (_Bool)1 [L814] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L815] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L816] 4 z$flush_delayed = weak$$choice2 [L817] 4 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L818] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L818] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L819] EXPR 4 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L819] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L820] EXPR 4 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L820] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L821] EXPR 4 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L821] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L822] EXPR 4 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L822] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L824] EXPR 4 weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L824] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L825] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L826] 4 z = z$flush_delayed ? z$mem_tmp : z [L827] 4 z$flush_delayed = (_Bool)0 [L830] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L773] 3 y = 1 [L776] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L777] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L778] 3 z$flush_delayed = weak$$choice2 [L779] 3 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, 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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, 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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] 3 z = !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) [L781] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L833] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L781] 3 z$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)) [L782] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))=0, x=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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L782] 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)) [L783] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))=1, x=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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L783] 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)) [L784] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L784] 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)) [L785] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3))=0, x=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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L786] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L786] 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)) [L787] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, 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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L833] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L834] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L835] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L868] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, 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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L869] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L870] 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 [L871] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 200 locations, 2 error locations. Result: UNSAFE, OverallTime: 52.0s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 11.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2858 SDtfs, 4498 SDslu, 6080 SDs, 0 SdLazy, 2732 SolverSat, 288 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 158 GetRequests, 47 SyntacticMatches, 4 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 387 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=94794occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 19.0s AutomataMinimizationTime, 16 MinimizatonAttempts, 8644 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 731 NumberOfCodeBlocks, 731 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 649 ConstructedInterpolants, 0 QuantifiedInterpolants, 100743 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...