/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/mix007_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 15:42:17,963 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 15:42:17,966 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 15:42:17,980 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 15:42:17,980 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 15:42:17,982 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 15:42:17,984 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 15:42:17,989 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 15:42:17,997 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 15:42:17,998 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 15:42:17,999 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 15:42:18,001 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 15:42:18,002 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 15:42:18,003 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 15:42:18,005 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 15:42:18,007 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 15:42:18,009 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 15:42:18,012 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 15:42:18,014 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 15:42:18,017 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 15:42:18,018 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 15:42:18,019 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 15:42:18,023 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 15:42:18,024 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 15:42:18,026 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 15:42:18,027 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 15:42:18,027 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 15:42:18,029 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 15:42:18,030 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 15:42:18,032 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 15:42:18,033 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 15:42:18,033 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 15:42:18,034 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 15:42:18,036 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 15:42:18,039 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 15:42:18,039 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 15:42:18,040 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 15:42:18,041 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 15:42:18,041 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 15:42:18,044 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 15:42:18,045 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 15:42:18,046 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:42:18,079 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 15:42:18,079 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 15:42:18,080 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 15:42:18,080 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 15:42:18,081 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 15:42:18,081 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 15:42:18,081 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 15:42:18,081 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 15:42:18,081 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 15:42:18,082 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 15:42:18,082 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 15:42:18,082 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 15:42:18,082 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 15:42:18,082 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 15:42:18,082 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 15:42:18,083 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 15:42:18,083 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 15:42:18,083 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 15:42:18,083 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 15:42:18,083 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 15:42:18,084 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 15:42:18,084 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 15:42:18,084 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 15:42:18,084 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 15:42:18,084 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 15:42:18,085 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 15:42:18,085 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 15:42:18,085 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 15:42:18,085 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 15:42:18,085 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 15:42:18,085 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 15:42:18,370 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 15:42:18,381 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 15:42:18,384 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 15:42:18,385 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 15:42:18,386 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 15:42:18,386 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix007_power.opt.i [2019-12-27 15:42:18,465 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa740ba25/a021a48ae15a46f5b05aa026255b001e/FLAG0fb04e9eb [2019-12-27 15:42:19,033 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 15:42:19,033 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix007_power.opt.i [2019-12-27 15:42:19,053 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa740ba25/a021a48ae15a46f5b05aa026255b001e/FLAG0fb04e9eb [2019-12-27 15:42:19,332 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa740ba25/a021a48ae15a46f5b05aa026255b001e [2019-12-27 15:42:19,343 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 15:42:19,345 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 15:42:19,346 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 15:42:19,346 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 15:42:19,350 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 15:42:19,351 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:42:19" (1/1) ... [2019-12-27 15:42:19,355 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fdaac8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:42:19, skipping insertion in model container [2019-12-27 15:42:19,356 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:42:19" (1/1) ... [2019-12-27 15:42:19,364 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 15:42:19,435 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 15:42:20,011 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 15:42:20,023 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 15:42:20,086 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 15:42:20,162 INFO L208 MainTranslator]: Completed translation [2019-12-27 15:42:20,162 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:42:20 WrapperNode [2019-12-27 15:42:20,163 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 15:42:20,164 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 15:42:20,164 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 15:42:20,164 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 15:42:20,174 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:42:20" (1/1) ... [2019-12-27 15:42:20,201 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:42:20" (1/1) ... [2019-12-27 15:42:20,236 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 15:42:20,237 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 15:42:20,237 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 15:42:20,237 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 15:42:20,249 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:42:20" (1/1) ... [2019-12-27 15:42:20,249 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:42:20" (1/1) ... [2019-12-27 15:42:20,254 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:42:20" (1/1) ... [2019-12-27 15:42:20,255 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:42:20" (1/1) ... [2019-12-27 15:42:20,267 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:42:20" (1/1) ... [2019-12-27 15:42:20,271 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:42:20" (1/1) ... [2019-12-27 15:42:20,275 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:42:20" (1/1) ... [2019-12-27 15:42:20,281 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 15:42:20,281 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 15:42:20,281 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 15:42:20,282 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 15:42:20,283 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:42:20" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 15:42:20,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 15:42:20,375 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 15:42:20,375 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 15:42:20,376 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 15:42:20,376 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 15:42:20,376 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 15:42:20,376 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 15:42:20,377 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 15:42:20,377 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 15:42:20,377 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 15:42:20,377 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-27 15:42:20,378 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-27 15:42:20,378 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 15:42:20,378 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 15:42:20,378 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 15:42:20,380 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:42:21,261 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 15:42:21,261 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 15:42:21,263 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:42:21 BoogieIcfgContainer [2019-12-27 15:42:21,263 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 15:42:21,264 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 15:42:21,264 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 15:42:21,267 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 15:42:21,268 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 03:42:19" (1/3) ... [2019-12-27 15:42:21,269 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75d18054 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:42:21, skipping insertion in model container [2019-12-27 15:42:21,269 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:42:20" (2/3) ... [2019-12-27 15:42:21,269 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75d18054 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:42:21, skipping insertion in model container [2019-12-27 15:42:21,269 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:42:21" (3/3) ... [2019-12-27 15:42:21,271 INFO L109 eAbstractionObserver]: Analyzing ICFG mix007_power.opt.i [2019-12-27 15:42:21,281 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 15:42:21,281 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 15:42:21,289 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 15:42:21,290 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 15:42:21,332 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,332 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,332 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,332 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,333 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,333 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,333 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,333 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,334 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,334 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,334 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,334 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,335 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,335 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,336 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,336 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,336 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,336 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,336 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,336 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,337 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,337 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,337 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,337 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,338 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,338 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,338 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,338 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,339 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,339 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,339 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,339 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,339 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,339 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,340 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,340 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,340 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,340 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,341 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,341 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,341 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,341 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,341 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,342 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,342 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,342 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,342 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,343 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,343 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,343 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,343 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,343 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,344 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,344 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,344 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,344 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,344 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,345 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,345 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,345 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,345 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,345 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,346 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,346 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,346 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,346 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,346 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,347 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,347 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,347 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,347 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,347 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,348 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,348 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,348 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,348 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,348 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,349 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,349 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,349 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,349 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,350 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,350 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,350 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,350 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,351 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,351 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,351 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,351 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,351 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,351 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,352 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,352 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,352 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,352 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,353 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,353 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,353 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,353 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,353 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,354 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,354 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,354 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,354 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,354 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,355 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,356 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,356 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,356 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,357 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,357 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,357 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,357 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,357 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,358 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,358 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,358 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,358 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,358 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,359 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,359 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,359 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,359 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,359 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,360 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,360 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,360 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,360 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,360 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,361 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,361 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,361 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,361 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,362 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,362 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,362 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,362 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,362 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,362 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,363 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,363 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,363 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,363 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,363 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,364 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,364 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,364 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,364 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,364 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,365 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,365 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,365 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,365 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,365 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,365 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,366 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,366 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,366 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,366 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,366 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,367 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,367 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,367 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,367 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,367 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,367 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,368 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,368 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,368 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,368 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,368 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,369 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,369 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,369 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,369 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,369 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,370 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,370 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,370 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,370 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,370 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,371 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,371 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,371 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,371 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,371 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,372 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,372 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,372 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,372 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,372 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,373 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,373 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,373 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,373 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,373 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,373 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,374 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,374 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,374 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,374 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,374 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,375 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,375 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,375 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,375 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,375 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,375 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,376 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,376 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,376 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,376 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,376 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,377 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,377 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,377 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,377 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,377 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,378 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,378 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,378 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,378 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,378 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,379 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,379 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,379 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,379 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,379 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,383 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,383 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,384 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,384 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,386 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,386 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,387 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,387 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,387 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,387 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,387 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,388 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,388 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,388 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,388 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,388 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,389 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,389 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,389 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,389 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,389 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,390 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,390 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,390 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,390 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,390 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,391 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,391 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,391 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,391 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,391 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,394 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,394 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,395 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,395 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,395 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,395 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,395 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,396 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,396 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,396 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,396 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,396 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,396 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,397 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,397 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,397 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,397 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,397 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,397 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,398 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,398 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,398 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,398 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,398 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,399 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,399 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,399 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,399 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,399 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,399 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,400 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,400 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,400 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,400 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,400 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,403 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,403 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,403 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,404 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:42:21,418 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-27 15:42:21,438 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 15:42:21,438 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 15:42:21,438 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 15:42:21,438 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 15:42:21,438 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 15:42:21,439 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 15:42:21,439 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 15:42:21,439 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 15:42:21,456 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 212 places, 255 transitions [2019-12-27 15:42:21,458 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 212 places, 255 transitions [2019-12-27 15:42:21,603 INFO L132 PetriNetUnfolder]: 56/251 cut-off events. [2019-12-27 15:42:21,603 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 15:42:21,624 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 559 event pairs. 0/193 useless extension candidates. Maximal degree in co-relation 217. Up to 2 conditions per place. [2019-12-27 15:42:21,653 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 212 places, 255 transitions [2019-12-27 15:42:21,761 INFO L132 PetriNetUnfolder]: 56/251 cut-off events. [2019-12-27 15:42:21,761 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 15:42:21,775 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 559 event pairs. 0/193 useless extension candidates. Maximal degree in co-relation 217. Up to 2 conditions per place. [2019-12-27 15:42:21,806 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 26510 [2019-12-27 15:42:21,807 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 15:42:27,641 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 44 [2019-12-27 15:42:27,808 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-27 15:42:27,924 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-27 15:42:28,386 WARN L192 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 99 [2019-12-27 15:42:28,551 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2019-12-27 15:42:28,600 INFO L206 etLargeBlockEncoding]: Checked pairs total: 141939 [2019-12-27 15:42:28,601 INFO L214 etLargeBlockEncoding]: Total number of compositions: 133 [2019-12-27 15:42:28,604 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 112 places, 132 transitions [2019-12-27 15:42:37,716 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 85966 states. [2019-12-27 15:42:37,718 INFO L276 IsEmpty]: Start isEmpty. Operand 85966 states. [2019-12-27 15:42:37,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 15:42:37,725 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:42:37,726 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:42:37,727 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:42:37,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:42:37,732 INFO L82 PathProgramCache]: Analyzing trace with hash 1287441752, now seen corresponding path program 1 times [2019-12-27 15:42:37,740 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:42:37,741 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26408892] [2019-12-27 15:42:37,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:42:37,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:42:37,995 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:42:37,996 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26408892] [2019-12-27 15:42:37,997 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:42:37,997 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 15:42:37,998 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1883026064] [2019-12-27 15:42:37,998 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:42:38,003 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:42:38,024 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 10 states and 9 transitions. [2019-12-27 15:42:38,025 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:42:38,029 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:42:38,030 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:42:38,030 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:42:38,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:42:38,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:42:38,047 INFO L87 Difference]: Start difference. First operand 85966 states. Second operand 3 states. [2019-12-27 15:42:41,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:42:41,560 INFO L93 Difference]: Finished difference Result 85406 states and 393472 transitions. [2019-12-27 15:42:41,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:42:41,561 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-27 15:42:41,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:42:42,101 INFO L225 Difference]: With dead ends: 85406 [2019-12-27 15:42:42,101 INFO L226 Difference]: Without dead ends: 79558 [2019-12-27 15:42:42,102 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:42:43,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79558 states. [2019-12-27 15:42:45,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79558 to 79558. [2019-12-27 15:42:45,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79558 states. [2019-12-27 15:42:49,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79558 states to 79558 states and 366284 transitions. [2019-12-27 15:42:49,512 INFO L78 Accepts]: Start accepts. Automaton has 79558 states and 366284 transitions. Word has length 9 [2019-12-27 15:42:49,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:42:49,513 INFO L462 AbstractCegarLoop]: Abstraction has 79558 states and 366284 transitions. [2019-12-27 15:42:49,513 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:42:49,513 INFO L276 IsEmpty]: Start isEmpty. Operand 79558 states and 366284 transitions. [2019-12-27 15:42:49,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 15:42:49,525 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:42:49,525 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:42:49,526 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:42:49,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:42:49,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1721975953, now seen corresponding path program 1 times [2019-12-27 15:42:49,527 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:42:49,527 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854524386] [2019-12-27 15:42:49,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:42:49,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:42:49,639 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:42:49,640 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854524386] [2019-12-27 15:42:49,640 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:42:49,640 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:42:49,640 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1908508259] [2019-12-27 15:42:49,640 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:42:49,642 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:42:49,646 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 16 states and 15 transitions. [2019-12-27 15:42:49,646 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:42:49,647 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:42:49,648 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 15:42:49,648 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:42:49,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 15:42:49,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 15:42:49,649 INFO L87 Difference]: Start difference. First operand 79558 states and 366284 transitions. Second operand 4 states. [2019-12-27 15:42:54,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:42:54,269 INFO L93 Difference]: Finished difference Result 126790 states and 563012 transitions. [2019-12-27 15:42:54,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 15:42:54,270 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-27 15:42:54,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:42:54,816 INFO L225 Difference]: With dead ends: 126790 [2019-12-27 15:42:54,817 INFO L226 Difference]: Without dead ends: 126726 [2019-12-27 15:42:54,817 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:42:56,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126726 states. [2019-12-27 15:42:59,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126726 to 123582. [2019-12-27 15:42:59,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123582 states. [2019-12-27 15:42:59,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123582 states to 123582 states and 551516 transitions. [2019-12-27 15:42:59,878 INFO L78 Accepts]: Start accepts. Automaton has 123582 states and 551516 transitions. Word has length 15 [2019-12-27 15:42:59,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:42:59,878 INFO L462 AbstractCegarLoop]: Abstraction has 123582 states and 551516 transitions. [2019-12-27 15:42:59,878 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 15:42:59,878 INFO L276 IsEmpty]: Start isEmpty. Operand 123582 states and 551516 transitions. [2019-12-27 15:42:59,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 15:42:59,884 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:42:59,884 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:42:59,885 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:42:59,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:42:59,885 INFO L82 PathProgramCache]: Analyzing trace with hash -1760528869, now seen corresponding path program 1 times [2019-12-27 15:42:59,885 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:42:59,886 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555538315] [2019-12-27 15:42:59,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:42:59,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:42:59,972 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:42:59,972 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555538315] [2019-12-27 15:42:59,972 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:42:59,972 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:42:59,973 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1213764462] [2019-12-27 15:42:59,973 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:42:59,976 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:42:59,981 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 37 states and 54 transitions. [2019-12-27 15:42:59,981 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:43:00,023 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 15:43:00,025 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 15:43:00,025 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:43:00,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 15:43:00,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 15:43:00,026 INFO L87 Difference]: Start difference. First operand 123582 states and 551516 transitions. Second operand 5 states. [2019-12-27 15:43:05,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:43:05,072 INFO L93 Difference]: Finished difference Result 159910 states and 703928 transitions. [2019-12-27 15:43:05,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 15:43:05,073 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-12-27 15:43:05,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:43:06,334 INFO L225 Difference]: With dead ends: 159910 [2019-12-27 15:43:06,335 INFO L226 Difference]: Without dead ends: 159850 [2019-12-27 15:43:06,335 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:43:07,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159850 states. [2019-12-27 15:43:11,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159850 to 141658. [2019-12-27 15:43:11,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141658 states. [2019-12-27 15:43:18,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141658 states to 141658 states and 629312 transitions. [2019-12-27 15:43:18,980 INFO L78 Accepts]: Start accepts. Automaton has 141658 states and 629312 transitions. Word has length 18 [2019-12-27 15:43:18,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:43:18,981 INFO L462 AbstractCegarLoop]: Abstraction has 141658 states and 629312 transitions. [2019-12-27 15:43:18,981 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 15:43:18,981 INFO L276 IsEmpty]: Start isEmpty. Operand 141658 states and 629312 transitions. [2019-12-27 15:43:18,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-27 15:43:19,000 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:43:19,000 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:43:19,000 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:43:19,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:43:19,001 INFO L82 PathProgramCache]: Analyzing trace with hash 176800759, now seen corresponding path program 1 times [2019-12-27 15:43:19,001 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:43:19,001 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752861438] [2019-12-27 15:43:19,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:43:19,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:43:19,068 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:43:19,069 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752861438] [2019-12-27 15:43:19,069 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:43:19,069 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 15:43:19,070 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [230766431] [2019-12-27 15:43:19,070 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:43:19,073 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:43:19,076 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 22 states and 22 transitions. [2019-12-27 15:43:19,077 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:43:19,077 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:43:19,077 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:43:19,078 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:43:19,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:43:19,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:43:19,078 INFO L87 Difference]: Start difference. First operand 141658 states and 629312 transitions. Second operand 3 states. [2019-12-27 15:43:19,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:43:19,880 INFO L93 Difference]: Finished difference Result 141310 states and 627848 transitions. [2019-12-27 15:43:19,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:43:19,881 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-27 15:43:19,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:43:26,809 INFO L225 Difference]: With dead ends: 141310 [2019-12-27 15:43:26,810 INFO L226 Difference]: Without dead ends: 141310 [2019-12-27 15:43:26,810 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:43:28,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141310 states. [2019-12-27 15:43:30,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141310 to 141310. [2019-12-27 15:43:30,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141310 states. [2019-12-27 15:43:31,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141310 states to 141310 states and 627848 transitions. [2019-12-27 15:43:31,293 INFO L78 Accepts]: Start accepts. Automaton has 141310 states and 627848 transitions. Word has length 20 [2019-12-27 15:43:31,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:43:31,293 INFO L462 AbstractCegarLoop]: Abstraction has 141310 states and 627848 transitions. [2019-12-27 15:43:31,293 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:43:31,293 INFO L276 IsEmpty]: Start isEmpty. Operand 141310 states and 627848 transitions. [2019-12-27 15:43:31,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 15:43:31,313 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:43:31,313 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:43:31,313 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:43:31,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:43:31,314 INFO L82 PathProgramCache]: Analyzing trace with hash -1444973627, now seen corresponding path program 1 times [2019-12-27 15:43:31,314 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:43:31,314 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396262761] [2019-12-27 15:43:31,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:43:31,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:43:31,376 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:43:31,376 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396262761] [2019-12-27 15:43:31,377 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:43:31,377 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 15:43:31,377 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [459788731] [2019-12-27 15:43:31,377 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:43:31,380 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:43:31,385 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 29 states and 36 transitions. [2019-12-27 15:43:31,385 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:43:31,385 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:43:31,385 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:43:31,386 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:43:31,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:43:31,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:43:31,386 INFO L87 Difference]: Start difference. First operand 141310 states and 627848 transitions. Second operand 3 states. [2019-12-27 15:43:33,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:43:33,234 INFO L93 Difference]: Finished difference Result 133278 states and 591216 transitions. [2019-12-27 15:43:33,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:43:33,235 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-12-27 15:43:33,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:43:33,669 INFO L225 Difference]: With dead ends: 133278 [2019-12-27 15:43:33,669 INFO L226 Difference]: Without dead ends: 133278 [2019-12-27 15:43:33,670 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:43:41,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133278 states. [2019-12-27 15:43:42,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133278 to 133278. [2019-12-27 15:43:42,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133278 states. [2019-12-27 15:43:44,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133278 states to 133278 states and 591216 transitions. [2019-12-27 15:43:44,153 INFO L78 Accepts]: Start accepts. Automaton has 133278 states and 591216 transitions. Word has length 21 [2019-12-27 15:43:44,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:43:44,153 INFO L462 AbstractCegarLoop]: Abstraction has 133278 states and 591216 transitions. [2019-12-27 15:43:44,153 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:43:44,153 INFO L276 IsEmpty]: Start isEmpty. Operand 133278 states and 591216 transitions. [2019-12-27 15:43:44,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-27 15:43:44,182 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:43:44,183 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:43:44,183 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:43:44,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:43:44,183 INFO L82 PathProgramCache]: Analyzing trace with hash -923267308, now seen corresponding path program 1 times [2019-12-27 15:43:44,183 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:43:44,184 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529696948] [2019-12-27 15:43:44,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:43:44,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:43:44,281 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:43:44,282 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529696948] [2019-12-27 15:43:44,282 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:43:44,282 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 15:43:44,283 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1319880442] [2019-12-27 15:43:44,283 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:43:44,291 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:43:44,302 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 52 states and 78 transitions. [2019-12-27 15:43:44,302 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:43:44,328 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 15:43:44,328 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 15:43:44,328 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:43:44,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 15:43:44,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 15:43:44,329 INFO L87 Difference]: Start difference. First operand 133278 states and 591216 transitions. Second operand 6 states. [2019-12-27 15:43:51,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:43:51,575 INFO L93 Difference]: Finished difference Result 159602 states and 699380 transitions. [2019-12-27 15:43:51,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 15:43:51,576 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-12-27 15:43:51,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:43:52,126 INFO L225 Difference]: With dead ends: 159602 [2019-12-27 15:43:52,126 INFO L226 Difference]: Without dead ends: 159490 [2019-12-27 15:43:52,126 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-12-27 15:43:53,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159490 states. [2019-12-27 15:43:56,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159490 to 132770. [2019-12-27 15:43:56,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132770 states. [2019-12-27 15:43:56,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132770 states to 132770 states and 589072 transitions. [2019-12-27 15:43:56,695 INFO L78 Accepts]: Start accepts. Automaton has 132770 states and 589072 transitions. Word has length 24 [2019-12-27 15:43:56,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:43:56,695 INFO L462 AbstractCegarLoop]: Abstraction has 132770 states and 589072 transitions. [2019-12-27 15:43:56,695 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 15:43:56,695 INFO L276 IsEmpty]: Start isEmpty. Operand 132770 states and 589072 transitions. [2019-12-27 15:43:56,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-27 15:43:57,901 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:43:57,901 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] [2019-12-27 15:43:57,902 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:43:57,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:43:57,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1614738075, now seen corresponding path program 1 times [2019-12-27 15:43:57,902 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:43:57,903 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656015130] [2019-12-27 15:43:57,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:43:57,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:43:58,025 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:43:58,026 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656015130] [2019-12-27 15:43:58,026 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:43:58,026 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 15:43:58,026 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1601908453] [2019-12-27 15:43:58,027 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:43:58,033 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:43:58,065 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 102 states and 158 transitions. [2019-12-27 15:43:58,065 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:43:58,167 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 10 times. [2019-12-27 15:43:58,170 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 15:43:58,170 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:43:58,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 15:43:58,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-12-27 15:43:58,171 INFO L87 Difference]: Start difference. First operand 132770 states and 589072 transitions. Second operand 8 states. [2019-12-27 15:44:01,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:44:01,450 INFO L93 Difference]: Finished difference Result 187863 states and 770905 transitions. [2019-12-27 15:44:01,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 15:44:01,451 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 35 [2019-12-27 15:44:01,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:44:02,001 INFO L225 Difference]: With dead ends: 187863 [2019-12-27 15:44:02,001 INFO L226 Difference]: Without dead ends: 174223 [2019-12-27 15:44:02,002 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-12-27 15:44:03,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174223 states. [2019-12-27 15:44:11,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174223 to 118038. [2019-12-27 15:44:11,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118038 states. [2019-12-27 15:44:12,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118038 states to 118038 states and 483978 transitions. [2019-12-27 15:44:12,247 INFO L78 Accepts]: Start accepts. Automaton has 118038 states and 483978 transitions. Word has length 35 [2019-12-27 15:44:12,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:44:12,247 INFO L462 AbstractCegarLoop]: Abstraction has 118038 states and 483978 transitions. [2019-12-27 15:44:12,247 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 15:44:12,247 INFO L276 IsEmpty]: Start isEmpty. Operand 118038 states and 483978 transitions. [2019-12-27 15:44:12,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-27 15:44:12,404 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:44:12,404 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] [2019-12-27 15:44:12,404 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:44:12,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:44:12,405 INFO L82 PathProgramCache]: Analyzing trace with hash -1927424231, now seen corresponding path program 1 times [2019-12-27 15:44:12,405 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:44:12,406 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242875629] [2019-12-27 15:44:12,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:44:12,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:44:12,505 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:44:12,506 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242875629] [2019-12-27 15:44:12,506 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:44:12,506 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 15:44:12,506 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1147613990] [2019-12-27 15:44:12,507 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:44:12,513 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:44:12,543 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 83 states and 131 transitions. [2019-12-27 15:44:12,543 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:44:12,574 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 15:44:12,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 15:44:12,574 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:44:12,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 15:44:12,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 15:44:12,575 INFO L87 Difference]: Start difference. First operand 118038 states and 483978 transitions. Second operand 6 states. [2019-12-27 15:44:13,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:44:13,990 INFO L93 Difference]: Finished difference Result 74948 states and 264445 transitions. [2019-12-27 15:44:13,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 15:44:13,991 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2019-12-27 15:44:13,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:44:14,140 INFO L225 Difference]: With dead ends: 74948 [2019-12-27 15:44:14,140 INFO L226 Difference]: Without dead ends: 67680 [2019-12-27 15:44:14,140 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-12-27 15:44:14,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67680 states. [2019-12-27 15:44:15,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67680 to 48479. [2019-12-27 15:44:15,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48479 states. [2019-12-27 15:44:20,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48479 states to 48479 states and 168392 transitions. [2019-12-27 15:44:20,107 INFO L78 Accepts]: Start accepts. Automaton has 48479 states and 168392 transitions. Word has length 36 [2019-12-27 15:44:20,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:44:20,107 INFO L462 AbstractCegarLoop]: Abstraction has 48479 states and 168392 transitions. [2019-12-27 15:44:20,107 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 15:44:20,107 INFO L276 IsEmpty]: Start isEmpty. Operand 48479 states and 168392 transitions. [2019-12-27 15:44:20,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-27 15:44:20,152 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:44:20,152 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:44:20,152 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:44:20,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:44:20,153 INFO L82 PathProgramCache]: Analyzing trace with hash 1082298760, now seen corresponding path program 1 times [2019-12-27 15:44:20,153 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:44:20,153 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202643096] [2019-12-27 15:44:20,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:44:20,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:44:20,212 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:44:20,213 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202643096] [2019-12-27 15:44:20,213 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:44:20,213 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:44:20,213 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [942293330] [2019-12-27 15:44:20,213 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:44:20,221 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:44:20,254 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 95 states and 152 transitions. [2019-12-27 15:44:20,254 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:44:20,257 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 15:44:20,257 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:44:20,258 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:44:20,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:44:20,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:44:20,258 INFO L87 Difference]: Start difference. First operand 48479 states and 168392 transitions. Second operand 3 states. [2019-12-27 15:44:20,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:44:20,564 INFO L93 Difference]: Finished difference Result 48479 states and 166464 transitions. [2019-12-27 15:44:20,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:44:20,565 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-12-27 15:44:20,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:44:20,702 INFO L225 Difference]: With dead ends: 48479 [2019-12-27 15:44:20,702 INFO L226 Difference]: Without dead ends: 48479 [2019-12-27 15:44:20,703 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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:44:21,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48479 states. [2019-12-27 15:44:21,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48479 to 48230. [2019-12-27 15:44:21,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48230 states. [2019-12-27 15:44:22,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48230 states to 48230 states and 165721 transitions. [2019-12-27 15:44:22,201 INFO L78 Accepts]: Start accepts. Automaton has 48230 states and 165721 transitions. Word has length 37 [2019-12-27 15:44:22,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:44:22,201 INFO L462 AbstractCegarLoop]: Abstraction has 48230 states and 165721 transitions. [2019-12-27 15:44:22,202 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:44:22,202 INFO L276 IsEmpty]: Start isEmpty. Operand 48230 states and 165721 transitions. [2019-12-27 15:44:22,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-27 15:44:22,246 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:44:22,246 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] [2019-12-27 15:44:22,246 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:44:22,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:44:22,247 INFO L82 PathProgramCache]: Analyzing trace with hash 1315911573, now seen corresponding path program 1 times [2019-12-27 15:44:22,247 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:44:22,247 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782701339] [2019-12-27 15:44:22,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:44:22,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:44:22,342 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:44:22,344 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782701339] [2019-12-27 15:44:22,344 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:44:22,344 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 15:44:22,344 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1957987321] [2019-12-27 15:44:22,345 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:44:22,352 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:44:22,377 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 97 states and 154 transitions. [2019-12-27 15:44:22,377 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:44:22,394 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 15:44:22,395 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 15:44:22,395 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:44:22,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 15:44:22,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 15:44:22,396 INFO L87 Difference]: Start difference. First operand 48230 states and 165721 transitions. Second operand 7 states. [2019-12-27 15:44:23,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:44:23,383 INFO L93 Difference]: Finished difference Result 85731 states and 291553 transitions. [2019-12-27 15:44:23,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 15:44:23,384 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2019-12-27 15:44:23,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:44:23,544 INFO L225 Difference]: With dead ends: 85731 [2019-12-27 15:44:23,544 INFO L226 Difference]: Without dead ends: 79061 [2019-12-27 15:44:23,544 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-12-27 15:44:24,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79061 states. [2019-12-27 15:44:25,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79061 to 65505. [2019-12-27 15:44:25,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65505 states. [2019-12-27 15:44:25,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65505 states to 65505 states and 225552 transitions. [2019-12-27 15:44:25,427 INFO L78 Accepts]: Start accepts. Automaton has 65505 states and 225552 transitions. Word has length 38 [2019-12-27 15:44:25,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:44:25,428 INFO L462 AbstractCegarLoop]: Abstraction has 65505 states and 225552 transitions. [2019-12-27 15:44:25,428 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 15:44:25,428 INFO L276 IsEmpty]: Start isEmpty. Operand 65505 states and 225552 transitions. [2019-12-27 15:44:25,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 15:44:25,492 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:44:25,492 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] [2019-12-27 15:44:25,492 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:44:25,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:44:25,492 INFO L82 PathProgramCache]: Analyzing trace with hash -1377430370, now seen corresponding path program 1 times [2019-12-27 15:44:25,493 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:44:25,493 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166238713] [2019-12-27 15:44:25,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:44:25,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:44:25,625 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:44:25,625 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166238713] [2019-12-27 15:44:25,626 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:44:25,626 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 15:44:25,626 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1655357651] [2019-12-27 15:44:25,626 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:44:25,634 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:44:25,691 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 150 states and 252 transitions. [2019-12-27 15:44:25,691 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:44:25,825 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 15:44:25,826 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 15:44:25,826 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:44:25,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 15:44:25,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-27 15:44:25,827 INFO L87 Difference]: Start difference. First operand 65505 states and 225552 transitions. Second operand 11 states. [2019-12-27 15:44:27,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:44:27,235 INFO L93 Difference]: Finished difference Result 17843 states and 58296 transitions. [2019-12-27 15:44:27,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 15:44:27,236 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 39 [2019-12-27 15:44:27,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:44:27,262 INFO L225 Difference]: With dead ends: 17843 [2019-12-27 15:44:27,263 INFO L226 Difference]: Without dead ends: 14623 [2019-12-27 15:44:27,263 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=163, Invalid=299, Unknown=0, NotChecked=0, Total=462 [2019-12-27 15:44:27,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14623 states. [2019-12-27 15:44:27,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14623 to 12158. [2019-12-27 15:44:27,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12158 states. [2019-12-27 15:44:27,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12158 states to 12158 states and 40417 transitions. [2019-12-27 15:44:27,838 INFO L78 Accepts]: Start accepts. Automaton has 12158 states and 40417 transitions. Word has length 39 [2019-12-27 15:44:27,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:44:27,839 INFO L462 AbstractCegarLoop]: Abstraction has 12158 states and 40417 transitions. [2019-12-27 15:44:27,839 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 15:44:27,839 INFO L276 IsEmpty]: Start isEmpty. Operand 12158 states and 40417 transitions. [2019-12-27 15:44:27,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-27 15:44:27,854 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:44:27,855 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:44:27,855 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:44:27,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:44:27,855 INFO L82 PathProgramCache]: Analyzing trace with hash 654156702, now seen corresponding path program 1 times [2019-12-27 15:44:27,856 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:44:27,856 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674146429] [2019-12-27 15:44:27,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:44:27,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:44:27,922 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:44:27,922 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674146429] [2019-12-27 15:44:27,922 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:44:27,923 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 15:44:27,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1575387556] [2019-12-27 15:44:27,923 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:44:27,936 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:44:28,010 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 124 states and 170 transitions. [2019-12-27 15:44:28,010 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:44:28,010 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:44:28,011 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 15:44:28,011 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:44:28,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 15:44:28,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 15:44:28,011 INFO L87 Difference]: Start difference. First operand 12158 states and 40417 transitions. Second operand 4 states. [2019-12-27 15:44:28,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:44:28,082 INFO L93 Difference]: Finished difference Result 13907 states and 44928 transitions. [2019-12-27 15:44:28,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 15:44:28,082 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2019-12-27 15:44:28,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:44:28,103 INFO L225 Difference]: With dead ends: 13907 [2019-12-27 15:44:28,103 INFO L226 Difference]: Without dead ends: 12170 [2019-12-27 15:44:28,103 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:44:28,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12170 states. [2019-12-27 15:44:28,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12170 to 12151. [2019-12-27 15:44:28,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12151 states. [2019-12-27 15:44:28,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12151 states to 12151 states and 40281 transitions. [2019-12-27 15:44:28,282 INFO L78 Accepts]: Start accepts. Automaton has 12151 states and 40281 transitions. Word has length 50 [2019-12-27 15:44:28,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:44:28,283 INFO L462 AbstractCegarLoop]: Abstraction has 12151 states and 40281 transitions. [2019-12-27 15:44:28,283 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 15:44:28,283 INFO L276 IsEmpty]: Start isEmpty. Operand 12151 states and 40281 transitions. [2019-12-27 15:44:28,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-27 15:44:28,298 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:44:28,298 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:44:28,298 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:44:28,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:44:28,299 INFO L82 PathProgramCache]: Analyzing trace with hash 101485776, now seen corresponding path program 2 times [2019-12-27 15:44:28,299 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:44:28,299 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963849185] [2019-12-27 15:44:28,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:44:28,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:44:28,366 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:44:28,366 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963849185] [2019-12-27 15:44:28,366 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:44:28,366 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 15:44:28,367 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [420371391] [2019-12-27 15:44:28,367 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:44:28,380 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:44:28,439 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 102 states and 123 transitions. [2019-12-27 15:44:28,440 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:44:28,440 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:44:28,440 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 15:44:28,440 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:44:28,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 15:44:28,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 15:44:28,441 INFO L87 Difference]: Start difference. First operand 12151 states and 40281 transitions. Second operand 4 states. [2019-12-27 15:44:28,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:44:28,505 INFO L93 Difference]: Finished difference Result 16362 states and 50383 transitions. [2019-12-27 15:44:28,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 15:44:28,505 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2019-12-27 15:44:28,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:44:28,526 INFO L225 Difference]: With dead ends: 16362 [2019-12-27 15:44:28,526 INFO L226 Difference]: Without dead ends: 12152 [2019-12-27 15:44:28,526 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 15:44:28,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12152 states. [2019-12-27 15:44:28,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12152 to 12099. [2019-12-27 15:44:28,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12099 states. [2019-12-27 15:44:28,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12099 states to 12099 states and 37550 transitions. [2019-12-27 15:44:28,693 INFO L78 Accepts]: Start accepts. Automaton has 12099 states and 37550 transitions. Word has length 50 [2019-12-27 15:44:28,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:44:28,693 INFO L462 AbstractCegarLoop]: Abstraction has 12099 states and 37550 transitions. [2019-12-27 15:44:28,693 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 15:44:28,693 INFO L276 IsEmpty]: Start isEmpty. Operand 12099 states and 37550 transitions. [2019-12-27 15:44:28,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-27 15:44:28,707 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:44:28,707 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:44:28,707 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:44:28,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:44:28,708 INFO L82 PathProgramCache]: Analyzing trace with hash -583724662, now seen corresponding path program 3 times [2019-12-27 15:44:28,708 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:44:28,708 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101768667] [2019-12-27 15:44:28,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:44:28,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:44:28,770 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:44:28,770 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101768667] [2019-12-27 15:44:28,771 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:44:28,771 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:44:28,771 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [438976236] [2019-12-27 15:44:28,771 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:44:28,786 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:44:28,839 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 73 states and 91 transitions. [2019-12-27 15:44:28,839 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:44:28,840 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:44:28,840 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:44:28,840 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:44:28,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:44:28,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:44:28,841 INFO L87 Difference]: Start difference. First operand 12099 states and 37550 transitions. Second operand 3 states. [2019-12-27 15:44:28,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:44:28,921 INFO L93 Difference]: Finished difference Result 18486 states and 53203 transitions. [2019-12-27 15:44:28,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:44:28,921 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-12-27 15:44:28,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:44:28,939 INFO L225 Difference]: With dead ends: 18486 [2019-12-27 15:44:28,940 INFO L226 Difference]: Without dead ends: 9776 [2019-12-27 15:44:28,942 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:44:28,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9776 states. [2019-12-27 15:44:29,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9776 to 9723. [2019-12-27 15:44:29,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9723 states. [2019-12-27 15:44:29,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9723 states to 9723 states and 24442 transitions. [2019-12-27 15:44:29,156 INFO L78 Accepts]: Start accepts. Automaton has 9723 states and 24442 transitions. Word has length 50 [2019-12-27 15:44:29,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:44:29,156 INFO L462 AbstractCegarLoop]: Abstraction has 9723 states and 24442 transitions. [2019-12-27 15:44:29,156 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:44:29,156 INFO L276 IsEmpty]: Start isEmpty. Operand 9723 states and 24442 transitions. [2019-12-27 15:44:29,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-27 15:44:29,165 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:44:29,165 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:44:29,165 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:44:29,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:44:29,166 INFO L82 PathProgramCache]: Analyzing trace with hash -2055850628, now seen corresponding path program 4 times [2019-12-27 15:44:29,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:44:29,166 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801834786] [2019-12-27 15:44:29,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:44:29,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:44:29,247 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:44:29,247 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801834786] [2019-12-27 15:44:29,247 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:44:29,247 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 15:44:29,248 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1943699430] [2019-12-27 15:44:29,248 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:44:29,261 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:44:29,309 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 72 states and 85 transitions. [2019-12-27 15:44:29,309 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:44:29,310 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:44:29,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 15:44:29,310 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:44:29,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 15:44:29,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-27 15:44:29,311 INFO L87 Difference]: Start difference. First operand 9723 states and 24442 transitions. Second operand 7 states. [2019-12-27 15:44:29,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:44:29,432 INFO L93 Difference]: Finished difference Result 8348 states and 21318 transitions. [2019-12-27 15:44:29,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 15:44:29,433 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2019-12-27 15:44:29,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:44:29,434 INFO L225 Difference]: With dead ends: 8348 [2019-12-27 15:44:29,434 INFO L226 Difference]: Without dead ends: 486 [2019-12-27 15:44:29,434 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-12-27 15:44:29,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2019-12-27 15:44:29,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 486. [2019-12-27 15:44:29,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 486 states. [2019-12-27 15:44:29,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 1060 transitions. [2019-12-27 15:44:29,441 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 1060 transitions. Word has length 50 [2019-12-27 15:44:29,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:44:29,442 INFO L462 AbstractCegarLoop]: Abstraction has 486 states and 1060 transitions. [2019-12-27 15:44:29,442 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 15:44:29,442 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 1060 transitions. [2019-12-27 15:44:29,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 15:44:29,443 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:44:29,443 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:44:29,443 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:44:29,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:44:29,444 INFO L82 PathProgramCache]: Analyzing trace with hash 1736859180, now seen corresponding path program 1 times [2019-12-27 15:44:29,444 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:44:29,445 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464911173] [2019-12-27 15:44:29,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:44:29,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:44:29,544 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:44:29,545 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464911173] [2019-12-27 15:44:29,547 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:44:29,547 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 15:44:29,547 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1876052443] [2019-12-27 15:44:29,547 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:44:29,581 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:44:29,798 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 258 states and 446 transitions. [2019-12-27 15:44:29,798 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:44:29,910 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 15:44:29,910 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 15:44:29,911 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:44:29,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 15:44:29,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-12-27 15:44:29,912 INFO L87 Difference]: Start difference. First operand 486 states and 1060 transitions. Second operand 11 states. [2019-12-27 15:44:31,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:44:31,819 INFO L93 Difference]: Finished difference Result 2988 states and 6549 transitions. [2019-12-27 15:44:31,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-12-27 15:44:31,820 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-27 15:44:31,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:44:31,823 INFO L225 Difference]: With dead ends: 2988 [2019-12-27 15:44:31,823 INFO L226 Difference]: Without dead ends: 2067 [2019-12-27 15:44:31,824 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=319, Invalid=1163, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 15:44:31,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2067 states. [2019-12-27 15:44:31,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2067 to 838. [2019-12-27 15:44:31,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 838 states. [2019-12-27 15:44:31,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1825 transitions. [2019-12-27 15:44:31,837 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1825 transitions. Word has length 66 [2019-12-27 15:44:31,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:44:31,837 INFO L462 AbstractCegarLoop]: Abstraction has 838 states and 1825 transitions. [2019-12-27 15:44:31,837 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 15:44:31,838 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1825 transitions. [2019-12-27 15:44:31,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 15:44:31,838 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:44:31,839 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:44:31,839 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:44:31,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:44:31,839 INFO L82 PathProgramCache]: Analyzing trace with hash 1869585708, now seen corresponding path program 2 times [2019-12-27 15:44:31,839 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:44:31,840 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256897698] [2019-12-27 15:44:31,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:44:31,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 15:44:31,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 15:44:31,974 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 15:44:31,974 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 15:44:31,978 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1061] [1061] ULTIMATE.startENTRY-->L856: Formula: (let ((.cse0 (store |v_#valid_90| 0 0))) (and (= v_~__unbuffered_cnt~0_147 0) (= 0 v_~__unbuffered_p0_EAX~0_62) (= v_~z$r_buff0_thd1~0_96 0) (= 0 v_~__unbuffered_p2_EAX~0_75) (= 0 v_~z$mem_tmp~0_203) (= v_~z$read_delayed_var~0.offset_6 0) (= v_~z$r_buff1_thd1~0_165 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t181~0.base_44|)) (= v_~__unbuffered_p2_EBX~0_79 0) (= 0 v_~z$flush_delayed~0_235) (= 0 v_~z$r_buff0_thd4~0_512) (= 0 v_~z$r_buff0_thd3~0_418) (= |v_#valid_88| (store .cse0 |v_ULTIMATE.start_main_~#t181~0.base_44| 1)) (= v_~z$w_buff0_used~0_907 0) (= v_~z$read_delayed_var~0.base_6 0) (= v_~weak$$choice2~0_286 0) (< 0 |v_#StackHeapBarrier_18|) (= 0 v_~__unbuffered_p3_EBX~0_60) (= v_~z$w_buff0~0_341 0) (= 0 v_~__unbuffered_p3_EAX~0_66) (= v_~z$read_delayed~0_7 0) (= v_~z$r_buff0_thd0~0_165 0) (= v_~a~0_32 0) (= |v_ULTIMATE.start_main_~#t181~0.offset_28| 0) (= |v_#length_29| (store |v_#length_30| |v_ULTIMATE.start_main_~#t181~0.base_44| 4)) (= |v_#NULL.offset_5| 0) (= 0 v_~z$r_buff1_thd3~0_405) (= v_~z$r_buff0_thd2~0_96 0) (= v_~y~0_94 0) (= 0 v_~weak$$choice0~0_191) (= v_~z$w_buff1~0_234 0) (= v_~x~0_46 0) (= v_~main$tmp_guard1~0_52 0) (= v_~z$w_buff1_used~0_667 0) (= (store |v_#memory_int_30| |v_ULTIMATE.start_main_~#t181~0.base_44| (store (select |v_#memory_int_30| |v_ULTIMATE.start_main_~#t181~0.base_44|) |v_ULTIMATE.start_main_~#t181~0.offset_28| 0)) |v_#memory_int_29|) (= v_~z$r_buff1_thd2~0_165 0) (= 0 |v_#NULL.base_5|) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t181~0.base_44|) (= 0 v_~z$r_buff1_thd4~0_334) (= v_~z~0_304 0) (= v_~z$r_buff1_thd0~0_255 0) (= v_~main$tmp_guard0~0_37 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_90|, #memory_int=|v_#memory_int_30|, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_~#t184~0.offset=|v_ULTIMATE.start_main_~#t184~0.offset_18|, ULTIMATE.start_main_~#t184~0.base=|v_ULTIMATE.start_main_~#t184~0.base_24|, ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_8|, ULTIMATE.start_main_~#t181~0.base=|v_ULTIMATE.start_main_~#t181~0.base_44|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_8|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_165, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_104|, ~a~0=v_~a~0_32, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_165, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_62, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_512, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_66, #length=|v_#length_29|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_75, ~z$mem_tmp~0=v_~z$mem_tmp~0_203, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_79, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_667, ~z$flush_delayed~0=v_~z$flush_delayed~0_235, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_28|, ~weak$$choice0~0=v_~weak$$choice0~0_191, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_206|, ULTIMATE.start_main_~#t183~0.base=|v_ULTIMATE.start_main_~#t183~0.base_23|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_165, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_418, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_147, ~x~0=v_~x~0_46, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_334, ULTIMATE.start_main_#t~nondet58=|v_ULTIMATE.start_main_#t~nondet58_21|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_8|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_234, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_52, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_~#t183~0.offset=|v_ULTIMATE.start_main_~#t183~0.offset_18|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_255, ULTIMATE.start_main_~#t182~0.base=|v_ULTIMATE.start_main_~#t182~0.base_36|, ~y~0=v_~y~0_94, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_96, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_907, ~z$w_buff0~0=v_~z$w_buff0~0_341, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_405, ULTIMATE.start_main_~#t182~0.offset=|v_ULTIMATE.start_main_~#t182~0.offset_24|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_68|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_37, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_60, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_80|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_97|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_27|, #valid=|v_#valid_88|, #memory_int=|v_#memory_int_29|, ULTIMATE.start_main_~#t181~0.offset=|v_ULTIMATE.start_main_~#t181~0.offset_28|, ~z~0=v_~z~0_304, ~weak$$choice2~0=v_~weak$$choice2~0_286, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_96} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t184~0.offset, ULTIMATE.start_main_~#t184~0.base, ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_~#t181~0.base, ULTIMATE.start_main_#t~nondet55, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_#t~ite64, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ULTIMATE.start_main_~#t183~0.base, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ~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_~#t183~0.offset, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t182~0.base, ~y~0, ~z$r_buff0_thd2~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_~#t182~0.offset, 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_#res, #valid, #memory_int, ULTIMATE.start_main_~#t181~0.offset, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 15:44:31,980 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1033] [1033] L856-1-->L858: Formula: (and (= |v_#valid_44| (store |v_#valid_45| |v_ULTIMATE.start_main_~#t182~0.base_11| 1)) (= |v_ULTIMATE.start_main_~#t182~0.offset_10| 0) (= 0 (select |v_#valid_45| |v_ULTIMATE.start_main_~#t182~0.base_11|)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t182~0.base_11|) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t182~0.base_11| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t182~0.base_11|) |v_ULTIMATE.start_main_~#t182~0.offset_10| 1)) |v_#memory_int_19|) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t182~0.base_11| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t182~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_20|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_5|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~#t182~0.offset=|v_ULTIMATE.start_main_~#t182~0.offset_10|, #length=|v_#length_19|, ULTIMATE.start_main_~#t182~0.base=|v_ULTIMATE.start_main_~#t182~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, ULTIMATE.start_main_~#t182~0.offset, #length, ULTIMATE.start_main_~#t182~0.base] because there is no mapped edge [2019-12-27 15:44:31,981 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1035] [1035] L858-1-->L860: Formula: (and (= 0 (select |v_#valid_49| |v_ULTIMATE.start_main_~#t183~0.base_12|)) (not (= |v_ULTIMATE.start_main_~#t183~0.base_12| 0)) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t183~0.base_12| 4)) (= |v_#valid_48| (store |v_#valid_49| |v_ULTIMATE.start_main_~#t183~0.base_12| 1)) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t183~0.base_12|) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t183~0.base_12| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t183~0.base_12|) |v_ULTIMATE.start_main_~#t183~0.offset_11| 2)) |v_#memory_int_21|) (= |v_ULTIMATE.start_main_~#t183~0.offset_11| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_22|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_~#t183~0.offset=|v_ULTIMATE.start_main_~#t183~0.offset_11|, ULTIMATE.start_main_~#t183~0.base=|v_ULTIMATE.start_main_~#t183~0.base_12|, #valid=|v_#valid_48|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_5|, #memory_int=|v_#memory_int_21|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t183~0.offset, ULTIMATE.start_main_~#t183~0.base, #valid, ULTIMATE.start_main_#t~nondet56, #memory_int, #length] because there is no mapped edge [2019-12-27 15:44:31,982 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1037] [1037] L860-1-->L862: Formula: (and (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t184~0.base_13| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t184~0.base_13|)) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t184~0.base_13| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t184~0.base_13|) |v_ULTIMATE.start_main_~#t184~0.offset_11| 3)) |v_#memory_int_23|) (= |v_#valid_50| (store |v_#valid_51| |v_ULTIMATE.start_main_~#t184~0.base_13| 1)) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t184~0.base_13|) (= 0 (select |v_#valid_51| |v_ULTIMATE.start_main_~#t184~0.base_13|)) (= |v_ULTIMATE.start_main_~#t184~0.offset_11| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_51|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t184~0.offset=|v_ULTIMATE.start_main_~#t184~0.offset_11|, ULTIMATE.start_main_~#t184~0.base=|v_ULTIMATE.start_main_~#t184~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_5|, #valid=|v_#valid_50|, #memory_int=|v_#memory_int_23|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t184~0.offset, ULTIMATE.start_main_~#t184~0.base, ULTIMATE.start_main_#t~nondet57, #valid, #memory_int, #length] because there is no mapped edge [2019-12-27 15:44:31,984 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [907] [907] P3ENTRY-->L4-3: Formula: (and (= v_P3Thread1of1ForFork2_~arg.base_9 |v_P3Thread1of1ForFork2_#in~arg.base_9|) (= |v_P3Thread1of1ForFork2_#in~arg.offset_9| v_P3Thread1of1ForFork2_~arg.offset_9) (= 1 v_~z$w_buff0~0_34) (= 1 |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_9|) (= v_~z$w_buff0~0_35 v_~z$w_buff1~0_22) (= v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_11 |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_9|) (= v_~z$w_buff0_used~0_106 v_~z$w_buff1_used~0_57) (= (mod v_~z$w_buff1_used~0_57 256) 0) (= v_~z$w_buff0_used~0_105 1)) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_106, ~z$w_buff0~0=v_~z$w_buff0~0_35, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_9|, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_9|} OutVars{P3Thread1of1ForFork2___VERIFIER_assert_~expression=v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_11, P3Thread1of1ForFork2_~arg.offset=v_P3Thread1of1ForFork2_~arg.offset_9, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_105, ~z$w_buff0~0=v_~z$w_buff0~0_34, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_57, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_9|, ~z$w_buff1~0=v_~z$w_buff1~0_22, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression=|v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_9|, P3Thread1of1ForFork2_~arg.base=v_P3Thread1of1ForFork2_~arg.base_9, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_9|} 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:44:31,987 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [984] [984] L818-2-->L818-5: Formula: (let ((.cse0 (= |P3Thread1of1ForFork2_#t~ite29_Out1053875365| |P3Thread1of1ForFork2_#t~ite28_Out1053875365|)) (.cse1 (= (mod ~z$r_buff0_thd4~0_In1053875365 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In1053875365 256) 0))) (or (and (= |P3Thread1of1ForFork2_#t~ite28_Out1053875365| ~z$w_buff0~0_In1053875365) .cse0 (not .cse1) (not .cse2)) (and .cse0 (= |P3Thread1of1ForFork2_#t~ite28_Out1053875365| ~z$w_buff1~0_In1053875365) (or .cse1 .cse2)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In1053875365, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1053875365, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1053875365, ~z$w_buff1~0=~z$w_buff1~0_In1053875365} OutVars{P3Thread1of1ForFork2_#t~ite29=|P3Thread1of1ForFork2_#t~ite29_Out1053875365|, P3Thread1of1ForFork2_#t~ite28=|P3Thread1of1ForFork2_#t~ite28_Out1053875365|, ~z$w_buff0~0=~z$w_buff0~0_In1053875365, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1053875365, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1053875365, ~z$w_buff1~0=~z$w_buff1~0_In1053875365} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite29, P3Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-27 15:44:31,997 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [942] [942] L823-->L824: Formula: (and (= v_~z$r_buff0_thd4~0_105 v_~z$r_buff0_thd4~0_104) (not (= 0 (mod v_~weak$$choice2~0_68 256)))) InVars {~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_105, ~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_104, ~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:44:31,999 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [978] [978] L826-->L826-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In-566341651 256)))) (or (and .cse0 (= ~z~0_In-566341651 |P3Thread1of1ForFork2_#t~ite48_Out-566341651|)) (and (not .cse0) (= |P3Thread1of1ForFork2_#t~ite48_Out-566341651| ~z$mem_tmp~0_In-566341651)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-566341651, ~z$flush_delayed~0=~z$flush_delayed~0_In-566341651, ~z~0=~z~0_In-566341651} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In-566341651, P3Thread1of1ForFork2_#t~ite48=|P3Thread1of1ForFork2_#t~ite48_Out-566341651|, ~z$flush_delayed~0=~z$flush_delayed~0_In-566341651, ~z~0=~z~0_In-566341651} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite48] because there is no mapped edge [2019-12-27 15:44:32,001 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1028] [1028] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork3_#res.base_5|) (= v_~__unbuffered_cnt~0_71 (+ v_~__unbuffered_cnt~0_72 1)) (= v_~x~0_14 v_~__unbuffered_p0_EAX~0_18) (= v_~a~0_16 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)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_72, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_10|, ~x~0=v_~x~0_14} OutVars{~a~0=v_~a~0_16, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_18, 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_71, 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_14} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset, P0Thread1of1ForFork3_~arg.offset] because there is no mapped edge [2019-12-27 15:44:32,001 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1027] [1027] P1ENTRY-->P1EXIT: Formula: (and (= v_P1Thread1of1ForFork0_~arg.offset_6 |v_P1Thread1of1ForFork0_#in~arg.offset_6|) (= v_P1Thread1of1ForFork0_~arg.base_6 |v_P1Thread1of1ForFork0_#in~arg.base_6|) (= (+ v_~__unbuffered_cnt~0_66 1) v_~__unbuffered_cnt~0_65) (= v_~y~0_39 1) (= v_~x~0_11 1) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_6|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_66} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_6, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_6, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_6|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_65, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, ~y~0=v_~y~0_39, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|, ~x~0=v_~x~0_11} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, ~y~0, P1Thread1of1ForFork0_#res.base, ~x~0] because there is no mapped edge [2019-12-27 15:44:32,045 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [983] [983] L788-->L788-2: Formula: (let ((.cse0 (= (mod ~z$flush_delayed~0_In646672011 256) 0))) (or (and .cse0 (= |P2Thread1of1ForFork1_#t~ite25_Out646672011| ~z~0_In646672011)) (and (= ~z$mem_tmp~0_In646672011 |P2Thread1of1ForFork1_#t~ite25_Out646672011|) (not .cse0)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In646672011, ~z$flush_delayed~0=~z$flush_delayed~0_In646672011, ~z~0=~z~0_In646672011} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In646672011, P2Thread1of1ForFork1_#t~ite25=|P2Thread1of1ForFork1_#t~ite25_Out646672011|, ~z$flush_delayed~0=~z$flush_delayed~0_In646672011, ~z~0=~z~0_In646672011} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-27 15:44:32,047 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [997] [997] L834-->L834-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1184701072 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In-1184701072 256)))) (or (and (or .cse0 .cse1) (= |P3Thread1of1ForFork2_#t~ite51_Out-1184701072| ~z$w_buff0_used~0_In-1184701072)) (and (= |P3Thread1of1ForFork2_#t~ite51_Out-1184701072| 0) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1184701072, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1184701072} OutVars{P3Thread1of1ForFork2_#t~ite51=|P3Thread1of1ForFork2_#t~ite51_Out-1184701072|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1184701072, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1184701072} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite51] because there is no mapped edge [2019-12-27 15:44:32,048 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [986] [986] L835-->L835-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In-1662270621 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1662270621 256))) (.cse3 (= (mod ~z$r_buff1_thd4~0_In-1662270621 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1662270621 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P3Thread1of1ForFork2_#t~ite52_Out-1662270621|)) (and (= |P3Thread1of1ForFork2_#t~ite52_Out-1662270621| ~z$w_buff1_used~0_In-1662270621) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1662270621, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1662270621, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1662270621, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1662270621} OutVars{P3Thread1of1ForFork2_#t~ite52=|P3Thread1of1ForFork2_#t~ite52_Out-1662270621|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1662270621, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1662270621, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1662270621, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1662270621} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite52] because there is no mapped edge [2019-12-27 15:44:32,050 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [982] [982] L836-->L837: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In345771769 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd4~0_In345771769 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd4~0_Out345771769 ~z$r_buff0_thd4~0_In345771769)) (and (not .cse0) (= ~z$r_buff0_thd4~0_Out345771769 0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In345771769, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In345771769} OutVars{P3Thread1of1ForFork2_#t~ite53=|P3Thread1of1ForFork2_#t~ite53_Out345771769|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In345771769, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out345771769} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite53, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-27 15:44:32,050 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [981] [981] L837-->L837-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd4~0_In2112893187 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In2112893187 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In2112893187 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In2112893187 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd4~0_In2112893187 |P3Thread1of1ForFork2_#t~ite54_Out2112893187|) (or .cse2 .cse3)) (and (= 0 |P3Thread1of1ForFork2_#t~ite54_Out2112893187|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In2112893187, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2112893187, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In2112893187, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2112893187} OutVars{P3Thread1of1ForFork2_#t~ite54=|P3Thread1of1ForFork2_#t~ite54_Out2112893187|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In2112893187, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2112893187, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In2112893187, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2112893187} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite54] because there is no mapped edge [2019-12-27 15:44:32,050 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1032] [1032] L837-2-->P3EXIT: Formula: (and (= 0 |v_P3Thread1of1ForFork2_#res.offset_5|) (= |v_P3Thread1of1ForFork2_#t~ite54_32| v_~z$r_buff1_thd4~0_260) (= 0 |v_P3Thread1of1ForFork2_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_84 1) v_~__unbuffered_cnt~0_83)) InVars {P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84} OutVars{P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_31|, P3Thread1of1ForFork2_#res.base=|v_P3Thread1of1ForFork2_#res.base_5|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_260, P3Thread1of1ForFork2_#res.offset=|v_P3Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_83} 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:44:32,050 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1023] [1023] L788-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= 0 v_~z$flush_delayed~0_189) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= v_~z~0_189 |v_P2Thread1of1ForFork1_#t~ite25_46|) (= (+ v_~__unbuffered_cnt~0_56 1) v_~__unbuffered_cnt~0_55)) InVars {P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_46|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56} OutVars{P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_45|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, ~z$flush_delayed~0=v_~z$flush_delayed~0_189, ~z~0=v_~z~0_189, 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:44:32,052 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [908] [908] L866-->L868-2: Formula: (and (or (= (mod v_~z$w_buff0_used~0_107 256) 0) (= 0 (mod v_~z$r_buff0_thd0~0_14 256))) (not (= (mod v_~main$tmp_guard0~0_4 256) 0))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_14, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_107, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_14, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_107, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 15:44:32,052 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [980] [980] L868-2-->L868-5: Formula: (let ((.cse2 (= |ULTIMATE.start_main_#t~ite60_Out1072746695| |ULTIMATE.start_main_#t~ite59_Out1072746695|)) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In1072746695 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In1072746695 256) 0))) (or (and (or .cse0 .cse1) .cse2 (= |ULTIMATE.start_main_#t~ite59_Out1072746695| ~z~0_In1072746695)) (and .cse2 (not .cse1) (= ~z$w_buff1~0_In1072746695 |ULTIMATE.start_main_#t~ite59_Out1072746695|) (not .cse0)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1072746695, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1072746695, ~z$w_buff1~0=~z$w_buff1~0_In1072746695, ~z~0=~z~0_In1072746695} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out1072746695|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1072746695, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1072746695, ~z$w_buff1~0=~z$w_buff1~0_In1072746695, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out1072746695|, ~z~0=~z~0_In1072746695} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-27 15:44:32,054 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [995] [995] L869-->L869-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In-824768540 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-824768540 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-824768540 |ULTIMATE.start_main_#t~ite61_Out-824768540|)) (and (= 0 |ULTIMATE.start_main_#t~ite61_Out-824768540|) (not .cse1) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-824768540, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-824768540} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-824768540, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-824768540|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-824768540} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-27 15:44:32,055 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1001] [1001] L870-->L870-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1536857781 256))) (.cse0 (= (mod ~z$r_buff1_thd0~0_In-1536857781 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-1536857781 256))) (.cse3 (= (mod ~z$r_buff0_thd0~0_In-1536857781 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite62_Out-1536857781| 0)) (and (= |ULTIMATE.start_main_#t~ite62_Out-1536857781| ~z$w_buff1_used~0_In-1536857781) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1536857781, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1536857781, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1536857781, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1536857781} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out-1536857781|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1536857781, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1536857781, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1536857781, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1536857781} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-27 15:44:32,057 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [979] [979] L871-->L871-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In1464934080 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1464934080 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite63_Out1464934080| ~z$r_buff0_thd0~0_In1464934080)) (and (= 0 |ULTIMATE.start_main_#t~ite63_Out1464934080|) (not .cse0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1464934080, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1464934080} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out1464934080|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1464934080, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1464934080} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-27 15:44:32,058 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [987] [987] L872-->L872-2: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd0~0_In-1376561149 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In-1376561149 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-1376561149 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In-1376561149 256)))) (or (and (= |ULTIMATE.start_main_#t~ite64_Out-1376561149| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite64_Out-1376561149| ~z$r_buff1_thd0~0_In-1376561149) (or .cse2 .cse3)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1376561149, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1376561149, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1376561149, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1376561149} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1376561149, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1376561149, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1376561149, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1376561149, ULTIMATE.start_main_#t~ite64=|ULTIMATE.start_main_#t~ite64_Out-1376561149|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-27 15:44:32,059 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1049] [1049] L872-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 0 v_~__unbuffered_p0_EAX~0_26) (= 1 v_~__unbuffered_p3_EAX~0_28) (= v_~main$tmp_guard1~0_18 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= 0 v_~__unbuffered_p3_EBX~0_24) (= v_~__unbuffered_p2_EBX~0_43 0) (= v_~y~0_52 2) (= 2 v_~__unbuffered_p2_EAX~0_41) (= v_~z$r_buff1_thd0~0_221 |v_ULTIMATE.start_main_#t~ite64_41|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_26, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_43, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_28, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_41, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_24, ~y~0=v_~y~0_52, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_41|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_26, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_43, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_221, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_28, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_41, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_24, ~y~0=v_~y~0_52, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_40|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_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:44:32,198 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 03:44:32 BasicIcfg [2019-12-27 15:44:32,198 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 15:44:32,202 INFO L168 Benchmark]: Toolchain (without parser) took 132855.89 ms. Allocated memory was 146.3 MB in the beginning and 3.9 GB in the end (delta: 3.8 GB). Free memory was 102.2 MB in the beginning and 2.7 GB in the end (delta: -2.6 GB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. [2019-12-27 15:44:32,204 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 15:44:32,206 INFO L168 Benchmark]: CACSL2BoogieTranslator took 817.18 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 101.8 MB in the beginning and 153.9 MB in the end (delta: -52.1 MB). Peak memory consumption was 20.9 MB. Max. memory is 7.1 GB. [2019-12-27 15:44:32,207 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.70 ms. Allocated memory is still 203.9 MB. Free memory was 153.9 MB in the beginning and 151.3 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:44:32,209 INFO L168 Benchmark]: Boogie Preprocessor took 44.32 ms. Allocated memory is still 203.9 MB. Free memory was 151.3 MB in the beginning and 148.6 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:44:32,212 INFO L168 Benchmark]: RCFGBuilder took 982.00 ms. Allocated memory was 203.9 MB in the beginning and 235.4 MB in the end (delta: 31.5 MB). Free memory was 148.6 MB in the beginning and 203.2 MB in the end (delta: -54.6 MB). Peak memory consumption was 63.2 MB. Max. memory is 7.1 GB. [2019-12-27 15:44:32,213 INFO L168 Benchmark]: TraceAbstraction took 130934.32 ms. Allocated memory was 235.4 MB in the beginning and 3.9 GB in the end (delta: 3.7 GB). Free memory was 203.2 MB in the beginning and 2.7 GB in the end (delta: -2.5 GB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. [2019-12-27 15:44:32,221 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.18 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 817.18 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 101.8 MB in the beginning and 153.9 MB in the end (delta: -52.1 MB). Peak memory consumption was 20.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 72.70 ms. Allocated memory is still 203.9 MB. Free memory was 153.9 MB in the beginning and 151.3 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.32 ms. Allocated memory is still 203.9 MB. Free memory was 151.3 MB in the beginning and 148.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 982.00 ms. Allocated memory was 203.9 MB in the beginning and 235.4 MB in the end (delta: 31.5 MB). Free memory was 148.6 MB in the beginning and 203.2 MB in the end (delta: -54.6 MB). Peak memory consumption was 63.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 130934.32 ms. Allocated memory was 235.4 MB in the beginning and 3.9 GB in the end (delta: 3.7 GB). Free memory was 203.2 MB in the beginning and 2.7 GB in the end (delta: -2.5 GB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 7.1s, 212 ProgramPointsBefore, 112 ProgramPointsAfterwards, 255 TransitionsBefore, 132 TransitionsAfterwards, 26510 CoEnabledTransitionPairs, 8 FixpointIterations, 38 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 48 ConcurrentYvCompositions, 28 ChoiceCompositions, 11185 VarBasedMoverChecksPositive, 321 VarBasedMoverChecksNegative, 83 SemBasedMoverChecksPositive, 338 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.2s, 0 MoverChecksTotal, 141939 CheckedPairsTotal, 133 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(&t181, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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(&t182, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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(&t183, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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(&t184, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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] [L770] 3 y = 2 [L773] 3 __unbuffered_p2_EAX = y [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_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=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=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=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=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] 3 z = !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_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=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=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [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_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=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=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L781] 3 z$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_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=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=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [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_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=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=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [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_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=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=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [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_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=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=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [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_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=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=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [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_EBX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=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=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [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 [L864] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=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=1, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L868] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [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: 130.5s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 44.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3635 SDtfs, 8768 SDslu, 6835 SDs, 0 SdLazy, 3303 SolverSat, 549 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 176 GetRequests, 50 SyntacticMatches, 5 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 476 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=141658occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 65.3s AutomataMinimizationTime, 16 MinimizatonAttempts, 141066 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 624 NumberOfCodeBlocks, 624 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 542 ConstructedInterpolants, 0 QuantifiedInterpolants, 57474 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...