/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix023_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 20:43:17,099 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 20:43:17,102 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 20:43:17,120 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 20:43:17,121 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 20:43:17,123 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 20:43:17,125 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 20:43:17,134 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 20:43:17,138 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 20:43:17,141 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 20:43:17,143 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 20:43:17,145 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 20:43:17,146 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 20:43:17,148 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 20:43:17,150 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 20:43:17,152 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 20:43:17,154 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 20:43:17,154 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 20:43:17,156 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 20:43:17,161 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 20:43:17,165 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 20:43:17,169 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 20:43:17,170 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 20:43:17,171 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 20:43:17,173 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 20:43:17,173 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 20:43:17,174 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 20:43:17,175 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 20:43:17,177 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 20:43:17,178 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 20:43:17,178 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 20:43:17,180 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 20:43:17,181 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 20:43:17,182 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 20:43:17,183 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 20:43:17,183 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 20:43:17,184 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 20:43:17,184 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 20:43:17,184 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 20:43:17,185 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 20:43:17,187 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 20:43:17,187 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-18 20:43:17,223 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 20:43:17,224 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 20:43:17,226 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 20:43:17,226 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 20:43:17,226 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 20:43:17,226 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 20:43:17,227 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 20:43:17,227 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 20:43:17,227 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 20:43:17,227 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 20:43:17,227 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 20:43:17,227 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 20:43:17,228 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 20:43:17,228 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 20:43:17,228 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 20:43:17,228 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 20:43:17,228 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 20:43:17,229 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 20:43:17,229 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 20:43:17,229 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 20:43:17,229 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 20:43:17,229 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 20:43:17,230 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 20:43:17,230 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 20:43:17,230 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 20:43:17,230 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 20:43:17,230 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 20:43:17,230 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 20:43:17,231 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 20:43:17,231 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 20:43:17,497 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 20:43:17,514 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 20:43:17,517 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 20:43:17,519 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 20:43:17,519 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 20:43:17,520 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix023_power.opt.i [2019-12-18 20:43:17,588 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37810cc07/dfe8795588a04936a9857c6f2b2cf5d2/FLAG33cdafb8a [2019-12-18 20:43:18,129 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 20:43:18,130 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix023_power.opt.i [2019-12-18 20:43:18,157 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37810cc07/dfe8795588a04936a9857c6f2b2cf5d2/FLAG33cdafb8a [2019-12-18 20:43:18,417 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37810cc07/dfe8795588a04936a9857c6f2b2cf5d2 [2019-12-18 20:43:18,427 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 20:43:18,429 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 20:43:18,430 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 20:43:18,430 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 20:43:18,434 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 20:43:18,435 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 08:43:18" (1/1) ... [2019-12-18 20:43:18,437 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67bfb380 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:43:18, skipping insertion in model container [2019-12-18 20:43:18,438 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 08:43:18" (1/1) ... [2019-12-18 20:43:18,445 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 20:43:18,486 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 20:43:19,078 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 20:43:19,089 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 20:43:19,146 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 20:43:19,233 INFO L208 MainTranslator]: Completed translation [2019-12-18 20:43:19,234 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:43:19 WrapperNode [2019-12-18 20:43:19,234 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 20:43:19,235 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 20:43:19,235 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 20:43:19,235 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 20:43:19,243 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:43:19" (1/1) ... [2019-12-18 20:43:19,267 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:43:19" (1/1) ... [2019-12-18 20:43:19,301 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 20:43:19,301 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 20:43:19,301 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 20:43:19,301 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 20:43:19,311 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:43:19" (1/1) ... [2019-12-18 20:43:19,311 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:43:19" (1/1) ... [2019-12-18 20:43:19,316 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:43:19" (1/1) ... [2019-12-18 20:43:19,316 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:43:19" (1/1) ... [2019-12-18 20:43:19,328 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:43:19" (1/1) ... [2019-12-18 20:43:19,332 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:43:19" (1/1) ... [2019-12-18 20:43:19,336 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:43:19" (1/1) ... [2019-12-18 20:43:19,341 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 20:43:19,342 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 20:43:19,342 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 20:43:19,342 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 20:43:19,343 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:43:19" (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-18 20:43:19,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 20:43:19,411 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 20:43:19,411 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 20:43:19,411 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 20:43:19,412 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 20:43:19,412 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 20:43:19,412 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 20:43:19,412 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 20:43:19,412 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 20:43:19,413 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 20:43:19,413 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-18 20:43:19,413 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-18 20:43:19,413 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 20:43:19,413 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 20:43:19,414 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 20:43:19,415 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 20:43:20,148 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 20:43:20,148 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 20:43:20,150 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 08:43:20 BoogieIcfgContainer [2019-12-18 20:43:20,150 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 20:43:20,152 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 20:43:20,152 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 20:43:20,158 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 20:43:20,159 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 08:43:18" (1/3) ... [2019-12-18 20:43:20,159 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bfd13a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 08:43:20, skipping insertion in model container [2019-12-18 20:43:20,160 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:43:19" (2/3) ... [2019-12-18 20:43:20,160 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bfd13a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 08:43:20, skipping insertion in model container [2019-12-18 20:43:20,160 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 08:43:20" (3/3) ... [2019-12-18 20:43:20,162 INFO L109 eAbstractionObserver]: Analyzing ICFG mix023_power.opt.i [2019-12-18 20:43:20,170 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 20:43:20,170 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 20:43:20,178 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 20:43:20,178 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 20:43:20,218 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,219 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,219 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,219 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,220 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,220 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,222 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,222 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,222 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,222 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,223 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,223 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,223 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,223 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,224 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,224 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,224 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,225 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,225 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,225 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,226 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,226 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,226 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,227 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,227 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,227 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,247 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,247 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,247 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,247 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,248 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,248 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,248 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,250 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,250 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,250 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,250 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,250 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,251 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,251 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,251 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,251 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,251 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,251 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,252 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,252 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,252 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,252 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,253 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,253 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,253 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,253 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,256 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,256 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,256 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,256 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,258 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,258 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,258 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,258 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,260 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,260 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,260 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,260 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,260 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,261 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,261 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,262 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,262 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,262 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,262 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,262 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,263 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,263 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,263 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,264 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,264 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,264 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,264 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,264 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,265 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,265 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,265 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,265 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,265 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,265 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,266 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,266 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,266 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,266 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,267 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,267 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,267 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,267 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,267 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,268 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,268 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,268 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,268 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,269 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,269 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,269 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,269 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,269 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,270 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,270 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,270 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,270 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,271 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,271 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,271 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,271 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,271 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,272 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,272 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,272 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,272 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,273 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,273 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,273 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,273 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,273 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,274 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,274 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,274 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,274 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,275 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,275 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,275 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,278 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,279 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,279 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,279 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,279 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,279 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,280 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,280 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,280 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,280 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,283 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,284 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,284 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,284 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,286 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,286 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,287 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,287 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,287 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,287 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,287 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,288 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,288 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,288 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,288 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,288 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,290 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,290 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,290 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,290 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,290 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,291 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,291 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,291 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,291 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,293 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,293 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,294 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,294 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,294 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,295 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,295 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,295 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,295 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,295 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,296 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,296 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:20,311 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-18 20:43:20,331 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 20:43:20,331 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 20:43:20,331 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 20:43:20,331 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 20:43:20,331 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 20:43:20,332 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 20:43:20,332 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 20:43:20,332 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 20:43:20,349 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 181 places, 209 transitions [2019-12-18 20:43:20,351 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 181 places, 209 transitions [2019-12-18 20:43:20,440 INFO L126 PetriNetUnfolder]: 41/205 cut-off events. [2019-12-18 20:43:20,440 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 20:43:20,460 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 205 events. 41/205 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 442 event pairs. 12/174 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-18 20:43:20,487 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 181 places, 209 transitions [2019-12-18 20:43:20,546 INFO L126 PetriNetUnfolder]: 41/205 cut-off events. [2019-12-18 20:43:20,546 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 20:43:20,559 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 205 events. 41/205 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 442 event pairs. 12/174 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-18 20:43:20,579 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 18126 [2019-12-18 20:43:20,581 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 20:43:24,595 WARN L192 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-12-18 20:43:24,756 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-12-18 20:43:24,776 INFO L206 etLargeBlockEncoding]: Checked pairs total: 68763 [2019-12-18 20:43:24,776 INFO L214 etLargeBlockEncoding]: Total number of compositions: 121 [2019-12-18 20:43:24,780 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 88 places, 94 transitions [2019-12-18 20:43:59,072 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 166438 states. [2019-12-18 20:43:59,074 INFO L276 IsEmpty]: Start isEmpty. Operand 166438 states. [2019-12-18 20:43:59,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-18 20:43:59,082 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:43:59,083 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:43:59,083 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:43:59,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:43:59,089 INFO L82 PathProgramCache]: Analyzing trace with hash 404581936, now seen corresponding path program 1 times [2019-12-18 20:43:59,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:43:59,096 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934333205] [2019-12-18 20:43:59,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:43:59,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:43:59,322 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-18 20:43:59,323 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934333205] [2019-12-18 20:43:59,323 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:43:59,324 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 20:43:59,324 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475206980] [2019-12-18 20:43:59,329 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:43:59,329 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:43:59,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:43:59,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:43:59,347 INFO L87 Difference]: Start difference. First operand 166438 states. Second operand 3 states. [2019-12-18 20:44:04,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:44:04,340 INFO L93 Difference]: Finished difference Result 163218 states and 783804 transitions. [2019-12-18 20:44:04,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:44:04,342 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-18 20:44:04,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:44:05,364 INFO L225 Difference]: With dead ends: 163218 [2019-12-18 20:44:05,364 INFO L226 Difference]: Without dead ends: 153026 [2019-12-18 20:44:05,366 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-18 20:44:13,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153026 states. [2019-12-18 20:44:17,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153026 to 153026. [2019-12-18 20:44:17,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153026 states. [2019-12-18 20:44:23,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153026 states to 153026 states and 733880 transitions. [2019-12-18 20:44:23,087 INFO L78 Accepts]: Start accepts. Automaton has 153026 states and 733880 transitions. Word has length 7 [2019-12-18 20:44:23,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:44:23,088 INFO L462 AbstractCegarLoop]: Abstraction has 153026 states and 733880 transitions. [2019-12-18 20:44:23,089 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:44:23,089 INFO L276 IsEmpty]: Start isEmpty. Operand 153026 states and 733880 transitions. [2019-12-18 20:44:23,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 20:44:23,100 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:44:23,100 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:44:23,100 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:44:23,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:44:23,101 INFO L82 PathProgramCache]: Analyzing trace with hash -1448601888, now seen corresponding path program 1 times [2019-12-18 20:44:23,101 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:44:23,101 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558162810] [2019-12-18 20:44:23,102 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:44:23,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:44:23,220 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-18 20:44:23,221 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558162810] [2019-12-18 20:44:23,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:44:23,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:44:23,222 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200579111] [2019-12-18 20:44:23,224 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:44:23,225 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:44:23,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:44:23,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:44:23,226 INFO L87 Difference]: Start difference. First operand 153026 states and 733880 transitions. Second operand 3 states. [2019-12-18 20:44:29,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:44:29,080 INFO L93 Difference]: Finished difference Result 96841 states and 419275 transitions. [2019-12-18 20:44:29,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:44:29,080 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-18 20:44:29,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:44:29,447 INFO L225 Difference]: With dead ends: 96841 [2019-12-18 20:44:29,447 INFO L226 Difference]: Without dead ends: 96841 [2019-12-18 20:44:29,448 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-18 20:44:31,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96841 states. [2019-12-18 20:44:33,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96841 to 96841. [2019-12-18 20:44:33,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96841 states. [2019-12-18 20:44:33,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96841 states to 96841 states and 419275 transitions. [2019-12-18 20:44:33,794 INFO L78 Accepts]: Start accepts. Automaton has 96841 states and 419275 transitions. Word has length 15 [2019-12-18 20:44:33,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:44:33,794 INFO L462 AbstractCegarLoop]: Abstraction has 96841 states and 419275 transitions. [2019-12-18 20:44:33,794 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:44:33,794 INFO L276 IsEmpty]: Start isEmpty. Operand 96841 states and 419275 transitions. [2019-12-18 20:44:33,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 20:44:33,797 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:44:33,797 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:44:33,797 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:44:33,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:44:33,798 INFO L82 PathProgramCache]: Analyzing trace with hash 576667599, now seen corresponding path program 1 times [2019-12-18 20:44:33,798 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:44:33,798 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017784178] [2019-12-18 20:44:33,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:44:33,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:44:33,885 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-18 20:44:33,885 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017784178] [2019-12-18 20:44:33,886 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:44:33,886 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:44:33,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463216068] [2019-12-18 20:44:33,886 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:44:33,887 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:44:33,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:44:33,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:44:33,887 INFO L87 Difference]: Start difference. First operand 96841 states and 419275 transitions. Second operand 4 states. [2019-12-18 20:44:35,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:44:35,827 INFO L93 Difference]: Finished difference Result 146922 states and 610245 transitions. [2019-12-18 20:44:35,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 20:44:35,827 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-18 20:44:35,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:44:36,490 INFO L225 Difference]: With dead ends: 146922 [2019-12-18 20:44:36,490 INFO L226 Difference]: Without dead ends: 146817 [2019-12-18 20:44:36,491 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-18 20:44:40,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146817 states. [2019-12-18 20:44:44,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146817 to 132421. [2019-12-18 20:44:44,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132421 states. [2019-12-18 20:44:44,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132421 states to 132421 states and 557528 transitions. [2019-12-18 20:44:44,774 INFO L78 Accepts]: Start accepts. Automaton has 132421 states and 557528 transitions. Word has length 15 [2019-12-18 20:44:44,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:44:44,774 INFO L462 AbstractCegarLoop]: Abstraction has 132421 states and 557528 transitions. [2019-12-18 20:44:44,774 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:44:44,774 INFO L276 IsEmpty]: Start isEmpty. Operand 132421 states and 557528 transitions. [2019-12-18 20:44:44,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 20:44:44,778 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:44:44,778 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:44:44,778 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:44:44,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:44:44,780 INFO L82 PathProgramCache]: Analyzing trace with hash -1043569302, now seen corresponding path program 1 times [2019-12-18 20:44:44,780 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:44:44,781 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25462227] [2019-12-18 20:44:44,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:44:44,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:44:44,847 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-18 20:44:44,848 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25462227] [2019-12-18 20:44:44,848 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:44:44,848 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:44:44,848 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257117522] [2019-12-18 20:44:44,849 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:44:44,849 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:44:44,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:44:44,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:44:44,850 INFO L87 Difference]: Start difference. First operand 132421 states and 557528 transitions. Second operand 4 states. [2019-12-18 20:44:45,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:44:45,053 INFO L93 Difference]: Finished difference Result 36987 states and 132370 transitions. [2019-12-18 20:44:45,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 20:44:45,053 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 20:44:45,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:44:45,153 INFO L225 Difference]: With dead ends: 36987 [2019-12-18 20:44:45,153 INFO L226 Difference]: Without dead ends: 36987 [2019-12-18 20:44:45,154 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-18 20:44:45,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36987 states. [2019-12-18 20:44:50,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36987 to 36987. [2019-12-18 20:44:50,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36987 states. [2019-12-18 20:44:50,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36987 states to 36987 states and 132370 transitions. [2019-12-18 20:44:50,460 INFO L78 Accepts]: Start accepts. Automaton has 36987 states and 132370 transitions. Word has length 16 [2019-12-18 20:44:50,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:44:50,461 INFO L462 AbstractCegarLoop]: Abstraction has 36987 states and 132370 transitions. [2019-12-18 20:44:50,461 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:44:50,461 INFO L276 IsEmpty]: Start isEmpty. Operand 36987 states and 132370 transitions. [2019-12-18 20:44:50,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 20:44:50,464 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:44:50,464 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:44:50,464 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:44:50,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:44:50,465 INFO L82 PathProgramCache]: Analyzing trace with hash 372623930, now seen corresponding path program 1 times [2019-12-18 20:44:50,465 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:44:50,465 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529806311] [2019-12-18 20:44:50,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:44:50,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:44:50,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:44:50,544 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529806311] [2019-12-18 20:44:50,544 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:44:50,545 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:44:50,545 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270783853] [2019-12-18 20:44:50,545 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:44:50,545 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:44:50,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:44:50,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:44:50,547 INFO L87 Difference]: Start difference. First operand 36987 states and 132370 transitions. Second operand 5 states. [2019-12-18 20:44:51,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:44:51,055 INFO L93 Difference]: Finished difference Result 54351 states and 190541 transitions. [2019-12-18 20:44:51,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 20:44:51,056 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-18 20:44:51,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:44:51,155 INFO L225 Difference]: With dead ends: 54351 [2019-12-18 20:44:51,156 INFO L226 Difference]: Without dead ends: 54333 [2019-12-18 20:44:51,156 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-18 20:44:51,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54333 states. [2019-12-18 20:44:52,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54333 to 42478. [2019-12-18 20:44:52,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42478 states. [2019-12-18 20:44:52,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42478 states to 42478 states and 151468 transitions. [2019-12-18 20:44:52,279 INFO L78 Accepts]: Start accepts. Automaton has 42478 states and 151468 transitions. Word has length 16 [2019-12-18 20:44:52,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:44:52,279 INFO L462 AbstractCegarLoop]: Abstraction has 42478 states and 151468 transitions. [2019-12-18 20:44:52,279 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:44:52,280 INFO L276 IsEmpty]: Start isEmpty. Operand 42478 states and 151468 transitions. [2019-12-18 20:44:52,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-18 20:44:52,295 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:44:52,295 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:44:52,295 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:44:52,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:44:52,296 INFO L82 PathProgramCache]: Analyzing trace with hash -351800871, now seen corresponding path program 1 times [2019-12-18 20:44:52,296 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:44:52,296 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918270946] [2019-12-18 20:44:52,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:44:52,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:44:52,401 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-18 20:44:52,401 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918270946] [2019-12-18 20:44:52,401 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:44:52,401 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 20:44:52,402 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222353397] [2019-12-18 20:44:52,402 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 20:44:52,402 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:44:52,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 20:44:52,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 20:44:52,403 INFO L87 Difference]: Start difference. First operand 42478 states and 151468 transitions. Second operand 6 states. [2019-12-18 20:44:53,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:44:53,342 INFO L93 Difference]: Finished difference Result 63900 states and 221523 transitions. [2019-12-18 20:44:53,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 20:44:53,343 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-12-18 20:44:53,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:44:53,466 INFO L225 Difference]: With dead ends: 63900 [2019-12-18 20:44:53,466 INFO L226 Difference]: Without dead ends: 63870 [2019-12-18 20:44:53,467 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-18 20:44:53,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63870 states. [2019-12-18 20:44:54,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63870 to 42427. [2019-12-18 20:44:54,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42427 states. [2019-12-18 20:44:54,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42427 states to 42427 states and 150408 transitions. [2019-12-18 20:44:54,845 INFO L78 Accepts]: Start accepts. Automaton has 42427 states and 150408 transitions. Word has length 24 [2019-12-18 20:44:54,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:44:54,846 INFO L462 AbstractCegarLoop]: Abstraction has 42427 states and 150408 transitions. [2019-12-18 20:44:54,846 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 20:44:54,846 INFO L276 IsEmpty]: Start isEmpty. Operand 42427 states and 150408 transitions. [2019-12-18 20:44:54,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 20:44:54,868 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:44:54,868 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] [2019-12-18 20:44:54,868 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:44:54,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:44:54,868 INFO L82 PathProgramCache]: Analyzing trace with hash -478348385, now seen corresponding path program 1 times [2019-12-18 20:44:54,868 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:44:54,869 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304638313] [2019-12-18 20:44:54,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:44:54,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:44:54,944 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-18 20:44:54,944 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304638313] [2019-12-18 20:44:54,944 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:44:54,944 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 20:44:54,945 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198700249] [2019-12-18 20:44:54,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:44:54,945 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:44:54,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:44:54,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:44:54,946 INFO L87 Difference]: Start difference. First operand 42427 states and 150408 transitions. Second operand 5 states. [2019-12-18 20:44:55,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:44:55,064 INFO L93 Difference]: Finished difference Result 22700 states and 81312 transitions. [2019-12-18 20:44:55,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 20:44:55,066 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-18 20:44:55,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:44:55,104 INFO L225 Difference]: With dead ends: 22700 [2019-12-18 20:44:55,105 INFO L226 Difference]: Without dead ends: 22700 [2019-12-18 20:44:55,105 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-18 20:44:55,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22700 states. [2019-12-18 20:44:55,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22700 to 22364. [2019-12-18 20:44:55,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22364 states. [2019-12-18 20:44:55,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22364 states to 22364 states and 80168 transitions. [2019-12-18 20:44:55,476 INFO L78 Accepts]: Start accepts. Automaton has 22364 states and 80168 transitions. Word has length 28 [2019-12-18 20:44:55,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:44:55,476 INFO L462 AbstractCegarLoop]: Abstraction has 22364 states and 80168 transitions. [2019-12-18 20:44:55,476 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:44:55,476 INFO L276 IsEmpty]: Start isEmpty. Operand 22364 states and 80168 transitions. [2019-12-18 20:44:55,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-18 20:44:55,513 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:44:55,513 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] [2019-12-18 20:44:55,514 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:44:55,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:44:55,514 INFO L82 PathProgramCache]: Analyzing trace with hash -89817491, now seen corresponding path program 1 times [2019-12-18 20:44:55,514 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:44:55,514 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083776475] [2019-12-18 20:44:55,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:44:55,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:44:55,593 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-18 20:44:55,594 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083776475] [2019-12-18 20:44:55,594 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:44:55,594 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:44:55,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749354212] [2019-12-18 20:44:55,595 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:44:55,595 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:44:55,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:44:55,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:44:55,596 INFO L87 Difference]: Start difference. First operand 22364 states and 80168 transitions. Second operand 3 states. [2019-12-18 20:44:55,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:44:55,706 INFO L93 Difference]: Finished difference Result 33735 states and 115366 transitions. [2019-12-18 20:44:55,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:44:55,706 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2019-12-18 20:44:55,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:44:55,748 INFO L225 Difference]: With dead ends: 33735 [2019-12-18 20:44:55,748 INFO L226 Difference]: Without dead ends: 22811 [2019-12-18 20:44:55,749 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-18 20:44:56,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22811 states. [2019-12-18 20:44:56,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22811 to 22329. [2019-12-18 20:44:56,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22329 states. [2019-12-18 20:44:56,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22329 states to 22329 states and 69880 transitions. [2019-12-18 20:44:56,280 INFO L78 Accepts]: Start accepts. Automaton has 22329 states and 69880 transitions. Word has length 42 [2019-12-18 20:44:56,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:44:56,280 INFO L462 AbstractCegarLoop]: Abstraction has 22329 states and 69880 transitions. [2019-12-18 20:44:56,280 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:44:56,281 INFO L276 IsEmpty]: Start isEmpty. Operand 22329 states and 69880 transitions. [2019-12-18 20:44:56,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-18 20:44:56,311 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:44:56,312 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] [2019-12-18 20:44:56,312 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:44:56,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:44:56,312 INFO L82 PathProgramCache]: Analyzing trace with hash -1643728433, now seen corresponding path program 1 times [2019-12-18 20:44:56,313 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:44:56,313 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482015471] [2019-12-18 20:44:56,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:44:56,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:44:56,438 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-18 20:44:56,438 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482015471] [2019-12-18 20:44:56,438 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:44:56,439 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 20:44:56,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062865671] [2019-12-18 20:44:56,441 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 20:44:56,441 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:44:56,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 20:44:56,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-18 20:44:56,442 INFO L87 Difference]: Start difference. First operand 22329 states and 69880 transitions. Second operand 6 states. [2019-12-18 20:44:56,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:44:56,577 INFO L93 Difference]: Finished difference Result 21070 states and 66665 transitions. [2019-12-18 20:44:56,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 20:44:56,578 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2019-12-18 20:44:56,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:44:56,598 INFO L225 Difference]: With dead ends: 21070 [2019-12-18 20:44:56,598 INFO L226 Difference]: Without dead ends: 10890 [2019-12-18 20:44:56,599 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-18 20:44:56,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10890 states. [2019-12-18 20:44:56,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10890 to 10414. [2019-12-18 20:44:56,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10414 states. [2019-12-18 20:44:56,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10414 states to 10414 states and 32808 transitions. [2019-12-18 20:44:56,770 INFO L78 Accepts]: Start accepts. Automaton has 10414 states and 32808 transitions. Word has length 43 [2019-12-18 20:44:56,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:44:56,770 INFO L462 AbstractCegarLoop]: Abstraction has 10414 states and 32808 transitions. [2019-12-18 20:44:56,770 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 20:44:56,770 INFO L276 IsEmpty]: Start isEmpty. Operand 10414 states and 32808 transitions. [2019-12-18 20:44:56,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 20:44:56,786 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:44:56,786 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:44:56,787 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:44:56,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:44:56,787 INFO L82 PathProgramCache]: Analyzing trace with hash -400777059, now seen corresponding path program 1 times [2019-12-18 20:44:56,787 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:44:56,787 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684917133] [2019-12-18 20:44:56,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:44:56,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:44:56,871 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-18 20:44:56,872 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684917133] [2019-12-18 20:44:56,872 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:44:56,872 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:44:56,872 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057421149] [2019-12-18 20:44:56,874 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:44:56,874 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:44:56,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:44:56,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:44:56,875 INFO L87 Difference]: Start difference. First operand 10414 states and 32808 transitions. Second operand 4 states. [2019-12-18 20:44:56,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:44:56,979 INFO L93 Difference]: Finished difference Result 18914 states and 59584 transitions. [2019-12-18 20:44:56,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 20:44:56,980 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-12-18 20:44:56,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:44:56,999 INFO L225 Difference]: With dead ends: 18914 [2019-12-18 20:44:56,999 INFO L226 Difference]: Without dead ends: 8811 [2019-12-18 20:44:57,000 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-18 20:44:57,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8811 states. [2019-12-18 20:44:57,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8811 to 8811. [2019-12-18 20:44:57,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8811 states. [2019-12-18 20:44:57,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8811 states to 8811 states and 27635 transitions. [2019-12-18 20:44:57,207 INFO L78 Accepts]: Start accepts. Automaton has 8811 states and 27635 transitions. Word has length 57 [2019-12-18 20:44:57,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:44:57,207 INFO L462 AbstractCegarLoop]: Abstraction has 8811 states and 27635 transitions. [2019-12-18 20:44:57,207 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:44:57,207 INFO L276 IsEmpty]: Start isEmpty. Operand 8811 states and 27635 transitions. [2019-12-18 20:44:57,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 20:44:57,221 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:44:57,222 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:44:57,223 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:44:57,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:44:57,223 INFO L82 PathProgramCache]: Analyzing trace with hash 2006827895, now seen corresponding path program 2 times [2019-12-18 20:44:57,223 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:44:57,224 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472099579] [2019-12-18 20:44:57,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:44:57,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:44:57,363 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-18 20:44:57,364 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472099579] [2019-12-18 20:44:57,364 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:44:57,364 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 20:44:57,364 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211798149] [2019-12-18 20:44:57,364 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 20:44:57,365 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:44:57,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 20:44:57,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 20:44:57,365 INFO L87 Difference]: Start difference. First operand 8811 states and 27635 transitions. Second operand 7 states. [2019-12-18 20:44:57,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:44:57,703 INFO L93 Difference]: Finished difference Result 23195 states and 72754 transitions. [2019-12-18 20:44:57,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 20:44:57,704 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-12-18 20:44:57,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:44:57,745 INFO L225 Difference]: With dead ends: 23195 [2019-12-18 20:44:57,745 INFO L226 Difference]: Without dead ends: 17949 [2019-12-18 20:44:57,746 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 20:44:57,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17949 states. [2019-12-18 20:44:57,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17949 to 10607. [2019-12-18 20:44:57,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10607 states. [2019-12-18 20:44:57,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10607 states to 10607 states and 33546 transitions. [2019-12-18 20:44:57,996 INFO L78 Accepts]: Start accepts. Automaton has 10607 states and 33546 transitions. Word has length 57 [2019-12-18 20:44:57,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:44:57,996 INFO L462 AbstractCegarLoop]: Abstraction has 10607 states and 33546 transitions. [2019-12-18 20:44:57,996 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 20:44:57,996 INFO L276 IsEmpty]: Start isEmpty. Operand 10607 states and 33546 transitions. [2019-12-18 20:44:58,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 20:44:58,097 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:44:58,098 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:44:58,098 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:44:58,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:44:58,098 INFO L82 PathProgramCache]: Analyzing trace with hash 716545355, now seen corresponding path program 3 times [2019-12-18 20:44:58,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:44:58,098 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820768991] [2019-12-18 20:44:58,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:44:58,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:44:58,249 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-18 20:44:58,250 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820768991] [2019-12-18 20:44:58,250 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:44:58,250 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 20:44:58,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798814532] [2019-12-18 20:44:58,251 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 20:44:58,251 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:44:58,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 20:44:58,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 20:44:58,252 INFO L87 Difference]: Start difference. First operand 10607 states and 33546 transitions. Second operand 8 states. [2019-12-18 20:44:59,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:44:59,327 INFO L93 Difference]: Finished difference Result 44112 states and 139302 transitions. [2019-12-18 20:44:59,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 20:44:59,328 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 57 [2019-12-18 20:44:59,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:44:59,381 INFO L225 Difference]: With dead ends: 44112 [2019-12-18 20:44:59,381 INFO L226 Difference]: Without dead ends: 31559 [2019-12-18 20:44:59,382 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2019-12-18 20:44:59,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31559 states. [2019-12-18 20:44:59,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31559 to 13319. [2019-12-18 20:44:59,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13319 states. [2019-12-18 20:44:59,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13319 states to 13319 states and 42674 transitions. [2019-12-18 20:44:59,730 INFO L78 Accepts]: Start accepts. Automaton has 13319 states and 42674 transitions. Word has length 57 [2019-12-18 20:44:59,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:44:59,730 INFO L462 AbstractCegarLoop]: Abstraction has 13319 states and 42674 transitions. [2019-12-18 20:44:59,730 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 20:44:59,731 INFO L276 IsEmpty]: Start isEmpty. Operand 13319 states and 42674 transitions. [2019-12-18 20:44:59,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 20:44:59,747 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:44:59,747 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:44:59,747 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:44:59,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:44:59,748 INFO L82 PathProgramCache]: Analyzing trace with hash -747821109, now seen corresponding path program 1 times [2019-12-18 20:44:59,748 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:44:59,748 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228252522] [2019-12-18 20:44:59,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:44:59,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:44:59,795 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-18 20:44:59,795 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228252522] [2019-12-18 20:44:59,795 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:44:59,796 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:44:59,796 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183003209] [2019-12-18 20:44:59,796 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:44:59,796 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:44:59,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:44:59,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:44:59,797 INFO L87 Difference]: Start difference. First operand 13319 states and 42674 transitions. Second operand 3 states. [2019-12-18 20:44:59,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:44:59,911 INFO L93 Difference]: Finished difference Result 18060 states and 57175 transitions. [2019-12-18 20:44:59,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:44:59,912 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-12-18 20:44:59,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:44:59,946 INFO L225 Difference]: With dead ends: 18060 [2019-12-18 20:44:59,946 INFO L226 Difference]: Without dead ends: 18060 [2019-12-18 20:44:59,947 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-18 20:45:00,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18060 states. [2019-12-18 20:45:00,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18060 to 15832. [2019-12-18 20:45:00,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15832 states. [2019-12-18 20:45:00,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15832 states to 15832 states and 50778 transitions. [2019-12-18 20:45:00,225 INFO L78 Accepts]: Start accepts. Automaton has 15832 states and 50778 transitions. Word has length 57 [2019-12-18 20:45:00,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:45:00,225 INFO L462 AbstractCegarLoop]: Abstraction has 15832 states and 50778 transitions. [2019-12-18 20:45:00,225 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:45:00,226 INFO L276 IsEmpty]: Start isEmpty. Operand 15832 states and 50778 transitions. [2019-12-18 20:45:00,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 20:45:00,251 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:45:00,251 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:45:00,252 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:45:00,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:45:00,252 INFO L82 PathProgramCache]: Analyzing trace with hash -780825525, now seen corresponding path program 4 times [2019-12-18 20:45:00,252 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:45:00,253 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661578704] [2019-12-18 20:45:00,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:45:00,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:45:00,373 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-18 20:45:00,373 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661578704] [2019-12-18 20:45:00,374 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:45:00,374 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 20:45:00,374 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562927448] [2019-12-18 20:45:00,374 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 20:45:00,375 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:45:00,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 20:45:00,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 20:45:00,375 INFO L87 Difference]: Start difference. First operand 15832 states and 50778 transitions. Second operand 9 states. [2019-12-18 20:45:01,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:45:01,866 INFO L93 Difference]: Finished difference Result 60662 states and 186954 transitions. [2019-12-18 20:45:01,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-18 20:45:01,866 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2019-12-18 20:45:01,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:45:01,960 INFO L225 Difference]: With dead ends: 60662 [2019-12-18 20:45:01,960 INFO L226 Difference]: Without dead ends: 56362 [2019-12-18 20:45:01,961 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=238, Invalid=632, Unknown=0, NotChecked=0, Total=870 [2019-12-18 20:45:02,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56362 states. [2019-12-18 20:45:02,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56362 to 16687. [2019-12-18 20:45:02,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16687 states. [2019-12-18 20:45:02,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16687 states to 16687 states and 53640 transitions. [2019-12-18 20:45:02,547 INFO L78 Accepts]: Start accepts. Automaton has 16687 states and 53640 transitions. Word has length 57 [2019-12-18 20:45:02,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:45:02,547 INFO L462 AbstractCegarLoop]: Abstraction has 16687 states and 53640 transitions. [2019-12-18 20:45:02,547 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 20:45:02,547 INFO L276 IsEmpty]: Start isEmpty. Operand 16687 states and 53640 transitions. [2019-12-18 20:45:02,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 20:45:02,567 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:45:02,567 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:45:02,567 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:45:02,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:45:02,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1562304933, now seen corresponding path program 5 times [2019-12-18 20:45:02,568 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:45:02,568 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026922527] [2019-12-18 20:45:02,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:45:02,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:45:02,679 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-18 20:45:02,680 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026922527] [2019-12-18 20:45:02,680 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:45:02,680 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 20:45:02,681 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749132593] [2019-12-18 20:45:02,681 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 20:45:02,681 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:45:02,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 20:45:02,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 20:45:02,682 INFO L87 Difference]: Start difference. First operand 16687 states and 53640 transitions. Second operand 9 states. [2019-12-18 20:45:03,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:45:03,966 INFO L93 Difference]: Finished difference Result 48042 states and 147444 transitions. [2019-12-18 20:45:03,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-18 20:45:03,967 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2019-12-18 20:45:03,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:45:04,024 INFO L225 Difference]: With dead ends: 48042 [2019-12-18 20:45:04,025 INFO L226 Difference]: Without dead ends: 41776 [2019-12-18 20:45:04,025 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=230, Invalid=700, Unknown=0, NotChecked=0, Total=930 [2019-12-18 20:45:04,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41776 states. [2019-12-18 20:45:04,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41776 to 15886. [2019-12-18 20:45:04,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15886 states. [2019-12-18 20:45:04,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15886 states to 15886 states and 51044 transitions. [2019-12-18 20:45:04,585 INFO L78 Accepts]: Start accepts. Automaton has 15886 states and 51044 transitions. Word has length 57 [2019-12-18 20:45:04,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:45:04,585 INFO L462 AbstractCegarLoop]: Abstraction has 15886 states and 51044 transitions. [2019-12-18 20:45:04,585 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 20:45:04,585 INFO L276 IsEmpty]: Start isEmpty. Operand 15886 states and 51044 transitions. [2019-12-18 20:45:04,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 20:45:04,602 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:45:04,603 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:45:04,603 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:45:04,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:45:04,603 INFO L82 PathProgramCache]: Analyzing trace with hash -414013221, now seen corresponding path program 6 times [2019-12-18 20:45:04,603 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:45:04,603 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912083920] [2019-12-18 20:45:04,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:45:04,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:45:04,685 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-18 20:45:04,686 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912083920] [2019-12-18 20:45:04,686 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:45:04,686 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 20:45:04,686 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596564954] [2019-12-18 20:45:04,687 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 20:45:04,687 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:45:04,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 20:45:04,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 20:45:04,687 INFO L87 Difference]: Start difference. First operand 15886 states and 51044 transitions. Second operand 7 states. [2019-12-18 20:45:05,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:45:05,003 INFO L93 Difference]: Finished difference Result 32290 states and 101146 transitions. [2019-12-18 20:45:05,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 20:45:05,003 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-12-18 20:45:05,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:45:05,042 INFO L225 Difference]: With dead ends: 32290 [2019-12-18 20:45:05,042 INFO L226 Difference]: Without dead ends: 27252 [2019-12-18 20:45:05,043 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-18 20:45:05,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27252 states. [2019-12-18 20:45:05,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27252 to 16096. [2019-12-18 20:45:05,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16096 states. [2019-12-18 20:45:05,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16096 states to 16096 states and 51631 transitions. [2019-12-18 20:45:05,359 INFO L78 Accepts]: Start accepts. Automaton has 16096 states and 51631 transitions. Word has length 57 [2019-12-18 20:45:05,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:45:05,359 INFO L462 AbstractCegarLoop]: Abstraction has 16096 states and 51631 transitions. [2019-12-18 20:45:05,359 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 20:45:05,359 INFO L276 IsEmpty]: Start isEmpty. Operand 16096 states and 51631 transitions. [2019-12-18 20:45:05,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 20:45:05,377 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:45:05,377 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:45:05,377 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:45:05,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:45:05,377 INFO L82 PathProgramCache]: Analyzing trace with hash -1111165587, now seen corresponding path program 7 times [2019-12-18 20:45:05,377 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:45:05,378 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051281185] [2019-12-18 20:45:05,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:45:05,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:45:05,452 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-18 20:45:05,453 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051281185] [2019-12-18 20:45:05,453 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:45:05,453 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 20:45:05,453 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691869737] [2019-12-18 20:45:05,454 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:45:05,454 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:45:05,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:45:05,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:45:05,454 INFO L87 Difference]: Start difference. First operand 16096 states and 51631 transitions. Second operand 5 states. [2019-12-18 20:45:05,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:45:05,924 INFO L93 Difference]: Finished difference Result 24102 states and 75006 transitions. [2019-12-18 20:45:05,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 20:45:05,925 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2019-12-18 20:45:05,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:45:05,960 INFO L225 Difference]: With dead ends: 24102 [2019-12-18 20:45:05,960 INFO L226 Difference]: Without dead ends: 23976 [2019-12-18 20:45:05,961 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 20:45:06,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23976 states. [2019-12-18 20:45:06,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23976 to 19024. [2019-12-18 20:45:06,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19024 states. [2019-12-18 20:45:06,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19024 states to 19024 states and 60429 transitions. [2019-12-18 20:45:06,437 INFO L78 Accepts]: Start accepts. Automaton has 19024 states and 60429 transitions. Word has length 57 [2019-12-18 20:45:06,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:45:06,437 INFO L462 AbstractCegarLoop]: Abstraction has 19024 states and 60429 transitions. [2019-12-18 20:45:06,437 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:45:06,437 INFO L276 IsEmpty]: Start isEmpty. Operand 19024 states and 60429 transitions. [2019-12-18 20:45:06,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 20:45:06,458 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:45:06,458 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:45:06,459 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:45:06,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:45:06,459 INFO L82 PathProgramCache]: Analyzing trace with hash -1189678611, now seen corresponding path program 8 times [2019-12-18 20:45:06,459 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:45:06,459 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973169149] [2019-12-18 20:45:06,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:45:06,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:45:06,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:45:06,540 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973169149] [2019-12-18 20:45:06,540 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:45:06,540 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 20:45:06,541 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566540804] [2019-12-18 20:45:06,541 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:45:06,541 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:45:06,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:45:06,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:45:06,542 INFO L87 Difference]: Start difference. First operand 19024 states and 60429 transitions. Second operand 5 states. [2019-12-18 20:45:07,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:45:07,016 INFO L93 Difference]: Finished difference Result 25682 states and 80014 transitions. [2019-12-18 20:45:07,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 20:45:07,017 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2019-12-18 20:45:07,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:45:07,053 INFO L225 Difference]: With dead ends: 25682 [2019-12-18 20:45:07,054 INFO L226 Difference]: Without dead ends: 25499 [2019-12-18 20:45:07,054 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-18 20:45:07,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25499 states. [2019-12-18 20:45:07,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25499 to 22650. [2019-12-18 20:45:07,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22650 states. [2019-12-18 20:45:07,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22650 states to 22650 states and 71520 transitions. [2019-12-18 20:45:07,407 INFO L78 Accepts]: Start accepts. Automaton has 22650 states and 71520 transitions. Word has length 57 [2019-12-18 20:45:07,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:45:07,407 INFO L462 AbstractCegarLoop]: Abstraction has 22650 states and 71520 transitions. [2019-12-18 20:45:07,407 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:45:07,408 INFO L276 IsEmpty]: Start isEmpty. Operand 22650 states and 71520 transitions. [2019-12-18 20:45:07,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 20:45:07,434 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:45:07,434 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:45:07,434 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:45:07,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:45:07,434 INFO L82 PathProgramCache]: Analyzing trace with hash -1103228865, now seen corresponding path program 9 times [2019-12-18 20:45:07,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:45:07,435 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149460948] [2019-12-18 20:45:07,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:45:07,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:45:07,495 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-18 20:45:07,496 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149460948] [2019-12-18 20:45:07,496 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:45:07,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:45:07,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823036766] [2019-12-18 20:45:07,497 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:45:07,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:45:07,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:45:07,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:45:07,497 INFO L87 Difference]: Start difference. First operand 22650 states and 71520 transitions. Second operand 3 states. [2019-12-18 20:45:07,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:45:07,597 INFO L93 Difference]: Finished difference Result 22650 states and 71518 transitions. [2019-12-18 20:45:07,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:45:07,597 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-12-18 20:45:07,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:45:07,640 INFO L225 Difference]: With dead ends: 22650 [2019-12-18 20:45:07,640 INFO L226 Difference]: Without dead ends: 22650 [2019-12-18 20:45:07,641 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-18 20:45:07,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22650 states. [2019-12-18 20:45:07,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22650 to 20990. [2019-12-18 20:45:07,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20990 states. [2019-12-18 20:45:07,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20990 states to 20990 states and 66993 transitions. [2019-12-18 20:45:07,975 INFO L78 Accepts]: Start accepts. Automaton has 20990 states and 66993 transitions. Word has length 57 [2019-12-18 20:45:07,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:45:07,975 INFO L462 AbstractCegarLoop]: Abstraction has 20990 states and 66993 transitions. [2019-12-18 20:45:07,975 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:45:07,975 INFO L276 IsEmpty]: Start isEmpty. Operand 20990 states and 66993 transitions. [2019-12-18 20:45:08,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 20:45:08,010 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:45:08,010 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:45:08,010 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:45:08,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:45:08,010 INFO L82 PathProgramCache]: Analyzing trace with hash -1000017382, now seen corresponding path program 1 times [2019-12-18 20:45:08,011 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:45:08,011 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338966851] [2019-12-18 20:45:08,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:45:08,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:45:08,072 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-18 20:45:08,072 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338966851] [2019-12-18 20:45:08,072 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:45:08,073 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:45:08,073 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179153147] [2019-12-18 20:45:08,073 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:45:08,073 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:45:08,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:45:08,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:45:08,074 INFO L87 Difference]: Start difference. First operand 20990 states and 66993 transitions. Second operand 3 states. [2019-12-18 20:45:08,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:45:08,142 INFO L93 Difference]: Finished difference Result 15219 states and 47567 transitions. [2019-12-18 20:45:08,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:45:08,142 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-18 20:45:08,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:45:08,162 INFO L225 Difference]: With dead ends: 15219 [2019-12-18 20:45:08,162 INFO L226 Difference]: Without dead ends: 15219 [2019-12-18 20:45:08,162 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-18 20:45:08,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15219 states. [2019-12-18 20:45:08,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15219 to 14624. [2019-12-18 20:45:08,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14624 states. [2019-12-18 20:45:08,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14624 states to 14624 states and 45626 transitions. [2019-12-18 20:45:08,476 INFO L78 Accepts]: Start accepts. Automaton has 14624 states and 45626 transitions. Word has length 58 [2019-12-18 20:45:08,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:45:08,476 INFO L462 AbstractCegarLoop]: Abstraction has 14624 states and 45626 transitions. [2019-12-18 20:45:08,476 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:45:08,476 INFO L276 IsEmpty]: Start isEmpty. Operand 14624 states and 45626 transitions. [2019-12-18 20:45:08,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 20:45:08,491 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:45:08,491 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:45:08,491 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:45:08,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:45:08,492 INFO L82 PathProgramCache]: Analyzing trace with hash 1487548287, now seen corresponding path program 1 times [2019-12-18 20:45:08,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:45:08,492 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134377693] [2019-12-18 20:45:08,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:45:08,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 20:45:08,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 20:45:08,598 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 20:45:08,598 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 20:45:08,602 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [851] [851] ULTIMATE.startENTRY-->L846: Formula: (let ((.cse0 (store |v_#valid_73| 0 0))) (and (= v_~main$tmp_guard1~0_17 0) (= v_~main$tmp_guard0~0_10 0) (= 0 |v_ULTIMATE.start_main_~#t605~0.offset_20|) (= 0 v_~weak$$choice0~0_8) (= 0 v_~y$r_buff1_thd3~0_20) (= v_~y~0_23 0) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t605~0.base_27|) (= 0 v_~__unbuffered_p1_EAX~0_14) (= 0 v_~__unbuffered_p3_EAX~0_15) (= v_~y$r_buff0_thd1~0_10 0) (= v_~z~0_18 0) (= 0 v_~y$w_buff1~0_24) (= (store .cse0 |v_ULTIMATE.start_main_~#t605~0.base_27| 1) |v_#valid_71|) (= v_~a~0_11 0) (< 0 |v_#StackHeapBarrier_22|) (= v_~__unbuffered_p1_EBX~0_15 0) (= v_~y$read_delayed~0_7 0) (= v_~y$r_buff0_thd2~0_71 0) (= 0 v_~y$read_delayed_var~0.base_5) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t605~0.base_27|)) (= 0 v_~weak$$choice2~0_34) (= 0 v_~y$r_buff1_thd0~0_25) (= v_~y$r_buff0_thd3~0_28 0) (= v_~y$r_buff0_thd4~0_21 0) (= 0 v_~y$flush_delayed~0_13) (= v_~y$r_buff1_thd1~0_9 0) (= 0 v_~y$read_delayed_var~0.offset_5) (= v_~y$r_buff0_thd0~0_20 0) (= v_~y$w_buff1_used~0_68 0) (= 0 |v_#NULL.base_4|) (= |v_#length_31| (store |v_#length_32| |v_ULTIMATE.start_main_~#t605~0.base_27| 4)) (= v_~x~0_18 0) (= 0 v_~__unbuffered_cnt~0_27) (= v_~y$w_buff0_used~0_106 0) (= 0 v_~__unbuffered_p3_EBX~0_15) (= 0 v_~y$w_buff0~0_25) (= |v_#NULL.offset_4| 0) (= v_~y$mem_tmp~0_10 0) (= 0 v_~y$r_buff1_thd2~0_42) (= 0 v_~y$r_buff1_thd4~0_18) (= (store |v_#memory_int_30| |v_ULTIMATE.start_main_~#t605~0.base_27| (store (select |v_#memory_int_30| |v_ULTIMATE.start_main_~#t605~0.base_27|) |v_ULTIMATE.start_main_~#t605~0.offset_20| 0)) |v_#memory_int_29|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_22|, #valid=|v_#valid_73|, #memory_int=|v_#memory_int_30|, #length=|v_#length_32|} OutVars{ULTIMATE.start_main_~#t607~0.base=|v_ULTIMATE.start_main_~#t607~0.base_27|, ULTIMATE.start_main_~#t605~0.offset=|v_ULTIMATE.start_main_~#t605~0.offset_20|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_24|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_13|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_11|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~a~0=v_~a~0_11, ~y$mem_tmp~0=v_~y$mem_tmp~0_10, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_20, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_10, ~y$flush_delayed~0=v_~y$flush_delayed~0_13, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_15, #length=|v_#length_31|, ULTIMATE.start_main_~#t607~0.offset=|v_ULTIMATE.start_main_~#t607~0.offset_20|, ULTIMATE.start_main_#t~nondet41=|v_ULTIMATE.start_main_#t~nondet41_9|, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_22|, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_18, ULTIMATE.start_main_~#t608~0.offset=|v_ULTIMATE.start_main_~#t608~0.offset_17|, ~y$w_buff1~0=v_~y$w_buff1~0_24, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_5, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_71, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_27, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_25, ~x~0=v_~x~0_18, ULTIMATE.start_main_~#t605~0.base=|v_ULTIMATE.start_main_~#t605~0.base_27|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_5, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_106, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_11|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_13|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_11|, ULTIMATE.start_main_~#t606~0.offset=|v_ULTIMATE.start_main_~#t606~0.offset_20|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_9, ~y$w_buff0~0=v_~y$w_buff0~0_25, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_28, ULTIMATE.start_main_~#t606~0.base=|v_ULTIMATE.start_main_~#t606~0.base_27|, ~y~0=v_~y~0_23, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_9|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_15, #NULL.base=|v_#NULL.base_4|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_42, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_21, ULTIMATE.start_main_~#t608~0.base=|v_ULTIMATE.start_main_~#t608~0.base_19|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_20, #valid=|v_#valid_71|, #memory_int=|v_#memory_int_29|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_9|, ~z~0=v_~z~0_18, ~weak$$choice2~0=v_~weak$$choice2~0_34, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_68} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t607~0.base, ULTIMATE.start_main_~#t605~0.offset, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ~a~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, ~__unbuffered_p3_EAX~0, #length, ULTIMATE.start_main_~#t607~0.offset, ULTIMATE.start_main_#t~nondet41, ~weak$$choice0~0, ~y$r_buff1_thd4~0, ULTIMATE.start_main_~#t608~0.offset, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_~#t605~0.base, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t606~0.offset, ~y$r_buff1_thd1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ULTIMATE.start_main_~#t606~0.base, ~y~0, ULTIMATE.start_main_#t~nondet40, ~__unbuffered_p1_EBX~0, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ~y$r_buff1_thd2~0, ~y$r_buff0_thd4~0, ULTIMATE.start_main_~#t608~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 20:45:08,603 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [814] [814] L846-1-->L848: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t606~0.offset_10|) (= (select |v_#valid_41| |v_ULTIMATE.start_main_~#t606~0.base_12|) 0) (not (= |v_ULTIMATE.start_main_~#t606~0.base_12| 0)) (= (store |v_#length_20| |v_ULTIMATE.start_main_~#t606~0.base_12| 4) |v_#length_19|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t606~0.base_12| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t606~0.base_12|) |v_ULTIMATE.start_main_~#t606~0.offset_10| 1)) |v_#memory_int_17|) (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t606~0.base_12| 1)) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t606~0.base_12|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{ULTIMATE.start_main_~#t606~0.offset=|v_ULTIMATE.start_main_~#t606~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_~#t606~0.base=|v_ULTIMATE.start_main_~#t606~0.base_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t606~0.offset, ULTIMATE.start_main_~#t606~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-18 20:45:08,604 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L848-1-->L850: Formula: (and (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t607~0.base_13| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t607~0.base_13|) |v_ULTIMATE.start_main_~#t607~0.offset_11| 2)) |v_#memory_int_21|) (not (= 0 |v_ULTIMATE.start_main_~#t607~0.base_13|)) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t607~0.base_13|) (= |v_#valid_46| (store |v_#valid_47| |v_ULTIMATE.start_main_~#t607~0.base_13| 1)) (= 0 |v_ULTIMATE.start_main_~#t607~0.offset_11|) (= 0 (select |v_#valid_47| |v_ULTIMATE.start_main_~#t607~0.base_13|)) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t607~0.base_13| 4) |v_#length_23|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t607~0.base=|v_ULTIMATE.start_main_~#t607~0.base_13|, ULTIMATE.start_main_~#t607~0.offset=|v_ULTIMATE.start_main_~#t607~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_21|, #length=|v_#length_23|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t607~0.base, ULTIMATE.start_main_~#t607~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-18 20:45:08,607 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L4-->L800: Formula: (and (= v_~y$r_buff0_thd3~0_17 1) (= 1 v_~z~0_6) (= v_~y$r_buff0_thd3~0_18 v_~y$r_buff1_thd3~0_11) (= v_~y$r_buff0_thd2~0_46 v_~y$r_buff1_thd2~0_26) (= v_~y$r_buff1_thd1~0_4 v_~y$r_buff0_thd1~0_4) (= v_~y$r_buff0_thd0~0_15 v_~y$r_buff1_thd0~0_11) (= v_~y$r_buff0_thd4~0_15 v_~y$r_buff1_thd4~0_11) (not (= v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_6 0))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_15, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_18, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_15, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_46, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_4, P2Thread1of1ForFork3___VERIFIER_assert_~expression=v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_6} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_26, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_15, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_4, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_11, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_11, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_17, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_15, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_46, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_4, P2Thread1of1ForFork3___VERIFIER_assert_~expression=v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_6, ~z~0=v_~z~0_6, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_11} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd4~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd3~0, ~z~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-18 20:45:08,607 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [813] [813] L850-1-->L852: Formula: (and (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t608~0.base_10| 4) |v_#length_17|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t608~0.base_10| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t608~0.base_10|) |v_ULTIMATE.start_main_~#t608~0.offset_10| 3)) |v_#memory_int_15|) (= 0 (select |v_#valid_39| |v_ULTIMATE.start_main_~#t608~0.base_10|)) (= |v_ULTIMATE.start_main_~#t608~0.offset_10| 0) (not (= 0 |v_ULTIMATE.start_main_~#t608~0.base_10|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t608~0.base_10|) (= (store |v_#valid_39| |v_ULTIMATE.start_main_~#t608~0.base_10| 1) |v_#valid_38|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_4|, ULTIMATE.start_main_~#t608~0.offset=|v_ULTIMATE.start_main_~#t608~0.offset_10|, ULTIMATE.start_main_~#t608~0.base=|v_ULTIMATE.start_main_~#t608~0.base_10|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t608~0.offset, ULTIMATE.start_main_~#t608~0.base, #valid, #memory_int, #length] because there is no mapped edge [2019-12-18 20:45:08,610 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [808] [808] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork1_~arg.base_5 |v_P0Thread1of1ForFork1_#in~arg.base_5|) (= 1 v_~a~0_6) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_P0Thread1of1ForFork1_~arg.offset_5 |v_P0Thread1of1ForFork1_#in~arg.offset_5|) (= 1 v_~x~0_8) (= (+ v_~__unbuffered_cnt~0_20 1) v_~__unbuffered_cnt~0_19) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|} OutVars{~a~0=v_~a~0_6, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_5, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|, ~x~0=v_~x~0_8, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_5} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~x~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-18 20:45:08,613 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L823-2-->L823-4: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd4~0_In467789190 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In467789190 256) 0))) (or (and (or .cse0 .cse1) (= |P3Thread1of1ForFork0_#t~ite32_Out467789190| ~y~0_In467789190)) (and (= ~y$w_buff1~0_In467789190 |P3Thread1of1ForFork0_#t~ite32_Out467789190|) (not .cse1) (not .cse0)))) InVars {~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In467789190, ~y$w_buff1~0=~y$w_buff1~0_In467789190, ~y~0=~y~0_In467789190, ~y$w_buff1_used~0=~y$w_buff1_used~0_In467789190} OutVars{~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In467789190, ~y$w_buff1~0=~y$w_buff1~0_In467789190, ~y~0=~y~0_In467789190, P3Thread1of1ForFork0_#t~ite32=|P3Thread1of1ForFork0_#t~ite32_Out467789190|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In467789190} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite32] because there is no mapped edge [2019-12-18 20:45:08,614 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L823-4-->L824: Formula: (= v_~y~0_17 |v_P3Thread1of1ForFork0_#t~ite32_8|) InVars {P3Thread1of1ForFork0_#t~ite32=|v_P3Thread1of1ForFork0_#t~ite32_8|} OutVars{~y~0=v_~y~0_17, P3Thread1of1ForFork0_#t~ite33=|v_P3Thread1of1ForFork0_#t~ite33_7|, P3Thread1of1ForFork0_#t~ite32=|v_P3Thread1of1ForFork0_#t~ite32_7|} AuxVars[] AssignedVars[~y~0, P3Thread1of1ForFork0_#t~ite33, P3Thread1of1ForFork0_#t~ite32] because there is no mapped edge [2019-12-18 20:45:08,614 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [785] [785] L824-->L824-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-494240283 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd4~0_In-494240283 256)))) (or (and (= |P3Thread1of1ForFork0_#t~ite34_Out-494240283| ~y$w_buff0_used~0_In-494240283) (or .cse0 .cse1)) (and (not .cse0) (= 0 |P3Thread1of1ForFork0_#t~ite34_Out-494240283|) (not .cse1)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-494240283, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-494240283} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-494240283, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-494240283, P3Thread1of1ForFork0_#t~ite34=|P3Thread1of1ForFork0_#t~ite34_Out-494240283|} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite34] because there is no mapped edge [2019-12-18 20:45:08,614 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L764-->L764-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In238969419 256)))) (or (and (= ~y$w_buff0~0_In238969419 |P1Thread1of1ForFork2_#t~ite9_Out238969419|) (not .cse0) (= |P1Thread1of1ForFork2_#t~ite8_In238969419| |P1Thread1of1ForFork2_#t~ite8_Out238969419|)) (and (= ~y$w_buff0~0_In238969419 |P1Thread1of1ForFork2_#t~ite8_Out238969419|) (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In238969419 256) 0))) (or (and .cse1 (= (mod ~y$r_buff1_thd2~0_In238969419 256) 0)) (= (mod ~y$w_buff0_used~0_In238969419 256) 0) (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In238969419 256))))) (= |P1Thread1of1ForFork2_#t~ite9_Out238969419| |P1Thread1of1ForFork2_#t~ite8_Out238969419|) .cse0))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In238969419, ~y$w_buff0_used~0=~y$w_buff0_used~0_In238969419, P1Thread1of1ForFork2_#t~ite8=|P1Thread1of1ForFork2_#t~ite8_In238969419|, ~y$w_buff0~0=~y$w_buff0~0_In238969419, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In238969419, ~weak$$choice2~0=~weak$$choice2~0_In238969419, ~y$w_buff1_used~0=~y$w_buff1_used~0_In238969419} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In238969419, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out238969419|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In238969419, P1Thread1of1ForFork2_#t~ite8=|P1Thread1of1ForFork2_#t~ite8_Out238969419|, ~y$w_buff0~0=~y$w_buff0~0_In238969419, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In238969419, ~weak$$choice2~0=~weak$$choice2~0_In238969419, ~y$w_buff1_used~0=~y$w_buff1_used~0_In238969419} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-18 20:45:08,617 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L766-->L766-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-386168452 256)))) (or (and .cse0 (= ~y$w_buff0_used~0_In-386168452 |P1Thread1of1ForFork2_#t~ite14_Out-386168452|) (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-386168452 256) 0))) (or (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-386168452 256))) (= 0 (mod ~y$w_buff0_used~0_In-386168452 256)) (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In-386168452 256))))) (= |P1Thread1of1ForFork2_#t~ite14_Out-386168452| |P1Thread1of1ForFork2_#t~ite15_Out-386168452|)) (and (= |P1Thread1of1ForFork2_#t~ite14_In-386168452| |P1Thread1of1ForFork2_#t~ite14_Out-386168452|) (not .cse0) (= ~y$w_buff0_used~0_In-386168452 |P1Thread1of1ForFork2_#t~ite15_Out-386168452|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-386168452, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-386168452, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-386168452, ~weak$$choice2~0=~weak$$choice2~0_In-386168452, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_In-386168452|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-386168452} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-386168452, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-386168452, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-386168452, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-386168452|, ~weak$$choice2~0=~weak$$choice2~0_In-386168452, P1Thread1of1ForFork2_#t~ite15=|P1Thread1of1ForFork2_#t~ite15_Out-386168452|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-386168452} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-18 20:45:08,621 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L768-->L769: Formula: (and (= v_~y$r_buff0_thd2~0_57 v_~y$r_buff0_thd2~0_56) (not (= (mod v_~weak$$choice2~0_23 256) 0))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_57, ~weak$$choice2~0=v_~weak$$choice2~0_23} OutVars{P1Thread1of1ForFork2_#t~ite19=|v_P1Thread1of1ForFork2_#t~ite19_9|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_56, P1Thread1of1ForFork2_#t~ite20=|v_P1Thread1of1ForFork2_#t~ite20_10|, P1Thread1of1ForFork2_#t~ite21=|v_P1Thread1of1ForFork2_#t~ite21_7|, ~weak$$choice2~0=v_~weak$$choice2~0_23} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite19, ~y$r_buff0_thd2~0, P1Thread1of1ForFork2_#t~ite20, P1Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-18 20:45:08,621 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L769-->L769-8: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In434401866 256))) (.cse4 (= 0 (mod ~weak$$choice2~0_In434401866 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In434401866 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In434401866 256) 0)) (.cse5 (= |P1Thread1of1ForFork2_#t~ite24_Out434401866| |P1Thread1of1ForFork2_#t~ite23_Out434401866|)) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In434401866 256)))) (or (and (or (and (or (and .cse0 .cse1) (and .cse2 .cse0) .cse3) .cse4 (= |P1Thread1of1ForFork2_#t~ite23_Out434401866| ~y$r_buff1_thd2~0_In434401866) .cse5) (and (= |P1Thread1of1ForFork2_#t~ite23_In434401866| |P1Thread1of1ForFork2_#t~ite23_Out434401866|) (not .cse4) (= |P1Thread1of1ForFork2_#t~ite24_Out434401866| ~y$r_buff1_thd2~0_In434401866))) (= |P1Thread1of1ForFork2_#t~ite22_In434401866| |P1Thread1of1ForFork2_#t~ite22_Out434401866|)) (let ((.cse6 (not .cse0))) (and (or (not .cse2) .cse6) .cse4 (or (not .cse1) .cse6) (= 0 |P1Thread1of1ForFork2_#t~ite22_Out434401866|) (not .cse3) .cse5 (= |P1Thread1of1ForFork2_#t~ite23_Out434401866| |P1Thread1of1ForFork2_#t~ite22_Out434401866|))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In434401866, ~y$w_buff0_used~0=~y$w_buff0_used~0_In434401866, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In434401866, P1Thread1of1ForFork2_#t~ite22=|P1Thread1of1ForFork2_#t~ite22_In434401866|, P1Thread1of1ForFork2_#t~ite23=|P1Thread1of1ForFork2_#t~ite23_In434401866|, ~weak$$choice2~0=~weak$$choice2~0_In434401866, ~y$w_buff1_used~0=~y$w_buff1_used~0_In434401866} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In434401866, ~y$w_buff0_used~0=~y$w_buff0_used~0_In434401866, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In434401866, P1Thread1of1ForFork2_#t~ite22=|P1Thread1of1ForFork2_#t~ite22_Out434401866|, P1Thread1of1ForFork2_#t~ite23=|P1Thread1of1ForFork2_#t~ite23_Out434401866|, ~weak$$choice2~0=~weak$$choice2~0_In434401866, P1Thread1of1ForFork2_#t~ite24=|P1Thread1of1ForFork2_#t~ite24_Out434401866|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In434401866} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite22, P1Thread1of1ForFork2_#t~ite23, P1Thread1of1ForFork2_#t~ite24] because there is no mapped edge [2019-12-18 20:45:08,623 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [787] [787] L825-->L825-2: Formula: (let ((.cse3 (= (mod ~y$r_buff1_thd4~0_In91546019 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In91546019 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd4~0_In91546019 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In91546019 256) 0))) (or (and (or .cse0 .cse1) (= |P3Thread1of1ForFork0_#t~ite35_Out91546019| ~y$w_buff1_used~0_In91546019) (or .cse2 .cse3)) (and (= 0 |P3Thread1of1ForFork0_#t~ite35_Out91546019|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In91546019, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In91546019, ~y$w_buff0_used~0=~y$w_buff0_used~0_In91546019, ~y$w_buff1_used~0=~y$w_buff1_used~0_In91546019} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In91546019, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In91546019, ~y$w_buff0_used~0=~y$w_buff0_used~0_In91546019, P3Thread1of1ForFork0_#t~ite35=|P3Thread1of1ForFork0_#t~ite35_Out91546019|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In91546019} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite35] because there is no mapped edge [2019-12-18 20:45:08,624 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L771-->L779: Formula: (and (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= 0 v_~y$flush_delayed~0_6) (not (= 0 (mod v_~y$flush_delayed~0_7 256))) (= v_~y~0_14 v_~y$mem_tmp~0_4)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~y~0=v_~y~0_14, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_7|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-18 20:45:08,626 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L801-->L801-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In-1108939919 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-1108939919 256) 0))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork3_#t~ite28_Out-1108939919|) (not .cse1)) (and (= ~y$w_buff0_used~0_In-1108939919 |P2Thread1of1ForFork3_#t~ite28_Out-1108939919|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1108939919, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1108939919} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1108939919, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1108939919, P2Thread1of1ForFork3_#t~ite28=|P2Thread1of1ForFork3_#t~ite28_Out-1108939919|} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite28] because there is no mapped edge [2019-12-18 20:45:08,627 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [784] [784] L802-->L802-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff0_thd3~0_In937064602 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In937064602 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In937064602 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd3~0_In937064602 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork3_#t~ite29_Out937064602| ~y$w_buff1_used~0_In937064602)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |P2Thread1of1ForFork3_#t~ite29_Out937064602| 0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In937064602, ~y$w_buff0_used~0=~y$w_buff0_used~0_In937064602, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In937064602, ~y$w_buff1_used~0=~y$w_buff1_used~0_In937064602} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In937064602, ~y$w_buff0_used~0=~y$w_buff0_used~0_In937064602, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In937064602, P2Thread1of1ForFork3_#t~ite29=|P2Thread1of1ForFork3_#t~ite29_Out937064602|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In937064602} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite29] because there is no mapped edge [2019-12-18 20:45:08,628 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L803-->L804: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1777738785 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In-1777738785 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd3~0_In-1777738785 ~y$r_buff0_thd3~0_Out-1777738785)) (and (not .cse1) (not .cse0) (= 0 ~y$r_buff0_thd3~0_Out-1777738785)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1777738785, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1777738785} OutVars{P2Thread1of1ForFork3_#t~ite30=|P2Thread1of1ForFork3_#t~ite30_Out-1777738785|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1777738785, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-1777738785} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite30, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-18 20:45:08,629 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L804-->L804-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In117522236 256))) (.cse0 (= (mod ~y$r_buff0_thd3~0_In117522236 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In117522236 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd3~0_In117522236 256) 0))) (or (and (= 0 |P2Thread1of1ForFork3_#t~ite31_Out117522236|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$r_buff1_thd3~0_In117522236 |P2Thread1of1ForFork3_#t~ite31_Out117522236|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In117522236, ~y$w_buff0_used~0=~y$w_buff0_used~0_In117522236, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In117522236, ~y$w_buff1_used~0=~y$w_buff1_used~0_In117522236} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In117522236, ~y$w_buff0_used~0=~y$w_buff0_used~0_In117522236, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In117522236, P2Thread1of1ForFork3_#t~ite31=|P2Thread1of1ForFork3_#t~ite31_Out117522236|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In117522236} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite31] because there is no mapped edge [2019-12-18 20:45:08,629 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L804-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_23 1) v_~__unbuffered_cnt~0_22) (= |v_P2Thread1of1ForFork3_#res.offset_5| 0) (= 0 |v_P2Thread1of1ForFork3_#res.base_5|) (= |v_P2Thread1of1ForFork3_#t~ite31_8| v_~y$r_buff1_thd3~0_16)) InVars {P2Thread1of1ForFork3_#t~ite31=|v_P2Thread1of1ForFork3_#t~ite31_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_23} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_16, P2Thread1of1ForFork3_#t~ite31=|v_P2Thread1of1ForFork3_#t~ite31_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, P2Thread1of1ForFork3_#res.base=|v_P2Thread1of1ForFork3_#res.base_5|, P2Thread1of1ForFork3_#res.offset=|v_P2Thread1of1ForFork3_#res.offset_5|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork3_#t~ite31, ~__unbuffered_cnt~0, P2Thread1of1ForFork3_#res.base, P2Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-18 20:45:08,630 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L826-->L826-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd4~0_In-2105613132 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-2105613132 256) 0))) (or (and (= ~y$r_buff0_thd4~0_In-2105613132 |P3Thread1of1ForFork0_#t~ite36_Out-2105613132|) (or .cse0 .cse1)) (and (= 0 |P3Thread1of1ForFork0_#t~ite36_Out-2105613132|) (not .cse0) (not .cse1)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-2105613132, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2105613132} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-2105613132, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2105613132, P3Thread1of1ForFork0_#t~ite36=|P3Thread1of1ForFork0_#t~ite36_Out-2105613132|} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite36] because there is no mapped edge [2019-12-18 20:45:08,631 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L827-->L827-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In1273260924 256))) (.cse3 (= (mod ~y$r_buff1_thd4~0_In1273260924 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1273260924 256))) (.cse1 (= (mod ~y$r_buff0_thd4~0_In1273260924 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P3Thread1of1ForFork0_#t~ite37_Out1273260924| 0)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= |P3Thread1of1ForFork0_#t~ite37_Out1273260924| ~y$r_buff1_thd4~0_In1273260924)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In1273260924, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In1273260924, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1273260924, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1273260924} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In1273260924, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In1273260924, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1273260924, P3Thread1of1ForFork0_#t~ite37=|P3Thread1of1ForFork0_#t~ite37_Out1273260924|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1273260924} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite37] because there is no mapped edge [2019-12-18 20:45:08,632 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [805] [805] L827-2-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork0_#res.base_5| 0) (= (+ v_~__unbuffered_cnt~0_18 1) v_~__unbuffered_cnt~0_17) (= 0 |v_P3Thread1of1ForFork0_#res.offset_5|) (= |v_P3Thread1of1ForFork0_#t~ite37_8| v_~y$r_buff1_thd4~0_13)) InVars {P3Thread1of1ForFork0_#t~ite37=|v_P3Thread1of1ForFork0_#t~ite37_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18} OutVars{~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_13, P3Thread1of1ForFork0_#res.offset=|v_P3Thread1of1ForFork0_#res.offset_5|, P3Thread1of1ForFork0_#t~ite37=|v_P3Thread1of1ForFork0_#t~ite37_7|, P3Thread1of1ForFork0_#res.base=|v_P3Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17} AuxVars[] AssignedVars[~y$r_buff1_thd4~0, P3Thread1of1ForFork0_#res.offset, P3Thread1of1ForFork0_#t~ite37, P3Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 20:45:08,632 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L852-1-->L858: Formula: (and (= 4 v_~__unbuffered_cnt~0_11) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} OutVars{ULTIMATE.start_main_#t~nondet41=|v_ULTIMATE.start_main_#t~nondet41_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet41, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 20:45:08,633 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L858-2-->L858-5: Formula: (let ((.cse2 (= |ULTIMATE.start_main_#t~ite42_Out-576776579| |ULTIMATE.start_main_#t~ite43_Out-576776579|)) (.cse1 (= (mod ~y$r_buff1_thd0~0_In-576776579 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In-576776579 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite42_Out-576776579| ~y$w_buff1~0_In-576776579) (not .cse1) .cse2) (and (= |ULTIMATE.start_main_#t~ite42_Out-576776579| ~y~0_In-576776579) .cse2 (or .cse1 .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-576776579, ~y~0=~y~0_In-576776579, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-576776579, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-576776579} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-576776579, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-576776579|, ~y~0=~y~0_In-576776579, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-576776579|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-576776579, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-576776579} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 20:45:08,634 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] L859-->L859-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-247113926 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-247113926 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite44_Out-247113926|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-247113926 |ULTIMATE.start_main_#t~ite44_Out-247113926|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-247113926, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-247113926} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-247113926, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-247113926, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-247113926|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 20:45:08,636 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [786] [786] L860-->L860-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In-681108308 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-681108308 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-681108308 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In-681108308 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite45_Out-681108308|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$w_buff1_used~0_In-681108308 |ULTIMATE.start_main_#t~ite45_Out-681108308|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-681108308, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-681108308, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-681108308, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-681108308} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-681108308, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-681108308, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-681108308, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-681108308|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-681108308} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 20:45:08,637 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L861-->L861-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1980040914 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1980040914 256)))) (or (and (= |ULTIMATE.start_main_#t~ite46_Out-1980040914| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite46_Out-1980040914| ~y$r_buff0_thd0~0_In-1980040914)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1980040914, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1980040914} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1980040914, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1980040914, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-1980040914|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-18 20:45:08,638 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [796] [796] L862-->L862-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In1493621512 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1493621512 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In1493621512 256))) (.cse3 (= (mod ~y$r_buff0_thd0~0_In1493621512 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite47_Out1493621512| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |ULTIMATE.start_main_#t~ite47_Out1493621512| ~y$r_buff1_thd0~0_In1493621512) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1493621512, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1493621512, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1493621512, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1493621512} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1493621512, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1493621512, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out1493621512|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1493621512, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1493621512} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-18 20:45:08,639 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L862-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_9 0) (= v_~z~0_11 2) (= 2 v_~__unbuffered_p1_EAX~0_7) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= 0 v_~__unbuffered_p1_EBX~0_8) (= 2 v_~__unbuffered_p3_EAX~0_8) (= 0 v_~__unbuffered_p3_EBX~0_8) (= |v_ULTIMATE.start_main_#t~ite47_13| v_~y$r_buff1_thd0~0_17) (= v_~x~0_11 2)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_7, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_8, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_13|, ~z~0=v_~z~0_11, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_8, ~x~0=v_~x~0_11} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_7, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_8, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_12|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~z~0=v_~z~0_11, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_8, ~x~0=v_~x~0_11, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_17, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite47, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 20:45:08,737 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 08:45:08 BasicIcfg [2019-12-18 20:45:08,737 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 20:45:08,741 INFO L168 Benchmark]: Toolchain (without parser) took 110310.88 ms. Allocated memory was 138.9 MB in the beginning and 3.4 GB in the end (delta: 3.3 GB). Free memory was 102.4 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-12-18 20:45:08,742 INFO L168 Benchmark]: CDTParser took 0.46 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-18 20:45:08,744 INFO L168 Benchmark]: CACSL2BoogieTranslator took 804.24 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 102.0 MB in the beginning and 155.1 MB in the end (delta: -53.2 MB). Peak memory consumption was 24.9 MB. Max. memory is 7.1 GB. [2019-12-18 20:45:08,744 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.29 ms. Allocated memory is still 203.4 MB. Free memory was 155.1 MB in the beginning and 152.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 20:45:08,745 INFO L168 Benchmark]: Boogie Preprocessor took 40.07 ms. Allocated memory is still 203.4 MB. Free memory was 152.4 MB in the beginning and 149.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 20:45:08,746 INFO L168 Benchmark]: RCFGBuilder took 808.98 ms. Allocated memory is still 203.4 MB. Free memory was 149.8 MB in the beginning and 100.4 MB in the end (delta: 49.4 MB). Peak memory consumption was 49.4 MB. Max. memory is 7.1 GB. [2019-12-18 20:45:08,746 INFO L168 Benchmark]: TraceAbstraction took 108585.53 ms. Allocated memory was 203.4 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 100.4 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2019-12-18 20:45:08,755 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.46 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 804.24 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 102.0 MB in the beginning and 155.1 MB in the end (delta: -53.2 MB). Peak memory consumption was 24.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 66.29 ms. Allocated memory is still 203.4 MB. Free memory was 155.1 MB in the beginning and 152.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.07 ms. Allocated memory is still 203.4 MB. Free memory was 152.4 MB in the beginning and 149.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 808.98 ms. Allocated memory is still 203.4 MB. Free memory was 149.8 MB in the beginning and 100.4 MB in the end (delta: 49.4 MB). Peak memory consumption was 49.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 108585.53 ms. Allocated memory was 203.4 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 100.4 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.4s, 181 ProgramPointsBefore, 88 ProgramPointsAfterwards, 209 TransitionsBefore, 94 TransitionsAfterwards, 18126 CoEnabledTransitionPairs, 7 FixpointIterations, 37 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 27 ChoiceCompositions, 7815 VarBasedMoverChecksPositive, 199 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 68763 CheckedPairsTotal, 121 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L846] FCALL, FORK 0 pthread_create(&t605, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L848] FCALL, FORK 0 pthread_create(&t606, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L850] FCALL, FORK 0 pthread_create(&t607, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L784] 3 y$w_buff1 = y$w_buff0 [L785] 3 y$w_buff0 = 1 [L786] 3 y$w_buff1_used = y$w_buff0_used [L787] 3 y$w_buff0_used = (_Bool)1 [L852] FCALL, FORK 0 pthread_create(&t608, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L814] 4 z = 2 [L817] 4 __unbuffered_p3_EAX = z [L820] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L823] 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L753] 2 x = 2 [L756] 2 __unbuffered_p1_EAX = x [L759] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L760] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L761] 2 y$flush_delayed = weak$$choice2 [L762] 2 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L763] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L763] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L764] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L765] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L765] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L766] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L767] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L767] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L769] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L770] 2 __unbuffered_p1_EBX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L824] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L800] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L800] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L801] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L802] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L825] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L826] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L858] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L858] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L859] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L860] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L861] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 169 locations, 2 error locations. Result: UNSAFE, OverallTime: 108.2s, OverallIterations: 21, TraceHistogramMax: 1, AutomataDifference: 23.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3671 SDtfs, 5374 SDslu, 8944 SDs, 0 SdLazy, 3778 SolverSat, 333 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 189 GetRequests, 34 SyntacticMatches, 7 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 584 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=166438occurred 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: 43.2s AutomataMinimizationTime, 20 MinimizatonAttempts, 163575 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 893 NumberOfCodeBlocks, 893 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 814 ConstructedInterpolants, 0 QuantifiedInterpolants, 110190 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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...