/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix015_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 21:36:27,047 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 21:36:27,049 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 21:36:27,065 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 21:36:27,066 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 21:36:27,068 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 21:36:27,069 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 21:36:27,079 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 21:36:27,083 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 21:36:27,087 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 21:36:27,088 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 21:36:27,089 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 21:36:27,090 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 21:36:27,090 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 21:36:27,091 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 21:36:27,092 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 21:36:27,093 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 21:36:27,094 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 21:36:27,095 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 21:36:27,097 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 21:36:27,098 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 21:36:27,099 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 21:36:27,103 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 21:36:27,103 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 21:36:27,105 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 21:36:27,106 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 21:36:27,106 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 21:36:27,107 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 21:36:27,107 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 21:36:27,108 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 21:36:27,108 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 21:36:27,110 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 21:36:27,111 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 21:36:27,111 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 21:36:27,113 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 21:36:27,114 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 21:36:27,114 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 21:36:27,114 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 21:36:27,117 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 21:36:27,119 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 21:36:27,119 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 21:36:27,121 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-26 21:36:27,151 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 21:36:27,152 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 21:36:27,156 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 21:36:27,156 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 21:36:27,157 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 21:36:27,157 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 21:36:27,157 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 21:36:27,157 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 21:36:27,157 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 21:36:27,158 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 21:36:27,158 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 21:36:27,158 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 21:36:27,158 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 21:36:27,158 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 21:36:27,158 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 21:36:27,162 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 21:36:27,162 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 21:36:27,162 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 21:36:27,162 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 21:36:27,163 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 21:36:27,163 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 21:36:27,163 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 21:36:27,163 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 21:36:27,164 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 21:36:27,164 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 21:36:27,164 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 21:36:27,164 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 21:36:27,164 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 21:36:27,164 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 21:36:27,165 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 21:36:27,450 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 21:36:27,470 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 21:36:27,473 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 21:36:27,474 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 21:36:27,474 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 21:36:27,475 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix015_power.opt.i [2019-12-26 21:36:27,536 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dcf30c96d/41b2fe427f4543b2be09f623e52c0286/FLAG8738e57a8 [2019-12-26 21:36:28,059 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 21:36:28,060 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix015_power.opt.i [2019-12-26 21:36:28,083 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dcf30c96d/41b2fe427f4543b2be09f623e52c0286/FLAG8738e57a8 [2019-12-26 21:36:28,381 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dcf30c96d/41b2fe427f4543b2be09f623e52c0286 [2019-12-26 21:36:28,391 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 21:36:28,393 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 21:36:28,394 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 21:36:28,395 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 21:36:28,399 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 21:36:28,400 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 09:36:28" (1/1) ... [2019-12-26 21:36:28,402 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@85f7a91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:36:28, skipping insertion in model container [2019-12-26 21:36:28,403 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 09:36:28" (1/1) ... [2019-12-26 21:36:28,410 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 21:36:28,472 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 21:36:28,954 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 21:36:28,966 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 21:36:29,072 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 21:36:29,146 INFO L208 MainTranslator]: Completed translation [2019-12-26 21:36:29,147 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:36:29 WrapperNode [2019-12-26 21:36:29,147 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 21:36:29,148 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 21:36:29,148 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 21:36:29,148 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 21:36:29,157 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:36:29" (1/1) ... [2019-12-26 21:36:29,179 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:36:29" (1/1) ... [2019-12-26 21:36:29,217 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 21:36:29,218 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 21:36:29,218 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 21:36:29,218 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 21:36:29,228 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:36:29" (1/1) ... [2019-12-26 21:36:29,228 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:36:29" (1/1) ... [2019-12-26 21:36:29,236 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:36:29" (1/1) ... [2019-12-26 21:36:29,236 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:36:29" (1/1) ... [2019-12-26 21:36:29,248 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:36:29" (1/1) ... [2019-12-26 21:36:29,258 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:36:29" (1/1) ... [2019-12-26 21:36:29,264 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:36:29" (1/1) ... [2019-12-26 21:36:29,269 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 21:36:29,269 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 21:36:29,269 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 21:36:29,270 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 21:36:29,281 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:36:29" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 21:36:29,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 21:36:29,342 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 21:36:29,343 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 21:36:29,343 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 21:36:29,343 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 21:36:29,343 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 21:36:29,343 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 21:36:29,344 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 21:36:29,344 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-26 21:36:29,344 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-26 21:36:29,344 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 21:36:29,344 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 21:36:29,344 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 21:36:29,346 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-26 21:36:30,207 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 21:36:30,207 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 21:36:30,209 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 09:36:30 BoogieIcfgContainer [2019-12-26 21:36:30,209 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 21:36:30,210 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 21:36:30,210 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 21:36:30,213 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 21:36:30,214 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 09:36:28" (1/3) ... [2019-12-26 21:36:30,215 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a957e25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 09:36:30, skipping insertion in model container [2019-12-26 21:36:30,215 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:36:29" (2/3) ... [2019-12-26 21:36:30,215 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a957e25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 09:36:30, skipping insertion in model container [2019-12-26 21:36:30,216 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 09:36:30" (3/3) ... [2019-12-26 21:36:30,217 INFO L109 eAbstractionObserver]: Analyzing ICFG mix015_power.opt.i [2019-12-26 21:36:30,228 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 21:36:30,229 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 21:36:30,238 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 21:36:30,239 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 21:36:30,304 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,304 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,304 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,305 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,306 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,306 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,307 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,307 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,307 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,307 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,308 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,308 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,308 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,308 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,308 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,309 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,309 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,309 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,309 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,310 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,310 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,310 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,310 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,312 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,312 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,312 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,312 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,313 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,313 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,313 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,313 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,313 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,314 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,314 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,314 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,314 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,315 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,315 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,315 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,315 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,315 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,316 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,316 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,316 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,316 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,316 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,317 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,317 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,317 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,317 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,317 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,318 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,318 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,318 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,318 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,318 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,319 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,319 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,319 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,319 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,320 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,320 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,320 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,320 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,320 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,321 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,321 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,321 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,321 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,321 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,322 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,322 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,322 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,322 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,322 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,323 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,323 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,323 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,323 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,323 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,324 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,324 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,324 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,324 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,324 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,325 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,325 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,325 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,325 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,325 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,326 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,326 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,326 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,326 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,326 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,327 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,328 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,328 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,328 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,329 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,329 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,329 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,329 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,329 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,330 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,330 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,330 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,330 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,330 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,331 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,331 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,331 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,331 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,331 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,332 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,332 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,332 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,332 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,332 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,333 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,333 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,333 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,333 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,333 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,334 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,334 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,334 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,334 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,334 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,334 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,335 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,335 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,335 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,336 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,336 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,336 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,336 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,336 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,337 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,337 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,337 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,337 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,337 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,337 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,338 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,338 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,338 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,338 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,338 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,339 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,339 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,339 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,339 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,339 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,340 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,340 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,340 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,340 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,340 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,341 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,341 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,341 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,341 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,341 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,341 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,342 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,342 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,342 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,342 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,342 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,343 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,343 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,343 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,343 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,343 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,344 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,344 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,344 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,344 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,344 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,345 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,345 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,345 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,345 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,345 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,346 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,346 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,346 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,346 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,346 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,346 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,347 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,347 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,347 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,347 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,347 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,347 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,348 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,348 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,348 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,348 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,348 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,349 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,349 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,349 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,349 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,349 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,350 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,350 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,350 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,350 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,350 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,351 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,351 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,351 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,351 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,351 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,352 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,355 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,355 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,355 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,356 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,356 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,356 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,356 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,356 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,356 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,357 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,357 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,357 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,357 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,357 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,358 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,358 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,358 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,358 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,358 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,358 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,359 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,359 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,359 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,359 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,359 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,360 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,360 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,360 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,360 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,360 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,361 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,361 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,361 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,361 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,361 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,364 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,364 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,365 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,365 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,367 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,367 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,368 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,368 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,368 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,368 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,368 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,368 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,369 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,371 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:36:30,389 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-26 21:36:30,407 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 21:36:30,407 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 21:36:30,408 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 21:36:30,408 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 21:36:30,408 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 21:36:30,408 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 21:36:30,408 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 21:36:30,408 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 21:36:30,425 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 197 places, 243 transitions [2019-12-26 21:36:30,427 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 197 places, 243 transitions [2019-12-26 21:36:30,550 INFO L132 PetriNetUnfolder]: 56/240 cut-off events. [2019-12-26 21:36:30,550 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 21:36:30,572 INFO L76 FinitePrefix]: Finished finitePrefix Result has 250 conditions, 240 events. 56/240 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 560 event pairs. 0/182 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-12-26 21:36:30,608 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 197 places, 243 transitions [2019-12-26 21:36:30,690 INFO L132 PetriNetUnfolder]: 56/240 cut-off events. [2019-12-26 21:36:30,691 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 21:36:30,706 INFO L76 FinitePrefix]: Finished finitePrefix Result has 250 conditions, 240 events. 56/240 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 560 event pairs. 0/182 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-12-26 21:36:30,732 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 24630 [2019-12-26 21:36:30,733 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 21:36:36,373 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-12-26 21:36:36,948 WARN L192 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-12-26 21:36:37,084 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-12-26 21:36:37,129 INFO L206 etLargeBlockEncoding]: Checked pairs total: 124397 [2019-12-26 21:36:37,129 INFO L214 etLargeBlockEncoding]: Total number of compositions: 127 [2019-12-26 21:36:37,133 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 108 places, 130 transitions [2019-12-26 21:36:41,045 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 44886 states. [2019-12-26 21:36:41,047 INFO L276 IsEmpty]: Start isEmpty. Operand 44886 states. [2019-12-26 21:36:41,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-26 21:36:41,054 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:36:41,054 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:36:41,055 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:36:41,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:36:41,059 INFO L82 PathProgramCache]: Analyzing trace with hash -615654133, now seen corresponding path program 1 times [2019-12-26 21:36:41,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:36:41,067 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128582908] [2019-12-26 21:36:41,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:36:41,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:36:41,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:36:41,303 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128582908] [2019-12-26 21:36:41,304 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:36:41,304 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 21:36:41,305 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807289225] [2019-12-26 21:36:41,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:36:41,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:36:41,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:36:41,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:36:41,321 INFO L87 Difference]: Start difference. First operand 44886 states. Second operand 3 states. [2019-12-26 21:36:42,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:36:42,331 INFO L93 Difference]: Finished difference Result 44562 states and 182514 transitions. [2019-12-26 21:36:42,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:36:42,333 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-26 21:36:42,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:36:42,737 INFO L225 Difference]: With dead ends: 44562 [2019-12-26 21:36:42,737 INFO L226 Difference]: Without dead ends: 41502 [2019-12-26 21:36:42,738 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:36:44,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41502 states. [2019-12-26 21:36:46,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41502 to 41502. [2019-12-26 21:36:46,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41502 states. [2019-12-26 21:36:46,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41502 states to 41502 states and 169862 transitions. [2019-12-26 21:36:46,509 INFO L78 Accepts]: Start accepts. Automaton has 41502 states and 169862 transitions. Word has length 7 [2019-12-26 21:36:46,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:36:46,510 INFO L462 AbstractCegarLoop]: Abstraction has 41502 states and 169862 transitions. [2019-12-26 21:36:46,510 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:36:46,510 INFO L276 IsEmpty]: Start isEmpty. Operand 41502 states and 169862 transitions. [2019-12-26 21:36:46,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-26 21:36:46,521 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:36:46,521 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:36:46,521 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:36:46,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:36:46,523 INFO L82 PathProgramCache]: Analyzing trace with hash -42181455, now seen corresponding path program 1 times [2019-12-26 21:36:46,523 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:36:46,524 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914002920] [2019-12-26 21:36:46,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:36:46,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:36:46,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:36:46,675 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914002920] [2019-12-26 21:36:46,676 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:36:46,676 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:36:46,676 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153783912] [2019-12-26 21:36:46,678 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 21:36:46,678 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:36:46,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 21:36:46,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:36:46,679 INFO L87 Difference]: Start difference. First operand 41502 states and 169862 transitions. Second operand 4 states. [2019-12-26 21:36:47,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:36:47,173 INFO L93 Difference]: Finished difference Result 26491 states and 94929 transitions. [2019-12-26 21:36:47,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 21:36:47,173 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-26 21:36:47,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:36:47,279 INFO L225 Difference]: With dead ends: 26491 [2019-12-26 21:36:47,279 INFO L226 Difference]: Without dead ends: 23431 [2019-12-26 21:36:47,281 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:36:49,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23431 states. [2019-12-26 21:36:49,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23431 to 23431. [2019-12-26 21:36:49,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23431 states. [2019-12-26 21:36:49,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23431 states to 23431 states and 83897 transitions. [2019-12-26 21:36:49,869 INFO L78 Accepts]: Start accepts. Automaton has 23431 states and 83897 transitions. Word has length 13 [2019-12-26 21:36:49,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:36:49,870 INFO L462 AbstractCegarLoop]: Abstraction has 23431 states and 83897 transitions. [2019-12-26 21:36:49,870 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 21:36:49,870 INFO L276 IsEmpty]: Start isEmpty. Operand 23431 states and 83897 transitions. [2019-12-26 21:36:49,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-26 21:36:49,872 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:36:49,872 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:36:49,872 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:36:49,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:36:49,873 INFO L82 PathProgramCache]: Analyzing trace with hash -1080804847, now seen corresponding path program 1 times [2019-12-26 21:36:49,873 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:36:49,873 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719360591] [2019-12-26 21:36:49,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:36:49,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:36:50,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:36:50,019 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719360591] [2019-12-26 21:36:50,019 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:36:50,019 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:36:50,019 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117248030] [2019-12-26 21:36:50,023 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 21:36:50,023 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:36:50,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 21:36:50,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:36:50,024 INFO L87 Difference]: Start difference. First operand 23431 states and 83897 transitions. Second operand 4 states. [2019-12-26 21:36:50,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:36:50,660 INFO L93 Difference]: Finished difference Result 35741 states and 122817 transitions. [2019-12-26 21:36:50,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 21:36:50,661 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-26 21:36:50,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:36:50,821 INFO L225 Difference]: With dead ends: 35741 [2019-12-26 21:36:50,821 INFO L226 Difference]: Without dead ends: 35726 [2019-12-26 21:36:50,822 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:36:51,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35726 states. [2019-12-26 21:36:52,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35726 to 34903. [2019-12-26 21:36:52,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34903 states. [2019-12-26 21:36:52,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34903 states to 34903 states and 120641 transitions. [2019-12-26 21:36:52,226 INFO L78 Accepts]: Start accepts. Automaton has 34903 states and 120641 transitions. Word has length 14 [2019-12-26 21:36:52,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:36:52,227 INFO L462 AbstractCegarLoop]: Abstraction has 34903 states and 120641 transitions. [2019-12-26 21:36:52,227 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 21:36:52,227 INFO L276 IsEmpty]: Start isEmpty. Operand 34903 states and 120641 transitions. [2019-12-26 21:36:52,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-26 21:36:52,230 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:36:52,230 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:36:52,231 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:36:52,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:36:52,231 INFO L82 PathProgramCache]: Analyzing trace with hash -902377345, now seen corresponding path program 1 times [2019-12-26 21:36:52,231 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:36:52,232 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166467841] [2019-12-26 21:36:52,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:36:52,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:36:52,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:36:52,308 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166467841] [2019-12-26 21:36:52,308 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:36:52,308 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:36:52,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452201010] [2019-12-26 21:36:52,309 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 21:36:52,309 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:36:52,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 21:36:52,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:36:52,310 INFO L87 Difference]: Start difference. First operand 34903 states and 120641 transitions. Second operand 4 states. [2019-12-26 21:36:53,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:36:53,106 INFO L93 Difference]: Finished difference Result 44765 states and 152243 transitions. [2019-12-26 21:36:53,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 21:36:53,107 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-26 21:36:53,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:36:53,273 INFO L225 Difference]: With dead ends: 44765 [2019-12-26 21:36:53,273 INFO L226 Difference]: Without dead ends: 44699 [2019-12-26 21:36:53,274 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:36:53,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44699 states. [2019-12-26 21:36:54,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44699 to 40201. [2019-12-26 21:36:54,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40201 states. [2019-12-26 21:36:54,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40201 states to 40201 states and 138191 transitions. [2019-12-26 21:36:54,787 INFO L78 Accepts]: Start accepts. Automaton has 40201 states and 138191 transitions. Word has length 16 [2019-12-26 21:36:54,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:36:54,788 INFO L462 AbstractCegarLoop]: Abstraction has 40201 states and 138191 transitions. [2019-12-26 21:36:54,788 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 21:36:54,788 INFO L276 IsEmpty]: Start isEmpty. Operand 40201 states and 138191 transitions. [2019-12-26 21:36:54,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-26 21:36:54,795 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:36:54,795 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:36:54,795 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:36:54,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:36:54,795 INFO L82 PathProgramCache]: Analyzing trace with hash -736056884, now seen corresponding path program 1 times [2019-12-26 21:36:54,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:36:54,796 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823790246] [2019-12-26 21:36:54,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:36:54,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:36:54,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:36:54,857 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823790246] [2019-12-26 21:36:54,858 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:36:54,858 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 21:36:54,858 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521886023] [2019-12-26 21:36:54,858 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:36:54,859 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:36:54,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:36:54,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:36:54,859 INFO L87 Difference]: Start difference. First operand 40201 states and 138191 transitions. Second operand 3 states. [2019-12-26 21:36:55,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:36:55,066 INFO L93 Difference]: Finished difference Result 37897 states and 130073 transitions. [2019-12-26 21:36:55,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:36:55,067 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-26 21:36:55,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:36:55,165 INFO L225 Difference]: With dead ends: 37897 [2019-12-26 21:36:55,165 INFO L226 Difference]: Without dead ends: 37897 [2019-12-26 21:36:55,166 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:36:55,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37897 states. [2019-12-26 21:36:56,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37897 to 37897. [2019-12-26 21:36:56,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37897 states. [2019-12-26 21:36:56,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37897 states to 37897 states and 130073 transitions. [2019-12-26 21:36:56,525 INFO L78 Accepts]: Start accepts. Automaton has 37897 states and 130073 transitions. Word has length 19 [2019-12-26 21:36:56,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:36:56,525 INFO L462 AbstractCegarLoop]: Abstraction has 37897 states and 130073 transitions. [2019-12-26 21:36:56,525 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:36:56,525 INFO L276 IsEmpty]: Start isEmpty. Operand 37897 states and 130073 transitions. [2019-12-26 21:36:56,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-26 21:36:56,539 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:36:56,539 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] [2019-12-26 21:36:56,539 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:36:56,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:36:56,540 INFO L82 PathProgramCache]: Analyzing trace with hash 1471479395, now seen corresponding path program 1 times [2019-12-26 21:36:56,540 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:36:56,540 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478692710] [2019-12-26 21:36:56,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:36:56,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:36:56,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:36:56,624 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478692710] [2019-12-26 21:36:56,625 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:36:56,625 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:36:56,625 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771827849] [2019-12-26 21:36:56,625 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 21:36:56,626 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:36:56,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 21:36:56,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:36:56,627 INFO L87 Difference]: Start difference. First operand 37897 states and 130073 transitions. Second operand 5 states. [2019-12-26 21:36:58,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:36:58,622 INFO L93 Difference]: Finished difference Result 44903 states and 151795 transitions. [2019-12-26 21:36:58,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 21:36:58,623 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-12-26 21:36:58,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:36:58,727 INFO L225 Difference]: With dead ends: 44903 [2019-12-26 21:36:58,727 INFO L226 Difference]: Without dead ends: 44876 [2019-12-26 21:36:58,729 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-26 21:36:59,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44876 states. [2019-12-26 21:36:59,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44876 to 37931. [2019-12-26 21:36:59,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37931 states. [2019-12-26 21:36:59,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37931 states to 37931 states and 130187 transitions. [2019-12-26 21:36:59,923 INFO L78 Accepts]: Start accepts. Automaton has 37931 states and 130187 transitions. Word has length 23 [2019-12-26 21:36:59,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:36:59,923 INFO L462 AbstractCegarLoop]: Abstraction has 37931 states and 130187 transitions. [2019-12-26 21:36:59,923 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 21:36:59,923 INFO L276 IsEmpty]: Start isEmpty. Operand 37931 states and 130187 transitions. [2019-12-26 21:36:59,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-26 21:36:59,971 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:36:59,971 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:36:59,972 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:36:59,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:36:59,972 INFO L82 PathProgramCache]: Analyzing trace with hash -1501647613, now seen corresponding path program 1 times [2019-12-26 21:36:59,972 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:36:59,972 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27382469] [2019-12-26 21:36:59,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:37:00,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:37:00,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:37:00,090 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27382469] [2019-12-26 21:37:00,091 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:37:00,091 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:37:00,091 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648794443] [2019-12-26 21:37:00,091 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 21:37:00,092 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:37:00,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 21:37:00,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:37:00,093 INFO L87 Difference]: Start difference. First operand 37931 states and 130187 transitions. Second operand 5 states. [2019-12-26 21:37:00,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:37:00,409 INFO L93 Difference]: Finished difference Result 57698 states and 201251 transitions. [2019-12-26 21:37:00,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 21:37:00,410 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-12-26 21:37:00,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:37:00,511 INFO L225 Difference]: With dead ends: 57698 [2019-12-26 21:37:00,511 INFO L226 Difference]: Without dead ends: 50142 [2019-12-26 21:37:00,512 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-26 21:37:00,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50142 states. [2019-12-26 21:37:01,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50142 to 50142. [2019-12-26 21:37:01,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50142 states. [2019-12-26 21:37:02,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50142 states to 50142 states and 175482 transitions. [2019-12-26 21:37:02,019 INFO L78 Accepts]: Start accepts. Automaton has 50142 states and 175482 transitions. Word has length 33 [2019-12-26 21:37:02,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:37:02,019 INFO L462 AbstractCegarLoop]: Abstraction has 50142 states and 175482 transitions. [2019-12-26 21:37:02,020 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 21:37:02,020 INFO L276 IsEmpty]: Start isEmpty. Operand 50142 states and 175482 transitions. [2019-12-26 21:37:02,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-26 21:37:02,093 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:37:02,093 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:37:02,093 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:37:02,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:37:02,093 INFO L82 PathProgramCache]: Analyzing trace with hash -1577527187, now seen corresponding path program 2 times [2019-12-26 21:37:02,093 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:37:02,094 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976705531] [2019-12-26 21:37:02,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:37:02,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:37:02,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:37:02,192 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976705531] [2019-12-26 21:37:02,192 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:37:02,193 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 21:37:02,193 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184755542] [2019-12-26 21:37:02,193 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 21:37:02,193 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:37:02,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 21:37:02,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:37:02,195 INFO L87 Difference]: Start difference. First operand 50142 states and 175482 transitions. Second operand 5 states. [2019-12-26 21:37:02,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:37:02,280 INFO L93 Difference]: Finished difference Result 11230 states and 34693 transitions. [2019-12-26 21:37:02,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 21:37:02,280 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-12-26 21:37:02,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:37:02,294 INFO L225 Difference]: With dead ends: 11230 [2019-12-26 21:37:02,294 INFO L226 Difference]: Without dead ends: 7932 [2019-12-26 21:37:02,294 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-26 21:37:02,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7932 states. [2019-12-26 21:37:02,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7932 to 7932. [2019-12-26 21:37:02,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7932 states. [2019-12-26 21:37:02,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7932 states to 7932 states and 23166 transitions. [2019-12-26 21:37:02,395 INFO L78 Accepts]: Start accepts. Automaton has 7932 states and 23166 transitions. Word has length 33 [2019-12-26 21:37:02,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:37:02,396 INFO L462 AbstractCegarLoop]: Abstraction has 7932 states and 23166 transitions. [2019-12-26 21:37:02,396 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 21:37:02,396 INFO L276 IsEmpty]: Start isEmpty. Operand 7932 states and 23166 transitions. [2019-12-26 21:37:02,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-26 21:37:02,408 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:37:02,408 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:37:02,408 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:37:02,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:37:02,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1037998465, now seen corresponding path program 1 times [2019-12-26 21:37:02,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:37:02,409 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308708519] [2019-12-26 21:37:02,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:37:02,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:37:02,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:37:02,478 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308708519] [2019-12-26 21:37:02,478 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:37:02,479 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:37:02,479 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729923388] [2019-12-26 21:37:02,479 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 21:37:02,479 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:37:02,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 21:37:02,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:37:02,480 INFO L87 Difference]: Start difference. First operand 7932 states and 23166 transitions. Second operand 4 states. [2019-12-26 21:37:02,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:37:02,655 INFO L93 Difference]: Finished difference Result 9099 states and 25843 transitions. [2019-12-26 21:37:02,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 21:37:02,655 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2019-12-26 21:37:02,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:37:02,670 INFO L225 Difference]: With dead ends: 9099 [2019-12-26 21:37:02,670 INFO L226 Difference]: Without dead ends: 7943 [2019-12-26 21:37:02,671 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:37:02,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7943 states. [2019-12-26 21:37:02,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7943 to 7927. [2019-12-26 21:37:02,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7927 states. [2019-12-26 21:37:02,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7927 states to 7927 states and 23085 transitions. [2019-12-26 21:37:02,818 INFO L78 Accepts]: Start accepts. Automaton has 7927 states and 23085 transitions. Word has length 45 [2019-12-26 21:37:02,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:37:02,819 INFO L462 AbstractCegarLoop]: Abstraction has 7927 states and 23085 transitions. [2019-12-26 21:37:02,819 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 21:37:02,819 INFO L276 IsEmpty]: Start isEmpty. Operand 7927 states and 23085 transitions. [2019-12-26 21:37:02,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-26 21:37:02,833 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:37:02,833 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:37:02,833 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:37:02,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:37:02,833 INFO L82 PathProgramCache]: Analyzing trace with hash -366523869, now seen corresponding path program 2 times [2019-12-26 21:37:02,834 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:37:02,834 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720831396] [2019-12-26 21:37:02,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:37:02,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:37:02,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:37:02,948 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720831396] [2019-12-26 21:37:02,948 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:37:02,948 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 21:37:02,949 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162428782] [2019-12-26 21:37:02,950 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 21:37:02,950 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:37:02,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 21:37:02,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:37:02,950 INFO L87 Difference]: Start difference. First operand 7927 states and 23085 transitions. Second operand 5 states. [2019-12-26 21:37:03,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:37:03,395 INFO L93 Difference]: Finished difference Result 8909 states and 25518 transitions. [2019-12-26 21:37:03,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 21:37:03,396 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-12-26 21:37:03,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:37:03,409 INFO L225 Difference]: With dead ends: 8909 [2019-12-26 21:37:03,410 INFO L226 Difference]: Without dead ends: 8909 [2019-12-26 21:37:03,412 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-26 21:37:03,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8909 states. [2019-12-26 21:37:03,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8909 to 8665. [2019-12-26 21:37:03,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8665 states. [2019-12-26 21:37:03,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8665 states to 8665 states and 25010 transitions. [2019-12-26 21:37:03,516 INFO L78 Accepts]: Start accepts. Automaton has 8665 states and 25010 transitions. Word has length 45 [2019-12-26 21:37:03,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:37:03,517 INFO L462 AbstractCegarLoop]: Abstraction has 8665 states and 25010 transitions. [2019-12-26 21:37:03,517 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 21:37:03,517 INFO L276 IsEmpty]: Start isEmpty. Operand 8665 states and 25010 transitions. [2019-12-26 21:37:03,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-26 21:37:03,526 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:37:03,526 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:37:03,527 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:37:03,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:37:03,527 INFO L82 PathProgramCache]: Analyzing trace with hash -1047489597, now seen corresponding path program 1 times [2019-12-26 21:37:03,527 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:37:03,527 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377464576] [2019-12-26 21:37:03,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:37:03,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:37:03,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:37:03,633 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377464576] [2019-12-26 21:37:03,634 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:37:03,634 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 21:37:03,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347719030] [2019-12-26 21:37:03,634 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 21:37:03,635 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:37:03,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 21:37:03,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-26 21:37:03,635 INFO L87 Difference]: Start difference. First operand 8665 states and 25010 transitions. Second operand 6 states. [2019-12-26 21:37:03,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:37:03,734 INFO L93 Difference]: Finished difference Result 7199 states and 21483 transitions. [2019-12-26 21:37:03,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 21:37:03,734 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2019-12-26 21:37:03,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:37:03,744 INFO L225 Difference]: With dead ends: 7199 [2019-12-26 21:37:03,744 INFO L226 Difference]: Without dead ends: 4310 [2019-12-26 21:37:03,744 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-26 21:37:03,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4310 states. [2019-12-26 21:37:03,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4310 to 4102. [2019-12-26 21:37:03,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4102 states. [2019-12-26 21:37:03,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4102 states to 4102 states and 10920 transitions. [2019-12-26 21:37:03,814 INFO L78 Accepts]: Start accepts. Automaton has 4102 states and 10920 transitions. Word has length 46 [2019-12-26 21:37:03,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:37:03,814 INFO L462 AbstractCegarLoop]: Abstraction has 4102 states and 10920 transitions. [2019-12-26 21:37:03,814 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 21:37:03,814 INFO L276 IsEmpty]: Start isEmpty. Operand 4102 states and 10920 transitions. [2019-12-26 21:37:03,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-26 21:37:03,820 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:37:03,821 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] [2019-12-26 21:37:03,821 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:37:03,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:37:03,821 INFO L82 PathProgramCache]: Analyzing trace with hash -717724991, now seen corresponding path program 1 times [2019-12-26 21:37:03,822 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:37:03,822 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120720096] [2019-12-26 21:37:03,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:37:03,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:37:03,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:37:03,913 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120720096] [2019-12-26 21:37:03,913 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:37:03,913 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 21:37:03,913 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71082508] [2019-12-26 21:37:03,914 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 21:37:03,914 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:37:03,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 21:37:03,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-26 21:37:03,915 INFO L87 Difference]: Start difference. First operand 4102 states and 10920 transitions. Second operand 6 states. [2019-12-26 21:37:04,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:37:04,115 INFO L93 Difference]: Finished difference Result 7954 states and 21361 transitions. [2019-12-26 21:37:04,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-26 21:37:04,115 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2019-12-26 21:37:04,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:37:04,124 INFO L225 Difference]: With dead ends: 7954 [2019-12-26 21:37:04,124 INFO L226 Difference]: Without dead ends: 6549 [2019-12-26 21:37:04,124 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-12-26 21:37:04,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6549 states. [2019-12-26 21:37:04,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6549 to 4527. [2019-12-26 21:37:04,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4527 states. [2019-12-26 21:37:04,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4527 states to 4527 states and 11970 transitions. [2019-12-26 21:37:04,185 INFO L78 Accepts]: Start accepts. Automaton has 4527 states and 11970 transitions. Word has length 61 [2019-12-26 21:37:04,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:37:04,185 INFO L462 AbstractCegarLoop]: Abstraction has 4527 states and 11970 transitions. [2019-12-26 21:37:04,186 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 21:37:04,186 INFO L276 IsEmpty]: Start isEmpty. Operand 4527 states and 11970 transitions. [2019-12-26 21:37:04,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-26 21:37:04,190 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:37:04,190 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:37:04,190 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:37:04,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:37:04,190 INFO L82 PathProgramCache]: Analyzing trace with hash -1098348301, now seen corresponding path program 1 times [2019-12-26 21:37:04,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:37:04,191 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832617185] [2019-12-26 21:37:04,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:37:04,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:37:04,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:37:04,261 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832617185] [2019-12-26 21:37:04,261 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:37:04,261 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:37:04,262 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327218584] [2019-12-26 21:37:04,262 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 21:37:04,262 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:37:04,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 21:37:04,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:37:04,263 INFO L87 Difference]: Start difference. First operand 4527 states and 11970 transitions. Second operand 4 states. [2019-12-26 21:37:04,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:37:04,294 INFO L93 Difference]: Finished difference Result 5181 states and 13422 transitions. [2019-12-26 21:37:04,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 21:37:04,294 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-12-26 21:37:04,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:37:04,296 INFO L225 Difference]: With dead ends: 5181 [2019-12-26 21:37:04,296 INFO L226 Difference]: Without dead ends: 735 [2019-12-26 21:37:04,296 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:37:04,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2019-12-26 21:37:04,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 735. [2019-12-26 21:37:04,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 735 states. [2019-12-26 21:37:04,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 735 states to 735 states and 1583 transitions. [2019-12-26 21:37:04,306 INFO L78 Accepts]: Start accepts. Automaton has 735 states and 1583 transitions. Word has length 62 [2019-12-26 21:37:04,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:37:04,307 INFO L462 AbstractCegarLoop]: Abstraction has 735 states and 1583 transitions. [2019-12-26 21:37:04,307 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 21:37:04,307 INFO L276 IsEmpty]: Start isEmpty. Operand 735 states and 1583 transitions. [2019-12-26 21:37:04,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-26 21:37:04,308 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:37:04,308 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:37:04,308 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:37:04,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:37:04,309 INFO L82 PathProgramCache]: Analyzing trace with hash 1723127799, now seen corresponding path program 1 times [2019-12-26 21:37:04,309 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:37:04,309 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184768494] [2019-12-26 21:37:04,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:37:04,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:37:04,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:37:04,396 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184768494] [2019-12-26 21:37:04,396 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:37:04,396 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 21:37:04,396 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451347848] [2019-12-26 21:37:04,396 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-26 21:37:04,397 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:37:04,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-26 21:37:04,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-26 21:37:04,397 INFO L87 Difference]: Start difference. First operand 735 states and 1583 transitions. Second operand 8 states. [2019-12-26 21:37:04,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:37:04,635 INFO L93 Difference]: Finished difference Result 1387 states and 2929 transitions. [2019-12-26 21:37:04,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-26 21:37:04,636 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 62 [2019-12-26 21:37:04,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:37:04,637 INFO L225 Difference]: With dead ends: 1387 [2019-12-26 21:37:04,638 INFO L226 Difference]: Without dead ends: 1012 [2019-12-26 21:37:04,638 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-12-26 21:37:04,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1012 states. [2019-12-26 21:37:04,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1012 to 808. [2019-12-26 21:37:04,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 808 states. [2019-12-26 21:37:04,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 1712 transitions. [2019-12-26 21:37:04,650 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 1712 transitions. Word has length 62 [2019-12-26 21:37:04,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:37:04,651 INFO L462 AbstractCegarLoop]: Abstraction has 808 states and 1712 transitions. [2019-12-26 21:37:04,651 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-26 21:37:04,651 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 1712 transitions. [2019-12-26 21:37:04,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-26 21:37:04,661 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:37:04,661 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:37:04,661 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:37:04,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:37:04,661 INFO L82 PathProgramCache]: Analyzing trace with hash -2098975229, now seen corresponding path program 2 times [2019-12-26 21:37:04,662 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:37:04,662 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569315234] [2019-12-26 21:37:04,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:37:04,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:37:04,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:37:04,737 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569315234] [2019-12-26 21:37:04,737 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:37:04,737 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 21:37:04,738 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957555478] [2019-12-26 21:37:04,738 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 21:37:04,738 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:37:04,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 21:37:04,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-26 21:37:04,739 INFO L87 Difference]: Start difference. First operand 808 states and 1712 transitions. Second operand 6 states. [2019-12-26 21:37:05,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:37:05,188 INFO L93 Difference]: Finished difference Result 930 states and 1951 transitions. [2019-12-26 21:37:05,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 21:37:05,188 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2019-12-26 21:37:05,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:37:05,190 INFO L225 Difference]: With dead ends: 930 [2019-12-26 21:37:05,190 INFO L226 Difference]: Without dead ends: 930 [2019-12-26 21:37:05,190 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-26 21:37:05,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 930 states. [2019-12-26 21:37:05,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 930 to 814. [2019-12-26 21:37:05,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 814 states. [2019-12-26 21:37:05,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 814 states to 814 states and 1723 transitions. [2019-12-26 21:37:05,201 INFO L78 Accepts]: Start accepts. Automaton has 814 states and 1723 transitions. Word has length 62 [2019-12-26 21:37:05,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:37:05,202 INFO L462 AbstractCegarLoop]: Abstraction has 814 states and 1723 transitions. [2019-12-26 21:37:05,202 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 21:37:05,202 INFO L276 IsEmpty]: Start isEmpty. Operand 814 states and 1723 transitions. [2019-12-26 21:37:05,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-26 21:37:05,203 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:37:05,203 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:37:05,203 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:37:05,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:37:05,203 INFO L82 PathProgramCache]: Analyzing trace with hash -991702007, now seen corresponding path program 3 times [2019-12-26 21:37:05,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:37:05,203 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376641127] [2019-12-26 21:37:05,204 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:37:05,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:37:05,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:37:05,267 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376641127] [2019-12-26 21:37:05,268 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:37:05,268 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:37:05,268 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864939336] [2019-12-26 21:37:05,268 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:37:05,268 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:37:05,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:37:05,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:37:05,269 INFO L87 Difference]: Start difference. First operand 814 states and 1723 transitions. Second operand 3 states. [2019-12-26 21:37:05,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:37:05,281 INFO L93 Difference]: Finished difference Result 814 states and 1722 transitions. [2019-12-26 21:37:05,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:37:05,282 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2019-12-26 21:37:05,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:37:05,283 INFO L225 Difference]: With dead ends: 814 [2019-12-26 21:37:05,283 INFO L226 Difference]: Without dead ends: 814 [2019-12-26 21:37:05,283 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:37:05,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 814 states. [2019-12-26 21:37:05,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 814 to 768. [2019-12-26 21:37:05,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 768 states. [2019-12-26 21:37:05,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 768 states to 768 states and 1644 transitions. [2019-12-26 21:37:05,294 INFO L78 Accepts]: Start accepts. Automaton has 768 states and 1644 transitions. Word has length 62 [2019-12-26 21:37:05,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:37:05,294 INFO L462 AbstractCegarLoop]: Abstraction has 768 states and 1644 transitions. [2019-12-26 21:37:05,294 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:37:05,295 INFO L276 IsEmpty]: Start isEmpty. Operand 768 states and 1644 transitions. [2019-12-26 21:37:05,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-26 21:37:05,296 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:37:05,296 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:37:05,296 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:37:05,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:37:05,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1081093091, now seen corresponding path program 1 times [2019-12-26 21:37:05,297 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:37:05,297 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469755803] [2019-12-26 21:37:05,297 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:37:05,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 21:37:05,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 21:37:05,426 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 21:37:05,426 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 21:37:05,432 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1028] [1028] ULTIMATE.startENTRY-->L840: Formula: (let ((.cse0 (store |v_#valid_148| 0 0))) (and (= v_~z$r_buff0_thd1~0_163 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t388~0.base_114|)) (= v_~z$r_buff1_thd1~0_231 0) (= 0 v_~__unbuffered_p2_EAX~0_94) (= v_~weak$$choice2~0_336 0) (= v_~z$r_buff1_thd2~0_450 0) (= v_~main$tmp_guard0~0_29 0) (= v_~z$w_buff0~0_389 0) (= v_~main$tmp_guard1~0_78 0) (= v_~y~0_48 0) (< 0 |v_#StackHeapBarrier_17|) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t388~0.base_114|) (= v_~z$read_delayed_var~0.offset_7 0) (= v_~__unbuffered_p0_EBX~0_85 0) (= v_~z$w_buff1~0_275 0) (= 0 v_~z$r_buff0_thd3~0_641) (= 0 v_~__unbuffered_p1_EAX~0_94) (= v_~__unbuffered_cnt~0_142 0) (= v_~z$w_buff1_used~0_552 0) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$read_delayed~0_7 0) (= v_~z$r_buff1_thd0~0_338 0) (= 0 v_~__unbuffered_p0_EAX~0_85) (= (store .cse0 |v_ULTIMATE.start_main_~#t388~0.base_114| 1) |v_#valid_146|) (= v_~z$r_buff0_thd0~0_222 0) (= 0 v_~weak$$choice0~0_260) (= |v_#NULL.offset_5| 0) (= v_~z~0_393 0) (= |v_ULTIMATE.start_main_~#t388~0.offset_64| 0) (= 0 v_~z$r_buff1_thd3~0_405) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t388~0.base_114| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t388~0.base_114|) |v_ULTIMATE.start_main_~#t388~0.offset_64| 0)) |v_#memory_int_21|) (= v_~__unbuffered_p2_EBX~0_87 0) (= v_~z$r_buff0_thd2~0_459 0) (= v_~a~0_33 0) (= 0 v_~z$flush_delayed~0_341) (= 0 v_~z$mem_tmp~0_277) (= v_~x~0_19 0) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t388~0.base_114| 4)) (= 0 |v_#NULL.base_5|) (= v_~z$w_buff0_used~0_978 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_148|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_16|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_10|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_450, #NULL.offset=|v_#NULL.offset_5|, ~a~0=v_~a~0_33, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_222, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_85, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_94, #length=|v_#length_25|, ULTIMATE.start_main_~#t389~0.base=|v_ULTIMATE.start_main_~#t389~0.base_87|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_94, ULTIMATE.start_main_~#t390~0.base=|v_ULTIMATE.start_main_~#t390~0.base_63|, ~z$mem_tmp~0=v_~z$mem_tmp~0_277, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_87, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_85, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_57|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_552, ~z$flush_delayed~0=v_~z$flush_delayed~0_341, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_159|, ~weak$$choice0~0=v_~weak$$choice0~0_260, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_33|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_231, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_641, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_142, ~x~0=v_~x~0_19, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_10|, ULTIMATE.start_main_~#t388~0.offset=|v_ULTIMATE.start_main_~#t388~0.offset_64|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_275, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_78, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_~#t390~0.offset=|v_ULTIMATE.start_main_~#t390~0.offset_38|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_338, ~y~0=v_~y~0_48, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_459, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_978, ~z$w_buff0~0=v_~z$w_buff0~0_389, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_405, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_88|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_29, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_~#t388~0.base=|v_ULTIMATE.start_main_~#t388~0.base_114|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_29|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_371|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_63|, #valid=|v_#valid_146|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_393, ~weak$$choice2~0=v_~weak$$choice2~0_336, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_163, ULTIMATE.start_main_~#t389~0.offset=|v_ULTIMATE.start_main_~#t389~0.offset_38|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, ~z$r_buff1_thd2~0, #NULL.offset, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ULTIMATE.start_main_~#t389~0.base, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t390~0.base, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_#t~ite58, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_#t~nondet56, ULTIMATE.start_main_~#t388~0.offset, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t390~0.offset, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_~#t388~0.base, ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ULTIMATE.start_main_~#t389~0.offset] because there is no mapped edge [2019-12-26 21:37:05,434 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [999] [999] L840-1-->L842: Formula: (and (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t389~0.base_11|) (= |v_ULTIMATE.start_main_~#t389~0.offset_10| 0) (= (store |v_#valid_35| |v_ULTIMATE.start_main_~#t389~0.base_11| 1) |v_#valid_34|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t389~0.base_11| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t389~0.base_11|)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t389~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t389~0.base_11|) |v_ULTIMATE.start_main_~#t389~0.offset_10| 1)) |v_#memory_int_11|) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t389~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_6|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t389~0.base=|v_ULTIMATE.start_main_~#t389~0.base_11|, #length=|v_#length_15|, ULTIMATE.start_main_~#t389~0.offset=|v_ULTIMATE.start_main_~#t389~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, ULTIMATE.start_main_~#t389~0.base, #length, ULTIMATE.start_main_~#t389~0.offset] because there is no mapped edge [2019-12-26 21:37:05,435 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1005] [1005] L842-1-->L844: Formula: (and (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t390~0.base_11| 1)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t390~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t390~0.base_11|) |v_ULTIMATE.start_main_~#t390~0.offset_10| 2)) |v_#memory_int_13|) (= 0 |v_ULTIMATE.start_main_~#t390~0.offset_10|) (not (= |v_ULTIMATE.start_main_~#t390~0.base_11| 0)) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t390~0.base_11| 4) |v_#length_17|) (= (select |v_#valid_37| |v_ULTIMATE.start_main_~#t390~0.base_11|) 0) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t390~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t390~0.base=|v_ULTIMATE.start_main_~#t390~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_36|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_6|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|, ULTIMATE.start_main_~#t390~0.offset=|v_ULTIMATE.start_main_~#t390~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t390~0.base, #valid, ULTIMATE.start_main_#t~nondet56, #memory_int, #length, ULTIMATE.start_main_~#t390~0.offset] because there is no mapped edge [2019-12-26 21:37:05,436 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [926] [926] P2ENTRY-->L4-3: Formula: (and (= v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_71 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_69|) (= |v_P2Thread1of1ForFork0_#in~arg.offset_69| v_P2Thread1of1ForFork0_~arg.offset_69) (= v_~z$w_buff0_used~0_347 1) (= |v_P2Thread1of1ForFork0_#in~arg.base_69| v_P2Thread1of1ForFork0_~arg.base_69) (= (mod v_~z$w_buff1_used~0_200 256) 0) (= v_~z$w_buff0_used~0_348 v_~z$w_buff1_used~0_200) (= v_~z$w_buff0~0_158 v_~z$w_buff1~0_95) (= 1 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_69|) (= v_~z$w_buff0~0_157 1)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_69|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_348, ~z$w_buff0~0=v_~z$w_buff0~0_158, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_69|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_69, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_69|, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_69|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_347, ~z$w_buff0~0=v_~z$w_buff0~0_157, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_69, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_200, ~z$w_buff1~0=v_~z$w_buff1~0_95, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_69|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_71} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~z$w_buff0_used~0, ~z$w_buff0~0, P2Thread1of1ForFork0_~arg.offset, ~z$w_buff1_used~0, ~z$w_buff1~0, P2Thread1of1ForFork0___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-26 21:37:05,440 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [967] [967] L802-2-->L802-4: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In52885536 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In52885536 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite28_Out52885536| ~z$w_buff0~0_In52885536) (not .cse0) (not .cse1)) (and (= ~z$w_buff1~0_In52885536 |P2Thread1of1ForFork0_#t~ite28_Out52885536|) (or .cse1 .cse0)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In52885536, ~z$w_buff0_used~0=~z$w_buff0_used~0_In52885536, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In52885536, ~z$w_buff1~0=~z$w_buff1~0_In52885536} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out52885536|, ~z$w_buff0~0=~z$w_buff0~0_In52885536, ~z$w_buff0_used~0=~z$w_buff0_used~0_In52885536, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In52885536, ~z$w_buff1~0=~z$w_buff1~0_In52885536} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-26 21:37:05,441 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [879] [879] L802-4-->L803: Formula: (= v_~z~0_26 |v_P2Thread1of1ForFork0_#t~ite28_8|) InVars {P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_8|} OutVars{P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_7|, ~z~0=v_~z~0_26, P2Thread1of1ForFork0_#t~ite29=|v_P2Thread1of1ForFork0_#t~ite29_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, ~z~0, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-26 21:37:05,448 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [882] [882] L807-->L808: Formula: (and (not (= (mod v_~weak$$choice2~0_43 256) 0)) (= v_~z$r_buff0_thd3~0_66 v_~z$r_buff0_thd3~0_65)) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_66, ~weak$$choice2~0=v_~weak$$choice2~0_43} OutVars{P2Thread1of1ForFork0_#t~ite44=|v_P2Thread1of1ForFork0_#t~ite44_9|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_7|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_65, P2Thread1of1ForFork0_#t~ite42=|v_P2Thread1of1ForFork0_#t~ite42_7|, ~weak$$choice2~0=v_~weak$$choice2~0_43} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite44, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-26 21:37:05,450 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [955] [955] L810-->L810-2: Formula: (let ((.cse0 (= (mod ~z$flush_delayed~0_In-695480007 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite48_Out-695480007| ~z~0_In-695480007) .cse0) (and (= |P2Thread1of1ForFork0_#t~ite48_Out-695480007| ~z$mem_tmp~0_In-695480007) (not .cse0)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-695480007, ~z$flush_delayed~0=~z$flush_delayed~0_In-695480007, ~z~0=~z~0_In-695480007} OutVars{P2Thread1of1ForFork0_#t~ite48=|P2Thread1of1ForFork0_#t~ite48_Out-695480007|, ~z$mem_tmp~0=~z$mem_tmp~0_In-695480007, ~z$flush_delayed~0=~z$flush_delayed~0_In-695480007, ~z~0=~z~0_In-695480007} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite48] because there is no mapped edge [2019-12-26 21:37:05,452 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1004] [1004] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork1_~arg.offset_12 |v_P0Thread1of1ForFork1_#in~arg.offset_12|) (= v_~__unbuffered_p0_EBX~0_19 v_~y~0_40) (= |v_P0Thread1of1ForFork1_#in~arg.base_12| v_P0Thread1of1ForFork1_~arg.base_12) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~x~0_13 v_~__unbuffered_p0_EAX~0_19) (= v_~x~0_13 1) (= v_~__unbuffered_cnt~0_119 (+ v_~__unbuffered_cnt~0_120 1)) (= v_~a~0_17 1) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_12|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_120, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_12|, ~y~0=v_~y~0_40} OutVars{~a~0=v_~a~0_17, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_19, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_19, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_12|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_12, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_119, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_12|, ~y~0=v_~y~0_40, ~x~0=v_~x~0_13, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_12} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p0_EBX~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~x~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-26 21:37:05,456 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [965] [965] L818-->L818-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-403496901 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-403496901 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite51_Out-403496901| 0) (not .cse1)) (and (= |P2Thread1of1ForFork0_#t~ite51_Out-403496901| ~z$w_buff0_used~0_In-403496901) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-403496901, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-403496901} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-403496901, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-403496901, P2Thread1of1ForFork0_#t~ite51=|P2Thread1of1ForFork0_#t~ite51_Out-403496901|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite51] because there is no mapped edge [2019-12-26 21:37:05,458 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [953] [953] L819-->L819-2: Formula: (let ((.cse3 (= (mod ~z$w_buff1_used~0_In-1197117208 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd3~0_In-1197117208 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1197117208 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-1197117208 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite52_Out-1197117208| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= |P2Thread1of1ForFork0_#t~ite52_Out-1197117208| ~z$w_buff1_used~0_In-1197117208) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1197117208, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1197117208, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1197117208, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1197117208} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1197117208, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1197117208, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1197117208, P2Thread1of1ForFork0_#t~ite52=|P2Thread1of1ForFork0_#t~ite52_Out-1197117208|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1197117208} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite52] because there is no mapped edge [2019-12-26 21:37:05,461 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [958] [958] L820-->L821: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In377079907 256))) (.cse0 (= (mod ~z$r_buff0_thd3~0_In377079907 256) 0))) (or (and (not .cse0) (= ~z$r_buff0_thd3~0_Out377079907 0) (not .cse1)) (and (= ~z$r_buff0_thd3~0_Out377079907 ~z$r_buff0_thd3~0_In377079907) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In377079907, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In377079907} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In377079907, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_Out377079907, P2Thread1of1ForFork0_#t~ite53=|P2Thread1of1ForFork0_#t~ite53_Out377079907|} AuxVars[] AssignedVars[~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite53] because there is no mapped edge [2019-12-26 21:37:05,461 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [963] [963] L821-->L821-2: Formula: (let ((.cse3 (= (mod ~z$r_buff0_thd3~0_In18441492 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In18441492 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In18441492 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd3~0_In18441492 256) 0))) (or (and (= ~z$r_buff1_thd3~0_In18441492 |P2Thread1of1ForFork0_#t~ite54_Out18441492|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork0_#t~ite54_Out18441492| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In18441492, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In18441492, ~z$w_buff1_used~0=~z$w_buff1_used~0_In18441492, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In18441492} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In18441492, P2Thread1of1ForFork0_#t~ite54=|P2Thread1of1ForFork0_#t~ite54_Out18441492|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In18441492, ~z$w_buff1_used~0=~z$w_buff1_used~0_In18441492, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In18441492} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite54] because there is no mapped edge [2019-12-26 21:37:05,462 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [993] [993] L821-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~z$r_buff1_thd3~0_201 |v_P2Thread1of1ForFork0_#t~ite54_38|) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= v_~__unbuffered_cnt~0_90 (+ v_~__unbuffered_cnt~0_91 1))) InVars {P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_91} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_37|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_201, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_90, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite54, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-26 21:37:05,481 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [957] [957] L773-->L773-2: Formula: (let ((.cse0 (= (mod ~z$flush_delayed~0_In-1205190008 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite25_Out-1205190008| ~z$mem_tmp~0_In-1205190008) (not .cse0)) (and .cse0 (= ~z~0_In-1205190008 |P1Thread1of1ForFork2_#t~ite25_Out-1205190008|)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-1205190008, ~z$flush_delayed~0=~z$flush_delayed~0_In-1205190008, ~z~0=~z~0_In-1205190008} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In-1205190008, ~z$flush_delayed~0=~z$flush_delayed~0_In-1205190008, ~z~0=~z~0_In-1205190008, P1Thread1of1ForFork2_#t~ite25=|P1Thread1of1ForFork2_#t~ite25_Out-1205190008|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-26 21:37:05,481 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1002] [1002] L773-2-->P1EXIT: Formula: (and (= 0 v_~z$flush_delayed~0_267) (= v_~z~0_239 |v_P1Thread1of1ForFork2_#t~ite25_94|) (= v_~__unbuffered_cnt~0_117 (+ v_~__unbuffered_cnt~0_118 1)) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_118, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_94|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_117, ~z$flush_delayed~0=v_~z$flush_delayed~0_267, ~z~0=v_~z~0_239, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_93|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P1Thread1of1ForFork2_#res.base, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-26 21:37:05,482 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [897] [897] L848-->L850-2: Formula: (and (not (= (mod v_~main$tmp_guard0~0_4 256) 0)) (or (= (mod v_~z$r_buff0_thd0~0_30 256) 0) (= 0 (mod v_~z$w_buff0_used~0_165 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_30, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_165, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_30, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_165, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-26 21:37:05,482 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [973] [973] L850-2-->L850-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite59_Out-1050007671| |ULTIMATE.start_main_#t~ite58_Out-1050007671|)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1050007671 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-1050007671 256)))) (or (and .cse0 (not .cse1) (= ~z$w_buff1~0_In-1050007671 |ULTIMATE.start_main_#t~ite58_Out-1050007671|) (not .cse2)) (and .cse0 (or .cse2 .cse1) (= ~z~0_In-1050007671 |ULTIMATE.start_main_#t~ite58_Out-1050007671|)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1050007671, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1050007671, ~z$w_buff1~0=~z$w_buff1~0_In-1050007671, ~z~0=~z~0_In-1050007671} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1050007671, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out-1050007671|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1050007671, ~z$w_buff1~0=~z$w_buff1~0_In-1050007671, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out-1050007671|, ~z~0=~z~0_In-1050007671} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-26 21:37:05,484 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [948] [948] L851-->L851-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In911284010 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In911284010 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite60_Out911284010| 0) (not .cse1)) (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In911284010 |ULTIMATE.start_main_#t~ite60_Out911284010|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In911284010, ~z$w_buff0_used~0=~z$w_buff0_used~0_In911284010} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out911284010|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In911284010, ~z$w_buff0_used~0=~z$w_buff0_used~0_In911284010} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-26 21:37:05,485 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [966] [966] L852-->L852-2: Formula: (let ((.cse3 (= (mod ~z$r_buff0_thd0~0_In991413464 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In991413464 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In991413464 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In991413464 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite61_Out991413464| 0)) (and (or .cse3 .cse2) (= ~z$w_buff1_used~0_In991413464 |ULTIMATE.start_main_#t~ite61_Out991413464|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In991413464, ~z$w_buff0_used~0=~z$w_buff0_used~0_In991413464, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In991413464, ~z$w_buff1_used~0=~z$w_buff1_used~0_In991413464} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In991413464, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out991413464|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In991413464, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In991413464, ~z$w_buff1_used~0=~z$w_buff1_used~0_In991413464} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-26 21:37:05,487 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [970] [970] L853-->L853-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1889661399 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-1889661399 256)))) (or (and (= ~z$r_buff0_thd0~0_In-1889661399 |ULTIMATE.start_main_#t~ite62_Out-1889661399|) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite62_Out-1889661399| 0) (not .cse1) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1889661399, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1889661399} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out-1889661399|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1889661399, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1889661399} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-26 21:37:05,489 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [951] [951] L854-->L854-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff1_used~0_In-216770968 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In-216770968 256))) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-216770968 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-216770968 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite63_Out-216770968|)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~z$r_buff1_thd0~0_In-216770968 |ULTIMATE.start_main_#t~ite63_Out-216770968|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-216770968, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-216770968, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-216770968, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-216770968} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-216770968|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-216770968, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-216770968, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-216770968, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-216770968} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-26 21:37:05,490 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1013] [1013] L854-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_14| (mod v_~main$tmp_guard1~0_22 256)) (= v_~__unbuffered_p0_EBX~0_30 0) (= v_~z$r_buff1_thd0~0_254 |v_ULTIMATE.start_main_#t~ite63_47|) (= 1 v_~__unbuffered_p0_EAX~0_30) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 0) (= v_~__unbuffered_p2_EBX~0_26 0) (= 0 v_~__unbuffered_p1_EAX~0_29) (= 1 v_~__unbuffered_p2_EAX~0_22) (= v_~main$tmp_guard1~0_22 0)) InVars {ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_47|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_30, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_30, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_29, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_22} OutVars{ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_46|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_30, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_19, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_30, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_29, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_254, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_22, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_22, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_14|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-26 21:37:05,659 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 09:37:05 BasicIcfg [2019-12-26 21:37:05,659 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 21:37:05,661 INFO L168 Benchmark]: Toolchain (without parser) took 37268.55 ms. Allocated memory was 145.8 MB in the beginning and 1.6 GB in the end (delta: 1.5 GB). Free memory was 102.1 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 393.7 MB. Max. memory is 7.1 GB. [2019-12-26 21:37:05,662 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-26 21:37:05,667 INFO L168 Benchmark]: CACSL2BoogieTranslator took 752.92 ms. Allocated memory was 145.8 MB in the beginning and 202.9 MB in the end (delta: 57.1 MB). Free memory was 101.7 MB in the beginning and 155.7 MB in the end (delta: -54.0 MB). Peak memory consumption was 22.4 MB. Max. memory is 7.1 GB. [2019-12-26 21:37:05,668 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.80 ms. Allocated memory is still 202.9 MB. Free memory was 155.7 MB in the beginning and 152.4 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2019-12-26 21:37:05,668 INFO L168 Benchmark]: Boogie Preprocessor took 51.32 ms. Allocated memory is still 202.9 MB. Free memory was 152.4 MB in the beginning and 149.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-26 21:37:05,670 INFO L168 Benchmark]: RCFGBuilder took 939.64 ms. Allocated memory is still 202.9 MB. Free memory was 149.7 MB in the beginning and 94.6 MB in the end (delta: 55.1 MB). Peak memory consumption was 55.1 MB. Max. memory is 7.1 GB. [2019-12-26 21:37:05,670 INFO L168 Benchmark]: TraceAbstraction took 35449.41 ms. Allocated memory was 202.9 MB in the beginning and 1.6 GB in the end (delta: 1.4 GB). Free memory was 93.9 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 328.4 MB. Max. memory is 7.1 GB. [2019-12-26 21:37:05,676 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 752.92 ms. Allocated memory was 145.8 MB in the beginning and 202.9 MB in the end (delta: 57.1 MB). Free memory was 101.7 MB in the beginning and 155.7 MB in the end (delta: -54.0 MB). Peak memory consumption was 22.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 69.80 ms. Allocated memory is still 202.9 MB. Free memory was 155.7 MB in the beginning and 152.4 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 51.32 ms. Allocated memory is still 202.9 MB. Free memory was 152.4 MB in the beginning and 149.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 939.64 ms. Allocated memory is still 202.9 MB. Free memory was 149.7 MB in the beginning and 94.6 MB in the end (delta: 55.1 MB). Peak memory consumption was 55.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 35449.41 ms. Allocated memory was 202.9 MB in the beginning and 1.6 GB in the end (delta: 1.4 GB). Free memory was 93.9 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 328.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.7s, 197 ProgramPointsBefore, 108 ProgramPointsAfterwards, 243 TransitionsBefore, 130 TransitionsAfterwards, 24630 CoEnabledTransitionPairs, 7 FixpointIterations, 36 TrivialSequentialCompositions, 38 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 53 ConcurrentYvCompositions, 28 ChoiceCompositions, 9454 VarBasedMoverChecksPositive, 317 VarBasedMoverChecksNegative, 92 SemBasedMoverChecksPositive, 331 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.4s, 0 MoverChecksTotal, 124397 CheckedPairsTotal, 127 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L840] FCALL, FORK 0 pthread_create(&t388, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L842] FCALL, FORK 0 pthread_create(&t389, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L844] FCALL, FORK 0 pthread_create(&t390, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L791] 3 z$r_buff1_thd0 = z$r_buff0_thd0 [L792] 3 z$r_buff1_thd1 = z$r_buff0_thd1 [L793] 3 z$r_buff1_thd2 = z$r_buff0_thd2 [L794] 3 z$r_buff1_thd3 = z$r_buff0_thd3 [L795] 3 z$r_buff0_thd3 = (_Bool)1 [L798] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L799] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L800] 3 z$flush_delayed = weak$$choice2 [L801] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L802] 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L803] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L803] 3 z$w_buff0 = 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)) [L804] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L804] 3 z$w_buff1 = 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)) [L805] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L805] 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)) [L806] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L806] 3 z$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)) [L808] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L808] 3 z$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)) [L809] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L810] 3 z = z$flush_delayed ? z$mem_tmp : z [L811] 3 z$flush_delayed = (_Bool)0 [L814] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L817] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L758] 2 y = 1 [L761] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 2 z$flush_delayed = weak$$choice2 [L764] 2 z$mem_tmp = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L765] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L817] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L818] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L819] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L765] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L766] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L766] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L767] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L767] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L768] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L768] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L769] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L769] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L770] EXPR 2 weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L771] EXPR 2 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L772] 2 __unbuffered_p1_EAX = z VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L846] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L850] 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) [L851] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L852] 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 [L853] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 188 locations, 2 error locations. Result: UNSAFE, OverallTime: 35.0s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 8.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3289 SDtfs, 4171 SDslu, 5953 SDs, 0 SdLazy, 1988 SolverSat, 118 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 101 GetRequests, 21 SyntacticMatches, 6 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50142occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 13.8s AutomataMinimizationTime, 16 MinimizatonAttempts, 15122 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 666 NumberOfCodeBlocks, 666 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 587 ConstructedInterpolants, 0 QuantifiedInterpolants, 82107 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...