/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix033_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 22:21:26,146 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 22:21:26,149 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 22:21:26,165 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 22:21:26,166 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 22:21:26,168 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 22:21:26,170 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 22:21:26,179 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 22:21:26,182 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 22:21:26,183 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 22:21:26,185 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 22:21:26,187 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 22:21:26,187 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 22:21:26,190 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 22:21:26,192 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 22:21:26,194 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 22:21:26,195 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 22:21:26,197 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 22:21:26,199 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 22:21:26,204 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 22:21:26,208 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 22:21:26,212 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 22:21:26,213 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 22:21:26,214 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 22:21:26,216 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 22:21:26,217 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 22:21:26,217 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 22:21:26,218 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 22:21:26,220 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 22:21:26,221 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 22:21:26,221 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 22:21:26,222 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 22:21:26,223 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 22:21:26,224 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 22:21:26,225 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 22:21:26,225 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 22:21:26,226 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 22:21:26,226 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 22:21:26,227 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 22:21:26,227 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 22:21:26,229 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 22:21:26,230 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-26 22:21:26,257 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 22:21:26,257 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 22:21:26,259 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 22:21:26,259 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 22:21:26,259 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 22:21:26,259 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 22:21:26,259 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 22:21:26,260 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 22:21:26,260 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 22:21:26,260 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 22:21:26,260 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 22:21:26,260 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 22:21:26,261 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 22:21:26,261 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 22:21:26,261 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 22:21:26,261 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 22:21:26,261 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 22:21:26,262 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 22:21:26,262 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 22:21:26,262 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 22:21:26,262 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 22:21:26,262 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 22:21:26,263 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 22:21:26,263 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 22:21:26,263 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 22:21:26,263 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 22:21:26,263 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 22:21:26,263 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 22:21:26,264 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 22:21:26,264 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 22:21:26,549 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 22:21:26,571 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 22:21:26,575 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 22:21:26,576 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 22:21:26,576 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 22:21:26,577 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix033_tso.opt.i [2019-12-26 22:21:26,650 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c95a4a2e/c9743692652545c68a1f2732c69ff1c4/FLAG4c2ca7b00 [2019-12-26 22:21:27,172 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 22:21:27,173 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix033_tso.opt.i [2019-12-26 22:21:27,192 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c95a4a2e/c9743692652545c68a1f2732c69ff1c4/FLAG4c2ca7b00 [2019-12-26 22:21:27,504 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c95a4a2e/c9743692652545c68a1f2732c69ff1c4 [2019-12-26 22:21:27,512 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 22:21:27,514 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 22:21:27,515 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 22:21:27,515 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 22:21:27,519 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 22:21:27,520 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 10:21:27" (1/1) ... [2019-12-26 22:21:27,523 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@616706a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:21:27, skipping insertion in model container [2019-12-26 22:21:27,523 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 10:21:27" (1/1) ... [2019-12-26 22:21:27,530 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 22:21:27,594 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 22:21:28,055 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 22:21:28,070 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 22:21:28,183 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 22:21:28,262 INFO L208 MainTranslator]: Completed translation [2019-12-26 22:21:28,262 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:21:28 WrapperNode [2019-12-26 22:21:28,263 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 22:21:28,263 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 22:21:28,263 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 22:21:28,263 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 22:21:28,272 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:21:28" (1/1) ... [2019-12-26 22:21:28,295 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:21:28" (1/1) ... [2019-12-26 22:21:28,325 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 22:21:28,326 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 22:21:28,326 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 22:21:28,326 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 22:21:28,337 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:21:28" (1/1) ... [2019-12-26 22:21:28,337 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:21:28" (1/1) ... [2019-12-26 22:21:28,344 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:21:28" (1/1) ... [2019-12-26 22:21:28,344 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:21:28" (1/1) ... [2019-12-26 22:21:28,357 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:21:28" (1/1) ... [2019-12-26 22:21:28,361 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:21:28" (1/1) ... [2019-12-26 22:21:28,364 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:21:28" (1/1) ... [2019-12-26 22:21:28,370 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 22:21:28,370 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 22:21:28,370 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 22:21:28,370 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 22:21:28,371 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:21:28" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 22:21:28,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 22:21:28,434 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 22:21:28,434 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 22:21:28,434 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 22:21:28,434 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 22:21:28,434 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 22:21:28,435 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 22:21:28,435 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 22:21:28,435 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-26 22:21:28,435 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-26 22:21:28,435 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 22:21:28,435 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 22:21:28,436 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 22:21:28,437 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-26 22:21:29,129 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 22:21:29,130 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 22:21:29,131 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 10:21:29 BoogieIcfgContainer [2019-12-26 22:21:29,132 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 22:21:29,133 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 22:21:29,133 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 22:21:29,136 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 22:21:29,137 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 10:21:27" (1/3) ... [2019-12-26 22:21:29,138 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7622d330 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 10:21:29, skipping insertion in model container [2019-12-26 22:21:29,138 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:21:28" (2/3) ... [2019-12-26 22:21:29,138 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7622d330 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 10:21:29, skipping insertion in model container [2019-12-26 22:21:29,138 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 10:21:29" (3/3) ... [2019-12-26 22:21:29,140 INFO L109 eAbstractionObserver]: Analyzing ICFG mix033_tso.opt.i [2019-12-26 22:21:29,151 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 22:21:29,151 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 22:21:29,160 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 22:21:29,161 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 22:21:29,201 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,202 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,202 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,202 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,203 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,203 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,204 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,204 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,204 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,205 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,205 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,205 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,205 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,205 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,206 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,206 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,207 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,207 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,207 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,207 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,208 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,208 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,208 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,210 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,210 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,211 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,211 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,211 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,213 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,214 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,214 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,214 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,215 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,215 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,215 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,215 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,216 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,217 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,217 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,219 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,219 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,219 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,224 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,224 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,225 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,225 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,225 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,225 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,226 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,226 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,226 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,226 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,228 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,228 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,228 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,228 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,229 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,230 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,230 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,230 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,230 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,230 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,231 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,231 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,231 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,232 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,232 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,232 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,232 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,236 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,236 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,236 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,236 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,237 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,237 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,237 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,237 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,238 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,238 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,238 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,238 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,241 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,242 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,246 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,246 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,246 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,247 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,253 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,254 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,254 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,254 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,255 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,255 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,255 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,256 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,256 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,257 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,258 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,258 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,258 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,258 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,259 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,259 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,259 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,259 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,260 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,260 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,260 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,260 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,261 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,261 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,261 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,261 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,261 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,262 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,268 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,268 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,268 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,284 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,288 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,290 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,290 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,290 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,290 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,290 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,291 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,291 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,291 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,291 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,291 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,293 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,294 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,296 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,296 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,297 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,297 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,297 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,297 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,297 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,299 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,299 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,299 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,299 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,300 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:29,313 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-26 22:21:29,331 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 22:21:29,331 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 22:21:29,331 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 22:21:29,331 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 22:21:29,331 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 22:21:29,331 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 22:21:29,332 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 22:21:29,332 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 22:21:29,348 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 155 places, 180 transitions [2019-12-26 22:21:29,350 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 155 places, 180 transitions [2019-12-26 22:21:29,449 INFO L132 PetriNetUnfolder]: 35/177 cut-off events. [2019-12-26 22:21:29,449 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 22:21:29,467 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 177 events. 35/177 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 340 event pairs. 0/140 useless extension candidates. Maximal degree in co-relation 143. Up to 2 conditions per place. [2019-12-26 22:21:29,484 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 155 places, 180 transitions [2019-12-26 22:21:29,553 INFO L132 PetriNetUnfolder]: 35/177 cut-off events. [2019-12-26 22:21:29,553 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 22:21:29,559 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 177 events. 35/177 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 340 event pairs. 0/140 useless extension candidates. Maximal degree in co-relation 143. Up to 2 conditions per place. [2019-12-26 22:21:29,573 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11400 [2019-12-26 22:21:29,574 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 22:21:34,327 WARN L192 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-12-26 22:21:34,473 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-12-26 22:21:34,641 INFO L206 etLargeBlockEncoding]: Checked pairs total: 39797 [2019-12-26 22:21:34,641 INFO L214 etLargeBlockEncoding]: Total number of compositions: 112 [2019-12-26 22:21:34,644 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 70 places, 78 transitions [2019-12-26 22:21:35,310 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 11878 states. [2019-12-26 22:21:35,312 INFO L276 IsEmpty]: Start isEmpty. Operand 11878 states. [2019-12-26 22:21:35,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-26 22:21:35,317 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:21:35,318 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:21:35,318 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:21:35,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:21:35,323 INFO L82 PathProgramCache]: Analyzing trace with hash -884972408, now seen corresponding path program 1 times [2019-12-26 22:21:35,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:21:35,331 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793915765] [2019-12-26 22:21:35,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:21:35,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:21:35,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:21:35,567 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793915765] [2019-12-26 22:21:35,568 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:21:35,568 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 22:21:35,569 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130137323] [2019-12-26 22:21:35,573 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:21:35,573 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:21:35,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:21:35,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:21:35,586 INFO L87 Difference]: Start difference. First operand 11878 states. Second operand 3 states. [2019-12-26 22:21:35,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:21:35,910 INFO L93 Difference]: Finished difference Result 11574 states and 44420 transitions. [2019-12-26 22:21:35,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:21:35,912 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-26 22:21:35,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:21:36,034 INFO L225 Difference]: With dead ends: 11574 [2019-12-26 22:21:36,035 INFO L226 Difference]: Without dead ends: 10902 [2019-12-26 22:21:36,036 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:21:36,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10902 states. [2019-12-26 22:21:36,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10902 to 10902. [2019-12-26 22:21:36,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10902 states. [2019-12-26 22:21:36,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10902 states to 10902 states and 41772 transitions. [2019-12-26 22:21:36,667 INFO L78 Accepts]: Start accepts. Automaton has 10902 states and 41772 transitions. Word has length 7 [2019-12-26 22:21:36,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:21:36,668 INFO L462 AbstractCegarLoop]: Abstraction has 10902 states and 41772 transitions. [2019-12-26 22:21:36,668 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:21:36,669 INFO L276 IsEmpty]: Start isEmpty. Operand 10902 states and 41772 transitions. [2019-12-26 22:21:36,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-26 22:21:36,673 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:21:36,674 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:21:36,674 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:21:36,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:21:36,674 INFO L82 PathProgramCache]: Analyzing trace with hash -1826046565, now seen corresponding path program 1 times [2019-12-26 22:21:36,675 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:21:36,675 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142022004] [2019-12-26 22:21:36,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:21:36,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:21:36,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:21:36,774 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142022004] [2019-12-26 22:21:36,774 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:21:36,774 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:21:36,775 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616115143] [2019-12-26 22:21:36,777 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:21:36,778 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:21:36,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:21:36,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:21:36,778 INFO L87 Difference]: Start difference. First operand 10902 states and 41772 transitions. Second operand 3 states. [2019-12-26 22:21:36,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:21:36,862 INFO L93 Difference]: Finished difference Result 6581 states and 22068 transitions. [2019-12-26 22:21:36,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:21:36,862 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-26 22:21:36,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:21:36,913 INFO L225 Difference]: With dead ends: 6581 [2019-12-26 22:21:36,913 INFO L226 Difference]: Without dead ends: 6581 [2019-12-26 22:21:36,916 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-26 22:21:36,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6581 states. [2019-12-26 22:21:37,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6581 to 6581. [2019-12-26 22:21:37,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6581 states. [2019-12-26 22:21:37,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6581 states to 6581 states and 22068 transitions. [2019-12-26 22:21:37,146 INFO L78 Accepts]: Start accepts. Automaton has 6581 states and 22068 transitions. Word has length 13 [2019-12-26 22:21:37,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:21:37,147 INFO L462 AbstractCegarLoop]: Abstraction has 6581 states and 22068 transitions. [2019-12-26 22:21:37,147 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:21:37,147 INFO L276 IsEmpty]: Start isEmpty. Operand 6581 states and 22068 transitions. [2019-12-26 22:21:37,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-26 22:21:37,152 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:21:37,152 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:21:37,153 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:21:37,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:21:37,153 INFO L82 PathProgramCache]: Analyzing trace with hash 2047638315, now seen corresponding path program 1 times [2019-12-26 22:21:37,153 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:21:37,154 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595333594] [2019-12-26 22:21:37,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:21:37,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:21:37,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:21:37,272 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595333594] [2019-12-26 22:21:37,272 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:21:37,272 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:21:37,273 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056979382] [2019-12-26 22:21:37,273 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:21:37,274 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:21:37,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:21:37,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:21:37,274 INFO L87 Difference]: Start difference. First operand 6581 states and 22068 transitions. Second operand 4 states. [2019-12-26 22:21:37,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:21:37,325 INFO L93 Difference]: Finished difference Result 1580 states and 4255 transitions. [2019-12-26 22:21:37,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 22:21:37,326 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-26 22:21:37,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:21:37,334 INFO L225 Difference]: With dead ends: 1580 [2019-12-26 22:21:37,334 INFO L226 Difference]: Without dead ends: 1580 [2019-12-26 22:21:37,335 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:21:37,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1580 states. [2019-12-26 22:21:37,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1580 to 1580. [2019-12-26 22:21:37,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2019-12-26 22:21:37,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 4255 transitions. [2019-12-26 22:21:37,896 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 4255 transitions. Word has length 14 [2019-12-26 22:21:37,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:21:37,896 INFO L462 AbstractCegarLoop]: Abstraction has 1580 states and 4255 transitions. [2019-12-26 22:21:37,896 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:21:37,896 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 4255 transitions. [2019-12-26 22:21:37,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-26 22:21:37,897 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:21:37,897 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:21:37,898 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:21:37,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:21:37,898 INFO L82 PathProgramCache]: Analyzing trace with hash 564133875, now seen corresponding path program 1 times [2019-12-26 22:21:37,898 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:21:37,899 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787200793] [2019-12-26 22:21:37,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:21:37,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:21:37,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:21:37,980 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787200793] [2019-12-26 22:21:37,980 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:21:37,980 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:21:37,981 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709551578] [2019-12-26 22:21:37,982 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:21:37,982 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:21:37,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:21:37,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:21:37,985 INFO L87 Difference]: Start difference. First operand 1580 states and 4255 transitions. Second operand 3 states. [2019-12-26 22:21:38,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:21:38,045 INFO L93 Difference]: Finished difference Result 2392 states and 6401 transitions. [2019-12-26 22:21:38,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:21:38,045 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-26 22:21:38,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:21:38,053 INFO L225 Difference]: With dead ends: 2392 [2019-12-26 22:21:38,053 INFO L226 Difference]: Without dead ends: 2392 [2019-12-26 22:21:38,053 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:21:38,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2392 states. [2019-12-26 22:21:38,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2392 to 1844. [2019-12-26 22:21:38,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1844 states. [2019-12-26 22:21:38,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1844 states to 1844 states and 5001 transitions. [2019-12-26 22:21:38,105 INFO L78 Accepts]: Start accepts. Automaton has 1844 states and 5001 transitions. Word has length 16 [2019-12-26 22:21:38,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:21:38,106 INFO L462 AbstractCegarLoop]: Abstraction has 1844 states and 5001 transitions. [2019-12-26 22:21:38,106 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:21:38,106 INFO L276 IsEmpty]: Start isEmpty. Operand 1844 states and 5001 transitions. [2019-12-26 22:21:38,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-26 22:21:38,107 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:21:38,107 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:21:38,108 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:21:38,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:21:38,108 INFO L82 PathProgramCache]: Analyzing trace with hash 659196956, now seen corresponding path program 1 times [2019-12-26 22:21:38,108 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:21:38,108 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284786847] [2019-12-26 22:21:38,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:21:38,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:21:38,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:21:38,173 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284786847] [2019-12-26 22:21:38,173 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:21:38,174 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:21:38,174 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229238409] [2019-12-26 22:21:38,174 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:21:38,174 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:21:38,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:21:38,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:21:38,175 INFO L87 Difference]: Start difference. First operand 1844 states and 5001 transitions. Second operand 5 states. [2019-12-26 22:21:38,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:21:38,485 INFO L93 Difference]: Finished difference Result 2843 states and 7459 transitions. [2019-12-26 22:21:38,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 22:21:38,486 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-26 22:21:38,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:21:38,494 INFO L225 Difference]: With dead ends: 2843 [2019-12-26 22:21:38,494 INFO L226 Difference]: Without dead ends: 2843 [2019-12-26 22:21:38,494 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:21:38,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2843 states. [2019-12-26 22:21:38,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2843 to 2353. [2019-12-26 22:21:38,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2353 states. [2019-12-26 22:21:38,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2353 states to 2353 states and 6293 transitions. [2019-12-26 22:21:38,555 INFO L78 Accepts]: Start accepts. Automaton has 2353 states and 6293 transitions. Word has length 16 [2019-12-26 22:21:38,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:21:38,555 INFO L462 AbstractCegarLoop]: Abstraction has 2353 states and 6293 transitions. [2019-12-26 22:21:38,555 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:21:38,556 INFO L276 IsEmpty]: Start isEmpty. Operand 2353 states and 6293 transitions. [2019-12-26 22:21:38,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-26 22:21:38,561 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:21:38,561 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] [2019-12-26 22:21:38,562 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:21:38,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:21:38,562 INFO L82 PathProgramCache]: Analyzing trace with hash 1695035107, now seen corresponding path program 1 times [2019-12-26 22:21:38,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:21:38,563 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286669055] [2019-12-26 22:21:38,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:21:38,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:21:38,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:21:38,624 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286669055] [2019-12-26 22:21:38,624 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:21:38,624 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 22:21:38,625 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077100557] [2019-12-26 22:21:38,625 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:21:38,625 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:21:38,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:21:38,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:21:38,626 INFO L87 Difference]: Start difference. First operand 2353 states and 6293 transitions. Second operand 5 states. [2019-12-26 22:21:38,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:21:38,659 INFO L93 Difference]: Finished difference Result 1432 states and 3933 transitions. [2019-12-26 22:21:38,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:21:38,660 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-12-26 22:21:38,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:21:38,664 INFO L225 Difference]: With dead ends: 1432 [2019-12-26 22:21:38,664 INFO L226 Difference]: Without dead ends: 1432 [2019-12-26 22:21:38,665 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:21:38,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1432 states. [2019-12-26 22:21:38,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1432 to 1360. [2019-12-26 22:21:38,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1360 states. [2019-12-26 22:21:38,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1360 states to 1360 states and 3745 transitions. [2019-12-26 22:21:38,696 INFO L78 Accepts]: Start accepts. Automaton has 1360 states and 3745 transitions. Word has length 29 [2019-12-26 22:21:38,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:21:38,697 INFO L462 AbstractCegarLoop]: Abstraction has 1360 states and 3745 transitions. [2019-12-26 22:21:38,697 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:21:38,698 INFO L276 IsEmpty]: Start isEmpty. Operand 1360 states and 3745 transitions. [2019-12-26 22:21:38,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-26 22:21:38,704 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:21:38,704 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] [2019-12-26 22:21:38,705 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:21:38,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:21:38,706 INFO L82 PathProgramCache]: Analyzing trace with hash -17339731, now seen corresponding path program 1 times [2019-12-26 22:21:38,707 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:21:38,707 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613095723] [2019-12-26 22:21:38,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:21:38,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:21:38,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:21:38,824 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613095723] [2019-12-26 22:21:38,824 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:21:38,825 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:21:38,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789271572] [2019-12-26 22:21:38,825 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:21:38,825 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:21:38,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:21:38,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:21:38,826 INFO L87 Difference]: Start difference. First operand 1360 states and 3745 transitions. Second operand 4 states. [2019-12-26 22:21:38,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:21:38,847 INFO L93 Difference]: Finished difference Result 1911 states and 4995 transitions. [2019-12-26 22:21:38,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 22:21:38,848 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2019-12-26 22:21:38,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:21:38,851 INFO L225 Difference]: With dead ends: 1911 [2019-12-26 22:21:38,851 INFO L226 Difference]: Without dead ends: 1220 [2019-12-26 22:21:38,851 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:21:38,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1220 states. [2019-12-26 22:21:38,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1220 to 1220. [2019-12-26 22:21:38,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1220 states. [2019-12-26 22:21:38,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1220 states to 1220 states and 3296 transitions. [2019-12-26 22:21:38,879 INFO L78 Accepts]: Start accepts. Automaton has 1220 states and 3296 transitions. Word has length 44 [2019-12-26 22:21:38,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:21:38,879 INFO L462 AbstractCegarLoop]: Abstraction has 1220 states and 3296 transitions. [2019-12-26 22:21:38,879 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:21:38,879 INFO L276 IsEmpty]: Start isEmpty. Operand 1220 states and 3296 transitions. [2019-12-26 22:21:38,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-26 22:21:38,883 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:21:38,883 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] [2019-12-26 22:21:38,884 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:21:38,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:21:38,884 INFO L82 PathProgramCache]: Analyzing trace with hash -1927376753, now seen corresponding path program 2 times [2019-12-26 22:21:38,884 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:21:38,885 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724502091] [2019-12-26 22:21:38,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:21:38,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:21:38,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:21:38,950 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724502091] [2019-12-26 22:21:38,950 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:21:38,950 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:21:38,951 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533615420] [2019-12-26 22:21:38,951 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:21:38,951 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:21:38,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:21:38,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:21:38,952 INFO L87 Difference]: Start difference. First operand 1220 states and 3296 transitions. Second operand 3 states. [2019-12-26 22:21:38,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:21:38,966 INFO L93 Difference]: Finished difference Result 1607 states and 4203 transitions. [2019-12-26 22:21:38,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:21:38,967 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-12-26 22:21:38,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:21:38,968 INFO L225 Difference]: With dead ends: 1607 [2019-12-26 22:21:38,968 INFO L226 Difference]: Without dead ends: 419 [2019-12-26 22:21:38,969 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-26 22:21:38,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2019-12-26 22:21:38,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 419. [2019-12-26 22:21:38,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2019-12-26 22:21:38,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 962 transitions. [2019-12-26 22:21:38,978 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 962 transitions. Word has length 44 [2019-12-26 22:21:38,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:21:38,978 INFO L462 AbstractCegarLoop]: Abstraction has 419 states and 962 transitions. [2019-12-26 22:21:38,978 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:21:38,978 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 962 transitions. [2019-12-26 22:21:38,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-26 22:21:38,980 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:21:38,980 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] [2019-12-26 22:21:38,980 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:21:38,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:21:38,980 INFO L82 PathProgramCache]: Analyzing trace with hash -742917265, now seen corresponding path program 3 times [2019-12-26 22:21:38,981 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:21:38,981 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295092718] [2019-12-26 22:21:38,981 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:21:38,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:21:39,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:21:39,088 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295092718] [2019-12-26 22:21:39,088 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:21:39,088 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 22:21:39,088 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091211155] [2019-12-26 22:21:39,089 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:21:39,089 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:21:39,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:21:39,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:21:39,090 INFO L87 Difference]: Start difference. First operand 419 states and 962 transitions. Second operand 5 states. [2019-12-26 22:21:39,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:21:39,407 INFO L93 Difference]: Finished difference Result 760 states and 1680 transitions. [2019-12-26 22:21:39,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 22:21:39,408 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-12-26 22:21:39,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:21:39,410 INFO L225 Difference]: With dead ends: 760 [2019-12-26 22:21:39,411 INFO L226 Difference]: Without dead ends: 760 [2019-12-26 22:21:39,411 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:21:39,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2019-12-26 22:21:39,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 718. [2019-12-26 22:21:39,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 718 states. [2019-12-26 22:21:39,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 1598 transitions. [2019-12-26 22:21:39,427 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 1598 transitions. Word has length 44 [2019-12-26 22:21:39,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:21:39,427 INFO L462 AbstractCegarLoop]: Abstraction has 718 states and 1598 transitions. [2019-12-26 22:21:39,427 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:21:39,427 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 1598 transitions. [2019-12-26 22:21:39,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-26 22:21:39,429 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:21:39,430 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] [2019-12-26 22:21:39,430 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:21:39,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:21:39,430 INFO L82 PathProgramCache]: Analyzing trace with hash 1532064511, now seen corresponding path program 4 times [2019-12-26 22:21:39,430 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:21:39,431 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751813289] [2019-12-26 22:21:39,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:21:39,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:21:39,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:21:39,521 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751813289] [2019-12-26 22:21:39,522 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:21:39,522 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 22:21:39,522 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283029878] [2019-12-26 22:21:39,522 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 22:21:39,523 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:21:39,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 22:21:39,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:21:39,523 INFO L87 Difference]: Start difference. First operand 718 states and 1598 transitions. Second operand 7 states. [2019-12-26 22:21:39,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:21:39,765 INFO L93 Difference]: Finished difference Result 1812 states and 3795 transitions. [2019-12-26 22:21:39,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-26 22:21:39,766 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 44 [2019-12-26 22:21:39,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:21:39,770 INFO L225 Difference]: With dead ends: 1812 [2019-12-26 22:21:39,770 INFO L226 Difference]: Without dead ends: 1187 [2019-12-26 22:21:39,771 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-12-26 22:21:39,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1187 states. [2019-12-26 22:21:39,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1187 to 750. [2019-12-26 22:21:39,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 750 states. [2019-12-26 22:21:39,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 750 states to 750 states and 1642 transitions. [2019-12-26 22:21:39,789 INFO L78 Accepts]: Start accepts. Automaton has 750 states and 1642 transitions. Word has length 44 [2019-12-26 22:21:39,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:21:39,789 INFO L462 AbstractCegarLoop]: Abstraction has 750 states and 1642 transitions. [2019-12-26 22:21:39,789 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 22:21:39,789 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states and 1642 transitions. [2019-12-26 22:21:39,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-26 22:21:39,791 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:21:39,792 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] [2019-12-26 22:21:39,792 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:21:39,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:21:39,792 INFO L82 PathProgramCache]: Analyzing trace with hash -719181347, now seen corresponding path program 5 times [2019-12-26 22:21:39,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:21:39,793 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710761214] [2019-12-26 22:21:39,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:21:39,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:21:39,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:21:39,985 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710761214] [2019-12-26 22:21:39,986 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:21:39,986 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-26 22:21:39,986 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675190170] [2019-12-26 22:21:39,986 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-26 22:21:39,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:21:39,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-26 22:21:39,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-26 22:21:39,987 INFO L87 Difference]: Start difference. First operand 750 states and 1642 transitions. Second operand 10 states. [2019-12-26 22:21:40,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:21:40,881 INFO L93 Difference]: Finished difference Result 1091 states and 2142 transitions. [2019-12-26 22:21:40,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-26 22:21:40,882 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 44 [2019-12-26 22:21:40,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:21:40,885 INFO L225 Difference]: With dead ends: 1091 [2019-12-26 22:21:40,885 INFO L226 Difference]: Without dead ends: 1091 [2019-12-26 22:21:40,886 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2019-12-26 22:21:40,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1091 states. [2019-12-26 22:21:40,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1091 to 591. [2019-12-26 22:21:40,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2019-12-26 22:21:40,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 1184 transitions. [2019-12-26 22:21:40,900 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 1184 transitions. Word has length 44 [2019-12-26 22:21:40,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:21:40,900 INFO L462 AbstractCegarLoop]: Abstraction has 591 states and 1184 transitions. [2019-12-26 22:21:40,900 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-26 22:21:40,901 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 1184 transitions. [2019-12-26 22:21:40,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-26 22:21:40,902 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:21:40,902 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] [2019-12-26 22:21:40,902 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:21:40,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:21:40,903 INFO L82 PathProgramCache]: Analyzing trace with hash -1358946919, now seen corresponding path program 6 times [2019-12-26 22:21:40,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:21:40,903 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984539339] [2019-12-26 22:21:40,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:21:40,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:21:40,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:21:40,993 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984539339] [2019-12-26 22:21:40,993 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:21:40,993 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 22:21:40,993 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62886558] [2019-12-26 22:21:40,994 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 22:21:40,994 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:21:40,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 22:21:40,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:21:40,995 INFO L87 Difference]: Start difference. First operand 591 states and 1184 transitions. Second operand 7 states. [2019-12-26 22:21:41,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:21:41,662 INFO L93 Difference]: Finished difference Result 945 states and 1841 transitions. [2019-12-26 22:21:41,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 22:21:41,663 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 44 [2019-12-26 22:21:41,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:21:41,666 INFO L225 Difference]: With dead ends: 945 [2019-12-26 22:21:41,666 INFO L226 Difference]: Without dead ends: 945 [2019-12-26 22:21:41,666 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-26 22:21:41,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2019-12-26 22:21:41,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 648. [2019-12-26 22:21:41,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 648 states. [2019-12-26 22:21:41,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 1277 transitions. [2019-12-26 22:21:41,688 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 1277 transitions. Word has length 44 [2019-12-26 22:21:41,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:21:41,688 INFO L462 AbstractCegarLoop]: Abstraction has 648 states and 1277 transitions. [2019-12-26 22:21:41,689 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 22:21:41,689 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 1277 transitions. [2019-12-26 22:21:41,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-26 22:21:41,690 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:21:41,691 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] [2019-12-26 22:21:41,691 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:21:41,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:21:41,691 INFO L82 PathProgramCache]: Analyzing trace with hash -1872340975, now seen corresponding path program 7 times [2019-12-26 22:21:41,691 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:21:41,692 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596134272] [2019-12-26 22:21:41,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:21:41,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:21:41,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:21:41,788 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596134272] [2019-12-26 22:21:41,788 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:21:41,788 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:21:41,789 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336883332] [2019-12-26 22:21:41,789 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:21:41,789 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:21:41,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:21:41,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:21:41,790 INFO L87 Difference]: Start difference. First operand 648 states and 1277 transitions. Second operand 3 states. [2019-12-26 22:21:41,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:21:41,807 INFO L93 Difference]: Finished difference Result 646 states and 1272 transitions. [2019-12-26 22:21:41,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:21:41,808 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-12-26 22:21:41,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:21:41,809 INFO L225 Difference]: With dead ends: 646 [2019-12-26 22:21:41,809 INFO L226 Difference]: Without dead ends: 646 [2019-12-26 22:21:41,810 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:21:41,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2019-12-26 22:21:41,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 540. [2019-12-26 22:21:41,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 540 states. [2019-12-26 22:21:41,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 1078 transitions. [2019-12-26 22:21:41,823 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 1078 transitions. Word has length 44 [2019-12-26 22:21:41,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:21:41,823 INFO L462 AbstractCegarLoop]: Abstraction has 540 states and 1078 transitions. [2019-12-26 22:21:41,823 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:21:41,823 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 1078 transitions. [2019-12-26 22:21:41,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-26 22:21:41,825 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:21:41,825 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:21:41,825 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:21:41,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:21:41,826 INFO L82 PathProgramCache]: Analyzing trace with hash -926318759, now seen corresponding path program 1 times [2019-12-26 22:21:41,826 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:21:41,826 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476906224] [2019-12-26 22:21:41,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:21:41,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 22:21:41,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 22:21:42,009 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 22:21:42,010 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 22:21:42,015 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [732] [732] ULTIMATE.startENTRY-->L830: Formula: (let ((.cse0 (store |v_#valid_67| 0 0))) (and (= 0 v_~weak$$choice0~0_10) (= v_~weak$$choice2~0_155 0) (= 0 v_~z$r_buff1_thd1~0_69) (= 0 v_~__unbuffered_cnt~0_89) (= v_~z$w_buff1~0_237 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t894~0.base_26|) 0) (= 0 v_~z$r_buff1_thd3~0_123) (= 0 v_~__unbuffered_p2_EAX~0_85) (= |v_#NULL.offset_7| 0) (= v_~main$tmp_guard0~0_18 0) (= v_~z~0_127 0) (= v_~z$mem_tmp~0_16 0) (< |v_#StackHeapBarrier_19| |v_ULTIMATE.start_main_~#t894~0.base_26|) (= v_~z$r_buff0_thd2~0_289 0) (= v_~z$read_delayed_var~0.base_4 0) (< 0 |v_#StackHeapBarrier_19|) (= v_~z$w_buff0~0_373 0) (= v_~__unbuffered_p2_EBX~0_85 0) (= v_~z$read_delayed~0_5 0) (= v_~z$read_delayed_var~0.offset_4 0) (= v_~a~0_68 0) (= v_~z$r_buff0_thd1~0_24 0) (= v_~y~0_12 0) (= 0 v_~__unbuffered_p1_EAX~0_29) (= v_~z$r_buff1_thd0~0_127 0) (= v_~z$r_buff0_thd0~0_88 0) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t894~0.base_26| 4)) (= v_~z$w_buff1_used~0_415 0) (= 0 |v_#NULL.base_7|) (= 0 v_~z$flush_delayed~0_41) (= v_~b~0_31 0) (= v_~z$w_buff0_used~0_644 0) (= 0 v_~z$r_buff0_thd3~0_138) (= v_~__unbuffered_p1_EBX~0_47 0) (= v_~z$r_buff1_thd2~0_233 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t894~0.base_26| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t894~0.base_26|) |v_ULTIMATE.start_main_~#t894~0.offset_19| 0)) |v_#memory_int_21|) (= v_~x~0_36 0) (= v_~main$tmp_guard1~0_25 0) (= |v_#valid_65| (store .cse0 |v_ULTIMATE.start_main_~#t894~0.base_26| 1)) (= |v_ULTIMATE.start_main_~#t894~0.offset_19| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_19|, #valid=|v_#valid_67|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_9|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_19|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_233, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_~#t895~0.offset=|v_ULTIMATE.start_main_~#t895~0.offset_16|, ~a~0=v_~a~0_68, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_88, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_29, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_85, ~z$mem_tmp~0=v_~z$mem_tmp~0_16, ULTIMATE.start_main_~#t896~0.offset=|v_ULTIMATE.start_main_~#t896~0.offset_16|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_85, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_31|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_79|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_415, ULTIMATE.start_main_~#t894~0.base=|v_ULTIMATE.start_main_~#t894~0.base_26|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_37|, ~z$flush_delayed~0=v_~z$flush_delayed~0_41, ~weak$$choice0~0=v_~weak$$choice0~0_10, #StackHeapBarrier=|v_#StackHeapBarrier_19|, ULTIMATE.start_main_~#t895~0.base=|v_ULTIMATE.start_main_~#t895~0.base_19|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_53|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_69, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_4, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_138, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_89, ~x~0=v_~x~0_36, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_9|, ~z$read_delayed~0=v_~z$read_delayed~0_5, ~z$w_buff1~0=v_~z$w_buff1~0_237, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_25, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_4, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_127, ULTIMATE.start_main_~#t894~0.offset=|v_ULTIMATE.start_main_~#t894~0.offset_19|, ULTIMATE.start_main_~#t896~0.base=|v_ULTIMATE.start_main_~#t896~0.base_19|, ~y~0=v_~y~0_12, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_289, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_47, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_644, ~z$w_buff0~0=v_~z$w_buff0~0_373, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_123, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_71|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_77|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_18, #NULL.base=|v_#NULL.base_7|, ~b~0=v_~b~0_31, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, #valid=|v_#valid_65|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_127, ~weak$$choice2~0=v_~weak$$choice2~0_155, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_24} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_#t~nondet34, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_~#t895~0.offset, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_~#t896~0.offset, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ~z$w_buff1_used~0, ULTIMATE.start_main_~#t894~0.base, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ~weak$$choice0~0, ULTIMATE.start_main_~#t895~0.base, ULTIMATE.start_main_#t~ite40, ~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~nondet33, ~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_~#t894~0.offset, ULTIMATE.start_main_~#t896~0.base, ~y~0, ~z$r_buff0_thd2~0, ~__unbuffered_p1_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, #NULL.base, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-26 22:21:42,017 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L830-1-->L832: Formula: (and (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t895~0.base_11| 4) |v_#length_15|) (not (= 0 |v_ULTIMATE.start_main_~#t895~0.base_11|)) (= |v_ULTIMATE.start_main_~#t895~0.offset_10| 0) (= 0 (select |v_#valid_40| |v_ULTIMATE.start_main_~#t895~0.base_11|)) (= |v_#valid_39| (store |v_#valid_40| |v_ULTIMATE.start_main_~#t895~0.base_11| 1)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t895~0.base_11|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t895~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t895~0.base_11|) |v_ULTIMATE.start_main_~#t895~0.offset_10| 1)) |v_#memory_int_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t895~0.base=|v_ULTIMATE.start_main_~#t895~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|, ULTIMATE.start_main_~#t895~0.offset=|v_ULTIMATE.start_main_~#t895~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t895~0.base, ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, #length, ULTIMATE.start_main_~#t895~0.offset] because there is no mapped edge [2019-12-26 22:21:42,019 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L832-1-->L834: Formula: (and (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t896~0.base_13|) (= |v_ULTIMATE.start_main_~#t896~0.offset_11| 0) (= |v_#valid_41| (store |v_#valid_42| |v_ULTIMATE.start_main_~#t896~0.base_13| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t896~0.base_13|)) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t896~0.base_13| 4) |v_#length_17|) (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t896~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t896~0.base_13|) |v_ULTIMATE.start_main_~#t896~0.offset_11| 2))) (= 0 (select |v_#valid_42| |v_ULTIMATE.start_main_~#t896~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t896~0.offset=|v_ULTIMATE.start_main_~#t896~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_5|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|, ULTIMATE.start_main_~#t896~0.base=|v_ULTIMATE.start_main_~#t896~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t896~0.offset, ULTIMATE.start_main_#t~nondet33, #valid, #memory_int, #length, ULTIMATE.start_main_~#t896~0.base] because there is no mapped edge [2019-12-26 22:21:42,023 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L4-->L807: Formula: (and (= v_~z$r_buff0_thd3~0_39 1) (= v_~__unbuffered_p2_EBX~0_7 v_~b~0_7) (= v_~z$r_buff0_thd2~0_71 v_~z$r_buff1_thd2~0_39) (= v_~z$r_buff1_thd1~0_6 v_~z$r_buff0_thd1~0_7) (= v_~z$r_buff0_thd0~0_20 v_~z$r_buff1_thd0~0_19) (= v_~z$r_buff0_thd3~0_40 v_~z$r_buff1_thd3~0_26) (not (= 0 v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_24)) (= 1 v_~a~0_6) (= v_~__unbuffered_p2_EAX~0_7 v_~a~0_6)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_20, ~b~0=v_~b~0_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_40, P2Thread1of1ForFork2___VERIFIER_assert_~expression=v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_24, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_7, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_71} OutVars{~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_7, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_26, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_39, P2Thread1of1ForFork2___VERIFIER_assert_~expression=v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_24, ~a~0=v_~a~0_6, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_20, ~b~0=v_~b~0_7, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_19, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_39, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_7, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_7, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_71} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p2_EBX~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0] because there is no mapped edge [2019-12-26 22:21:42,023 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] P0ENTRY-->P0EXIT: Formula: (and (= v_~b~0_22 1) (= v_P0Thread1of1ForFork0_~arg.offset_8 |v_P0Thread1of1ForFork0_#in~arg.offset_8|) (= v_P0Thread1of1ForFork0_~arg.base_8 |v_P0Thread1of1ForFork0_#in~arg.base_8|) (= (+ v_~__unbuffered_cnt~0_59 1) v_~__unbuffered_cnt~0_58) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~x~0_18 1) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_8|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_8|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, ~b~0=v_~b~0_22, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_8|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_8, ~x~0=v_~x~0_18, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_8} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, ~b~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_~arg.base, ~x~0, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-26 22:21:42,030 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L768-->L768-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-36729888 256) 0))) (or (and (let ((.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-36729888 256)))) (or (= 0 (mod ~z$w_buff0_used~0_In-36729888 256)) (and .cse0 (= 0 (mod ~z$r_buff1_thd2~0_In-36729888 256))) (and .cse0 (= 0 (mod ~z$w_buff1_used~0_In-36729888 256))))) .cse1 (= |P1Thread1of1ForFork1_#t~ite14_Out-36729888| ~z$w_buff0_used~0_In-36729888) (= |P1Thread1of1ForFork1_#t~ite14_Out-36729888| |P1Thread1of1ForFork1_#t~ite15_Out-36729888|)) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite15_Out-36729888| ~z$w_buff0_used~0_In-36729888) (= |P1Thread1of1ForFork1_#t~ite14_In-36729888| |P1Thread1of1ForFork1_#t~ite14_Out-36729888|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-36729888, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-36729888, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-36729888, ~weak$$choice2~0=~weak$$choice2~0_In-36729888, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-36729888, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In-36729888|} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-36729888, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-36729888, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-36729888, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out-36729888|, ~weak$$choice2~0=~weak$$choice2~0_In-36729888, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-36729888|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-36729888} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-26 22:21:42,034 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [666] [666] L770-->L771: Formula: (and (= v_~z$r_buff0_thd2~0_113 v_~z$r_buff0_thd2~0_112) (not (= (mod v_~weak$$choice2~0_37 256) 0))) InVars {~weak$$choice2~0=v_~weak$$choice2~0_37, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_113} OutVars{P1Thread1of1ForFork1_#t~ite19=|v_P1Thread1of1ForFork1_#t~ite19_15|, P1Thread1of1ForFork1_#t~ite20=|v_P1Thread1of1ForFork1_#t~ite20_10|, P1Thread1of1ForFork1_#t~ite21=|v_P1Thread1of1ForFork1_#t~ite21_7|, ~weak$$choice2~0=v_~weak$$choice2~0_37, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_112} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite19, P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21, ~z$r_buff0_thd2~0] because there is no mapped edge [2019-12-26 22:21:42,037 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L773-->L781: Formula: (and (not (= (mod v_~z$flush_delayed~0_13 256) 0)) (= 0 v_~z$flush_delayed~0_12) (= v_~z~0_41 v_~z$mem_tmp~0_6) (= (+ v_~__unbuffered_cnt~0_26 1) v_~__unbuffered_cnt~0_25)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_26, ~z$flush_delayed~0=v_~z$flush_delayed~0_13} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_25, ~z$flush_delayed~0=v_~z$flush_delayed~0_12, ~z~0=v_~z~0_41, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_15|} AuxVars[] AssignedVars[~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P1Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-26 22:21:42,040 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L808-->L808-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-119637794 256))) (.cse1 (= (mod ~z$r_buff0_thd3~0_In-119637794 256) 0))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite28_Out-119637794| 0)) (and (= |P2Thread1of1ForFork2_#t~ite28_Out-119637794| ~z$w_buff0_used~0_In-119637794) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-119637794, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-119637794} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-119637794, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-119637794, P2Thread1of1ForFork2_#t~ite28=|P2Thread1of1ForFork2_#t~ite28_Out-119637794|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-26 22:21:42,042 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L809-->L809-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In1608263569 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1608263569 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In1608263569 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd3~0_In1608263569 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite29_Out1608263569| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork2_#t~ite29_Out1608263569| ~z$w_buff1_used~0_In1608263569) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1608263569, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1608263569, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1608263569, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1608263569} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1608263569, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1608263569, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1608263569, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1608263569, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out1608263569|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-26 22:21:42,043 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [673] [673] L810-->L811: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In-836313792 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-836313792 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 ~z$r_buff0_thd3~0_Out-836313792)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd3~0_In-836313792 ~z$r_buff0_thd3~0_Out-836313792)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-836313792, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-836313792} OutVars{P2Thread1of1ForFork2_#t~ite30=|P2Thread1of1ForFork2_#t~ite30_Out-836313792|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-836313792, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_Out-836313792} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite30, ~z$r_buff0_thd3~0] because there is no mapped edge [2019-12-26 22:21:42,044 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L811-->L811-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff0_thd3~0_In-606999044 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-606999044 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-606999044 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-606999044 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork2_#t~ite31_Out-606999044| ~z$r_buff1_thd3~0_In-606999044)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |P2Thread1of1ForFork2_#t~ite31_Out-606999044| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-606999044, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-606999044, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-606999044, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-606999044} OutVars{P2Thread1of1ForFork2_#t~ite31=|P2Thread1of1ForFork2_#t~ite31_Out-606999044|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-606999044, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-606999044, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-606999044, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-606999044} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-26 22:21:42,044 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L811-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork2_#t~ite31_30| v_~z$r_buff1_thd3~0_49) (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_46 1) v_~__unbuffered_cnt~0_45) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0)) InVars {P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_46} OutVars{P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_29|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_49, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_45, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31, ~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-26 22:21:42,044 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [604] [604] L834-1-->L840: Formula: (and (= 3 v_~__unbuffered_cnt~0_13) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet34, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-26 22:21:42,046 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L840-2-->L840-4: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In1673456614 256))) (.cse0 (= (mod ~z$r_buff1_thd0~0_In1673456614 256) 0))) (or (and (or .cse0 .cse1) (= ~z~0_In1673456614 |ULTIMATE.start_main_#t~ite35_Out1673456614|)) (and (not .cse1) (not .cse0) (= ~z$w_buff1~0_In1673456614 |ULTIMATE.start_main_#t~ite35_Out1673456614|)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1673456614, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1673456614, ~z$w_buff1~0=~z$w_buff1~0_In1673456614, ~z~0=~z~0_In1673456614} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1673456614, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out1673456614|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1673456614, ~z$w_buff1~0=~z$w_buff1~0_In1673456614, ~z~0=~z~0_In1673456614} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35] because there is no mapped edge [2019-12-26 22:21:42,046 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [649] [649] L840-4-->L841: Formula: (= v_~z~0_31 |v_ULTIMATE.start_main_#t~ite35_22|) InVars {ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_22|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_21|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_19|, ~z~0=v_~z~0_31} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~z~0] because there is no mapped edge [2019-12-26 22:21:42,046 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [676] [676] L841-->L841-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In1477998285 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1477998285 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite37_Out1477998285| ~z$w_buff0_used~0_In1477998285)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite37_Out1477998285| 0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1477998285, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1477998285} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1477998285, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1477998285, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out1477998285|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-26 22:21:42,048 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L842-->L842-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff1_used~0_In415811518 256))) (.cse2 (= (mod ~z$r_buff1_thd0~0_In415811518 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In415811518 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In415811518 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite38_Out415811518| ~z$w_buff1_used~0_In415811518)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |ULTIMATE.start_main_#t~ite38_Out415811518| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In415811518, ~z$w_buff0_used~0=~z$w_buff0_used~0_In415811518, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In415811518, ~z$w_buff1_used~0=~z$w_buff1_used~0_In415811518} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In415811518, ~z$w_buff0_used~0=~z$w_buff0_used~0_In415811518, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In415811518, ~z$w_buff1_used~0=~z$w_buff1_used~0_In415811518, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out415811518|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-26 22:21:42,050 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L843-->L843-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In-2091534353 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-2091534353 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite39_Out-2091534353|)) (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In-2091534353 |ULTIMATE.start_main_#t~ite39_Out-2091534353|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2091534353, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2091534353} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2091534353, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-2091534353|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2091534353} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-26 22:21:42,052 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L844-->L844-2: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd0~0_In874822819 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In874822819 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In874822819 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In874822819 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd0~0_In874822819 |ULTIMATE.start_main_#t~ite40_Out874822819|)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |ULTIMATE.start_main_#t~ite40_Out874822819|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In874822819, ~z$w_buff0_used~0=~z$w_buff0_used~0_In874822819, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In874822819, ~z$w_buff1_used~0=~z$w_buff1_used~0_In874822819} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In874822819, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out874822819|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In874822819, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In874822819, ~z$w_buff1_used~0=~z$w_buff1_used~0_In874822819} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-26 22:21:42,052 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L844-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 1 v_~__unbuffered_p2_EAX~0_80) (= v_~main$tmp_guard1~0_20 0) (= 1 v_~__unbuffered_p1_EAX~0_24) (= v_~__unbuffered_p2_EBX~0_80 0) (= v_~x~0_31 2) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= v_~z$r_buff1_thd0~0_122 |v_ULTIMATE.start_main_#t~ite40_46|) (= v_~__unbuffered_p1_EBX~0_41 0)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_41, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_80, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_46|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_24, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_80, ~x~0=v_~x~0_31} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_41, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_80, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_45|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_24, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_122, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_80, ~x~0=v_~x~0_31, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-26 22:21:42,201 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 10:21:42 BasicIcfg [2019-12-26 22:21:42,201 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 22:21:42,205 INFO L168 Benchmark]: Toolchain (without parser) took 14690.90 ms. Allocated memory was 146.3 MB in the beginning and 548.4 MB in the end (delta: 402.1 MB). Free memory was 102.9 MB in the beginning and 366.8 MB in the end (delta: -263.9 MB). Peak memory consumption was 138.2 MB. Max. memory is 7.1 GB. [2019-12-26 22:21:42,205 INFO L168 Benchmark]: CDTParser took 1.45 ms. Allocated memory is still 146.3 MB. Free memory is still 122.2 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-26 22:21:42,207 INFO L168 Benchmark]: CACSL2BoogieTranslator took 747.79 ms. Allocated memory was 146.3 MB in the beginning and 205.0 MB in the end (delta: 58.7 MB). Free memory was 102.5 MB in the beginning and 159.2 MB in the end (delta: -56.7 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. [2019-12-26 22:21:42,208 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.39 ms. Allocated memory is still 205.0 MB. Free memory was 159.2 MB in the beginning and 156.3 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-26 22:21:42,211 INFO L168 Benchmark]: Boogie Preprocessor took 43.97 ms. Allocated memory is still 205.0 MB. Free memory was 156.3 MB in the beginning and 154.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-26 22:21:42,217 INFO L168 Benchmark]: RCFGBuilder took 761.69 ms. Allocated memory is still 205.0 MB. Free memory was 154.4 MB in the beginning and 110.3 MB in the end (delta: 44.1 MB). Peak memory consumption was 44.1 MB. Max. memory is 7.1 GB. [2019-12-26 22:21:42,218 INFO L168 Benchmark]: TraceAbstraction took 13068.59 ms. Allocated memory was 205.0 MB in the beginning and 548.4 MB in the end (delta: 343.4 MB). Free memory was 109.3 MB in the beginning and 366.8 MB in the end (delta: -257.5 MB). Peak memory consumption was 85.9 MB. Max. memory is 7.1 GB. [2019-12-26 22:21:42,224 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.45 ms. Allocated memory is still 146.3 MB. Free memory is still 122.2 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 747.79 ms. Allocated memory was 146.3 MB in the beginning and 205.0 MB in the end (delta: 58.7 MB). Free memory was 102.5 MB in the beginning and 159.2 MB in the end (delta: -56.7 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 62.39 ms. Allocated memory is still 205.0 MB. Free memory was 159.2 MB in the beginning and 156.3 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.97 ms. Allocated memory is still 205.0 MB. Free memory was 156.3 MB in the beginning and 154.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 761.69 ms. Allocated memory is still 205.0 MB. Free memory was 154.4 MB in the beginning and 110.3 MB in the end (delta: 44.1 MB). Peak memory consumption was 44.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13068.59 ms. Allocated memory was 205.0 MB in the beginning and 548.4 MB in the end (delta: 343.4 MB). Free memory was 109.3 MB in the beginning and 366.8 MB in the end (delta: -257.5 MB). Peak memory consumption was 85.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.2s, 155 ProgramPointsBefore, 70 ProgramPointsAfterwards, 180 TransitionsBefore, 78 TransitionsAfterwards, 11400 CoEnabledTransitionPairs, 7 FixpointIterations, 36 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 21 ChoiceCompositions, 4873 VarBasedMoverChecksPositive, 192 VarBasedMoverChecksNegative, 55 SemBasedMoverChecksPositive, 173 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.3s, 0 MoverChecksTotal, 39797 CheckedPairsTotal, 112 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L830] FCALL, FORK 0 pthread_create(&t894, ((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}, b=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] [L832] FCALL, FORK 0 pthread_create(&t895, ((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}, b=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] [L834] FCALL, FORK 0 pthread_create(&t896, ((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}, b=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] [L786] 3 z$w_buff1 = z$w_buff0 [L787] 3 z$w_buff0 = 1 [L788] 3 z$w_buff1_used = z$w_buff0_used [L789] 3 z$w_buff0_used = (_Bool)1 [L752] 2 x = 2 [L755] 2 y = 1 [L758] 2 __unbuffered_p1_EAX = y [L761] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 2 z$flush_delayed = weak$$choice2 [L764] 2 z$mem_tmp = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L765] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L765] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L766] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L767] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L767] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L768] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L769] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L769] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L771] EXPR 2 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L772] 2 __unbuffered_p1_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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L807] 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=2, __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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L807] 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) [L808] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L809] 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 [L840] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, __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}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=1, 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] [L841] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L842] 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 [L843] 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, 146 locations, 2 error locations. Result: UNSAFE, OverallTime: 12.6s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1393 SDtfs, 1525 SDslu, 2783 SDs, 0 SdLazy, 1715 SolverSat, 96 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 86 GetRequests, 20 SyntacticMatches, 6 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11878occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.6s AutomataMinimizationTime, 13 MinimizatonAttempts, 2492 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 448 NumberOfCodeBlocks, 448 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 390 ConstructedInterpolants, 0 QuantifiedInterpolants, 49215 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...