/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix011_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 20:01:12,058 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 20:01:12,062 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 20:01:12,080 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 20:01:12,080 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 20:01:12,083 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 20:01:12,085 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 20:01:12,087 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 20:01:12,089 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 20:01:12,090 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 20:01:12,091 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 20:01:12,092 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 20:01:12,093 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 20:01:12,094 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 20:01:12,095 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 20:01:12,096 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 20:01:12,096 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 20:01:12,097 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 20:01:12,099 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 20:01:12,101 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 20:01:12,104 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 20:01:12,105 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 20:01:12,108 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 20:01:12,109 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 20:01:12,113 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 20:01:12,113 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 20:01:12,113 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 20:01:12,116 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 20:01:12,117 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 20:01:12,119 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 20:01:12,119 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 20:01:12,121 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 20:01:12,122 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 20:01:12,123 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 20:01:12,126 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 20:01:12,127 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 20:01:12,128 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 20:01:12,128 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 20:01:12,128 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 20:01:12,132 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 20:01:12,133 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 20:01:12,134 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf [2019-12-27 20:01:12,154 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 20:01:12,154 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 20:01:12,157 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 20:01:12,157 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 20:01:12,157 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 20:01:12,157 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 20:01:12,157 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 20:01:12,158 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 20:01:12,158 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 20:01:12,158 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 20:01:12,159 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 20:01:12,159 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 20:01:12,159 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 20:01:12,160 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 20:01:12,160 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 20:01:12,160 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 20:01:12,160 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 20:01:12,161 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 20:01:12,161 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 20:01:12,161 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 20:01:12,161 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 20:01:12,161 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 20:01:12,162 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 20:01:12,162 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 20:01:12,162 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 20:01:12,162 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 20:01:12,162 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 20:01:12,163 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 20:01:12,163 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 20:01:12,163 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 20:01:12,164 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 20:01:12,164 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 20:01:12,477 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 20:01:12,495 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 20:01:12,499 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 20:01:12,500 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 20:01:12,501 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 20:01:12,502 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix011_rmo.opt.i [2019-12-27 20:01:12,586 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e78b4888/5ce2e6c31eb44421afc0f7e6fd540722/FLAGbd2e28c78 [2019-12-27 20:01:13,190 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 20:01:13,191 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix011_rmo.opt.i [2019-12-27 20:01:13,213 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e78b4888/5ce2e6c31eb44421afc0f7e6fd540722/FLAGbd2e28c78 [2019-12-27 20:01:13,401 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e78b4888/5ce2e6c31eb44421afc0f7e6fd540722 [2019-12-27 20:01:13,410 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 20:01:13,412 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 20:01:13,413 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 20:01:13,413 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 20:01:13,417 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 20:01:13,418 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:01:13" (1/1) ... [2019-12-27 20:01:13,421 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@230b7f01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:01:13, skipping insertion in model container [2019-12-27 20:01:13,421 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:01:13" (1/1) ... [2019-12-27 20:01:13,428 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 20:01:13,497 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 20:01:14,064 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 20:01:14,077 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 20:01:14,178 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 20:01:14,267 INFO L208 MainTranslator]: Completed translation [2019-12-27 20:01:14,267 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:01:14 WrapperNode [2019-12-27 20:01:14,268 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 20:01:14,268 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 20:01:14,269 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 20:01:14,270 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 20:01:14,278 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:01:14" (1/1) ... [2019-12-27 20:01:14,307 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:01:14" (1/1) ... [2019-12-27 20:01:14,345 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 20:01:14,346 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 20:01:14,346 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 20:01:14,346 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 20:01:14,354 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:01:14" (1/1) ... [2019-12-27 20:01:14,355 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:01:14" (1/1) ... [2019-12-27 20:01:14,360 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:01:14" (1/1) ... [2019-12-27 20:01:14,360 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:01:14" (1/1) ... [2019-12-27 20:01:14,372 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:01:14" (1/1) ... [2019-12-27 20:01:14,376 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:01:14" (1/1) ... [2019-12-27 20:01:14,380 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:01:14" (1/1) ... [2019-12-27 20:01:14,386 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 20:01:14,387 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 20:01:14,387 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 20:01:14,387 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 20:01:14,388 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:01:14" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 20:01:14,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 20:01:14,461 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 20:01:14,461 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 20:01:14,461 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 20:01:14,461 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 20:01:14,462 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 20:01:14,462 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 20:01:14,462 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 20:01:14,462 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 20:01:14,462 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 20:01:14,463 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 20:01:14,463 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 20:01:14,463 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 20:01:14,465 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 20:01:15,251 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 20:01:15,251 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 20:01:15,252 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:01:15 BoogieIcfgContainer [2019-12-27 20:01:15,253 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 20:01:15,254 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 20:01:15,254 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 20:01:15,257 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 20:01:15,258 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 08:01:13" (1/3) ... [2019-12-27 20:01:15,258 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dbc3184 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:01:15, skipping insertion in model container [2019-12-27 20:01:15,259 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:01:14" (2/3) ... [2019-12-27 20:01:15,259 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dbc3184 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:01:15, skipping insertion in model container [2019-12-27 20:01:15,259 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:01:15" (3/3) ... [2019-12-27 20:01:15,261 INFO L109 eAbstractionObserver]: Analyzing ICFG mix011_rmo.opt.i [2019-12-27 20:01:15,269 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 20:01:15,270 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 20:01:15,278 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 20:01:15,279 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 20:01:15,341 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,342 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,342 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,342 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,343 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,343 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,344 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,344 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,344 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,345 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,345 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,345 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,345 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,345 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,346 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,346 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,346 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,347 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,347 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,347 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,347 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,347 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,348 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,348 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,348 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,348 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,348 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,349 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,349 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,349 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,349 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,350 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,350 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,350 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,350 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,350 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,351 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,351 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,351 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,351 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,352 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,352 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,352 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,352 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,352 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,353 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,353 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,353 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,353 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,353 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,360 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,360 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,360 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,360 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,360 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,361 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,361 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,361 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,361 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,362 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,362 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,362 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,362 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,362 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,363 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,363 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,363 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,363 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,363 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,364 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,365 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,365 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,365 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,366 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,366 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,366 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,366 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,367 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,367 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,367 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,367 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,367 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,368 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,368 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,368 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,368 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,369 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,369 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,369 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,369 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,369 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,369 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,370 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,370 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,370 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,370 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,370 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,371 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,371 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,371 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,371 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,371 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,372 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,372 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,372 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,372 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,372 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,373 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,373 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,373 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,373 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,374 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,374 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,374 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,374 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,374 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,375 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,375 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,375 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,375 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,375 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,376 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,376 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,376 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,376 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,376 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,377 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,377 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,377 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,377 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,377 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,377 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,378 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,378 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,378 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,378 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,378 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,379 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,379 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,379 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,379 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,379 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,380 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,380 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,380 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,380 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,380 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,381 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,381 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,381 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,381 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,382 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,382 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,382 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,382 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,382 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,383 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,383 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,383 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,383 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,383 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,383 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,384 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,384 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,384 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,384 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,384 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,385 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,385 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,385 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,385 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,385 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,385 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,386 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,386 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,386 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,386 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,386 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,387 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,387 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,387 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,387 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,387 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,388 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,388 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,388 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,388 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,389 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,389 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,389 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,389 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,389 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,394 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,394 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,394 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,394 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,395 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,395 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,395 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,395 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,395 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,396 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,396 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,396 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,396 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,396 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,397 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,397 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,397 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,397 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,397 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,398 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,398 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,398 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,398 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,398 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,398 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,399 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,399 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,399 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,399 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,399 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,400 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,405 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,405 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,405 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,406 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,408 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,410 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,411 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,411 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,411 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,411 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,411 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,411 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,412 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,412 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,412 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,412 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,412 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,413 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,413 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,413 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,413 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:01:15,430 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 20:01:15,452 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 20:01:15,452 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 20:01:15,452 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 20:01:15,452 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 20:01:15,452 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 20:01:15,453 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 20:01:15,453 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 20:01:15,453 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 20:01:15,478 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 196 places, 242 transitions [2019-12-27 20:01:15,480 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 196 places, 242 transitions [2019-12-27 20:01:15,599 INFO L132 PetriNetUnfolder]: 56/239 cut-off events. [2019-12-27 20:01:15,599 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 20:01:15,620 INFO L76 FinitePrefix]: Finished finitePrefix Result has 249 conditions, 239 events. 56/239 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 565 event pairs. 0/181 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-12-27 20:01:15,651 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 196 places, 242 transitions [2019-12-27 20:01:15,716 INFO L132 PetriNetUnfolder]: 56/239 cut-off events. [2019-12-27 20:01:15,716 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 20:01:15,727 INFO L76 FinitePrefix]: Finished finitePrefix Result has 249 conditions, 239 events. 56/239 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 565 event pairs. 0/181 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-12-27 20:01:15,759 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 24630 [2019-12-27 20:01:15,760 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 20:01:19,484 WARN L192 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-27 20:01:19,610 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-27 20:01:19,719 INFO L206 etLargeBlockEncoding]: Checked pairs total: 123784 [2019-12-27 20:01:19,720 INFO L214 etLargeBlockEncoding]: Total number of compositions: 125 [2019-12-27 20:01:19,723 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 106 places, 127 transitions [2019-12-27 20:01:23,093 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 42982 states. [2019-12-27 20:01:23,095 INFO L276 IsEmpty]: Start isEmpty. Operand 42982 states. [2019-12-27 20:01:23,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-27 20:01:23,102 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:01:23,103 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:01:23,104 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-27 20:01:23,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:01:23,110 INFO L82 PathProgramCache]: Analyzing trace with hash 48878050, now seen corresponding path program 1 times [2019-12-27 20:01:23,121 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:01:23,122 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723377444] [2019-12-27 20:01:23,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:01:23,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:01:23,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:01:23,385 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723377444] [2019-12-27 20:01:23,386 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:01:23,386 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 20:01:23,387 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [424306399] [2019-12-27 20:01:23,388 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:01:23,392 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:01:23,406 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 8 states and 7 transitions. [2019-12-27 20:01:23,407 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:01:23,411 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:01:23,411 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:01:23,411 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:01:23,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:01:23,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:01:23,425 INFO L87 Difference]: Start difference. First operand 42982 states. Second operand 3 states. [2019-12-27 20:01:24,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:01:24,258 INFO L93 Difference]: Finished difference Result 42470 states and 173504 transitions. [2019-12-27 20:01:24,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:01:24,260 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-27 20:01:24,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:01:24,600 INFO L225 Difference]: With dead ends: 42470 [2019-12-27 20:01:24,600 INFO L226 Difference]: Without dead ends: 39546 [2019-12-27 20:01:24,602 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:01:26,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39546 states. [2019-12-27 20:01:27,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39546 to 39546. [2019-12-27 20:01:27,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39546 states. [2019-12-27 20:01:27,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39546 states to 39546 states and 161440 transitions. [2019-12-27 20:01:27,986 INFO L78 Accepts]: Start accepts. Automaton has 39546 states and 161440 transitions. Word has length 7 [2019-12-27 20:01:27,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:01:27,987 INFO L462 AbstractCegarLoop]: Abstraction has 39546 states and 161440 transitions. [2019-12-27 20:01:27,987 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:01:27,987 INFO L276 IsEmpty]: Start isEmpty. Operand 39546 states and 161440 transitions. [2019-12-27 20:01:27,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 20:01:27,995 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:01:27,995 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:01:28,000 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-27 20:01:28,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:01:28,002 INFO L82 PathProgramCache]: Analyzing trace with hash 2064044969, now seen corresponding path program 1 times [2019-12-27 20:01:28,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:01:28,003 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550112754] [2019-12-27 20:01:28,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:01:28,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:01:28,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:01:28,124 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550112754] [2019-12-27 20:01:28,125 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:01:28,125 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:01:28,126 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2129474660] [2019-12-27 20:01:28,126 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:01:28,127 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:01:28,131 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 20:01:28,132 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:01:28,132 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:01:28,133 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:01:28,134 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:01:28,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:01:28,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:01:28,134 INFO L87 Difference]: Start difference. First operand 39546 states and 161440 transitions. Second operand 4 states. [2019-12-27 20:01:30,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:01:30,396 INFO L93 Difference]: Finished difference Result 62606 states and 245680 transitions. [2019-12-27 20:01:30,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:01:30,397 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 20:01:30,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:01:30,671 INFO L225 Difference]: With dead ends: 62606 [2019-12-27 20:01:30,671 INFO L226 Difference]: Without dead ends: 62574 [2019-12-27 20:01:30,672 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:01:31,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62574 states. [2019-12-27 20:01:33,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62574 to 60086. [2019-12-27 20:01:33,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60086 states. [2019-12-27 20:01:33,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60086 states to 60086 states and 237688 transitions. [2019-12-27 20:01:33,875 INFO L78 Accepts]: Start accepts. Automaton has 60086 states and 237688 transitions. Word has length 13 [2019-12-27 20:01:33,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:01:33,876 INFO L462 AbstractCegarLoop]: Abstraction has 60086 states and 237688 transitions. [2019-12-27 20:01:33,876 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:01:33,876 INFO L276 IsEmpty]: Start isEmpty. Operand 60086 states and 237688 transitions. [2019-12-27 20:01:33,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 20:01:33,885 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:01:33,885 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:01:33,886 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-27 20:01:33,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:01:33,886 INFO L82 PathProgramCache]: Analyzing trace with hash 503175658, now seen corresponding path program 1 times [2019-12-27 20:01:33,887 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:01:33,887 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181136162] [2019-12-27 20:01:33,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:01:33,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:01:34,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:01:34,014 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181136162] [2019-12-27 20:01:34,015 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:01:34,015 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:01:34,015 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [723048247] [2019-12-27 20:01:34,015 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:01:34,019 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:01:34,026 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 35 states and 52 transitions. [2019-12-27 20:01:34,026 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:01:34,028 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:01:34,028 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:01:34,028 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:01:34,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:01:34,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:01:34,029 INFO L87 Difference]: Start difference. First operand 60086 states and 237688 transitions. Second operand 4 states. [2019-12-27 20:01:37,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:01:37,024 INFO L93 Difference]: Finished difference Result 77526 states and 302124 transitions. [2019-12-27 20:01:37,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:01:37,025 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 20:01:37,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:01:37,325 INFO L225 Difference]: With dead ends: 77526 [2019-12-27 20:01:37,326 INFO L226 Difference]: Without dead ends: 77496 [2019-12-27 20:01:37,326 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:01:38,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77496 states. [2019-12-27 20:01:39,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77496 to 68188. [2019-12-27 20:01:39,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68188 states. [2019-12-27 20:01:40,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68188 states to 68188 states and 268551 transitions. [2019-12-27 20:01:40,015 INFO L78 Accepts]: Start accepts. Automaton has 68188 states and 268551 transitions. Word has length 16 [2019-12-27 20:01:40,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:01:40,015 INFO L462 AbstractCegarLoop]: Abstraction has 68188 states and 268551 transitions. [2019-12-27 20:01:40,015 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:01:40,015 INFO L276 IsEmpty]: Start isEmpty. Operand 68188 states and 268551 transitions. [2019-12-27 20:01:40,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 20:01:40,026 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:01:40,026 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:01:40,026 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-27 20:01:40,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:01:40,027 INFO L82 PathProgramCache]: Analyzing trace with hash -787717565, now seen corresponding path program 1 times [2019-12-27 20:01:40,027 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:01:40,027 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660305927] [2019-12-27 20:01:40,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:01:40,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:01:40,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:01:40,111 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660305927] [2019-12-27 20:01:40,111 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:01:40,111 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 20:01:40,112 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1503139541] [2019-12-27 20:01:40,112 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:01:40,114 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:01:40,116 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 20 states and 20 transitions. [2019-12-27 20:01:40,117 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:01:40,117 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:01:40,117 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:01:40,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:01:40,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:01:40,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:01:40,118 INFO L87 Difference]: Start difference. First operand 68188 states and 268551 transitions. Second operand 3 states. [2019-12-27 20:01:40,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:01:40,469 INFO L93 Difference]: Finished difference Result 64048 states and 251839 transitions. [2019-12-27 20:01:40,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:01:40,469 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-27 20:01:40,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:01:40,639 INFO L225 Difference]: With dead ends: 64048 [2019-12-27 20:01:40,639 INFO L226 Difference]: Without dead ends: 63856 [2019-12-27 20:01:40,640 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:01:44,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63856 states. [2019-12-27 20:01:45,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63856 to 63856. [2019-12-27 20:01:45,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63856 states. [2019-12-27 20:01:45,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63856 states to 63856 states and 251151 transitions. [2019-12-27 20:01:45,354 INFO L78 Accepts]: Start accepts. Automaton has 63856 states and 251151 transitions. Word has length 18 [2019-12-27 20:01:45,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:01:45,354 INFO L462 AbstractCegarLoop]: Abstraction has 63856 states and 251151 transitions. [2019-12-27 20:01:45,355 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:01:45,355 INFO L276 IsEmpty]: Start isEmpty. Operand 63856 states and 251151 transitions. [2019-12-27 20:01:45,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 20:01:45,379 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:01:45,379 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:01:45,380 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-27 20:01:45,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:01:45,380 INFO L82 PathProgramCache]: Analyzing trace with hash -802769487, now seen corresponding path program 1 times [2019-12-27 20:01:45,381 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:01:45,381 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071311842] [2019-12-27 20:01:45,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:01:45,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:01:45,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:01:45,450 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071311842] [2019-12-27 20:01:45,451 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:01:45,451 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:01:45,452 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [253542965] [2019-12-27 20:01:45,452 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:01:45,455 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:01:45,462 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 76 transitions. [2019-12-27 20:01:45,462 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:01:45,463 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:01:45,463 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:01:45,463 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:01:45,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:01:45,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:01:45,464 INFO L87 Difference]: Start difference. First operand 63856 states and 251151 transitions. Second operand 5 states. [2019-12-27 20:01:46,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:01:46,425 INFO L93 Difference]: Finished difference Result 77072 states and 298885 transitions. [2019-12-27 20:01:46,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 20:01:46,425 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 20:01:46,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:01:47,296 INFO L225 Difference]: With dead ends: 77072 [2019-12-27 20:01:47,297 INFO L226 Difference]: Without dead ends: 77018 [2019-12-27 20:01:47,297 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-27 20:01:48,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77018 states. [2019-12-27 20:01:51,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77018 to 63662. [2019-12-27 20:01:51,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63662 states. [2019-12-27 20:01:51,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63662 states to 63662 states and 250434 transitions. [2019-12-27 20:01:51,657 INFO L78 Accepts]: Start accepts. Automaton has 63662 states and 250434 transitions. Word has length 22 [2019-12-27 20:01:51,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:01:51,657 INFO L462 AbstractCegarLoop]: Abstraction has 63662 states and 250434 transitions. [2019-12-27 20:01:51,657 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:01:51,657 INFO L276 IsEmpty]: Start isEmpty. Operand 63662 states and 250434 transitions. [2019-12-27 20:01:51,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-27 20:01:51,729 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:01:51,729 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:01:51,729 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-27 20:01:51,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:01:51,730 INFO L82 PathProgramCache]: Analyzing trace with hash -655538281, now seen corresponding path program 1 times [2019-12-27 20:01:51,730 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:01:51,730 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357058876] [2019-12-27 20:01:51,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:01:51,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:01:51,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:01:51,807 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357058876] [2019-12-27 20:01:51,807 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:01:51,807 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 20:01:51,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [604572737] [2019-12-27 20:01:51,808 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:01:51,816 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:01:51,825 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 34 states and 34 transitions. [2019-12-27 20:01:51,826 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:01:51,826 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:01:51,826 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:01:51,827 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:01:51,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:01:51,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:01:51,827 INFO L87 Difference]: Start difference. First operand 63662 states and 250434 transitions. Second operand 3 states. [2019-12-27 20:01:52,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:01:52,641 INFO L93 Difference]: Finished difference Result 63610 states and 250254 transitions. [2019-12-27 20:01:52,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:01:52,641 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-12-27 20:01:52,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:01:52,793 INFO L225 Difference]: With dead ends: 63610 [2019-12-27 20:01:52,793 INFO L226 Difference]: Without dead ends: 63610 [2019-12-27 20:01:52,794 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:01:53,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63610 states. [2019-12-27 20:01:56,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63610 to 63610. [2019-12-27 20:01:56,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63610 states. [2019-12-27 20:01:56,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63610 states to 63610 states and 250254 transitions. [2019-12-27 20:01:56,953 INFO L78 Accepts]: Start accepts. Automaton has 63610 states and 250254 transitions. Word has length 32 [2019-12-27 20:01:56,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:01:56,953 INFO L462 AbstractCegarLoop]: Abstraction has 63610 states and 250254 transitions. [2019-12-27 20:01:56,953 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:01:56,953 INFO L276 IsEmpty]: Start isEmpty. Operand 63610 states and 250254 transitions. [2019-12-27 20:01:57,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 20:01:57,031 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:01:57,031 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-27 20:01:57,031 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-27 20:01:57,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:01:57,031 INFO L82 PathProgramCache]: Analyzing trace with hash -33493824, now seen corresponding path program 1 times [2019-12-27 20:01:57,032 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:01:57,032 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915684612] [2019-12-27 20:01:57,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:01:57,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:01:57,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:01:57,105 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915684612] [2019-12-27 20:01:57,105 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:01:57,105 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:01:57,106 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [599116612] [2019-12-27 20:01:57,106 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:01:57,112 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:01:57,124 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 41 states and 48 transitions. [2019-12-27 20:01:57,124 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:01:57,130 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 20:01:57,130 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:01:57,131 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:01:57,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:01:57,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:01:57,131 INFO L87 Difference]: Start difference. First operand 63610 states and 250254 transitions. Second operand 3 states. [2019-12-27 20:01:57,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:01:57,464 INFO L93 Difference]: Finished difference Result 63610 states and 247314 transitions. [2019-12-27 20:01:57,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:01:57,464 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-12-27 20:01:57,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:01:58,190 INFO L225 Difference]: With dead ends: 63610 [2019-12-27 20:01:58,190 INFO L226 Difference]: Without dead ends: 63610 [2019-12-27 20:01:58,191 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:01:58,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63610 states. [2019-12-27 20:02:00,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63610 to 63290. [2019-12-27 20:02:00,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63290 states. [2019-12-27 20:02:00,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63290 states to 63290 states and 246226 transitions. [2019-12-27 20:02:00,315 INFO L78 Accepts]: Start accepts. Automaton has 63290 states and 246226 transitions. Word has length 33 [2019-12-27 20:02:00,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:02:00,316 INFO L462 AbstractCegarLoop]: Abstraction has 63290 states and 246226 transitions. [2019-12-27 20:02:00,316 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:02:00,316 INFO L276 IsEmpty]: Start isEmpty. Operand 63290 states and 246226 transitions. [2019-12-27 20:02:00,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 20:02:00,397 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:02:00,398 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:02:00,398 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-27 20:02:00,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:02:00,398 INFO L82 PathProgramCache]: Analyzing trace with hash 142914011, now seen corresponding path program 1 times [2019-12-27 20:02:00,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:02:00,399 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123020675] [2019-12-27 20:02:00,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:02:00,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:02:00,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:02:00,477 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123020675] [2019-12-27 20:02:00,477 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:02:00,478 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 20:02:00,478 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [633964051] [2019-12-27 20:02:00,478 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:02:00,484 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:02:00,504 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 69 states and 101 transitions. [2019-12-27 20:02:00,504 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:02:00,523 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 20:02:00,524 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 20:02:00,524 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:02:00,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 20:02:00,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 20:02:00,525 INFO L87 Difference]: Start difference. First operand 63290 states and 246226 transitions. Second operand 7 states. [2019-12-27 20:02:05,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:02:05,186 INFO L93 Difference]: Finished difference Result 162766 states and 632902 transitions. [2019-12-27 20:02:05,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 20:02:05,187 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2019-12-27 20:02:05,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:02:05,547 INFO L225 Difference]: With dead ends: 162766 [2019-12-27 20:02:05,547 INFO L226 Difference]: Without dead ends: 135720 [2019-12-27 20:02:05,548 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2019-12-27 20:02:06,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135720 states. [2019-12-27 20:02:08,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135720 to 105090. [2019-12-27 20:02:08,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105090 states. [2019-12-27 20:02:09,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105090 states to 105090 states and 412794 transitions. [2019-12-27 20:02:09,249 INFO L78 Accepts]: Start accepts. Automaton has 105090 states and 412794 transitions. Word has length 34 [2019-12-27 20:02:09,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:02:09,249 INFO L462 AbstractCegarLoop]: Abstraction has 105090 states and 412794 transitions. [2019-12-27 20:02:09,249 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 20:02:09,250 INFO L276 IsEmpty]: Start isEmpty. Operand 105090 states and 412794 transitions. [2019-12-27 20:02:09,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 20:02:09,400 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:02:09,400 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:02:09,400 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-27 20:02:09,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:02:09,400 INFO L82 PathProgramCache]: Analyzing trace with hash -1215394357, now seen corresponding path program 2 times [2019-12-27 20:02:09,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:02:09,401 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284964160] [2019-12-27 20:02:09,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:02:09,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:02:09,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:02:09,540 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284964160] [2019-12-27 20:02:09,540 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:02:09,540 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 20:02:09,541 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [278658937] [2019-12-27 20:02:09,541 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:02:09,548 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:02:09,571 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 89 states and 141 transitions. [2019-12-27 20:02:09,572 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:02:09,728 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 20:02:09,728 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 20:02:09,729 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:02:09,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 20:02:09,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-12-27 20:02:09,729 INFO L87 Difference]: Start difference. First operand 105090 states and 412794 transitions. Second operand 15 states. [2019-12-27 20:02:23,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:02:23,846 INFO L93 Difference]: Finished difference Result 628338 states and 2464636 transitions. [2019-12-27 20:02:23,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-12-27 20:02:23,847 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 34 [2019-12-27 20:02:23,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:02:26,887 INFO L225 Difference]: With dead ends: 628338 [2019-12-27 20:02:26,888 INFO L226 Difference]: Without dead ends: 546964 [2019-12-27 20:02:26,889 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 764 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=713, Invalid=2149, Unknown=0, NotChecked=0, Total=2862 [2019-12-27 20:02:37,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546964 states. [2019-12-27 20:02:41,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546964 to 131510. [2019-12-27 20:02:41,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131510 states. [2019-12-27 20:02:42,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131510 states to 131510 states and 521364 transitions. [2019-12-27 20:02:42,887 INFO L78 Accepts]: Start accepts. Automaton has 131510 states and 521364 transitions. Word has length 34 [2019-12-27 20:02:42,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:02:42,888 INFO L462 AbstractCegarLoop]: Abstraction has 131510 states and 521364 transitions. [2019-12-27 20:02:42,888 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 20:02:42,888 INFO L276 IsEmpty]: Start isEmpty. Operand 131510 states and 521364 transitions. [2019-12-27 20:02:43,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-27 20:02:43,080 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:02:43,080 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:02:43,080 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-27 20:02:43,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:02:43,081 INFO L82 PathProgramCache]: Analyzing trace with hash 2146150024, now seen corresponding path program 1 times [2019-12-27 20:02:43,081 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:02:43,081 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231083914] [2019-12-27 20:02:43,082 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:02:43,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:02:43,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:02:43,154 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231083914] [2019-12-27 20:02:43,154 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:02:43,154 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:02:43,154 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2072637527] [2019-12-27 20:02:43,154 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:02:43,161 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:02:43,185 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 106 states and 173 transitions. [2019-12-27 20:02:43,186 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:02:43,201 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 20:02:43,202 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:02:43,202 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:02:43,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:02:43,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:02:43,202 INFO L87 Difference]: Start difference. First operand 131510 states and 521364 transitions. Second operand 5 states. [2019-12-27 20:02:43,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:02:43,848 INFO L93 Difference]: Finished difference Result 113996 states and 399171 transitions. [2019-12-27 20:02:43,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:02:43,848 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2019-12-27 20:02:43,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:02:44,085 INFO L225 Difference]: With dead ends: 113996 [2019-12-27 20:02:44,085 INFO L226 Difference]: Without dead ends: 105848 [2019-12-27 20:02:44,086 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 20:02:45,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105848 states. [2019-12-27 20:02:46,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105848 to 71655. [2019-12-27 20:02:46,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71655 states. [2019-12-27 20:02:47,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71655 states to 71655 states and 248330 transitions. [2019-12-27 20:02:47,042 INFO L78 Accepts]: Start accepts. Automaton has 71655 states and 248330 transitions. Word has length 35 [2019-12-27 20:02:47,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:02:47,042 INFO L462 AbstractCegarLoop]: Abstraction has 71655 states and 248330 transitions. [2019-12-27 20:02:47,043 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:02:47,043 INFO L276 IsEmpty]: Start isEmpty. Operand 71655 states and 248330 transitions. [2019-12-27 20:02:47,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-27 20:02:47,125 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:02:47,125 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:02:47,125 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-27 20:02:47,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:02:47,126 INFO L82 PathProgramCache]: Analyzing trace with hash 700182320, now seen corresponding path program 1 times [2019-12-27 20:02:47,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:02:47,127 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058981383] [2019-12-27 20:02:47,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:02:47,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:02:47,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:02:47,199 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058981383] [2019-12-27 20:02:47,199 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:02:47,199 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 20:02:47,199 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [110724866] [2019-12-27 20:02:47,200 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:02:47,206 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:02:48,468 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 126 states and 204 transitions. [2019-12-27 20:02:48,468 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:02:48,490 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 20:02:48,491 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 20:02:48,491 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:02:48,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 20:02:48,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 20:02:48,491 INFO L87 Difference]: Start difference. First operand 71655 states and 248330 transitions. Second operand 6 states. [2019-12-27 20:02:48,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:02:48,786 INFO L93 Difference]: Finished difference Result 15089 states and 46229 transitions. [2019-12-27 20:02:48,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 20:02:48,787 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2019-12-27 20:02:48,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:02:48,810 INFO L225 Difference]: With dead ends: 15089 [2019-12-27 20:02:48,810 INFO L226 Difference]: Without dead ends: 10861 [2019-12-27 20:02:48,811 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-12-27 20:02:48,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10861 states. [2019-12-27 20:02:48,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10861 to 9803. [2019-12-27 20:02:48,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9803 states. [2019-12-27 20:02:49,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9803 states to 9803 states and 28793 transitions. [2019-12-27 20:02:49,018 INFO L78 Accepts]: Start accepts. Automaton has 9803 states and 28793 transitions. Word has length 36 [2019-12-27 20:02:49,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:02:49,018 INFO L462 AbstractCegarLoop]: Abstraction has 9803 states and 28793 transitions. [2019-12-27 20:02:49,018 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 20:02:49,018 INFO L276 IsEmpty]: Start isEmpty. Operand 9803 states and 28793 transitions. [2019-12-27 20:02:49,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-27 20:02:49,035 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:02:49,035 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:02:49,035 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-27 20:02:49,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:02:49,036 INFO L82 PathProgramCache]: Analyzing trace with hash 1368466382, now seen corresponding path program 1 times [2019-12-27 20:02:49,036 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:02:49,036 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557053198] [2019-12-27 20:02:49,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:02:49,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:02:49,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:02:49,151 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557053198] [2019-12-27 20:02:49,152 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:02:49,152 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:02:49,152 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2115695342] [2019-12-27 20:02:49,152 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:02:49,164 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:02:49,200 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 82 states and 95 transitions. [2019-12-27 20:02:49,200 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:02:49,201 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:02:49,201 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:02:49,201 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:02:49,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:02:49,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:02:49,202 INFO L87 Difference]: Start difference. First operand 9803 states and 28793 transitions. Second operand 4 states. [2019-12-27 20:02:49,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:02:49,260 INFO L93 Difference]: Finished difference Result 10852 states and 31172 transitions. [2019-12-27 20:02:49,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 20:02:49,261 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-12-27 20:02:49,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:02:49,279 INFO L225 Difference]: With dead ends: 10852 [2019-12-27 20:02:49,280 INFO L226 Difference]: Without dead ends: 9814 [2019-12-27 20:02:49,280 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:02:49,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9814 states. [2019-12-27 20:02:49,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9814 to 9797. [2019-12-27 20:02:49,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9797 states. [2019-12-27 20:02:49,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9797 states to 9797 states and 28709 transitions. [2019-12-27 20:02:49,408 INFO L78 Accepts]: Start accepts. Automaton has 9797 states and 28709 transitions. Word has length 47 [2019-12-27 20:02:49,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:02:49,408 INFO L462 AbstractCegarLoop]: Abstraction has 9797 states and 28709 transitions. [2019-12-27 20:02:49,408 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:02:49,408 INFO L276 IsEmpty]: Start isEmpty. Operand 9797 states and 28709 transitions. [2019-12-27 20:02:49,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-27 20:02:49,419 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:02:49,419 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:02:49,419 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-27 20:02:49,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:02:49,420 INFO L82 PathProgramCache]: Analyzing trace with hash -82607882, now seen corresponding path program 2 times [2019-12-27 20:02:49,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:02:49,420 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631668233] [2019-12-27 20:02:49,421 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:02:49,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:02:49,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:02:49,472 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631668233] [2019-12-27 20:02:49,472 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:02:49,472 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:02:49,473 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [466393482] [2019-12-27 20:02:49,473 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:02:49,485 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:02:49,515 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 62 states and 72 transitions. [2019-12-27 20:02:49,515 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:02:49,515 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:02:49,515 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:02:49,516 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:02:49,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:02:49,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:02:49,516 INFO L87 Difference]: Start difference. First operand 9797 states and 28709 transitions. Second operand 3 states. [2019-12-27 20:02:49,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:02:49,593 INFO L93 Difference]: Finished difference Result 15237 states and 42219 transitions. [2019-12-27 20:02:49,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:02:49,594 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-12-27 20:02:49,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:02:49,614 INFO L225 Difference]: With dead ends: 15237 [2019-12-27 20:02:49,614 INFO L226 Difference]: Without dead ends: 9610 [2019-12-27 20:02:49,614 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:02:49,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9610 states. [2019-12-27 20:02:49,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9610 to 9554. [2019-12-27 20:02:49,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9554 states. [2019-12-27 20:02:49,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9554 states to 9554 states and 24243 transitions. [2019-12-27 20:02:49,800 INFO L78 Accepts]: Start accepts. Automaton has 9554 states and 24243 transitions. Word has length 47 [2019-12-27 20:02:49,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:02:49,800 INFO L462 AbstractCegarLoop]: Abstraction has 9554 states and 24243 transitions. [2019-12-27 20:02:49,800 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:02:49,800 INFO L276 IsEmpty]: Start isEmpty. Operand 9554 states and 24243 transitions. [2019-12-27 20:02:49,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-27 20:02:49,813 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:02:49,813 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:02:49,813 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-27 20:02:49,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:02:49,813 INFO L82 PathProgramCache]: Analyzing trace with hash -1179496772, now seen corresponding path program 3 times [2019-12-27 20:02:49,814 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:02:49,814 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148196199] [2019-12-27 20:02:49,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:02:49,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:02:49,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:02:49,930 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148196199] [2019-12-27 20:02:49,930 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:02:49,930 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 20:02:49,930 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [234343992] [2019-12-27 20:02:49,931 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:02:49,942 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:02:49,973 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 59 states and 61 transitions. [2019-12-27 20:02:49,973 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:02:49,974 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:02:49,974 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 20:02:49,974 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:02:49,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 20:02:49,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 20:02:49,975 INFO L87 Difference]: Start difference. First operand 9554 states and 24243 transitions. Second operand 6 states. [2019-12-27 20:02:50,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:02:50,064 INFO L93 Difference]: Finished difference Result 8039 states and 20902 transitions. [2019-12-27 20:02:50,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 20:02:50,065 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2019-12-27 20:02:50,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:02:50,066 INFO L225 Difference]: With dead ends: 8039 [2019-12-27 20:02:50,066 INFO L226 Difference]: Without dead ends: 444 [2019-12-27 20:02:50,066 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-27 20:02:50,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2019-12-27 20:02:50,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 444. [2019-12-27 20:02:50,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444 states. [2019-12-27 20:02:50,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 961 transitions. [2019-12-27 20:02:50,074 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 961 transitions. Word has length 47 [2019-12-27 20:02:50,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:02:50,074 INFO L462 AbstractCegarLoop]: Abstraction has 444 states and 961 transitions. [2019-12-27 20:02:50,074 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 20:02:50,074 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 961 transitions. [2019-12-27 20:02:50,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-27 20:02:50,075 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:02:50,075 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-27 20:02:50,075 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-27 20:02:50,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:02:50,076 INFO L82 PathProgramCache]: Analyzing trace with hash -1909019652, now seen corresponding path program 1 times [2019-12-27 20:02:50,077 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:02:50,077 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100437966] [2019-12-27 20:02:50,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:02:50,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:02:50,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:02:50,186 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100437966] [2019-12-27 20:02:50,187 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:02:50,187 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 20:02:50,187 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [462481379] [2019-12-27 20:02:50,187 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:02:50,208 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:02:51,595 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 181 states and 273 transitions. [2019-12-27 20:02:51,595 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:02:51,673 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 11 times. [2019-12-27 20:02:51,673 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 20:02:51,673 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:02:51,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 20:02:51,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-27 20:02:51,674 INFO L87 Difference]: Start difference. First operand 444 states and 961 transitions. Second operand 10 states. [2019-12-27 20:02:52,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:02:52,776 INFO L93 Difference]: Finished difference Result 3380 states and 7340 transitions. [2019-12-27 20:02:52,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-12-27 20:02:52,776 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 63 [2019-12-27 20:02:52,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:02:52,779 INFO L225 Difference]: With dead ends: 3380 [2019-12-27 20:02:52,779 INFO L226 Difference]: Without dead ends: 2068 [2019-12-27 20:02:52,780 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 9 SyntacticMatches, 4 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 471 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=340, Invalid=1466, Unknown=0, NotChecked=0, Total=1806 [2019-12-27 20:02:52,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2068 states. [2019-12-27 20:02:52,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2068 to 828. [2019-12-27 20:02:52,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 828 states. [2019-12-27 20:02:52,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1839 transitions. [2019-12-27 20:02:52,799 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 1839 transitions. Word has length 63 [2019-12-27 20:02:52,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:02:52,800 INFO L462 AbstractCegarLoop]: Abstraction has 828 states and 1839 transitions. [2019-12-27 20:02:52,800 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 20:02:52,800 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1839 transitions. [2019-12-27 20:02:52,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-27 20:02:52,801 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:02:52,801 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-27 20:02:52,801 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-27 20:02:52,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:02:52,802 INFO L82 PathProgramCache]: Analyzing trace with hash 1974293500, now seen corresponding path program 2 times [2019-12-27 20:02:52,803 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:02:52,803 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363248268] [2019-12-27 20:02:52,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:02:52,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 20:02:52,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 20:02:52,916 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 20:02:52,916 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 20:02:52,920 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1024] [1024] ULTIMATE.startENTRY-->L838: Formula: (let ((.cse0 (store |v_#valid_65| 0 0))) (and (= v_~z$r_buff0_thd0~0_22 0) (= 0 v_~weak$$choice0~0_10) (= v_~main$tmp_guard0~0_10 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t296~0.base_27|) (= 0 v_~__unbuffered_p1_EAX~0_13) (= 0 v_~z$r_buff1_thd3~0_41) (= v_~main$tmp_guard1~0_18 0) (= v_~z$r_buff0_thd3~0_78 0) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t296~0.base_27| 4) |v_#length_23|) (= 0 v_~z$r_buff1_thd2~0_28) (= |v_#NULL.offset_6| 0) (= v_~z$r_buff1_thd1~0_8 0) (= v_~z~0_26 0) (= 0 v_~z$w_buff1~0_35) (= v_~x~0_15 0) (= 0 v_~y~0_7) (= v_~__unbuffered_p2_EBX~0_12 0) (= v_~z$read_delayed~0_6 0) (= v_~z$read_delayed_var~0.offset_7 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t296~0.base_27| 1) |v_#valid_63|) (= 0 v_~z$flush_delayed~0_17) (< 0 |v_#StackHeapBarrier_18|) (= v_~z$w_buff0_used~0_134 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t296~0.base_27|)) (= v_~a~0_10 0) (= 0 |v_#NULL.base_6|) (= |v_ULTIMATE.start_main_~#t296~0.offset_21| 0) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t296~0.base_27| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t296~0.base_27|) |v_ULTIMATE.start_main_~#t296~0.offset_21| 0)) |v_#memory_int_23|) (= v_~z$r_buff0_thd2~0_54 0) (= 0 v_~z$r_buff1_thd0~0_22) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$r_buff0_thd1~0_9 0) (= 0 v_~weak$$choice2~0_35) (= 0 v_~__unbuffered_p2_EAX~0_12) (= v_~z$mem_tmp~0_12 0) (= 0 v_~__unbuffered_cnt~0_22) (= 0 v_~z$w_buff1_used~0_71) (= v_~__unbuffered_p1_EBX~0_13 0) (= 0 v_~z$w_buff0~0_35))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_65|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_7|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_8|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_28, #NULL.offset=|v_#NULL.offset_6|, ~a~0=v_~a~0_10, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_22, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_13, ULTIMATE.start_main_~#t297~0.base=|v_ULTIMATE.start_main_~#t297~0.base_22|, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_12, ~z$mem_tmp~0=v_~z$mem_tmp~0_12, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_12, ULTIMATE.start_main_~#t296~0.offset=|v_ULTIMATE.start_main_~#t296~0.offset_21|, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_12|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_71, ~z$flush_delayed~0=v_~z$flush_delayed~0_17, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_18|, ~weak$$choice0~0=v_~weak$$choice0~0_10, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_10|, ULTIMATE.start_main_~#t296~0.base=|v_ULTIMATE.start_main_~#t296~0.base_27|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_8, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_78, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, ~x~0=v_~x~0_15, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_8|, ~z$read_delayed~0=v_~z$read_delayed~0_6, ~z$w_buff1~0=v_~z$w_buff1~0_35, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_22, ULTIMATE.start_main_~#t297~0.offset=|v_ULTIMATE.start_main_~#t297~0.offset_18|, ~y~0=v_~y~0_7, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_54, ULTIMATE.start_main_~#t298~0.base=|v_ULTIMATE.start_main_~#t298~0.base_22|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_13, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_134, ~z$w_buff0~0=v_~z$w_buff0~0_35, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_41, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_13|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_10|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_10|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, #valid=|v_#valid_63|, ULTIMATE.start_main_~#t298~0.offset=|v_ULTIMATE.start_main_~#t298~0.offset_18|, #memory_int=|v_#memory_int_23|, ~z~0=v_~z~0_26, ~weak$$choice2~0=v_~weak$$choice2~0_35, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, ~z$r_buff1_thd2~0, #NULL.offset, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t297~0.base, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_~#t296~0.offset, ULTIMATE.start_main_#t~ite58, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ULTIMATE.start_main_~#t296~0.base, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_#t~nondet56, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t297~0.offset, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t298~0.base, ~__unbuffered_p1_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~#t298~0.offset, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 20:02:52,922 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [974] [974] L838-1-->L840: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t297~0.offset_9|) (not (= 0 |v_ULTIMATE.start_main_~#t297~0.base_10|)) (= (select |v_#valid_30| |v_ULTIMATE.start_main_~#t297~0.base_10|) 0) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t297~0.base_10| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t297~0.base_10|) |v_ULTIMATE.start_main_~#t297~0.offset_9| 1)) |v_#memory_int_13|) (= |v_#valid_29| (store |v_#valid_30| |v_ULTIMATE.start_main_~#t297~0.base_10| 1)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t297~0.base_10|) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t297~0.base_10| 4) |v_#length_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_14|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_4|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t297~0.offset=|v_ULTIMATE.start_main_~#t297~0.offset_9|, ULTIMATE.start_main_~#t297~0.base=|v_ULTIMATE.start_main_~#t297~0.base_10|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, ULTIMATE.start_main_~#t297~0.offset, ULTIMATE.start_main_~#t297~0.base, #length] because there is no mapped edge [2019-12-27 20:02:52,923 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [990] [990] L840-1-->L842: Formula: (and (= |v_ULTIMATE.start_main_~#t298~0.offset_10| 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t298~0.base_11| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t298~0.base_11|) |v_ULTIMATE.start_main_~#t298~0.offset_10| 2)) |v_#memory_int_17|) (= (store |v_#valid_38| |v_ULTIMATE.start_main_~#t298~0.base_11| 1) |v_#valid_37|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t298~0.base_11|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t298~0.base_11| 4)) (not (= |v_ULTIMATE.start_main_~#t298~0.base_11| 0)) (= 0 (select |v_#valid_38| |v_ULTIMATE.start_main_~#t298~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t298~0.base=|v_ULTIMATE.start_main_~#t298~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t298~0.offset=|v_ULTIMATE.start_main_~#t298~0.offset_10|, #valid=|v_#valid_37|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_5|, #memory_int=|v_#memory_int_17|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t298~0.base, ULTIMATE.start_main_~#t298~0.offset, #valid, ULTIMATE.start_main_#t~nondet56, #memory_int, #length] because there is no mapped edge [2019-12-27 20:02:52,924 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [896] [896] P2ENTRY-->L4-3: Formula: (and (= 0 (mod v_~z$w_buff1_used~0_53 256)) (= 1 v_~z$w_buff0~0_24) (= v_P2Thread1of1ForFork0_~arg.base_5 |v_P2Thread1of1ForFork0_#in~arg.base_5|) (= v_~z$w_buff0_used~0_99 1) (= v_P2Thread1of1ForFork0_~arg.offset_5 |v_P2Thread1of1ForFork0_#in~arg.offset_5|) (= |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_5| v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_7) (= v_~z$w_buff0_used~0_100 v_~z$w_buff1_used~0_53) (= v_~z$w_buff0~0_25 v_~z$w_buff1~0_22) (= 1 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_5|)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_100, ~z$w_buff0~0=v_~z$w_buff0~0_25, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_5, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_5|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_99, ~z$w_buff0~0=v_~z$w_buff0~0_24, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_5, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_53, ~z$w_buff1~0=v_~z$w_buff1~0_22, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_7} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~z$w_buff0_used~0, ~z$w_buff0~0, P2Thread1of1ForFork0_~arg.offset, ~z$w_buff1_used~0, ~z$w_buff1~0, P2Thread1of1ForFork0___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 20:02:52,926 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [954] [954] L800-2-->L800-5: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In354638022 256) 0)) (.cse2 (= |P2Thread1of1ForFork0_#t~ite28_Out354638022| |P2Thread1of1ForFork0_#t~ite29_Out354638022|)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In354638022 256)))) (or (and (or .cse0 .cse1) .cse2 (= |P2Thread1of1ForFork0_#t~ite28_Out354638022| ~z$w_buff1~0_In354638022)) (and (not .cse0) .cse2 (not .cse1) (= |P2Thread1of1ForFork0_#t~ite28_Out354638022| ~z$w_buff0~0_In354638022)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In354638022, ~z$w_buff0_used~0=~z$w_buff0_used~0_In354638022, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In354638022, ~z$w_buff1~0=~z$w_buff1~0_In354638022} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out354638022|, ~z$w_buff0~0=~z$w_buff0~0_In354638022, ~z$w_buff0_used~0=~z$w_buff0_used~0_In354638022, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In354638022, ~z$w_buff1~0=~z$w_buff1~0_In354638022, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out354638022|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 20:02:52,935 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [905] [905] L805-->L806: Formula: (and (= v_~z$r_buff0_thd3~0_57 v_~z$r_buff0_thd3~0_56) (not (= 0 (mod v_~weak$$choice2~0_30 256)))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_57, ~weak$$choice2~0=v_~weak$$choice2~0_30} OutVars{P2Thread1of1ForFork0_#t~ite44=|v_P2Thread1of1ForFork0_#t~ite44_9|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_9|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_56, P2Thread1of1ForFork0_#t~ite42=|v_P2Thread1of1ForFork0_#t~ite42_8|, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite44, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-27 20:02:52,937 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [970] [970] L808-->L808-2: Formula: (let ((.cse0 (= (mod ~z$flush_delayed~0_In-795021893 256) 0))) (or (and .cse0 (= ~z~0_In-795021893 |P2Thread1of1ForFork0_#t~ite48_Out-795021893|)) (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite48_Out-795021893| ~z$mem_tmp~0_In-795021893)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-795021893, ~z$flush_delayed~0=~z$flush_delayed~0_In-795021893, ~z~0=~z~0_In-795021893} OutVars{P2Thread1of1ForFork0_#t~ite48=|P2Thread1of1ForFork0_#t~ite48_Out-795021893|, ~z$mem_tmp~0=~z$mem_tmp~0_In-795021893, ~z$flush_delayed~0=~z$flush_delayed~0_In-795021893, ~z~0=~z~0_In-795021893} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite48] because there is no mapped edge [2019-12-27 20:02:52,939 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [996] [996] P0ENTRY-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= 1 v_~a~0_7) (= v_P0Thread1of1ForFork1_~arg.base_5 |v_P0Thread1of1ForFork1_#in~arg.base_5|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_P0Thread1of1ForFork1_~arg.offset_5 |v_P0Thread1of1ForFork1_#in~arg.offset_5|) (= 1 v_~x~0_8) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|} OutVars{~a~0=v_~a~0_7, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_5, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|, ~x~0=v_~x~0_8, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_5} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~x~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-27 20:02:52,957 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [955] [955] L816-->L816-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1627280074 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1627280074 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite51_Out-1627280074| ~z$w_buff0_used~0_In-1627280074)) (and (not .cse1) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite51_Out-1627280074| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1627280074, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1627280074} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1627280074, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1627280074, P2Thread1of1ForFork0_#t~ite51=|P2Thread1of1ForFork0_#t~ite51_Out-1627280074|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite51] because there is no mapped edge [2019-12-27 20:02:52,959 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [964] [964] L817-->L817-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In1377794662 256))) (.cse3 (= (mod ~z$r_buff1_thd3~0_In1377794662 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In1377794662 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1377794662 256)))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite52_Out1377794662|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= |P2Thread1of1ForFork0_#t~ite52_Out1377794662| ~z$w_buff1_used~0_In1377794662) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1377794662, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1377794662, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1377794662, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1377794662} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1377794662, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1377794662, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1377794662, P2Thread1of1ForFork0_#t~ite52=|P2Thread1of1ForFork0_#t~ite52_Out1377794662|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1377794662} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite52] because there is no mapped edge [2019-12-27 20:02:52,960 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [948] [948] L818-->L819: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-1027199983 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1027199983 256)))) (or (and (not .cse0) (= 0 ~z$r_buff0_thd3~0_Out-1027199983) (not .cse1)) (and (= ~z$r_buff0_thd3~0_In-1027199983 ~z$r_buff0_thd3~0_Out-1027199983) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1027199983, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1027199983} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1027199983, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_Out-1027199983, P2Thread1of1ForFork0_#t~ite53=|P2Thread1of1ForFork0_#t~ite53_Out-1027199983|} AuxVars[] AssignedVars[~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite53] because there is no mapped edge [2019-12-27 20:02:52,960 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [951] [951] L819-->L819-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff1_thd3~0_In-1700243238 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1700243238 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1700243238 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1700243238 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite54_Out-1700243238| 0)) (and (= |P2Thread1of1ForFork0_#t~ite54_Out-1700243238| ~z$r_buff1_thd3~0_In-1700243238) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1700243238, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1700243238, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1700243238, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1700243238} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1700243238, P2Thread1of1ForFork0_#t~ite54=|P2Thread1of1ForFork0_#t~ite54_Out-1700243238|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1700243238, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1700243238, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1700243238} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite54] because there is no mapped edge [2019-12-27 20:02:52,960 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [999] [999] L819-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~z$r_buff1_thd3~0_37 |v_P2Thread1of1ForFork0_#t~ite54_8|) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= (+ v_~__unbuffered_cnt~0_18 1) v_~__unbuffered_cnt~0_17)) InVars {P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_37, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite54, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-27 20:02:52,960 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [972] [972] L771-->L771-2: Formula: (let ((.cse0 (= (mod ~z$flush_delayed~0_In-1600614280 256) 0))) (or (and (= ~z~0_In-1600614280 |P1Thread1of1ForFork2_#t~ite25_Out-1600614280|) .cse0) (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite25_Out-1600614280| ~z$mem_tmp~0_In-1600614280)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-1600614280, ~z$flush_delayed~0=~z$flush_delayed~0_In-1600614280, ~z~0=~z~0_In-1600614280} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In-1600614280, ~z$flush_delayed~0=~z$flush_delayed~0_In-1600614280, ~z~0=~z~0_In-1600614280, P1Thread1of1ForFork2_#t~ite25=|P1Thread1of1ForFork2_#t~ite25_Out-1600614280|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-27 20:02:52,961 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [982] [982] L771-2-->P1EXIT: Formula: (and (= 0 v_~z$flush_delayed~0_13) (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= |v_P1Thread1of1ForFork2_#t~ite25_8| v_~z~0_23) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_8|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ~z$flush_delayed~0=v_~z$flush_delayed~0_13, ~z~0=v_~z~0_23, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P1Thread1of1ForFork2_#res.base, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-27 20:02:52,962 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [891] [891] L846-->L848-2: Formula: (and (not (= (mod v_~main$tmp_guard0~0_4 256) 0)) (or (= 0 (mod v_~z$w_buff0_used~0_94 256)) (= 0 (mod v_~z$r_buff0_thd0~0_14 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_14, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_94, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_14, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_94, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 20:02:52,962 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [958] [958] L848-2-->L848-5: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1607837823 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-1607837823 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite59_Out-1607837823| |ULTIMATE.start_main_#t~ite58_Out-1607837823|))) (or (and (= ~z~0_In-1607837823 |ULTIMATE.start_main_#t~ite58_Out-1607837823|) (or .cse0 .cse1) .cse2) (and (not .cse1) (not .cse0) .cse2 (= ~z$w_buff1~0_In-1607837823 |ULTIMATE.start_main_#t~ite58_Out-1607837823|)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1607837823, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1607837823, ~z$w_buff1~0=~z$w_buff1~0_In-1607837823, ~z~0=~z~0_In-1607837823} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1607837823, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out-1607837823|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1607837823, ~z$w_buff1~0=~z$w_buff1~0_In-1607837823, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out-1607837823|, ~z~0=~z~0_In-1607837823} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-27 20:02:52,963 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [966] [966] L849-->L849-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1537555847 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1537555847 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite60_Out1537555847| 0)) (and (or .cse1 .cse0) (= ~z$w_buff0_used~0_In1537555847 |ULTIMATE.start_main_#t~ite60_Out1537555847|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1537555847, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1537555847} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out1537555847|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1537555847, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1537555847} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-27 20:02:52,965 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [957] [957] L850-->L850-2: Formula: (let ((.cse3 (= (mod ~z$w_buff1_used~0_In-1959640867 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd0~0_In-1959640867 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1959640867 256))) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-1959640867 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite61_Out-1959640867|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$w_buff1_used~0_In-1959640867 |ULTIMATE.start_main_#t~ite61_Out-1959640867|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1959640867, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1959640867, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1959640867, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1959640867} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1959640867, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-1959640867|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1959640867, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1959640867, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1959640867} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-27 20:02:52,966 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [965] [965] L851-->L851-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1393276734 256))) (.cse0 (= (mod ~z$r_buff0_thd0~0_In1393276734 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In1393276734 |ULTIMATE.start_main_#t~ite62_Out1393276734|)) (and (= 0 |ULTIMATE.start_main_#t~ite62_Out1393276734|) (not .cse1) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1393276734, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1393276734} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out1393276734|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1393276734, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1393276734} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-27 20:02:52,967 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [952] [952] L852-->L852-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-688757271 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-688757271 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In-688757271 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-688757271 256)))) (or (and (= |ULTIMATE.start_main_#t~ite63_Out-688757271| ~z$r_buff1_thd0~0_In-688757271) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite63_Out-688757271|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-688757271, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-688757271, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-688757271, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-688757271} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-688757271|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-688757271, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-688757271, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-688757271, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-688757271} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-27 20:02:52,968 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1017] [1017] L852-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~x~0_10 2) (= 0 v_~__unbuffered_p1_EBX~0_8) (= 1 v_~__unbuffered_p1_EAX~0_8) (= v_~main$tmp_guard1~0_13 0) (= |v_ULTIMATE.start_main_#t~ite63_10| v_~z$r_buff1_thd0~0_17) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= v_~__unbuffered_p2_EAX~0_7 1) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|) (= v_~__unbuffered_p2_EBX~0_7 0)) InVars {ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_10|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_7, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_7, ~x~0=v_~x~0_10} OutVars{ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_9|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_7, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_17, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_7, ~x~0=v_~x~0_10, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 20:02:53,087 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 08:02:53 BasicIcfg [2019-12-27 20:02:53,087 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 20:02:53,089 INFO L168 Benchmark]: Toolchain (without parser) took 99677.13 ms. Allocated memory was 137.4 MB in the beginning and 2.8 GB in the end (delta: 2.7 GB). Free memory was 99.2 MB in the beginning and 2.4 GB in the end (delta: -2.3 GB). Peak memory consumption was 422.4 MB. Max. memory is 7.1 GB. [2019-12-27 20:02:53,090 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 137.4 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-27 20:02:53,091 INFO L168 Benchmark]: CACSL2BoogieTranslator took 854.88 ms. Allocated memory was 137.4 MB in the beginning and 201.9 MB in the end (delta: 64.5 MB). Free memory was 98.8 MB in the beginning and 154.8 MB in the end (delta: -56.0 MB). Peak memory consumption was 25.0 MB. Max. memory is 7.1 GB. [2019-12-27 20:02:53,092 INFO L168 Benchmark]: Boogie Procedure Inliner took 77.11 ms. Allocated memory is still 201.9 MB. Free memory was 154.8 MB in the beginning and 151.4 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2019-12-27 20:02:53,092 INFO L168 Benchmark]: Boogie Preprocessor took 40.57 ms. Allocated memory is still 201.9 MB. Free memory was 151.4 MB in the beginning and 148.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 20:02:53,093 INFO L168 Benchmark]: RCFGBuilder took 866.14 ms. Allocated memory is still 201.9 MB. Free memory was 148.7 MB in the beginning and 93.5 MB in the end (delta: 55.2 MB). Peak memory consumption was 55.2 MB. Max. memory is 7.1 GB. [2019-12-27 20:02:53,094 INFO L168 Benchmark]: TraceAbstraction took 97833.21 ms. Allocated memory was 201.9 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 92.8 MB in the beginning and 2.4 GB in the end (delta: -2.3 GB). Peak memory consumption was 351.4 MB. Max. memory is 7.1 GB. [2019-12-27 20:02:53,098 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 137.4 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 854.88 ms. Allocated memory was 137.4 MB in the beginning and 201.9 MB in the end (delta: 64.5 MB). Free memory was 98.8 MB in the beginning and 154.8 MB in the end (delta: -56.0 MB). Peak memory consumption was 25.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 77.11 ms. Allocated memory is still 201.9 MB. Free memory was 154.8 MB in the beginning and 151.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 40.57 ms. Allocated memory is still 201.9 MB. Free memory was 151.4 MB in the beginning and 148.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 866.14 ms. Allocated memory is still 201.9 MB. Free memory was 148.7 MB in the beginning and 93.5 MB in the end (delta: 55.2 MB). Peak memory consumption was 55.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 97833.21 ms. Allocated memory was 201.9 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 92.8 MB in the beginning and 2.4 GB in the end (delta: -2.3 GB). Peak memory consumption was 351.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.2s, 196 ProgramPointsBefore, 106 ProgramPointsAfterwards, 242 TransitionsBefore, 127 TransitionsAfterwards, 24630 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 51 ConcurrentYvCompositions, 29 ChoiceCompositions, 8644 VarBasedMoverChecksPositive, 243 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 123784 CheckedPairsTotal, 125 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L838] FCALL, FORK 0 pthread_create(&t296, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L840] FCALL, FORK 0 pthread_create(&t297, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L842] FCALL, FORK 0 pthread_create(&t298, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L789] 3 z$r_buff1_thd0 = z$r_buff0_thd0 [L790] 3 z$r_buff1_thd1 = z$r_buff0_thd1 [L791] 3 z$r_buff1_thd2 = z$r_buff0_thd2 [L792] 3 z$r_buff1_thd3 = z$r_buff0_thd3 [L793] 3 z$r_buff0_thd3 = (_Bool)1 [L796] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L797] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L798] 3 z$flush_delayed = weak$$choice2 [L799] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L800] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L800] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L801] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L801] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L802] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L802] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L803] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L803] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L804] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L804] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L806] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L806] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L807] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L808] 3 z = z$flush_delayed ? z$mem_tmp : z [L809] 3 z$flush_delayed = (_Bool)0 [L812] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L750] 2 x = 2 [L753] 2 y = 1 [L756] 2 __unbuffered_p1_EAX = y [L759] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L760] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L761] 2 z$flush_delayed = weak$$choice2 [L762] 2 z$mem_tmp = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L763] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L763] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L764] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L765] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L765] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L766] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L767] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L767] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L815] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] EXPR 2 weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L769] EXPR 2 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L769] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L770] 2 __unbuffered_p1_EBX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L815] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L816] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L817] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L844] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L848] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L849] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L850] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L851] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 187 locations, 2 error locations. Result: UNSAFE, OverallTime: 97.4s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 36.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3425 SDtfs, 7630 SDslu, 8296 SDs, 0 SdLazy, 4472 SolverSat, 633 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 191 GetRequests, 36 SyntacticMatches, 9 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1294 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=131510occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 47.8s AutomataMinimizationTime, 15 MinimizatonAttempts, 508120 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 547 NumberOfCodeBlocks, 547 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 469 ConstructedInterpolants, 0 QuantifiedInterpolants, 50743 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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...